/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/goblint-regression/36-apron_21-traces-cluster-based_true.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 16:09:57,529 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 16:09:57,603 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-VariableLbe.epf [2023-08-26 16:09:57,607 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 16:09:57,607 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 16:09:57,645 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 16:09:57,645 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 16:09:57,646 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 16:09:57,647 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 16:09:57,650 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 16:09:57,651 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 16:09:57,651 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 16:09:57,651 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 16:09:57,652 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 16:09:57,653 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 16:09:57,653 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 16:09:57,653 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 16:09:57,653 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 16:09:57,654 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 16:09:57,654 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 16:09:57,654 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 16:09:57,655 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 16:09:57,655 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 16:09:57,656 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 16:09:57,656 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 16:09:57,656 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 16:09:57,656 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 16:09:57,656 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 16:09:57,657 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 16:09:57,657 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 16:09:57,658 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 16:09:57,658 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 16:09:57,658 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 16:09:57,658 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 16:09:57,658 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 16:09:57,659 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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: Order of the error locations to be checked -> INSUFFICIENT_FIRST 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-08-26 16:09:57,993 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 16:09:58,020 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 16:09:58,023 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 16:09:58,024 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 16:09:58,024 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 16:09:58,026 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/36-apron_21-traces-cluster-based_true.i [2023-08-26 16:09:59,257 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 16:09:59,561 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 16:09:59,562 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/36-apron_21-traces-cluster-based_true.i [2023-08-26 16:09:59,578 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/853463db0/7ca8f34ac2bb499e93c5697e77f19e62/FLAGd3e529642 [2023-08-26 16:09:59,591 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/853463db0/7ca8f34ac2bb499e93c5697e77f19e62 [2023-08-26 16:09:59,593 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 16:09:59,594 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 16:09:59,595 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 16:09:59,595 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 16:09:59,598 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 16:09:59,598 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 04:09:59" (1/1) ... [2023-08-26 16:09:59,599 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@337f96b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:09:59, skipping insertion in model container [2023-08-26 16:09:59,599 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 04:09:59" (1/1) ... [2023-08-26 16:09:59,644 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 16:09:59,986 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 16:10:00,002 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 16:10:00,031 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [232] [2023-08-26 16:10:00,038 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [233] [2023-08-26 16:10:00,065 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 16:10:00,107 INFO L206 MainTranslator]: Completed translation [2023-08-26 16:10:00,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:10:00 WrapperNode [2023-08-26 16:10:00,108 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 16:10:00,109 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 16:10:00,109 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 16:10:00,110 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 16:10:00,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:10:00" (1/1) ... [2023-08-26 16:10:00,139 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:10:00" (1/1) ... [2023-08-26 16:10:00,173 INFO L138 Inliner]: procedures = 165, calls = 46, calls flagged for inlining = 7, calls inlined = 10, statements flattened = 147 [2023-08-26 16:10:00,173 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 16:10:00,174 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 16:10:00,175 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 16:10:00,175 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 16:10:00,182 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:10:00" (1/1) ... [2023-08-26 16:10:00,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:10:00" (1/1) ... [2023-08-26 16:10:00,199 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:10:00" (1/1) ... [2023-08-26 16:10:00,201 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:10:00" (1/1) ... [2023-08-26 16:10:00,209 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:10:00" (1/1) ... [2023-08-26 16:10:00,211 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:10:00" (1/1) ... [2023-08-26 16:10:00,213 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:10:00" (1/1) ... [2023-08-26 16:10:00,214 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:10:00" (1/1) ... [2023-08-26 16:10:00,217 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 16:10:00,217 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 16:10:00,218 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 16:10:00,218 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 16:10:00,218 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:10:00" (1/1) ... [2023-08-26 16:10:00,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 16:10:00,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 16:10:00,253 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-08-26 16:10:00,277 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-08-26 16:10:00,291 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2023-08-26 16:10:00,291 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2023-08-26 16:10:00,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 16:10:00,292 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-26 16:10:00,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 16:10:00,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 16:10:00,292 INFO L130 BoogieDeclarations]: Found specification of procedure t3_fun [2023-08-26 16:10:00,292 INFO L138 BoogieDeclarations]: Found implementation of procedure t3_fun [2023-08-26 16:10:00,293 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-26 16:10:00,293 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-26 16:10:00,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 16:10:00,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 16:10:00,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 16:10:00,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 16:10:00,295 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 16:10:00,442 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 16:10:00,444 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 16:10:00,649 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 16:10:00,658 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 16:10:00,658 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 16:10:00,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 04:10:00 BoogieIcfgContainer [2023-08-26 16:10:00,660 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 16:10:00,662 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 16:10:00,662 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 16:10:00,665 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 16:10:00,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 04:09:59" (1/3) ... [2023-08-26 16:10:00,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23b3ffd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 04:10:00, skipping insertion in model container [2023-08-26 16:10:00,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:10:00" (2/3) ... [2023-08-26 16:10:00,666 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23b3ffd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 04:10:00, skipping insertion in model container [2023-08-26 16:10:00,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 04:10:00" (3/3) ... [2023-08-26 16:10:00,667 INFO L112 eAbstractionObserver]: Analyzing ICFG 36-apron_21-traces-cluster-based_true.i [2023-08-26 16:10:00,682 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 16:10:00,683 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-26 16:10:00,683 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 16:10:00,795 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 16:10:00,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 185 places, 184 transitions, 383 flow [2023-08-26 16:10:00,951 INFO L124 PetriNetUnfolderBase]: 9/181 cut-off events. [2023-08-26 16:10:00,952 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 16:10:00,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 181 events. 9/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 351 event pairs, 0 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2023-08-26 16:10:00,967 INFO L82 GeneralOperation]: Start removeDead. Operand has 185 places, 184 transitions, 383 flow [2023-08-26 16:10:00,975 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 182 places, 181 transitions, 371 flow [2023-08-26 16:10:00,979 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 16:10:00,991 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 181 transitions, 371 flow [2023-08-26 16:10:00,997 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 182 places, 181 transitions, 371 flow [2023-08-26 16:10:00,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 181 transitions, 371 flow [2023-08-26 16:10:01,052 INFO L124 PetriNetUnfolderBase]: 9/181 cut-off events. [2023-08-26 16:10:01,053 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 16:10:01,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 181 events. 9/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 351 event pairs, 0 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2023-08-26 16:10:01,064 INFO L119 LiptonReduction]: Number of co-enabled transitions 12214 [2023-08-26 16:10:06,580 INFO L134 LiptonReduction]: Checked pairs total: 27334 [2023-08-26 16:10:06,580 INFO L136 LiptonReduction]: Total number of compositions: 200 [2023-08-26 16:10:06,592 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 16:10:06,597 INFO L357 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@518378f9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 16:10:06,598 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-08-26 16:10:06,599 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 16:10:06,599 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-08-26 16:10:06,600 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 16:10:06,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:10:06,600 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 16:10:06,601 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0ASSERT_VIOLATIONASSERT, t3_funErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 16:10:06,604 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:10:06,605 INFO L85 PathProgramCache]: Analyzing trace with hash 720, now seen corresponding path program 1 times [2023-08-26 16:10:06,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:10:06,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583808596] [2023-08-26 16:10:06,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:10:06,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:10:06,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:10:06,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 16:10:06,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:10:06,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583808596] [2023-08-26 16:10:06,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583808596] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:10:06,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:10:06,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 16:10:06,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305234610] [2023-08-26 16:10:06,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:10:06,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 16:10:06,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:10:06,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 16:10:06,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 16:10:06,751 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 384 [2023-08-26 16:10:06,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 99 flow. Second operand has 2 states, 2 states have (on average 169.5) internal successors, (339), 2 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-08-26 16:10:06,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:10:06,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 384 [2023-08-26 16:10:06,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:10:07,206 INFO L124 PetriNetUnfolderBase]: 2101/3542 cut-off events. [2023-08-26 16:10:07,206 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-08-26 16:10:07,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6601 conditions, 3542 events. 2101/3542 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 23392 event pairs, 1921 based on Foata normal form. 100/2663 useless extension candidates. Maximal degree in co-relation 6590. Up to 3003 conditions per place. [2023-08-26 16:10:07,230 INFO L140 encePairwiseOnDemand]: 381/384 looper letters, 29 selfloop transitions, 0 changer transitions 0/42 dead transitions. [2023-08-26 16:10:07,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 42 transitions, 151 flow [2023-08-26 16:10:07,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 16:10:07,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 16:10:07,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 370 transitions. [2023-08-26 16:10:07,242 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4817708333333333 [2023-08-26 16:10:07,243 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 370 transitions. [2023-08-26 16:10:07,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 370 transitions. [2023-08-26 16:10:07,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:10:07,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 370 transitions. [2023-08-26 16:10:07,249 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 185.0) internal successors, (370), 2 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:07,253 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 384.0) internal successors, (1152), 3 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:07,254 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 384.0) internal successors, (1152), 3 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:07,255 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 99 flow. Second operand 2 states and 370 transitions. [2023-08-26 16:10:07,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 42 transitions, 151 flow [2023-08-26 16:10:07,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 42 transitions, 148 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 16:10:07,260 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 90 flow [2023-08-26 16:10:07,261 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=384, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=90, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2023-08-26 16:10:07,264 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -4 predicate places. [2023-08-26 16:10:07,264 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 90 flow [2023-08-26 16:10:07,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 169.5) internal successors, (339), 2 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-08-26 16:10:07,265 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:10:07,265 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 16:10:07,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 16:10:07,266 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0ASSERT_VIOLATIONASSERT, t3_funErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 16:10:07,266 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:10:07,266 INFO L85 PathProgramCache]: Analyzing trace with hash 705675, now seen corresponding path program 1 times [2023-08-26 16:10:07,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:10:07,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384408043] [2023-08-26 16:10:07,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:10:07,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:10:07,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:10:07,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 16:10:07,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:10:07,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384408043] [2023-08-26 16:10:07,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384408043] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:10:07,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:10:07,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 16:10:07,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746491448] [2023-08-26 16:10:07,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:10:07,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 16:10:07,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:10:07,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 16:10:07,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 16:10:07,589 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 384 [2023-08-26 16:10:07,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:07,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:10:07,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 384 [2023-08-26 16:10:07,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:10:07,931 INFO L124 PetriNetUnfolderBase]: 2096/3527 cut-off events. [2023-08-26 16:10:07,931 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 16:10:07,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6574 conditions, 3527 events. 2096/3527 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 23299 event pairs, 1682 based on Foata normal form. 0/2554 useless extension candidates. Maximal degree in co-relation 6571. Up to 2637 conditions per place. [2023-08-26 16:10:07,954 INFO L140 encePairwiseOnDemand]: 381/384 looper letters, 38 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-08-26 16:10:07,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 53 transitions, 192 flow [2023-08-26 16:10:07,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 16:10:07,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 16:10:07,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 488 transitions. [2023-08-26 16:10:07,958 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4236111111111111 [2023-08-26 16:10:07,958 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 488 transitions. [2023-08-26 16:10:07,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 488 transitions. [2023-08-26 16:10:07,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:10:07,959 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 488 transitions. [2023-08-26 16:10:07,960 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:07,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 384.0) internal successors, (1536), 4 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:07,964 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 384.0) internal successors, (1536), 4 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:07,964 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 90 flow. Second operand 3 states and 488 transitions. [2023-08-26 16:10:07,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 53 transitions, 192 flow [2023-08-26 16:10:07,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 53 transitions, 192 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 16:10:07,966 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 92 flow [2023-08-26 16:10:07,966 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=384, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2023-08-26 16:10:07,967 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2023-08-26 16:10:07,967 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 92 flow [2023-08-26 16:10:07,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:07,968 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:10:07,968 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 16:10:07,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 16:10:07,968 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0ASSERT_VIOLATIONASSERT, t3_funErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 16:10:07,969 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:10:07,969 INFO L85 PathProgramCache]: Analyzing trace with hash 705674, now seen corresponding path program 1 times [2023-08-26 16:10:07,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:10:07,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105626156] [2023-08-26 16:10:07,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:10:07,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:10:07,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:10:08,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 16:10:08,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:10:08,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105626156] [2023-08-26 16:10:08,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105626156] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:10:08,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:10:08,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 16:10:08,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993055307] [2023-08-26 16:10:08,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:10:08,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 16:10:08,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:10:08,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 16:10:08,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 16:10:08,067 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 384 [2023-08-26 16:10:08,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:08,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:10:08,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 384 [2023-08-26 16:10:08,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:10:08,405 INFO L124 PetriNetUnfolderBase]: 2091/3512 cut-off events. [2023-08-26 16:10:08,405 INFO L125 PetriNetUnfolderBase]: For 100/100 co-relation queries the response was YES. [2023-08-26 16:10:08,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6651 conditions, 3512 events. 2091/3512 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 23192 event pairs, 1678 based on Foata normal form. 0/2645 useless extension candidates. Maximal degree in co-relation 6647. Up to 2627 conditions per place. [2023-08-26 16:10:08,430 INFO L140 encePairwiseOnDemand]: 381/384 looper letters, 37 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-08-26 16:10:08,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 52 transitions, 192 flow [2023-08-26 16:10:08,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 16:10:08,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 16:10:08,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2023-08-26 16:10:08,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4305555555555556 [2023-08-26 16:10:08,433 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 496 transitions. [2023-08-26 16:10:08,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 496 transitions. [2023-08-26 16:10:08,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:10:08,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 496 transitions. [2023-08-26 16:10:08,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:08,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 384.0) internal successors, (1536), 4 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:08,437 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 384.0) internal successors, (1536), 4 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:08,438 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 92 flow. Second operand 3 states and 496 transitions. [2023-08-26 16:10:08,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 52 transitions, 192 flow [2023-08-26 16:10:08,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 52 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 16:10:08,444 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 90 flow [2023-08-26 16:10:08,444 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=384, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2023-08-26 16:10:08,445 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -4 predicate places. [2023-08-26 16:10:08,445 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 90 flow [2023-08-26 16:10:08,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:08,445 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:10:08,446 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 16:10:08,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 16:10:08,446 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0ASSERT_VIOLATIONASSERT, t3_funErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 16:10:08,446 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:10:08,446 INFO L85 PathProgramCache]: Analyzing trace with hash 678170430, now seen corresponding path program 1 times [2023-08-26 16:10:08,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:10:08,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752288695] [2023-08-26 16:10:08,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:10:08,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:10:08,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:10:08,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 16:10:08,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:10:08,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752288695] [2023-08-26 16:10:08,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752288695] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:10:08,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:10:08,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 16:10:08,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442301666] [2023-08-26 16:10:08,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:10:08,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 16:10:08,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:10:08,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 16:10:08,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 16:10:08,492 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 384 [2023-08-26 16:10:08,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:08,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:10:08,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 384 [2023-08-26 16:10:08,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:10:08,792 INFO L124 PetriNetUnfolderBase]: 2056/3447 cut-off events. [2023-08-26 16:10:08,792 INFO L125 PetriNetUnfolderBase]: For 100/100 co-relation queries the response was YES. [2023-08-26 16:10:08,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6531 conditions, 3447 events. 2056/3447 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 22860 event pairs, 1647 based on Foata normal form. 0/2612 useless extension candidates. Maximal degree in co-relation 6527. Up to 2572 conditions per place. [2023-08-26 16:10:08,816 INFO L140 encePairwiseOnDemand]: 381/384 looper letters, 36 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2023-08-26 16:10:08,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 51 transitions, 188 flow [2023-08-26 16:10:08,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 16:10:08,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 16:10:08,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 486 transitions. [2023-08-26 16:10:08,819 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.421875 [2023-08-26 16:10:08,819 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 486 transitions. [2023-08-26 16:10:08,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 486 transitions. [2023-08-26 16:10:08,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:10:08,819 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 486 transitions. [2023-08-26 16:10:08,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:08,822 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 384.0) internal successors, (1536), 4 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:08,823 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 384.0) internal successors, (1536), 4 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:08,823 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 90 flow. Second operand 3 states and 486 transitions. [2023-08-26 16:10:08,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 51 transitions, 188 flow [2023-08-26 16:10:08,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 51 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 16:10:08,830 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 88 flow [2023-08-26 16:10:08,831 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=384, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2023-08-26 16:10:08,832 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2023-08-26 16:10:08,832 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 88 flow [2023-08-26 16:10:08,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:08,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:10:08,833 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 16:10:08,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 16:10:08,833 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0ASSERT_VIOLATIONASSERT, t3_funErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 16:10:08,833 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:10:08,834 INFO L85 PathProgramCache]: Analyzing trace with hash 678170431, now seen corresponding path program 1 times [2023-08-26 16:10:08,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:10:08,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608990156] [2023-08-26 16:10:08,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:10:08,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:10:08,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:10:08,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 16:10:08,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:10:08,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608990156] [2023-08-26 16:10:08,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608990156] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:10:08,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:10:08,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 16:10:08,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205542640] [2023-08-26 16:10:08,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:10:08,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 16:10:08,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:10:08,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 16:10:08,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 16:10:08,951 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 384 [2023-08-26 16:10:08,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:08,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:10:08,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 384 [2023-08-26 16:10:08,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:10:09,237 INFO L124 PetriNetUnfolderBase]: 2021/3382 cut-off events. [2023-08-26 16:10:09,237 INFO L125 PetriNetUnfolderBase]: For 100/100 co-relation queries the response was YES. [2023-08-26 16:10:09,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6411 conditions, 3382 events. 2021/3382 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 22351 event pairs, 1616 based on Foata normal form. 0/2579 useless extension candidates. Maximal degree in co-relation 6407. Up to 2517 conditions per place. [2023-08-26 16:10:09,266 INFO L140 encePairwiseOnDemand]: 381/384 looper letters, 35 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2023-08-26 16:10:09,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 50 transitions, 184 flow [2023-08-26 16:10:09,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 16:10:09,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 16:10:09,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions. [2023-08-26 16:10:09,269 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4288194444444444 [2023-08-26 16:10:09,269 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 494 transitions. [2023-08-26 16:10:09,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 494 transitions. [2023-08-26 16:10:09,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:10:09,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 494 transitions. [2023-08-26 16:10:09,270 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:09,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 384.0) internal successors, (1536), 4 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:09,273 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 384.0) internal successors, (1536), 4 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:09,273 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 88 flow. Second operand 3 states and 494 transitions. [2023-08-26 16:10:09,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 50 transitions, 184 flow [2023-08-26 16:10:09,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 50 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 16:10:09,280 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 86 flow [2023-08-26 16:10:09,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=384, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2023-08-26 16:10:09,283 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -6 predicate places. [2023-08-26 16:10:09,283 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 86 flow [2023-08-26 16:10:09,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:09,284 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:10:09,284 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 16:10:09,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 16:10:09,284 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2_funErr0ASSERT_VIOLATIONASSERT === [t2_funErr0ASSERT_VIOLATIONASSERT, t3_funErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 16:10:09,284 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:10:09,284 INFO L85 PathProgramCache]: Analyzing trace with hash -149603959, now seen corresponding path program 1 times [2023-08-26 16:10:09,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:10:09,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526821099] [2023-08-26 16:10:09,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:10:09,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:10:09,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:10:09,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 16:10:09,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:10:09,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526821099] [2023-08-26 16:10:09,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526821099] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:10:09,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:10:09,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 16:10:09,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857828381] [2023-08-26 16:10:09,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:10:09,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 16:10:09,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:10:09,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 16:10:09,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 16:10:09,393 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 384 [2023-08-26 16:10:09,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 156.6) internal successors, (783), 5 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:09,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:10:09,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 384 [2023-08-26 16:10:09,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:10:10,640 INFO L124 PetriNetUnfolderBase]: 10022/14741 cut-off events. [2023-08-26 16:10:10,641 INFO L125 PetriNetUnfolderBase]: For 399/399 co-relation queries the response was YES. [2023-08-26 16:10:10,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29424 conditions, 14741 events. 10022/14741 cut-off events. For 399/399 co-relation queries the response was YES. Maximal size of possible extension queue 620. Compared 92463 event pairs, 2015 based on Foata normal form. 0/12555 useless extension candidates. Maximal degree in co-relation 29420. Up to 6242 conditions per place. [2023-08-26 16:10:10,723 INFO L140 encePairwiseOnDemand]: 377/384 looper letters, 149 selfloop transitions, 10 changer transitions 0/163 dead transitions. [2023-08-26 16:10:10,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 163 transitions, 680 flow [2023-08-26 16:10:10,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 16:10:10,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 16:10:10,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1402 transitions. [2023-08-26 16:10:10,727 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4563802083333333 [2023-08-26 16:10:10,727 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1402 transitions. [2023-08-26 16:10:10,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1402 transitions. [2023-08-26 16:10:10,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:10:10,728 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1402 transitions. [2023-08-26 16:10:10,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 175.25) internal successors, (1402), 8 states have internal predecessors, (1402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:10,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 384.0) internal successors, (3456), 9 states have internal predecessors, (3456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:10,737 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 384.0) internal successors, (3456), 9 states have internal predecessors, (3456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:10,737 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 86 flow. Second operand 8 states and 1402 transitions. [2023-08-26 16:10:10,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 163 transitions, 680 flow [2023-08-26 16:10:10,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 163 transitions, 664 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 16:10:10,747 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 151 flow [2023-08-26 16:10:10,748 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=384, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=151, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2023-08-26 16:10:10,751 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 5 predicate places. [2023-08-26 16:10:10,751 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 151 flow [2023-08-26 16:10:10,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 156.6) internal successors, (783), 5 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:10,752 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:10:10,752 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 16:10:10,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 16:10:10,752 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [t2_funErr0ASSERT_VIOLATIONASSERT, t3_funErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 16:10:10,753 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:10:10,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1472282220, now seen corresponding path program 1 times [2023-08-26 16:10:10,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:10:10,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934225161] [2023-08-26 16:10:10,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:10:10,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:10:10,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:10:10,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 16:10:10,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:10:10,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934225161] [2023-08-26 16:10:10,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934225161] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:10:10,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:10:10,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 16:10:10,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217745469] [2023-08-26 16:10:10,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:10:10,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 16:10:10,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:10:10,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 16:10:10,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 16:10:10,904 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 384 [2023-08-26 16:10:10,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 151 flow. Second operand has 5 states, 5 states have (on average 155.0) internal successors, (775), 5 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:10,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:10:10,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 384 [2023-08-26 16:10:10,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:10:12,458 INFO L124 PetriNetUnfolderBase]: 11122/16535 cut-off events. [2023-08-26 16:10:12,458 INFO L125 PetriNetUnfolderBase]: For 8683/8683 co-relation queries the response was YES. [2023-08-26 16:10:12,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39663 conditions, 16535 events. 11122/16535 cut-off events. For 8683/8683 co-relation queries the response was YES. Maximal size of possible extension queue 692. Compared 104886 event pairs, 3267 based on Foata normal form. 0/14846 useless extension candidates. Maximal degree in co-relation 39654. Up to 8273 conditions per place. [2023-08-26 16:10:12,553 INFO L140 encePairwiseOnDemand]: 375/384 looper letters, 130 selfloop transitions, 20 changer transitions 0/154 dead transitions. [2023-08-26 16:10:12,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 154 transitions, 807 flow [2023-08-26 16:10:12,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 16:10:12,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 16:10:12,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1361 transitions. [2023-08-26 16:10:12,557 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4430338541666667 [2023-08-26 16:10:12,557 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1361 transitions. [2023-08-26 16:10:12,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1361 transitions. [2023-08-26 16:10:12,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:10:12,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1361 transitions. [2023-08-26 16:10:12,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 170.125) internal successors, (1361), 8 states have internal predecessors, (1361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:12,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 384.0) internal successors, (3456), 9 states have internal predecessors, (3456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:12,565 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 384.0) internal successors, (3456), 9 states have internal predecessors, (3456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:12,565 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 151 flow. Second operand 8 states and 1361 transitions. [2023-08-26 16:10:12,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 154 transitions, 807 flow [2023-08-26 16:10:12,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 154 transitions, 807 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 16:10:12,641 INFO L231 Difference]: Finished difference. Result has 71 places, 62 transitions, 340 flow [2023-08-26 16:10:12,642 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=384, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=340, PETRI_PLACES=71, PETRI_TRANSITIONS=62} [2023-08-26 16:10:12,642 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 18 predicate places. [2023-08-26 16:10:12,642 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 62 transitions, 340 flow [2023-08-26 16:10:12,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 155.0) internal successors, (775), 5 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:12,643 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:10:12,643 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 16:10:12,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 16:10:12,643 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2_funErr0ASSERT_VIOLATIONASSERT === [t2_funErr0ASSERT_VIOLATIONASSERT, t3_funErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 16:10:12,643 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:10:12,644 INFO L85 PathProgramCache]: Analyzing trace with hash 828218967, now seen corresponding path program 1 times [2023-08-26 16:10:12,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:10:12,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526925744] [2023-08-26 16:10:12,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:10:12,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:10:12,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:10:12,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 16:10:12,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:10:12,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526925744] [2023-08-26 16:10:12,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526925744] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:10:12,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:10:12,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 16:10:12,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046463044] [2023-08-26 16:10:12,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:10:12,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 16:10:12,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:10:12,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 16:10:12,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 16:10:12,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 384 [2023-08-26 16:10:12,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 62 transitions, 340 flow. Second operand has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:12,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:10:12,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 384 [2023-08-26 16:10:12,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:10:13,218 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([645] L707-->t2_funErr0ASSERT_VIOLATIONASSERT: Formula: (and (= |v_t2_funThread1of1ForFork2___VERIFIER_assert_~cond#1_31| 0) (= (store |v_#pthreadsMutex_128| |v_~#A~0.base_49| (store (select |v_#pthreadsMutex_128| |v_~#A~0.base_49|) |v_~#A~0.offset_49| 0)) |v_#pthreadsMutex_127|) (= (ite (<= |v_t2_funThread1of1ForFork2_~y~0#1_19| |v_t2_funThread1of1ForFork2_~x~1#1_21|) 1 0) |v_t2_funThread1of1ForFork2___VERIFIER_assert_#in~cond#1_15|) (= |v_t2_funThread1of1ForFork2___VERIFIER_assert_~cond#1_31| |v_t2_funThread1of1ForFork2___VERIFIER_assert_#in~cond#1_15|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_128|, ~#A~0.offset=|v_~#A~0.offset_49|, t2_funThread1of1ForFork2_~x~1#1=|v_t2_funThread1of1ForFork2_~x~1#1_21|, t2_funThread1of1ForFork2_~y~0#1=|v_t2_funThread1of1ForFork2_~y~0#1_19|, ~#A~0.base=|v_~#A~0.base_49|} OutVars{t2_funThread1of1ForFork2___VERIFIER_assert_#in~cond#1=|v_t2_funThread1of1ForFork2___VERIFIER_assert_#in~cond#1_15|, #pthreadsMutex=|v_#pthreadsMutex_127|, t2_funThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_t2_funThread1of1ForFork2_reach_error_#t~nondet0#1.base_23|, ~#A~0.offset=|v_~#A~0.offset_49|, t2_funThread1of1ForFork2_~x~1#1=|v_t2_funThread1of1ForFork2_~x~1#1_21|, t2_funThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_t2_funThread1of1ForFork2_reach_error_#t~nondet0#1.offset_23|, t2_funThread1of1ForFork2___VERIFIER_assert_~cond#1=|v_t2_funThread1of1ForFork2___VERIFIER_assert_~cond#1_31|, t2_funThread1of1ForFork2_~y~0#1=|v_t2_funThread1of1ForFork2_~y~0#1_19|, ~#A~0.base=|v_~#A~0.base_49|} AuxVars[] AssignedVars[t2_funThread1of1ForFork2___VERIFIER_assert_#in~cond#1, #pthreadsMutex, t2_funThread1of1ForFork2_reach_error_#t~nondet0#1.base, t2_funThread1of1ForFork2_reach_error_#t~nondet0#1.offset, t2_funThread1of1ForFork2___VERIFIER_assert_~cond#1][62], [Black: 209#(<= ~h~0 ~g~0), 161#t3_funErr0ASSERT_VIOLATIONASSERTtrue, 2#ULTIMATE.startEXITtrue, 229#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 243#true, Black: 225#true, 81#L693true, Black: 235#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 227#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 233#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 228#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), 179#t2_funErr0ASSERT_VIOLATIONASSERTtrue, t3_funThread1of1ForFork1InUse, t2_funThread1of1ForFork2InUse, t_funThread1of1ForFork0InUse, 207#true, Black: 211#(<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|), Black: 210#(<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|), 188#true, Black: 215#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 ~g~0)), Black: 217#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|))]) [2023-08-26 16:10:13,219 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-26 16:10:13,219 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-26 16:10:13,219 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-26 16:10:13,219 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-26 16:10:13,220 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([645] L707-->t2_funErr0ASSERT_VIOLATIONASSERT: Formula: (and (= |v_t2_funThread1of1ForFork2___VERIFIER_assert_~cond#1_31| 0) (= (store |v_#pthreadsMutex_128| |v_~#A~0.base_49| (store (select |v_#pthreadsMutex_128| |v_~#A~0.base_49|) |v_~#A~0.offset_49| 0)) |v_#pthreadsMutex_127|) (= (ite (<= |v_t2_funThread1of1ForFork2_~y~0#1_19| |v_t2_funThread1of1ForFork2_~x~1#1_21|) 1 0) |v_t2_funThread1of1ForFork2___VERIFIER_assert_#in~cond#1_15|) (= |v_t2_funThread1of1ForFork2___VERIFIER_assert_~cond#1_31| |v_t2_funThread1of1ForFork2___VERIFIER_assert_#in~cond#1_15|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_128|, ~#A~0.offset=|v_~#A~0.offset_49|, t2_funThread1of1ForFork2_~x~1#1=|v_t2_funThread1of1ForFork2_~x~1#1_21|, t2_funThread1of1ForFork2_~y~0#1=|v_t2_funThread1of1ForFork2_~y~0#1_19|, ~#A~0.base=|v_~#A~0.base_49|} OutVars{t2_funThread1of1ForFork2___VERIFIER_assert_#in~cond#1=|v_t2_funThread1of1ForFork2___VERIFIER_assert_#in~cond#1_15|, #pthreadsMutex=|v_#pthreadsMutex_127|, t2_funThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_t2_funThread1of1ForFork2_reach_error_#t~nondet0#1.base_23|, ~#A~0.offset=|v_~#A~0.offset_49|, t2_funThread1of1ForFork2_~x~1#1=|v_t2_funThread1of1ForFork2_~x~1#1_21|, t2_funThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_t2_funThread1of1ForFork2_reach_error_#t~nondet0#1.offset_23|, t2_funThread1of1ForFork2___VERIFIER_assert_~cond#1=|v_t2_funThread1of1ForFork2___VERIFIER_assert_~cond#1_31|, t2_funThread1of1ForFork2_~y~0#1=|v_t2_funThread1of1ForFork2_~y~0#1_19|, ~#A~0.base=|v_~#A~0.base_49|} AuxVars[] AssignedVars[t2_funThread1of1ForFork2___VERIFIER_assert_#in~cond#1, #pthreadsMutex, t2_funThread1of1ForFork2_reach_error_#t~nondet0#1.base, t2_funThread1of1ForFork2_reach_error_#t~nondet0#1.offset, t2_funThread1of1ForFork2___VERIFIER_assert_~cond#1][62], [Black: 209#(<= ~h~0 ~g~0), 2#ULTIMATE.startEXITtrue, 229#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 243#true, Black: 225#true, 81#L693true, Black: 235#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 227#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 233#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 228#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), 179#t2_funErr0ASSERT_VIOLATIONASSERTtrue, t3_funThread1of1ForFork1InUse, t2_funThread1of1ForFork2InUse, 180#t3_funEXITtrue, t_funThread1of1ForFork0InUse, 207#true, Black: 211#(<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|), Black: 210#(<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|), 188#true, Black: 215#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 ~g~0)), Black: 217#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|))]) [2023-08-26 16:10:13,220 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-26 16:10:13,220 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-26 16:10:13,220 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-26 16:10:13,220 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-26 16:10:13,311 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([478] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][60], [Black: 209#(<= ~h~0 ~g~0), 161#t3_funErr0ASSERT_VIOLATIONASSERTtrue, 37#L694true, 2#ULTIMATE.startEXITtrue, 229#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 243#true, Black: 225#true, Black: 235#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 227#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 233#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 211#(<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|), Black: 228#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), t3_funThread1of1ForFork1InUse, t2_funThread1of1ForFork2InUse, t_funThread1of1ForFork0InUse, 176#t2_funEXITtrue, Black: 210#(<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|), Black: 207#true, 188#true, Black: 215#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 ~g~0)), Black: 217#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|))]) [2023-08-26 16:10:13,312 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-26 16:10:13,312 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-26 16:10:13,312 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-26 16:10:13,312 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-26 16:10:13,312 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([478] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][60], [Black: 209#(<= ~h~0 ~g~0), 37#L694true, 2#ULTIMATE.startEXITtrue, 229#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 243#true, Black: 225#true, Black: 235#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 227#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 233#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 211#(<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|), Black: 228#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), t3_funThread1of1ForFork1InUse, 180#t3_funEXITtrue, t2_funThread1of1ForFork2InUse, t_funThread1of1ForFork0InUse, 176#t2_funEXITtrue, Black: 210#(<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|), Black: 207#true, 188#true, Black: 215#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 ~g~0)), Black: 217#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|))]) [2023-08-26 16:10:13,312 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-26 16:10:13,313 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-26 16:10:13,313 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-26 16:10:13,313 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-26 16:10:13,354 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([478] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][60], [Black: 209#(<= ~h~0 ~g~0), 37#L694true, 161#t3_funErr0ASSERT_VIOLATIONASSERTtrue, 2#ULTIMATE.startEXITtrue, 229#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 243#true, Black: 225#true, Black: 235#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 227#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 233#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 211#(<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|), Black: 228#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), t3_funThread1of1ForFork1InUse, t2_funThread1of1ForFork2InUse, t_funThread1of1ForFork0InUse, Black: 210#(<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|), 176#t2_funEXITtrue, Black: 207#true, 188#true, Black: 215#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 ~g~0)), Black: 217#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|))]) [2023-08-26 16:10:13,354 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-26 16:10:13,354 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-26 16:10:13,354 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-26 16:10:13,355 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-26 16:10:13,355 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-26 16:10:13,355 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([478] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][60], [Black: 209#(<= ~h~0 ~g~0), 37#L694true, 2#ULTIMATE.startEXITtrue, 229#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 243#true, Black: 225#true, Black: 235#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 227#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 233#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 211#(<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|), Black: 228#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), t3_funThread1of1ForFork1InUse, 180#t3_funEXITtrue, t2_funThread1of1ForFork2InUse, t_funThread1of1ForFork0InUse, Black: 210#(<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|), 176#t2_funEXITtrue, Black: 207#true, 188#true, Black: 215#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 ~g~0)), Black: 217#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|))]) [2023-08-26 16:10:13,355 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-26 16:10:13,355 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-26 16:10:13,355 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-26 16:10:13,355 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-26 16:10:13,355 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-26 16:10:13,519 INFO L124 PetriNetUnfolderBase]: 4115/7781 cut-off events. [2023-08-26 16:10:13,519 INFO L125 PetriNetUnfolderBase]: For 8467/8818 co-relation queries the response was YES. [2023-08-26 16:10:13,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20822 conditions, 7781 events. 4115/7781 cut-off events. For 8467/8818 co-relation queries the response was YES. Maximal size of possible extension queue 501. Compared 62122 event pairs, 1823 based on Foata normal form. 698/7702 useless extension candidates. Maximal degree in co-relation 20807. Up to 4618 conditions per place. [2023-08-26 16:10:13,560 INFO L140 encePairwiseOnDemand]: 369/384 looper letters, 39 selfloop transitions, 16 changer transitions 0/84 dead transitions. [2023-08-26 16:10:13,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 84 transitions, 520 flow [2023-08-26 16:10:13,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 16:10:13,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 16:10:13,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 497 transitions. [2023-08-26 16:10:13,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4314236111111111 [2023-08-26 16:10:13,563 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 497 transitions. [2023-08-26 16:10:13,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 497 transitions. [2023-08-26 16:10:13,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:10:13,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 497 transitions. [2023-08-26 16:10:13,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 165.66666666666666) internal successors, (497), 3 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:13,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 384.0) internal successors, (1536), 4 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:13,566 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 384.0) internal successors, (1536), 4 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:13,566 INFO L175 Difference]: Start difference. First operand has 71 places, 62 transitions, 340 flow. Second operand 3 states and 497 transitions. [2023-08-26 16:10:13,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 84 transitions, 520 flow [2023-08-26 16:10:13,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 84 transitions, 516 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-26 16:10:13,640 INFO L231 Difference]: Finished difference. Result has 74 places, 71 transitions, 422 flow [2023-08-26 16:10:13,640 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=384, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=422, PETRI_PLACES=74, PETRI_TRANSITIONS=71} [2023-08-26 16:10:13,641 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 21 predicate places. [2023-08-26 16:10:13,642 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 71 transitions, 422 flow [2023-08-26 16:10:13,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:13,642 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:10:13,642 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 16:10:13,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 16:10:13,642 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t3_funErr0ASSERT_VIOLATIONASSERT === [t2_funErr0ASSERT_VIOLATIONASSERT, t3_funErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 16:10:13,649 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:10:13,650 INFO L85 PathProgramCache]: Analyzing trace with hash -174716296, now seen corresponding path program 1 times [2023-08-26 16:10:13,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:10:13,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500465432] [2023-08-26 16:10:13,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:10:13,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:10:13,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:10:13,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 16:10:13,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:10:13,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500465432] [2023-08-26 16:10:13,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500465432] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:10:13,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:10:13,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 16:10:13,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21544484] [2023-08-26 16:10:13,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:10:13,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 16:10:13,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:10:13,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 16:10:13,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 16:10:13,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 384 [2023-08-26 16:10:13,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 71 transitions, 422 flow. Second operand has 5 states, 5 states have (on average 157.2) internal successors, (786), 5 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:13,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:10:13,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 384 [2023-08-26 16:10:13,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:10:14,957 INFO L124 PetriNetUnfolderBase]: 7384/12060 cut-off events. [2023-08-26 16:10:14,957 INFO L125 PetriNetUnfolderBase]: For 17391/17474 co-relation queries the response was YES. [2023-08-26 16:10:14,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41819 conditions, 12060 events. 7384/12060 cut-off events. For 17391/17474 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 80854 event pairs, 2773 based on Foata normal form. 83/11310 useless extension candidates. Maximal degree in co-relation 41802. Up to 5762 conditions per place. [2023-08-26 16:10:15,027 INFO L140 encePairwiseOnDemand]: 377/384 looper letters, 134 selfloop transitions, 31 changer transitions 4/177 dead transitions. [2023-08-26 16:10:15,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 177 transitions, 1373 flow [2023-08-26 16:10:15,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 16:10:15,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 16:10:15,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1357 transitions. [2023-08-26 16:10:15,037 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4417317708333333 [2023-08-26 16:10:15,038 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1357 transitions. [2023-08-26 16:10:15,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1357 transitions. [2023-08-26 16:10:15,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:10:15,040 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1357 transitions. [2023-08-26 16:10:15,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 169.625) internal successors, (1357), 8 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:15,052 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 384.0) internal successors, (3456), 9 states have internal predecessors, (3456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:15,053 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 384.0) internal successors, (3456), 9 states have internal predecessors, (3456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:15,053 INFO L175 Difference]: Start difference. First operand has 74 places, 71 transitions, 422 flow. Second operand 8 states and 1357 transitions. [2023-08-26 16:10:15,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 177 transitions, 1373 flow [2023-08-26 16:10:15,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 177 transitions, 1327 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 16:10:15,199 INFO L231 Difference]: Finished difference. Result has 86 places, 90 transitions, 711 flow [2023-08-26 16:10:15,200 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=384, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=711, PETRI_PLACES=86, PETRI_TRANSITIONS=90} [2023-08-26 16:10:15,201 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 33 predicate places. [2023-08-26 16:10:15,201 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 90 transitions, 711 flow [2023-08-26 16:10:15,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 157.2) internal successors, (786), 5 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:15,201 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:10:15,201 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 16:10:15,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 16:10:15,202 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2_funErr0ASSERT_VIOLATIONASSERT === [t2_funErr0ASSERT_VIOLATIONASSERT, t3_funErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 16:10:15,202 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:10:15,202 INFO L85 PathProgramCache]: Analyzing trace with hash 2096501696, now seen corresponding path program 1 times [2023-08-26 16:10:15,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:10:15,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915294365] [2023-08-26 16:10:15,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:10:15,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:10:15,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:10:15,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 16:10:15,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:10:15,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915294365] [2023-08-26 16:10:15,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915294365] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:10:15,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:10:15,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 16:10:15,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688860] [2023-08-26 16:10:15,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:10:15,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 16:10:15,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:10:15,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 16:10:15,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-26 16:10:15,322 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 384 [2023-08-26 16:10:15,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 90 transitions, 711 flow. Second operand has 6 states, 6 states have (on average 154.0) internal successors, (924), 6 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:15,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:10:15,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 384 [2023-08-26 16:10:15,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:10:16,805 INFO L124 PetriNetUnfolderBase]: 8293/13754 cut-off events. [2023-08-26 16:10:16,805 INFO L125 PetriNetUnfolderBase]: For 29621/29729 co-relation queries the response was YES. [2023-08-26 16:10:16,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48582 conditions, 13754 events. 8293/13754 cut-off events. For 29621/29729 co-relation queries the response was YES. Maximal size of possible extension queue 609. Compared 97862 event pairs, 2264 based on Foata normal form. 446/13788 useless extension candidates. Maximal degree in co-relation 48560. Up to 6030 conditions per place. [2023-08-26 16:10:16,874 INFO L140 encePairwiseOnDemand]: 378/384 looper letters, 176 selfloop transitions, 35 changer transitions 0/219 dead transitions. [2023-08-26 16:10:16,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 219 transitions, 1811 flow [2023-08-26 16:10:16,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 16:10:16,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 16:10:16,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1202 transitions. [2023-08-26 16:10:16,879 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44717261904761907 [2023-08-26 16:10:16,879 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1202 transitions. [2023-08-26 16:10:16,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1202 transitions. [2023-08-26 16:10:16,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:10:16,880 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1202 transitions. [2023-08-26 16:10:16,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 171.71428571428572) internal successors, (1202), 7 states have internal predecessors, (1202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:16,887 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 384.0) internal successors, (3072), 8 states have internal predecessors, (3072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:16,887 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 384.0) internal successors, (3072), 8 states have internal predecessors, (3072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:16,887 INFO L175 Difference]: Start difference. First operand has 86 places, 90 transitions, 711 flow. Second operand 7 states and 1202 transitions. [2023-08-26 16:10:16,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 219 transitions, 1811 flow [2023-08-26 16:10:17,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 219 transitions, 1805 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-26 16:10:17,072 INFO L231 Difference]: Finished difference. Result has 96 places, 94 transitions, 822 flow [2023-08-26 16:10:17,072 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=384, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=822, PETRI_PLACES=96, PETRI_TRANSITIONS=94} [2023-08-26 16:10:17,073 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 43 predicate places. [2023-08-26 16:10:17,073 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 94 transitions, 822 flow [2023-08-26 16:10:17,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 154.0) internal successors, (924), 6 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:17,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:10:17,074 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 16:10:17,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 16:10:17,074 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [t2_funErr0ASSERT_VIOLATIONASSERT, t3_funErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 16:10:17,074 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:10:17,074 INFO L85 PathProgramCache]: Analyzing trace with hash 61376169, now seen corresponding path program 1 times [2023-08-26 16:10:17,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:10:17,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222129441] [2023-08-26 16:10:17,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:10:17,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:10:17,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:10:17,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 16:10:17,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:10:17,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222129441] [2023-08-26 16:10:17,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222129441] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:10:17,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:10:17,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 16:10:17,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705199730] [2023-08-26 16:10:17,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:10:17,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 16:10:17,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:10:17,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 16:10:17,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 16:10:17,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 384 [2023-08-26 16:10:17,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 94 transitions, 822 flow. Second operand has 5 states, 5 states have (on average 143.2) internal successors, (716), 5 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:17,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:10:17,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 384 [2023-08-26 16:10:17,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:10:17,782 INFO L124 PetriNetUnfolderBase]: 1354/3051 cut-off events. [2023-08-26 16:10:17,783 INFO L125 PetriNetUnfolderBase]: For 9880/10287 co-relation queries the response was YES. [2023-08-26 16:10:17,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11329 conditions, 3051 events. 1354/3051 cut-off events. For 9880/10287 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 23430 event pairs, 205 based on Foata normal form. 373/3243 useless extension candidates. Maximal degree in co-relation 11302. Up to 1643 conditions per place. [2023-08-26 16:10:17,794 INFO L140 encePairwiseOnDemand]: 374/384 looper letters, 44 selfloop transitions, 16 changer transitions 2/107 dead transitions. [2023-08-26 16:10:17,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 107 transitions, 982 flow [2023-08-26 16:10:17,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 16:10:17,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 16:10:17,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 610 transitions. [2023-08-26 16:10:17,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3971354166666667 [2023-08-26 16:10:17,797 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 610 transitions. [2023-08-26 16:10:17,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 610 transitions. [2023-08-26 16:10:17,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:10:17,798 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 610 transitions. [2023-08-26 16:10:17,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 152.5) internal successors, (610), 4 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:17,801 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 384.0) internal successors, (1920), 5 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:17,801 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 384.0) internal successors, (1920), 5 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:17,802 INFO L175 Difference]: Start difference. First operand has 96 places, 94 transitions, 822 flow. Second operand 4 states and 610 transitions. [2023-08-26 16:10:17,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 107 transitions, 982 flow [2023-08-26 16:10:17,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 107 transitions, 917 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-08-26 16:10:17,837 INFO L231 Difference]: Finished difference. Result has 94 places, 88 transitions, 719 flow [2023-08-26 16:10:17,837 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=384, PETRI_DIFFERENCE_MINUEND_FLOW=689, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=719, PETRI_PLACES=94, PETRI_TRANSITIONS=88} [2023-08-26 16:10:17,837 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 41 predicate places. [2023-08-26 16:10:17,837 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 88 transitions, 719 flow [2023-08-26 16:10:17,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 143.2) internal successors, (716), 5 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:17,838 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:10:17,838 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 16:10:17,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 16:10:17,838 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2_funErr0ASSERT_VIOLATIONASSERT === [t2_funErr0ASSERT_VIOLATIONASSERT, t3_funErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 16:10:17,838 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:10:17,838 INFO L85 PathProgramCache]: Analyzing trace with hash 916705620, now seen corresponding path program 1 times [2023-08-26 16:10:17,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:10:17,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624862911] [2023-08-26 16:10:17,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:10:17,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:10:17,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:10:17,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 16:10:17,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:10:17,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624862911] [2023-08-26 16:10:17,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624862911] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:10:17,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:10:17,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 16:10:17,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747023539] [2023-08-26 16:10:17,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:10:17,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 16:10:17,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:10:17,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 16:10:17,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-26 16:10:17,916 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 384 [2023-08-26 16:10:17,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 88 transitions, 719 flow. Second operand has 6 states, 6 states have (on average 154.5) internal successors, (927), 6 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:17,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:10:17,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 384 [2023-08-26 16:10:17,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:10:18,640 INFO L124 PetriNetUnfolderBase]: 2238/4456 cut-off events. [2023-08-26 16:10:18,640 INFO L125 PetriNetUnfolderBase]: For 11602/11683 co-relation queries the response was YES. [2023-08-26 16:10:18,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17077 conditions, 4456 events. 2238/4456 cut-off events. For 11602/11683 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 32492 event pairs, 484 based on Foata normal form. 225/4583 useless extension candidates. Maximal degree in co-relation 17052. Up to 1537 conditions per place. [2023-08-26 16:10:18,664 INFO L140 encePairwiseOnDemand]: 376/384 looper letters, 190 selfloop transitions, 39 changer transitions 8/245 dead transitions. [2023-08-26 16:10:18,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 245 transitions, 2059 flow [2023-08-26 16:10:18,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-26 16:10:18,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-26 16:10:18,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2153 transitions. [2023-08-26 16:10:18,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4312900641025641 [2023-08-26 16:10:18,670 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2153 transitions. [2023-08-26 16:10:18,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2153 transitions. [2023-08-26 16:10:18,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:10:18,671 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2153 transitions. [2023-08-26 16:10:18,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 165.6153846153846) internal successors, (2153), 13 states have internal predecessors, (2153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:18,682 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 384.0) internal successors, (5376), 14 states have internal predecessors, (5376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:18,683 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 384.0) internal successors, (5376), 14 states have internal predecessors, (5376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:18,683 INFO L175 Difference]: Start difference. First operand has 94 places, 88 transitions, 719 flow. Second operand 13 states and 2153 transitions. [2023-08-26 16:10:18,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 245 transitions, 2059 flow [2023-08-26 16:10:18,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 245 transitions, 1990 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 16:10:18,731 INFO L231 Difference]: Finished difference. Result has 108 places, 92 transitions, 859 flow [2023-08-26 16:10:18,731 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=384, PETRI_DIFFERENCE_MINUEND_FLOW=703, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=859, PETRI_PLACES=108, PETRI_TRANSITIONS=92} [2023-08-26 16:10:18,731 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 55 predicate places. [2023-08-26 16:10:18,731 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 92 transitions, 859 flow [2023-08-26 16:10:18,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 154.5) internal successors, (927), 6 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:18,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:10:18,732 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 16:10:18,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 16:10:18,732 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [t2_funErr0ASSERT_VIOLATIONASSERT, t3_funErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 16:10:18,732 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:10:18,732 INFO L85 PathProgramCache]: Analyzing trace with hash 840095611, now seen corresponding path program 1 times [2023-08-26 16:10:18,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:10:18,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196221216] [2023-08-26 16:10:18,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:10:18,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:10:18,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:10:18,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 16:10:18,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:10:18,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196221216] [2023-08-26 16:10:18,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196221216] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:10:18,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:10:18,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 16:10:18,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826445643] [2023-08-26 16:10:18,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:10:18,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 16:10:18,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:10:18,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 16:10:18,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-26 16:10:18,875 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 384 [2023-08-26 16:10:18,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 92 transitions, 859 flow. Second operand has 6 states, 6 states have (on average 152.83333333333334) internal successors, (917), 6 states have internal predecessors, (917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:18,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:10:18,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 384 [2023-08-26 16:10:18,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:10:19,619 INFO L124 PetriNetUnfolderBase]: 2093/4315 cut-off events. [2023-08-26 16:10:19,619 INFO L125 PetriNetUnfolderBase]: For 14595/14653 co-relation queries the response was YES. [2023-08-26 16:10:19,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17685 conditions, 4315 events. 2093/4315 cut-off events. For 14595/14653 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 31598 event pairs, 584 based on Foata normal form. 186/4458 useless extension candidates. Maximal degree in co-relation 17656. Up to 1568 conditions per place. [2023-08-26 16:10:19,637 INFO L140 encePairwiseOnDemand]: 374/384 looper letters, 177 selfloop transitions, 32 changer transitions 28/245 dead transitions. [2023-08-26 16:10:19,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 245 transitions, 2429 flow [2023-08-26 16:10:19,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-26 16:10:19,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-26 16:10:19,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2097 transitions. [2023-08-26 16:10:19,643 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42007211538461536 [2023-08-26 16:10:19,643 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2097 transitions. [2023-08-26 16:10:19,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2097 transitions. [2023-08-26 16:10:19,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:10:19,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2097 transitions. [2023-08-26 16:10:19,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 161.30769230769232) internal successors, (2097), 13 states have internal predecessors, (2097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:19,654 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 384.0) internal successors, (5376), 14 states have internal predecessors, (5376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:19,655 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 384.0) internal successors, (5376), 14 states have internal predecessors, (5376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:19,655 INFO L175 Difference]: Start difference. First operand has 108 places, 92 transitions, 859 flow. Second operand 13 states and 2097 transitions. [2023-08-26 16:10:19,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 245 transitions, 2429 flow [2023-08-26 16:10:19,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 245 transitions, 2263 flow, removed 38 selfloop flow, removed 10 redundant places. [2023-08-26 16:10:19,719 INFO L231 Difference]: Finished difference. Result has 113 places, 97 transitions, 868 flow [2023-08-26 16:10:19,720 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=384, PETRI_DIFFERENCE_MINUEND_FLOW=759, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=868, PETRI_PLACES=113, PETRI_TRANSITIONS=97} [2023-08-26 16:10:19,720 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 60 predicate places. [2023-08-26 16:10:19,720 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 97 transitions, 868 flow [2023-08-26 16:10:19,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 152.83333333333334) internal successors, (917), 6 states have internal predecessors, (917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:19,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:10:19,721 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 16:10:19,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 16:10:19,721 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t2_funErr0ASSERT_VIOLATIONASSERT === [t2_funErr0ASSERT_VIOLATIONASSERT, t3_funErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 16:10:19,721 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:10:19,722 INFO L85 PathProgramCache]: Analyzing trace with hash 139565695, now seen corresponding path program 1 times [2023-08-26 16:10:19,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:10:19,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431164485] [2023-08-26 16:10:19,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:10:19,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:10:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:10:19,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 16:10:19,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:10:19,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431164485] [2023-08-26 16:10:19,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431164485] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:10:19,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:10:19,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 16:10:19,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549859485] [2023-08-26 16:10:19,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:10:19,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 16:10:19,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:10:19,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 16:10:19,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 16:10:19,831 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 384 [2023-08-26 16:10:19,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 97 transitions, 868 flow. Second operand has 5 states, 5 states have (on average 143.8) internal successors, (719), 5 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:19,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:10:19,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 384 [2023-08-26 16:10:19,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:10:19,987 INFO L124 PetriNetUnfolderBase]: 304/1126 cut-off events. [2023-08-26 16:10:19,987 INFO L125 PetriNetUnfolderBase]: For 2521/2579 co-relation queries the response was YES. [2023-08-26 16:10:19,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4067 conditions, 1126 events. 304/1126 cut-off events. For 2521/2579 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 8169 event pairs, 148 based on Foata normal form. 47/1167 useless extension candidates. Maximal degree in co-relation 4037. Up to 407 conditions per place. [2023-08-26 16:10:19,992 INFO L140 encePairwiseOnDemand]: 373/384 looper letters, 24 selfloop transitions, 13 changer transitions 14/75 dead transitions. [2023-08-26 16:10:19,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 75 transitions, 649 flow [2023-08-26 16:10:19,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 16:10:19,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 16:10:19,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 602 transitions. [2023-08-26 16:10:19,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3919270833333333 [2023-08-26 16:10:19,994 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 602 transitions. [2023-08-26 16:10:19,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 602 transitions. [2023-08-26 16:10:19,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:10:19,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 602 transitions. [2023-08-26 16:10:19,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 150.5) internal successors, (602), 4 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:19,998 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 384.0) internal successors, (1920), 5 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:19,998 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 384.0) internal successors, (1920), 5 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:19,998 INFO L175 Difference]: Start difference. First operand has 113 places, 97 transitions, 868 flow. Second operand 4 states and 602 transitions. [2023-08-26 16:10:19,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 75 transitions, 649 flow [2023-08-26 16:10:20,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 75 transitions, 539 flow, removed 15 selfloop flow, removed 19 redundant places. [2023-08-26 16:10:20,009 INFO L231 Difference]: Finished difference. Result has 89 places, 53 transitions, 335 flow [2023-08-26 16:10:20,009 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=384, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=335, PETRI_PLACES=89, PETRI_TRANSITIONS=53} [2023-08-26 16:10:20,010 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 36 predicate places. [2023-08-26 16:10:20,010 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 53 transitions, 335 flow [2023-08-26 16:10:20,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 143.8) internal successors, (719), 5 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:20,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:10:20,011 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 16:10:20,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 16:10:20,011 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t3_funErr0ASSERT_VIOLATIONASSERT === [t2_funErr0ASSERT_VIOLATIONASSERT, t3_funErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 16:10:20,011 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:10:20,011 INFO L85 PathProgramCache]: Analyzing trace with hash 298131353, now seen corresponding path program 1 times [2023-08-26 16:10:20,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:10:20,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546790438] [2023-08-26 16:10:20,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:10:20,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:10:20,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:10:20,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 16:10:20,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:10:20,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546790438] [2023-08-26 16:10:20,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546790438] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:10:20,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:10:20,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 16:10:20,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958274979] [2023-08-26 16:10:20,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:10:20,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 16:10:20,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:10:20,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 16:10:20,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-26 16:10:20,122 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 384 [2023-08-26 16:10:20,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 53 transitions, 335 flow. Second operand has 6 states, 6 states have (on average 155.0) internal successors, (930), 6 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:20,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:10:20,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 384 [2023-08-26 16:10:20,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:10:20,361 INFO L124 PetriNetUnfolderBase]: 324/856 cut-off events. [2023-08-26 16:10:20,361 INFO L125 PetriNetUnfolderBase]: For 1053/1061 co-relation queries the response was YES. [2023-08-26 16:10:20,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2967 conditions, 856 events. 324/856 cut-off events. For 1053/1061 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 4604 event pairs, 177 based on Foata normal form. 47/897 useless extension candidates. Maximal degree in co-relation 2950. Up to 403 conditions per place. [2023-08-26 16:10:20,364 INFO L140 encePairwiseOnDemand]: 378/384 looper letters, 0 selfloop transitions, 0 changer transitions 81/81 dead transitions. [2023-08-26 16:10:20,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 81 transitions, 616 flow [2023-08-26 16:10:20,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 16:10:20,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 16:10:20,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1127 transitions. [2023-08-26 16:10:20,367 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4192708333333333 [2023-08-26 16:10:20,367 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1127 transitions. [2023-08-26 16:10:20,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1127 transitions. [2023-08-26 16:10:20,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:10:20,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1127 transitions. [2023-08-26 16:10:20,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 161.0) internal successors, (1127), 7 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:20,372 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 384.0) internal successors, (3072), 8 states have internal predecessors, (3072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:20,372 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 384.0) internal successors, (3072), 8 states have internal predecessors, (3072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:20,373 INFO L175 Difference]: Start difference. First operand has 89 places, 53 transitions, 335 flow. Second operand 7 states and 1127 transitions. [2023-08-26 16:10:20,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 81 transitions, 616 flow [2023-08-26 16:10:20,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 81 transitions, 551 flow, removed 5 selfloop flow, removed 10 redundant places. [2023-08-26 16:10:20,376 INFO L231 Difference]: Finished difference. Result has 79 places, 0 transitions, 0 flow [2023-08-26 16:10:20,376 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=384, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=79, PETRI_TRANSITIONS=0} [2023-08-26 16:10:20,377 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 26 predicate places. [2023-08-26 16:10:20,377 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 0 transitions, 0 flow [2023-08-26 16:10:20,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 155.0) internal successors, (930), 6 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:20,379 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONASSERT (14 of 15 remaining) [2023-08-26 16:10:20,380 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t3_funErr0ASSERT_VIOLATIONASSERT (13 of 15 remaining) [2023-08-26 16:10:20,380 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 15 remaining) [2023-08-26 16:10:20,380 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2023-08-26 16:10:20,381 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2023-08-26 16:10:20,381 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2023-08-26 16:10:20,381 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2023-08-26 16:10:20,381 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2023-08-26 16:10:20,381 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONASSERT (6 of 15 remaining) [2023-08-26 16:10:20,382 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONASSERT (5 of 15 remaining) [2023-08-26 16:10:20,382 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 15 remaining) [2023-08-26 16:10:20,382 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 15 remaining) [2023-08-26 16:10:20,382 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 15 remaining) [2023-08-26 16:10:20,382 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONASSERT (1 of 15 remaining) [2023-08-26 16:10:20,382 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t3_funErr0ASSERT_VIOLATIONASSERT (0 of 15 remaining) [2023-08-26 16:10:20,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 16:10:20,383 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 16:10:20,387 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 16:10:20,388 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 16:10:20,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 04:10:20 BasicIcfg [2023-08-26 16:10:20,390 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 16:10:20,391 INFO L158 Benchmark]: Toolchain (without parser) took 20796.55ms. Allocated memory was 388.0MB in the beginning and 5.6GB in the end (delta: 5.2GB). Free memory was 362.6MB in the beginning and 4.9GB in the end (delta: -4.5GB). Peak memory consumption was 729.6MB. Max. memory is 16.0GB. [2023-08-26 16:10:20,391 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 388.0MB. Free memory was 364.9MB in the beginning and 364.8MB in the end (delta: 34.6kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 16:10:20,391 INFO L158 Benchmark]: CACSL2BoogieTranslator took 513.33ms. Allocated memory is still 388.0MB. Free memory was 362.0MB in the beginning and 342.5MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-08-26 16:10:20,391 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.18ms. Allocated memory is still 388.0MB. Free memory was 342.5MB in the beginning and 339.8MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-26 16:10:20,391 INFO L158 Benchmark]: Boogie Preprocessor took 42.65ms. Allocated memory is still 388.0MB. Free memory was 339.8MB in the beginning and 338.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 16:10:20,392 INFO L158 Benchmark]: RCFGBuilder took 442.90ms. Allocated memory is still 388.0MB. Free memory was 338.3MB in the beginning and 318.2MB in the end (delta: 20.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-08-26 16:10:20,392 INFO L158 Benchmark]: TraceAbstraction took 19728.13ms. Allocated memory was 388.0MB in the beginning and 5.6GB in the end (delta: 5.2GB). Free memory was 317.6MB in the beginning and 4.9GB in the end (delta: -4.5GB). Peak memory consumption was 685.6MB. Max. memory is 16.0GB. [2023-08-26 16:10:20,393 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 388.0MB. Free memory was 364.9MB in the beginning and 364.8MB in the end (delta: 34.6kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 513.33ms. Allocated memory is still 388.0MB. Free memory was 362.0MB in the beginning and 342.5MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 64.18ms. Allocated memory is still 388.0MB. Free memory was 342.5MB in the beginning and 339.8MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 42.65ms. Allocated memory is still 388.0MB. Free memory was 339.8MB in the beginning and 338.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 442.90ms. Allocated memory is still 388.0MB. Free memory was 338.3MB in the beginning and 318.2MB in the end (delta: 20.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * TraceAbstraction took 19728.13ms. Allocated memory was 388.0MB in the beginning and 5.6GB in the end (delta: 5.2GB). Free memory was 317.6MB in the beginning and 4.9GB in the end (delta: -4.5GB). Peak memory consumption was 685.6MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 232]: Unsoundness Warning unspecified type, defaulting to int C: short [232] - GenericResultAtLocation [Line: 233]: Unsoundness Warning unspecified type, defaulting to int C: short [233] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.6s, 182 PlacesBefore, 53 PlacesAfterwards, 181 TransitionsBefore, 45 TransitionsAfterwards, 12214 CoEnabledTransitionPairs, 7 FixpointIterations, 48 TrivialSequentialCompositions, 116 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 29 ConcurrentYvCompositions, 7 ChoiceCompositions, 200 TotalNumberOfCompositions, 27334 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 14344, independent: 13943, independent conditional: 0, independent unconditional: 13943, dependent: 401, dependent conditional: 0, dependent unconditional: 401, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 6939, independent: 6878, independent conditional: 0, independent unconditional: 6878, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 14344, independent: 7065, independent conditional: 0, independent unconditional: 7065, dependent: 340, dependent conditional: 0, dependent unconditional: 340, unknown: 6939, unknown conditional: 0, unknown unconditional: 6939] , Statistics on independence cache: Total cache size (in pairs): 188, Positive cache size: 160, Positive conditional cache size: 0, Positive unconditional cache size: 160, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - PositiveResult [Line: 18]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 18]: assertion always holds For all program executions holds that assertion always holds 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: 18]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 18]: assertion always holds For all program executions holds that assertion always holds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 257 locations, 15 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: 19.6s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 965 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 965 mSDsluCounter, 83 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 45 mSDsCounter, 70 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2243 IncrementalHoareTripleChecker+Invalid, 2313 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 70 mSolverCounterUnsat, 38 mSDtfsCounter, 2243 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=868occurred in iteration=13, InterpolantAutomatonStates: 89, 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, 1.5s InterpolantComputationTime, 162 NumberOfCodeBlocks, 162 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 147 ConstructedInterpolants, 0 QuantifiedInterpolants, 814 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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 10 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-08-26 16:10:20,407 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...