/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe017_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-11 18:37:25,596 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-11 18:37:25,598 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-11 18:37:25,625 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-11 18:37:25,626 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-11 18:37:25,627 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-11 18:37:25,628 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-11 18:37:25,630 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-11 18:37:25,632 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-11 18:37:25,633 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-11 18:37:25,634 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-11 18:37:25,635 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-11 18:37:25,635 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-11 18:37:25,636 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-11 18:37:25,637 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-11 18:37:25,638 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-11 18:37:25,639 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-11 18:37:25,640 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-11 18:37:25,642 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-11 18:37:25,644 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-11 18:37:25,645 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-11 18:37:25,646 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-11 18:37:25,647 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-11 18:37:25,648 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-11 18:37:25,651 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-11 18:37:25,651 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-11 18:37:25,651 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-11 18:37:25,652 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-11 18:37:25,652 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-11 18:37:25,653 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-11 18:37:25,654 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-11 18:37:25,654 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-11 18:37:25,655 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-11 18:37:25,656 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-11 18:37:25,657 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-11 18:37:25,657 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-11 18:37:25,658 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-11 18:37:25,658 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-11 18:37:25,658 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-11 18:37:25,659 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-11 18:37:25,660 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-11 18:37:25,661 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf [2020-10-11 18:37:25,684 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-11 18:37:25,684 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-11 18:37:25,685 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-11 18:37:25,685 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-11 18:37:25,686 INFO L138 SettingsManager]: * Use SBE=true [2020-10-11 18:37:25,686 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-11 18:37:25,686 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-11 18:37:25,686 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-11 18:37:25,686 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-11 18:37:25,687 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-11 18:37:25,687 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-11 18:37:25,687 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-11 18:37:25,687 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-11 18:37:25,687 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-11 18:37:25,688 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-11 18:37:25,688 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-11 18:37:25,688 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-11 18:37:25,688 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-11 18:37:25,688 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-11 18:37:25,689 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-11 18:37:25,689 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-11 18:37:25,689 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 18:37:25,689 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-11 18:37:25,689 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-11 18:37:25,690 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-11 18:37:25,690 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-11 18:37:25,690 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-11 18:37:25,690 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-10-11 18:37:25,690 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-11 18:37:25,691 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-11 18:37:25,970 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-11 18:37:25,982 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-11 18:37:25,986 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-11 18:37:25,987 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-11 18:37:25,988 INFO L275 PluginConnector]: CDTParser initialized [2020-10-11 18:37:25,988 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_power.opt.i [2020-10-11 18:37:26,063 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0de296fd3/818a493392f1476eb6bd3e401b974297/FLAGc9878521d [2020-10-11 18:37:26,631 INFO L306 CDTParser]: Found 1 translation units. [2020-10-11 18:37:26,632 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_power.opt.i [2020-10-11 18:37:26,649 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0de296fd3/818a493392f1476eb6bd3e401b974297/FLAGc9878521d [2020-10-11 18:37:26,940 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0de296fd3/818a493392f1476eb6bd3e401b974297 [2020-10-11 18:37:26,950 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-11 18:37:26,952 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-11 18:37:26,953 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-11 18:37:26,953 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-11 18:37:26,956 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-11 18:37:26,957 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:37:26" (1/1) ... [2020-10-11 18:37:26,960 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@691e5957 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:37:26, skipping insertion in model container [2020-10-11 18:37:26,960 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:37:26" (1/1) ... [2020-10-11 18:37:26,968 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-11 18:37:27,038 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-11 18:37:27,498 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:37:27,511 INFO L203 MainTranslator]: Completed pre-run [2020-10-11 18:37:27,577 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:37:27,661 INFO L208 MainTranslator]: Completed translation [2020-10-11 18:37:27,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:37:27 WrapperNode [2020-10-11 18:37:27,662 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-11 18:37:27,663 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-11 18:37:27,663 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-11 18:37:27,663 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-11 18:37:27,672 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:37:27" (1/1) ... [2020-10-11 18:37:27,692 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:37:27" (1/1) ... [2020-10-11 18:37:27,730 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-11 18:37:27,730 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-11 18:37:27,731 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-11 18:37:27,731 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-11 18:37:27,741 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:37:27" (1/1) ... [2020-10-11 18:37:27,741 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:37:27" (1/1) ... [2020-10-11 18:37:27,747 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:37:27" (1/1) ... [2020-10-11 18:37:27,747 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:37:27" (1/1) ... [2020-10-11 18:37:27,761 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:37:27" (1/1) ... [2020-10-11 18:37:27,770 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:37:27" (1/1) ... [2020-10-11 18:37:27,774 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:37:27" (1/1) ... [2020-10-11 18:37:27,788 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-11 18:37:27,788 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-11 18:37:27,789 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-11 18:37:27,789 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-11 18:37:27,789 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:37:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 18:37:27,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-11 18:37:27,855 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-11 18:37:27,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-11 18:37:27,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-11 18:37:27,855 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-11 18:37:27,855 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-11 18:37:27,856 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-11 18:37:27,856 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-11 18:37:27,856 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-11 18:37:27,856 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-11 18:37:27,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-11 18:37:27,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-11 18:37:27,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-11 18:37:27,858 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-11 18:37:29,843 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-11 18:37:29,843 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-11 18:37:29,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:37:29 BoogieIcfgContainer [2020-10-11 18:37:29,846 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-11 18:37:29,847 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-11 18:37:29,847 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-11 18:37:29,850 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-11 18:37:29,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:37:26" (1/3) ... [2020-10-11 18:37:29,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50aa697e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:37:29, skipping insertion in model container [2020-10-11 18:37:29,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:37:27" (2/3) ... [2020-10-11 18:37:29,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50aa697e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:37:29, skipping insertion in model container [2020-10-11 18:37:29,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:37:29" (3/3) ... [2020-10-11 18:37:29,854 INFO L111 eAbstractionObserver]: Analyzing ICFG safe017_power.opt.i [2020-10-11 18:37:29,865 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-11 18:37:29,873 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-11 18:37:29,874 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-11 18:37:29,903 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,903 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,904 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,904 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,905 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,905 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,905 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,905 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,906 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,906 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,906 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,906 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,907 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,907 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,907 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,908 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,908 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,908 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,909 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,909 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,909 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,909 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,910 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,910 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,910 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,910 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,911 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,911 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,911 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,912 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,912 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,912 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,912 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,913 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,913 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,913 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,913 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,913 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,914 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,914 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,914 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,915 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,915 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,919 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,919 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,919 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,920 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,920 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,920 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,920 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,920 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,921 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,921 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,921 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,921 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,927 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,927 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,927 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,927 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,928 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,928 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,928 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,928 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,929 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,929 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,930 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,931 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,931 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,931 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,931 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,932 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,932 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,932 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,932 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,933 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:29,950 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-11 18:37:29,972 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 18:37:29,972 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-11 18:37:29,972 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 18:37:29,972 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 18:37:29,973 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 18:37:29,973 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 18:37:29,973 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 18:37:29,973 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 18:37:29,987 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 98 places, 90 transitions, 195 flow [2020-10-11 18:37:30,033 INFO L129 PetriNetUnfolder]: 2/87 cut-off events. [2020-10-11 18:37:30,033 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:37:30,038 INFO L80 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2020-10-11 18:37:30,039 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 90 transitions, 195 flow [2020-10-11 18:37:30,045 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 87 transitions, 183 flow [2020-10-11 18:37:30,056 INFO L129 PetriNetUnfolder]: 0/35 cut-off events. [2020-10-11 18:37:30,056 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:37:30,056 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:37:30,057 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:37:30,058 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:37:30,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:37:30,068 INFO L82 PathProgramCache]: Analyzing trace with hash -644128995, now seen corresponding path program 1 times [2020-10-11 18:37:30,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:37:30,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386488853] [2020-10-11 18:37:30,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:37:30,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:37:30,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:37:30,451 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386488853] [2020-10-11 18:37:30,454 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:37:30,454 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 18:37:30,457 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966117705] [2020-10-11 18:37:30,470 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 18:37:30,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:37:30,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 18:37:30,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 18:37:30,619 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 90 [2020-10-11 18:37:30,621 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 87 transitions, 183 flow. Second operand 3 states. [2020-10-11 18:37:30,621 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:37:30,622 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 90 [2020-10-11 18:37:30,623 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:37:30,653 INFO L129 PetriNetUnfolder]: 0/84 cut-off events. [2020-10-11 18:37:30,654 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:37:30,654 INFO L80 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 84 events. 0/84 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 4/86 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2020-10-11 18:37:30,656 INFO L132 encePairwiseOnDemand]: 85/90 looper letters, 0 selfloop transitions, 2 changer transitions 11/84 dead transitions. [2020-10-11 18:37:30,656 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 84 transitions, 181 flow [2020-10-11 18:37:30,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 18:37:30,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-11 18:37:30,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2020-10-11 18:37:30,672 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9703703703703703 [2020-10-11 18:37:30,673 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 262 transitions. [2020-10-11 18:37:30,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 262 transitions. [2020-10-11 18:37:30,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:37:30,678 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 262 transitions. [2020-10-11 18:37:30,681 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-11 18:37:30,687 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-11 18:37:30,688 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-11 18:37:30,690 INFO L185 Difference]: Start difference. First operand has 95 places, 87 transitions, 183 flow. Second operand 3 states and 262 transitions. [2020-10-11 18:37:30,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 84 transitions, 181 flow [2020-10-11 18:37:30,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 84 transitions, 178 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-11 18:37:30,700 INFO L241 Difference]: Finished difference. Result has 93 places, 73 transitions, 156 flow [2020-10-11 18:37:30,703 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=93, PETRI_TRANSITIONS=73} [2020-10-11 18:37:30,704 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, -2 predicate places. [2020-10-11 18:37:30,704 INFO L481 AbstractCegarLoop]: Abstraction has has 93 places, 73 transitions, 156 flow [2020-10-11 18:37:30,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 18:37:30,704 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:37:30,705 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:37:30,705 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-11 18:37:30,705 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:37:30,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:37:30,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1310755725, now seen corresponding path program 1 times [2020-10-11 18:37:30,706 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:37:30,706 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622682389] [2020-10-11 18:37:30,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:37:30,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:37:31,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:37:31,033 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622682389] [2020-10-11 18:37:31,034 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:37:31,034 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:37:31,034 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51621943] [2020-10-11 18:37:31,039 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:37:31,039 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:37:31,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:37:31,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:37:31,233 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 90 [2020-10-11 18:37:31,234 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 73 transitions, 156 flow. Second operand 6 states. [2020-10-11 18:37:31,234 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:37:31,234 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 90 [2020-10-11 18:37:31,234 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:37:31,358 INFO L129 PetriNetUnfolder]: 3/99 cut-off events. [2020-10-11 18:37:31,358 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:37:31,359 INFO L80 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 99 events. 3/99 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 135 event pairs, 0 based on Foata normal form. 2/101 useless extension candidates. Maximal degree in co-relation 93. Up to 7 conditions per place. [2020-10-11 18:37:31,359 INFO L132 encePairwiseOnDemand]: 84/90 looper letters, 6 selfloop transitions, 2 changer transitions 10/83 dead transitions. [2020-10-11 18:37:31,360 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 83 transitions, 212 flow [2020-10-11 18:37:31,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:37:31,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:37:31,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 740 transitions. [2020-10-11 18:37:31,365 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9135802469135802 [2020-10-11 18:37:31,366 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 740 transitions. [2020-10-11 18:37:31,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 740 transitions. [2020-10-11 18:37:31,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:37:31,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 740 transitions. [2020-10-11 18:37:31,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:37:31,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:37:31,373 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:37:31,373 INFO L185 Difference]: Start difference. First operand has 93 places, 73 transitions, 156 flow. Second operand 9 states and 740 transitions. [2020-10-11 18:37:31,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 83 transitions, 212 flow [2020-10-11 18:37:31,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 83 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-11 18:37:31,377 INFO L241 Difference]: Finished difference. Result has 95 places, 73 transitions, 172 flow [2020-10-11 18:37:31,377 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=172, PETRI_PLACES=95, PETRI_TRANSITIONS=73} [2020-10-11 18:37:31,378 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 0 predicate places. [2020-10-11 18:37:31,378 INFO L481 AbstractCegarLoop]: Abstraction has has 95 places, 73 transitions, 172 flow [2020-10-11 18:37:31,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:37:31,378 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:37:31,379 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:37:31,379 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-11 18:37:31,379 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:37:31,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:37:31,379 INFO L82 PathProgramCache]: Analyzing trace with hash 295474258, now seen corresponding path program 1 times [2020-10-11 18:37:31,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:37:31,380 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451619829] [2020-10-11 18:37:31,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:37:31,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:37:31,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:37:31,656 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451619829] [2020-10-11 18:37:31,656 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:37:31,656 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:37:31,657 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144661644] [2020-10-11 18:37:31,657 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:37:31,657 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:37:31,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:37:31,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:37:31,943 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 90 [2020-10-11 18:37:31,943 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 73 transitions, 172 flow. Second operand 7 states. [2020-10-11 18:37:31,944 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:37:31,944 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 90 [2020-10-11 18:37:31,944 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:37:32,214 INFO L129 PetriNetUnfolder]: 30/169 cut-off events. [2020-10-11 18:37:32,214 INFO L130 PetriNetUnfolder]: For 35/72 co-relation queries the response was YES. [2020-10-11 18:37:32,216 INFO L80 FinitePrefix]: Finished finitePrefix Result has 309 conditions, 169 events. 30/169 cut-off events. For 35/72 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 564 event pairs, 0 based on Foata normal form. 4/167 useless extension candidates. Maximal degree in co-relation 280. Up to 31 conditions per place. [2020-10-11 18:37:32,217 INFO L132 encePairwiseOnDemand]: 81/90 looper letters, 10 selfloop transitions, 5 changer transitions 21/98 dead transitions. [2020-10-11 18:37:32,217 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 98 transitions, 317 flow [2020-10-11 18:37:32,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-11 18:37:32,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-11 18:37:32,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 808 transitions. [2020-10-11 18:37:32,221 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8977777777777778 [2020-10-11 18:37:32,221 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 808 transitions. [2020-10-11 18:37:32,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 808 transitions. [2020-10-11 18:37:32,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:37:32,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 808 transitions. [2020-10-11 18:37:32,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-11 18:37:32,225 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-11 18:37:32,226 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-11 18:37:32,226 INFO L185 Difference]: Start difference. First operand has 95 places, 73 transitions, 172 flow. Second operand 10 states and 808 transitions. [2020-10-11 18:37:32,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 98 transitions, 317 flow [2020-10-11 18:37:32,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 98 transitions, 283 flow, removed 14 selfloop flow, removed 8 redundant places. [2020-10-11 18:37:32,231 INFO L241 Difference]: Finished difference. Result has 98 places, 75 transitions, 210 flow [2020-10-11 18:37:32,232 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=210, PETRI_PLACES=98, PETRI_TRANSITIONS=75} [2020-10-11 18:37:32,232 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 3 predicate places. [2020-10-11 18:37:32,232 INFO L481 AbstractCegarLoop]: Abstraction has has 98 places, 75 transitions, 210 flow [2020-10-11 18:37:32,232 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:37:32,232 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:37:32,233 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:37:32,233 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-11 18:37:32,233 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:37:32,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:37:32,234 INFO L82 PathProgramCache]: Analyzing trace with hash 160508021, now seen corresponding path program 1 times [2020-10-11 18:37:32,234 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:37:32,234 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015656444] [2020-10-11 18:37:32,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:37:32,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:37:32,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:37:32,502 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015656444] [2020-10-11 18:37:32,502 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:37:32,502 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 18:37:32,503 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518679183] [2020-10-11 18:37:32,503 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 18:37:32,503 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:37:32,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 18:37:32,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-10-11 18:37:33,016 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 90 [2020-10-11 18:37:33,017 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 75 transitions, 210 flow. Second operand 10 states. [2020-10-11 18:37:33,018 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:37:33,018 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 90 [2020-10-11 18:37:33,018 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:37:33,671 INFO L129 PetriNetUnfolder]: 458/1017 cut-off events. [2020-10-11 18:37:33,672 INFO L130 PetriNetUnfolder]: For 844/858 co-relation queries the response was YES. [2020-10-11 18:37:33,679 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2371 conditions, 1017 events. 458/1017 cut-off events. For 844/858 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 6041 event pairs, 136 based on Foata normal form. 30/1017 useless extension candidates. Maximal degree in co-relation 2317. Up to 411 conditions per place. [2020-10-11 18:37:33,686 INFO L132 encePairwiseOnDemand]: 78/90 looper letters, 14 selfloop transitions, 10 changer transitions 44/127 dead transitions. [2020-10-11 18:37:33,686 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 127 transitions, 486 flow [2020-10-11 18:37:33,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 18:37:33,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 18:37:33,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1136 transitions. [2020-10-11 18:37:33,692 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8414814814814815 [2020-10-11 18:37:33,692 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1136 transitions. [2020-10-11 18:37:33,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1136 transitions. [2020-10-11 18:37:33,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:37:33,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1136 transitions. [2020-10-11 18:37:33,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 18:37:33,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 18:37:33,700 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 18:37:33,700 INFO L185 Difference]: Start difference. First operand has 98 places, 75 transitions, 210 flow. Second operand 15 states and 1136 transitions. [2020-10-11 18:37:33,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 127 transitions, 486 flow [2020-10-11 18:37:33,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 127 transitions, 455 flow, removed 12 selfloop flow, removed 5 redundant places. [2020-10-11 18:37:33,711 INFO L241 Difference]: Finished difference. Result has 112 places, 81 transitions, 279 flow [2020-10-11 18:37:33,712 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=279, PETRI_PLACES=112, PETRI_TRANSITIONS=81} [2020-10-11 18:37:33,712 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 17 predicate places. [2020-10-11 18:37:33,712 INFO L481 AbstractCegarLoop]: Abstraction has has 112 places, 81 transitions, 279 flow [2020-10-11 18:37:33,712 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 18:37:33,713 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:37:33,713 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:37:33,713 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-11 18:37:33,713 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:37:33,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:37:33,714 INFO L82 PathProgramCache]: Analyzing trace with hash -2122943111, now seen corresponding path program 1 times [2020-10-11 18:37:33,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:37:33,714 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916551392] [2020-10-11 18:37:33,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:37:33,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:37:34,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:37:34,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916551392] [2020-10-11 18:37:34,037 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:37:34,037 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 18:37:34,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554126983] [2020-10-11 18:37:34,038 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 18:37:34,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:37:34,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 18:37:34,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-10-11 18:37:34,720 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 90 [2020-10-11 18:37:34,721 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 81 transitions, 279 flow. Second operand 12 states. [2020-10-11 18:37:34,721 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:37:34,722 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 90 [2020-10-11 18:37:34,722 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:37:35,295 INFO L129 PetriNetUnfolder]: 331/739 cut-off events. [2020-10-11 18:37:35,296 INFO L130 PetriNetUnfolder]: For 2229/2260 co-relation queries the response was YES. [2020-10-11 18:37:35,301 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2575 conditions, 739 events. 331/739 cut-off events. For 2229/2260 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3805 event pairs, 132 based on Foata normal form. 22/738 useless extension candidates. Maximal degree in co-relation 2509. Up to 404 conditions per place. [2020-10-11 18:37:35,307 INFO L132 encePairwiseOnDemand]: 76/90 looper letters, 17 selfloop transitions, 16 changer transitions 34/125 dead transitions. [2020-10-11 18:37:35,308 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 125 transitions, 708 flow [2020-10-11 18:37:35,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-11 18:37:35,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-11 18:37:35,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1183 transitions. [2020-10-11 18:37:35,313 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8215277777777777 [2020-10-11 18:37:35,313 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1183 transitions. [2020-10-11 18:37:35,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1183 transitions. [2020-10-11 18:37:35,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:37:35,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1183 transitions. [2020-10-11 18:37:35,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 17 states. [2020-10-11 18:37:35,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 17 states. [2020-10-11 18:37:35,320 INFO L81 ComplementDD]: Finished complementDD. Result 17 states. [2020-10-11 18:37:35,320 INFO L185 Difference]: Start difference. First operand has 112 places, 81 transitions, 279 flow. Second operand 16 states and 1183 transitions. [2020-10-11 18:37:35,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 125 transitions, 708 flow [2020-10-11 18:37:35,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 125 transitions, 686 flow, removed 9 selfloop flow, removed 5 redundant places. [2020-10-11 18:37:35,329 INFO L241 Difference]: Finished difference. Result has 124 places, 90 transitions, 420 flow [2020-10-11 18:37:35,330 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=420, PETRI_PLACES=124, PETRI_TRANSITIONS=90} [2020-10-11 18:37:35,330 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 29 predicate places. [2020-10-11 18:37:35,330 INFO L481 AbstractCegarLoop]: Abstraction has has 124 places, 90 transitions, 420 flow [2020-10-11 18:37:35,330 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 18:37:35,330 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:37:35,330 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:37:35,331 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-11 18:37:35,331 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:37:35,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:37:35,331 INFO L82 PathProgramCache]: Analyzing trace with hash -455080539, now seen corresponding path program 1 times [2020-10-11 18:37:35,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:37:35,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175433378] [2020-10-11 18:37:35,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:37:35,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:37:35,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:37:35,570 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175433378] [2020-10-11 18:37:35,571 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:37:35,571 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 18:37:35,571 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816515096] [2020-10-11 18:37:35,571 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 18:37:35,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:37:35,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 18:37:35,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-10-11 18:37:36,338 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 90 [2020-10-11 18:37:36,338 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 90 transitions, 420 flow. Second operand 10 states. [2020-10-11 18:37:36,339 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:37:36,339 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 90 [2020-10-11 18:37:36,339 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:37:37,009 INFO L129 PetriNetUnfolder]: 332/794 cut-off events. [2020-10-11 18:37:37,009 INFO L130 PetriNetUnfolder]: For 5830/5974 co-relation queries the response was YES. [2020-10-11 18:37:37,014 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3453 conditions, 794 events. 332/794 cut-off events. For 5830/5974 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4293 event pairs, 110 based on Foata normal form. 37/813 useless extension candidates. Maximal degree in co-relation 3375. Up to 325 conditions per place. [2020-10-11 18:37:37,021 INFO L132 encePairwiseOnDemand]: 79/90 looper letters, 28 selfloop transitions, 11 changer transitions 37/137 dead transitions. [2020-10-11 18:37:37,021 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 137 transitions, 980 flow [2020-10-11 18:37:37,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 18:37:37,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 18:37:37,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1146 transitions. [2020-10-11 18:37:37,026 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8488888888888889 [2020-10-11 18:37:37,026 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1146 transitions. [2020-10-11 18:37:37,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1146 transitions. [2020-10-11 18:37:37,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:37:37,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1146 transitions. [2020-10-11 18:37:37,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 18:37:37,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 18:37:37,033 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 18:37:37,033 INFO L185 Difference]: Start difference. First operand has 124 places, 90 transitions, 420 flow. Second operand 15 states and 1146 transitions. [2020-10-11 18:37:37,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 137 transitions, 980 flow [2020-10-11 18:37:37,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 137 transitions, 816 flow, removed 79 selfloop flow, removed 12 redundant places. [2020-10-11 18:37:37,047 INFO L241 Difference]: Finished difference. Result has 127 places, 93 transitions, 451 flow [2020-10-11 18:37:37,048 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=451, PETRI_PLACES=127, PETRI_TRANSITIONS=93} [2020-10-11 18:37:37,048 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 32 predicate places. [2020-10-11 18:37:37,048 INFO L481 AbstractCegarLoop]: Abstraction has has 127 places, 93 transitions, 451 flow [2020-10-11 18:37:37,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 18:37:37,049 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:37:37,049 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:37:37,049 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-11 18:37:37,049 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:37:37,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:37:37,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1898968873, now seen corresponding path program 1 times [2020-10-11 18:37:37,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:37:37,050 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312303113] [2020-10-11 18:37:37,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:37:37,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:37:37,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:37:37,165 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312303113] [2020-10-11 18:37:37,166 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:37:37,166 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:37:37,166 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139723733] [2020-10-11 18:37:37,166 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:37:37,167 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:37:37,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:37:37,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:37:37,423 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 90 [2020-10-11 18:37:37,423 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 93 transitions, 451 flow. Second operand 7 states. [2020-10-11 18:37:37,424 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:37:37,424 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 90 [2020-10-11 18:37:37,424 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:37:37,886 INFO L129 PetriNetUnfolder]: 405/1179 cut-off events. [2020-10-11 18:37:37,886 INFO L130 PetriNetUnfolder]: For 8027/8145 co-relation queries the response was YES. [2020-10-11 18:37:37,897 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5201 conditions, 1179 events. 405/1179 cut-off events. For 8027/8145 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 8451 event pairs, 161 based on Foata normal form. 68/1192 useless extension candidates. Maximal degree in co-relation 5123. Up to 339 conditions per place. [2020-10-11 18:37:37,905 INFO L132 encePairwiseOnDemand]: 83/90 looper letters, 15 selfloop transitions, 5 changer transitions 18/116 dead transitions. [2020-10-11 18:37:37,905 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 116 transitions, 773 flow [2020-10-11 18:37:37,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 18:37:37,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-11 18:37:37,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1114 transitions. [2020-10-11 18:37:37,909 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8841269841269841 [2020-10-11 18:37:37,909 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1114 transitions. [2020-10-11 18:37:37,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1114 transitions. [2020-10-11 18:37:37,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:37:37,911 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1114 transitions. [2020-10-11 18:37:37,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-11 18:37:37,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-11 18:37:37,917 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-11 18:37:37,918 INFO L185 Difference]: Start difference. First operand has 127 places, 93 transitions, 451 flow. Second operand 14 states and 1114 transitions. [2020-10-11 18:37:37,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 116 transitions, 773 flow [2020-10-11 18:37:37,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 116 transitions, 694 flow, removed 35 selfloop flow, removed 9 redundant places. [2020-10-11 18:37:37,936 INFO L241 Difference]: Finished difference. Result has 134 places, 94 transitions, 468 flow [2020-10-11 18:37:37,936 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=468, PETRI_PLACES=134, PETRI_TRANSITIONS=94} [2020-10-11 18:37:37,936 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 39 predicate places. [2020-10-11 18:37:37,937 INFO L481 AbstractCegarLoop]: Abstraction has has 134 places, 94 transitions, 468 flow [2020-10-11 18:37:37,937 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:37:37,937 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:37:37,937 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:37:37,937 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-11 18:37:37,937 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:37:37,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:37:37,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1632605035, now seen corresponding path program 1 times [2020-10-11 18:37:37,938 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:37:37,938 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934123338] [2020-10-11 18:37:37,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:37:37,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:37:38,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:37:38,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934123338] [2020-10-11 18:37:38,208 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:37:38,208 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-11 18:37:38,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717857608] [2020-10-11 18:37:38,208 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 18:37:38,209 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:37:38,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 18:37:38,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2020-10-11 18:37:39,794 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 90 [2020-10-11 18:37:39,796 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 94 transitions, 468 flow. Second operand 13 states. [2020-10-11 18:37:39,796 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:37:39,796 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 90 [2020-10-11 18:37:39,796 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:37:40,439 INFO L129 PetriNetUnfolder]: 390/979 cut-off events. [2020-10-11 18:37:40,440 INFO L130 PetriNetUnfolder]: For 7990/8301 co-relation queries the response was YES. [2020-10-11 18:37:40,448 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4691 conditions, 979 events. 390/979 cut-off events. For 7990/8301 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6006 event pairs, 179 based on Foata normal form. 41/987 useless extension candidates. Maximal degree in co-relation 4605. Up to 530 conditions per place. [2020-10-11 18:37:40,455 INFO L132 encePairwiseOnDemand]: 79/90 looper letters, 28 selfloop transitions, 11 changer transitions 25/123 dead transitions. [2020-10-11 18:37:40,455 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 123 transitions, 923 flow [2020-10-11 18:37:40,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 18:37:40,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-11 18:37:40,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1018 transitions. [2020-10-11 18:37:40,460 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.807936507936508 [2020-10-11 18:37:40,461 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1018 transitions. [2020-10-11 18:37:40,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1018 transitions. [2020-10-11 18:37:40,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:37:40,462 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1018 transitions. [2020-10-11 18:37:40,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-11 18:37:40,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-11 18:37:40,468 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-11 18:37:40,468 INFO L185 Difference]: Start difference. First operand has 134 places, 94 transitions, 468 flow. Second operand 14 states and 1018 transitions. [2020-10-11 18:37:40,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 123 transitions, 923 flow [2020-10-11 18:37:40,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 123 transitions, 858 flow, removed 31 selfloop flow, removed 10 redundant places. [2020-10-11 18:37:40,485 INFO L241 Difference]: Finished difference. Result has 135 places, 94 transitions, 473 flow [2020-10-11 18:37:40,485 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=473, PETRI_PLACES=135, PETRI_TRANSITIONS=94} [2020-10-11 18:37:40,485 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 40 predicate places. [2020-10-11 18:37:40,486 INFO L481 AbstractCegarLoop]: Abstraction has has 135 places, 94 transitions, 473 flow [2020-10-11 18:37:40,486 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 18:37:40,486 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:37:40,486 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:37:40,486 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-11 18:37:40,486 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:37:40,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:37:40,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1749058855, now seen corresponding path program 1 times [2020-10-11 18:37:40,487 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:37:40,489 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878013765] [2020-10-11 18:37:40,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:37:40,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:37:40,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:37:40,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878013765] [2020-10-11 18:37:40,844 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:37:40,844 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 18:37:40,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334744684] [2020-10-11 18:37:40,845 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 18:37:40,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:37:40,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 18:37:40,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-11 18:37:41,689 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 90 [2020-10-11 18:37:41,690 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 94 transitions, 473 flow. Second operand 12 states. [2020-10-11 18:37:41,690 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:37:41,690 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 90 [2020-10-11 18:37:41,691 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:37:42,187 INFO L129 PetriNetUnfolder]: 365/1003 cut-off events. [2020-10-11 18:37:42,187 INFO L130 PetriNetUnfolder]: For 6621/6987 co-relation queries the response was YES. [2020-10-11 18:37:42,195 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4403 conditions, 1003 events. 365/1003 cut-off events. For 6621/6987 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6590 event pairs, 128 based on Foata normal form. 87/1054 useless extension candidates. Maximal degree in co-relation 4315. Up to 484 conditions per place. [2020-10-11 18:37:42,202 INFO L132 encePairwiseOnDemand]: 78/90 looper letters, 21 selfloop transitions, 16 changer transitions 23/120 dead transitions. [2020-10-11 18:37:42,202 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 120 transitions, 841 flow [2020-10-11 18:37:42,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 18:37:42,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-11 18:37:42,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1029 transitions. [2020-10-11 18:37:42,209 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8166666666666667 [2020-10-11 18:37:42,209 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1029 transitions. [2020-10-11 18:37:42,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1029 transitions. [2020-10-11 18:37:42,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:37:42,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1029 transitions. [2020-10-11 18:37:42,214 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-11 18:37:42,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-11 18:37:42,218 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-11 18:37:42,218 INFO L185 Difference]: Start difference. First operand has 135 places, 94 transitions, 473 flow. Second operand 14 states and 1029 transitions. [2020-10-11 18:37:42,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 120 transitions, 841 flow [2020-10-11 18:37:42,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 120 transitions, 773 flow, removed 25 selfloop flow, removed 15 redundant places. [2020-10-11 18:37:42,234 INFO L241 Difference]: Finished difference. Result has 134 places, 95 transitions, 503 flow [2020-10-11 18:37:42,234 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=503, PETRI_PLACES=134, PETRI_TRANSITIONS=95} [2020-10-11 18:37:42,235 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 39 predicate places. [2020-10-11 18:37:42,235 INFO L481 AbstractCegarLoop]: Abstraction has has 134 places, 95 transitions, 503 flow [2020-10-11 18:37:42,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 18:37:42,235 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:37:42,235 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:37:42,235 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-11 18:37:42,236 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:37:42,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:37:42,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1070823643, now seen corresponding path program 1 times [2020-10-11 18:37:42,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:37:42,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606439564] [2020-10-11 18:37:42,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:37:42,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:37:42,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:37:42,432 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606439564] [2020-10-11 18:37:42,432 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:37:42,432 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-11 18:37:42,433 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333613553] [2020-10-11 18:37:42,433 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 18:37:42,433 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:37:42,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 18:37:42,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-11 18:37:42,952 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 90 [2020-10-11 18:37:42,953 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 95 transitions, 503 flow. Second operand 8 states. [2020-10-11 18:37:42,953 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:37:42,953 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 90 [2020-10-11 18:37:42,953 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:37:43,359 INFO L129 PetriNetUnfolder]: 380/1109 cut-off events. [2020-10-11 18:37:43,359 INFO L130 PetriNetUnfolder]: For 10586/11003 co-relation queries the response was YES. [2020-10-11 18:37:43,368 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5542 conditions, 1109 events. 380/1109 cut-off events. For 10586/11003 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7568 event pairs, 78 based on Foata normal form. 61/1139 useless extension candidates. Maximal degree in co-relation 5458. Up to 376 conditions per place. [2020-10-11 18:37:43,375 INFO L132 encePairwiseOnDemand]: 80/90 looper letters, 24 selfloop transitions, 14 changer transitions 25/127 dead transitions. [2020-10-11 18:37:43,375 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 127 transitions, 1039 flow [2020-10-11 18:37:43,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-11 18:37:43,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-11 18:37:43,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 863 transitions. [2020-10-11 18:37:43,378 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8717171717171717 [2020-10-11 18:37:43,378 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 863 transitions. [2020-10-11 18:37:43,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 863 transitions. [2020-10-11 18:37:43,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:37:43,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 863 transitions. [2020-10-11 18:37:43,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-11 18:37:43,382 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-11 18:37:43,382 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-11 18:37:43,382 INFO L185 Difference]: Start difference. First operand has 134 places, 95 transitions, 503 flow. Second operand 11 states and 863 transitions. [2020-10-11 18:37:43,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 127 transitions, 1039 flow [2020-10-11 18:37:43,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 127 transitions, 990 flow, removed 13 selfloop flow, removed 9 redundant places. [2020-10-11 18:37:43,402 INFO L241 Difference]: Finished difference. Result has 136 places, 98 transitions, 588 flow [2020-10-11 18:37:43,402 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=588, PETRI_PLACES=136, PETRI_TRANSITIONS=98} [2020-10-11 18:37:43,402 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 41 predicate places. [2020-10-11 18:37:43,403 INFO L481 AbstractCegarLoop]: Abstraction has has 136 places, 98 transitions, 588 flow [2020-10-11 18:37:43,403 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 18:37:43,403 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:37:43,403 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:37:43,403 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-11 18:37:43,404 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:37:43,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:37:43,404 INFO L82 PathProgramCache]: Analyzing trace with hash -365224020, now seen corresponding path program 1 times [2020-10-11 18:37:43,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:37:43,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001397851] [2020-10-11 18:37:43,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:37:43,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:37:43,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:37:43,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001397851] [2020-10-11 18:37:43,516 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:37:43,517 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:37:43,517 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8919889] [2020-10-11 18:37:43,517 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:37:43,518 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:37:43,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:37:43,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:37:43,614 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 90 [2020-10-11 18:37:43,615 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 98 transitions, 588 flow. Second operand 6 states. [2020-10-11 18:37:43,615 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:37:43,615 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 90 [2020-10-11 18:37:43,615 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:37:44,090 INFO L129 PetriNetUnfolder]: 934/2659 cut-off events. [2020-10-11 18:37:44,090 INFO L130 PetriNetUnfolder]: For 13717/13964 co-relation queries the response was YES. [2020-10-11 18:37:44,116 INFO L80 FinitePrefix]: Finished finitePrefix Result has 8062 conditions, 2659 events. 934/2659 cut-off events. For 13717/13964 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 25135 event pairs, 188 based on Foata normal form. 94/2554 useless extension candidates. Maximal degree in co-relation 7979. Up to 689 conditions per place. [2020-10-11 18:37:44,131 INFO L132 encePairwiseOnDemand]: 81/90 looper letters, 19 selfloop transitions, 16 changer transitions 0/120 dead transitions. [2020-10-11 18:37:44,131 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 120 transitions, 680 flow [2020-10-11 18:37:44,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:37:44,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:37:44,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 730 transitions. [2020-10-11 18:37:44,133 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9012345679012346 [2020-10-11 18:37:44,133 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 730 transitions. [2020-10-11 18:37:44,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 730 transitions. [2020-10-11 18:37:44,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:37:44,134 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 730 transitions. [2020-10-11 18:37:44,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:37:44,136 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:37:44,137 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:37:44,137 INFO L185 Difference]: Start difference. First operand has 136 places, 98 transitions, 588 flow. Second operand 9 states and 730 transitions. [2020-10-11 18:37:44,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 120 transitions, 680 flow [2020-10-11 18:37:44,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 120 transitions, 629 flow, removed 18 selfloop flow, removed 9 redundant places. [2020-10-11 18:37:44,163 INFO L241 Difference]: Finished difference. Result has 134 places, 109 transitions, 620 flow [2020-10-11 18:37:44,164 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=509, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=620, PETRI_PLACES=134, PETRI_TRANSITIONS=109} [2020-10-11 18:37:44,164 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 39 predicate places. [2020-10-11 18:37:44,164 INFO L481 AbstractCegarLoop]: Abstraction has has 134 places, 109 transitions, 620 flow [2020-10-11 18:37:44,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:37:44,164 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:37:44,165 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:37:44,165 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-11 18:37:44,165 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:37:44,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:37:44,166 INFO L82 PathProgramCache]: Analyzing trace with hash 138236569, now seen corresponding path program 1 times [2020-10-11 18:37:44,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:37:44,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850553294] [2020-10-11 18:37:44,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:37:44,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:37:44,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:37:44,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850553294] [2020-10-11 18:37:44,287 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:37:44,287 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:37:44,288 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049935890] [2020-10-11 18:37:44,288 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:37:44,288 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:37:44,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:37:44,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:37:44,470 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 90 [2020-10-11 18:37:44,470 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 109 transitions, 620 flow. Second operand 7 states. [2020-10-11 18:37:44,470 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:37:44,471 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 90 [2020-10-11 18:37:44,471 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:37:44,921 INFO L129 PetriNetUnfolder]: 740/2309 cut-off events. [2020-10-11 18:37:44,922 INFO L130 PetriNetUnfolder]: For 7416/9021 co-relation queries the response was YES. [2020-10-11 18:37:44,949 INFO L80 FinitePrefix]: Finished finitePrefix Result has 7970 conditions, 2309 events. 740/2309 cut-off events. For 7416/9021 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 22939 event pairs, 21 based on Foata normal form. 510/2627 useless extension candidates. Maximal degree in co-relation 7888. Up to 706 conditions per place. [2020-10-11 18:37:44,962 INFO L132 encePairwiseOnDemand]: 81/90 looper letters, 15 selfloop transitions, 31 changer transitions 6/136 dead transitions. [2020-10-11 18:37:44,962 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 136 transitions, 900 flow [2020-10-11 18:37:44,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 18:37:44,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-11 18:37:44,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 974 transitions. [2020-10-11 18:37:44,965 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9018518518518519 [2020-10-11 18:37:44,965 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 974 transitions. [2020-10-11 18:37:44,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 974 transitions. [2020-10-11 18:37:44,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:37:44,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 974 transitions. [2020-10-11 18:37:44,969 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-11 18:37:44,970 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-11 18:37:44,971 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-11 18:37:44,971 INFO L185 Difference]: Start difference. First operand has 134 places, 109 transitions, 620 flow. Second operand 12 states and 974 transitions. [2020-10-11 18:37:44,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 136 transitions, 900 flow [2020-10-11 18:37:44,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 136 transitions, 889 flow, removed 2 selfloop flow, removed 2 redundant places. [2020-10-11 18:37:44,997 INFO L241 Difference]: Finished difference. Result has 146 places, 127 transitions, 834 flow [2020-10-11 18:37:44,997 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=834, PETRI_PLACES=146, PETRI_TRANSITIONS=127} [2020-10-11 18:37:44,998 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 51 predicate places. [2020-10-11 18:37:44,998 INFO L481 AbstractCegarLoop]: Abstraction has has 146 places, 127 transitions, 834 flow [2020-10-11 18:37:44,998 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:37:44,998 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:37:44,998 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:37:44,999 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-11 18:37:44,999 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:37:44,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:37:44,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1266061200, now seen corresponding path program 1 times [2020-10-11 18:37:45,000 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:37:45,000 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24145790] [2020-10-11 18:37:45,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:37:45,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:37:45,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:37:45,129 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24145790] [2020-10-11 18:37:45,129 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:37:45,129 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-11 18:37:45,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311763722] [2020-10-11 18:37:45,130 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 18:37:45,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:37:45,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 18:37:45,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-11 18:37:45,209 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 90 [2020-10-11 18:37:45,209 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 127 transitions, 834 flow. Second operand 8 states. [2020-10-11 18:37:45,210 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:37:45,210 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 90 [2020-10-11 18:37:45,210 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:37:45,797 INFO L129 PetriNetUnfolder]: 622/2120 cut-off events. [2020-10-11 18:37:45,797 INFO L130 PetriNetUnfolder]: For 9509/11935 co-relation queries the response was YES. [2020-10-11 18:37:45,821 INFO L80 FinitePrefix]: Finished finitePrefix Result has 8241 conditions, 2120 events. 622/2120 cut-off events. For 9509/11935 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 22042 event pairs, 4 based on Foata normal form. 516/2445 useless extension candidates. Maximal degree in co-relation 8155. Up to 620 conditions per place. [2020-10-11 18:37:45,831 INFO L132 encePairwiseOnDemand]: 81/90 looper letters, 10 selfloop transitions, 36 changer transitions 27/146 dead transitions. [2020-10-11 18:37:45,831 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 146 transitions, 1088 flow [2020-10-11 18:37:45,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 18:37:45,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 18:37:45,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1206 transitions. [2020-10-11 18:37:45,834 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8933333333333333 [2020-10-11 18:37:45,834 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1206 transitions. [2020-10-11 18:37:45,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1206 transitions. [2020-10-11 18:37:45,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:37:45,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1206 transitions. [2020-10-11 18:37:45,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 18:37:45,839 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 18:37:45,839 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 18:37:45,840 INFO L185 Difference]: Start difference. First operand has 146 places, 127 transitions, 834 flow. Second operand 15 states and 1206 transitions. [2020-10-11 18:37:45,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 146 transitions, 1088 flow [2020-10-11 18:37:45,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 146 transitions, 857 flow, removed 99 selfloop flow, removed 14 redundant places. [2020-10-11 18:37:45,943 INFO L241 Difference]: Finished difference. Result has 152 places, 116 transitions, 662 flow [2020-10-11 18:37:45,943 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=635, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=662, PETRI_PLACES=152, PETRI_TRANSITIONS=116} [2020-10-11 18:37:45,943 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 57 predicate places. [2020-10-11 18:37:45,943 INFO L481 AbstractCegarLoop]: Abstraction has has 152 places, 116 transitions, 662 flow [2020-10-11 18:37:45,944 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 18:37:45,944 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:37:45,944 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:37:45,944 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-11 18:37:45,944 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:37:45,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:37:45,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1473003801, now seen corresponding path program 1 times [2020-10-11 18:37:45,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:37:45,945 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217271665] [2020-10-11 18:37:45,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:37:46,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:37:46,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:37:46,243 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217271665] [2020-10-11 18:37:46,243 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:37:46,243 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-11 18:37:46,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908918594] [2020-10-11 18:37:46,244 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 18:37:46,244 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:37:46,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 18:37:46,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2020-10-11 18:37:48,254 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 90 [2020-10-11 18:37:48,255 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 116 transitions, 662 flow. Second operand 13 states. [2020-10-11 18:37:48,255 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:37:48,255 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 90 [2020-10-11 18:37:48,255 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:37:48,489 INFO L129 PetriNetUnfolder]: 314/1240 cut-off events. [2020-10-11 18:37:48,490 INFO L130 PetriNetUnfolder]: For 3042/3239 co-relation queries the response was YES. [2020-10-11 18:37:48,496 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3791 conditions, 1240 events. 314/1240 cut-off events. For 3042/3239 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 11978 event pairs, 2 based on Foata normal form. 5/1162 useless extension candidates. Maximal degree in co-relation 3705. Up to 158 conditions per place. [2020-10-11 18:37:48,499 INFO L132 encePairwiseOnDemand]: 80/90 looper letters, 15 selfloop transitions, 8 changer transitions 8/122 dead transitions. [2020-10-11 18:37:48,500 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 122 transitions, 768 flow [2020-10-11 18:37:48,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-11 18:37:48,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-11 18:37:48,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 753 transitions. [2020-10-11 18:37:48,501 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8366666666666667 [2020-10-11 18:37:48,501 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 753 transitions. [2020-10-11 18:37:48,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 753 transitions. [2020-10-11 18:37:48,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:37:48,502 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 753 transitions. [2020-10-11 18:37:48,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-11 18:37:48,504 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-11 18:37:48,504 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-11 18:37:48,504 INFO L185 Difference]: Start difference. First operand has 152 places, 116 transitions, 662 flow. Second operand 10 states and 753 transitions. [2020-10-11 18:37:48,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 122 transitions, 768 flow [2020-10-11 18:37:48,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 122 transitions, 623 flow, removed 39 selfloop flow, removed 26 redundant places. [2020-10-11 18:37:48,536 INFO L241 Difference]: Finished difference. Result has 135 places, 112 transitions, 545 flow [2020-10-11 18:37:48,537 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=545, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=545, PETRI_PLACES=135, PETRI_TRANSITIONS=112} [2020-10-11 18:37:48,537 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 40 predicate places. [2020-10-11 18:37:48,537 INFO L481 AbstractCegarLoop]: Abstraction has has 135 places, 112 transitions, 545 flow [2020-10-11 18:37:48,537 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 18:37:48,537 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:37:48,538 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:37:48,538 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-11 18:37:48,538 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:37:48,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:37:48,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1718784481, now seen corresponding path program 2 times [2020-10-11 18:37:48,538 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:37:48,539 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413356098] [2020-10-11 18:37:48,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:37:48,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:37:48,586 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:37:48,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:37:48,633 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:37:48,674 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 18:37:48,674 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 18:37:48,675 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-11 18:37:48,717 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:37:48,718 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:37:48,720 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:37:48,720 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:37:48,720 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:37:48,720 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:37:48,720 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:37:48,721 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:37:48,721 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:37:48,721 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:37:48,721 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:37:48,721 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:37:48,721 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:37:48,721 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:37:48,722 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:37:48,722 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:37:48,722 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:37:48,722 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:37:48,722 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:37:48,723 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:37:48,723 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:37:48,723 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:37:48,723 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:37:48,723 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:37:48,724 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:37:48,724 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:37:48,724 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:37:48,724 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:37:48,724 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:37:48,724 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:37:48,724 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:37:48,725 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:37:48,725 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:37:48,725 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:37:48,726 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:37:48,727 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:37:48,727 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:37:48,727 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:37:48,727 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:37:48,727 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:37:48,732 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:37:48,733 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:37:48,733 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:37:48,733 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:37:48,734 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:37:48,734 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:37:48,734 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:37:48,734 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:37:48,734 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:37:48,734 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:37:48,735 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:37:48,735 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:37:48,735 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:37:48,735 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:37:48,735 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:37:48,736 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:37:48,736 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:37:48,736 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:37:48,736 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:37:48,737 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:37:48,737 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:37:48,737 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:37:48,737 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:37:48,737 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:37:48,737 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:37:48,738 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:37:48,738 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:37:48,738 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:37:48,738 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:37:48,738 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:37:48,738 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:37:48,738 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:37:48,739 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:37:48,739 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:37:48,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:37:48 BasicIcfg [2020-10-11 18:37:48,853 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-11 18:37:48,855 INFO L168 Benchmark]: Toolchain (without parser) took 21903.11 ms. Allocated memory was 248.5 MB in the beginning and 731.4 MB in the end (delta: 482.9 MB). Free memory was 203.9 MB in the beginning and 183.8 MB in the end (delta: 20.1 MB). Peak memory consumption was 502.9 MB. Max. memory is 14.2 GB. [2020-10-11 18:37:48,856 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 248.5 MB. Free memory was 226.6 MB in the beginning and 225.7 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB. [2020-10-11 18:37:48,857 INFO L168 Benchmark]: CACSL2BoogieTranslator took 709.13 ms. Allocated memory was 248.5 MB in the beginning and 305.7 MB in the end (delta: 57.1 MB). Free memory was 203.0 MB in the beginning and 256.4 MB in the end (delta: -53.4 MB). Peak memory consumption was 30.5 MB. Max. memory is 14.2 GB. [2020-10-11 18:37:48,858 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.60 ms. Allocated memory is still 305.7 MB. Free memory was 256.4 MB in the beginning and 253.0 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. [2020-10-11 18:37:48,859 INFO L168 Benchmark]: Boogie Preprocessor took 57.65 ms. Allocated memory is still 305.7 MB. Free memory was 253.0 MB in the beginning and 250.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-11 18:37:48,860 INFO L168 Benchmark]: RCFGBuilder took 2057.43 ms. Allocated memory was 305.7 MB in the beginning and 354.9 MB in the end (delta: 49.3 MB). Free memory was 250.5 MB in the beginning and 183.7 MB in the end (delta: 66.8 MB). Peak memory consumption was 116.1 MB. Max. memory is 14.2 GB. [2020-10-11 18:37:48,861 INFO L168 Benchmark]: TraceAbstraction took 19006.13 ms. Allocated memory was 354.9 MB in the beginning and 731.4 MB in the end (delta: 376.4 MB). Free memory was 183.7 MB in the beginning and 183.8 MB in the end (delta: -82.9 kB). Peak memory consumption was 376.4 MB. Max. memory is 14.2 GB. [2020-10-11 18:37:48,865 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 248.5 MB. Free memory was 226.6 MB in the beginning and 225.7 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 709.13 ms. Allocated memory was 248.5 MB in the beginning and 305.7 MB in the end (delta: 57.1 MB). Free memory was 203.0 MB in the beginning and 256.4 MB in the end (delta: -53.4 MB). Peak memory consumption was 30.5 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 67.60 ms. Allocated memory is still 305.7 MB. Free memory was 256.4 MB in the beginning and 253.0 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 57.65 ms. Allocated memory is still 305.7 MB. Free memory was 253.0 MB in the beginning and 250.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2057.43 ms. Allocated memory was 305.7 MB in the beginning and 354.9 MB in the end (delta: 49.3 MB). Free memory was 250.5 MB in the beginning and 183.7 MB in the end (delta: 66.8 MB). Peak memory consumption was 116.1 MB. Max. memory is 14.2 GB. * TraceAbstraction took 19006.13 ms. Allocated memory was 354.9 MB in the beginning and 731.4 MB in the end (delta: 376.4 MB). Free memory was 183.7 MB in the beginning and 183.8 MB in the end (delta: -82.9 kB). Peak memory consumption was 376.4 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L700] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L701] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L702] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L704] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L706] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L707] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L708] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L709] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L710] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L711] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L712] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L713] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L714] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L715] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L716] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L717] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L718] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L719] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L720] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L721] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L722] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L723] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 pthread_t t2180; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] FCALL, FORK 0 pthread_create(&t2180, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L728] 1 y$w_buff1 = y$w_buff0 [L729] 1 y$w_buff0 = 2 [L730] 1 y$w_buff1_used = y$w_buff0_used [L731] 1 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 1 !expression [L7] 1 __VERIFIER_error() [L733] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L734] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L735] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L736] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L737] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 pthread_t t2181; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L805] FCALL, FORK 0 pthread_create(&t2181, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 pthread_t t2182; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L807] FCALL, FORK 0 pthread_create(&t2182, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L774] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L777] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L743] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L743] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y [L743] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L743] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L744] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L744] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L745] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L745] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L746] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L746] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L747] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L762] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L764] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L780] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L780] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L781] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L781] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L782] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L782] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L783] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L784] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L784] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L750] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L809] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L813] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L813] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L814] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L814] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L815] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L815] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L816] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L816] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L817] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L817] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L820] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L821] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L822] 0 y$flush_delayed = weak$$choice2 [L823] 0 y$mem_tmp = y [L824] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L824] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L825] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L825] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L825] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L825] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L826] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L826] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1 [L826] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L826] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L826] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L827] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L827] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L828] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L829] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L829] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L829] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L829] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L829] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L830] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L830] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L830] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L830] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L830] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L830] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L831] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) [L832] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L832] 0 y = y$flush_delayed ? y$mem_tmp : y [L833] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L7] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L7] 0 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 89 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 18.7s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 14.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 460 SDtfs, 727 SDslu, 2021 SDs, 0 SdLazy, 1932 SolverSat, 391 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 215 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=834occurred in iteration=12, 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.7s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 874 NumberOfCodeBlocks, 874 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 793 ConstructedInterpolants, 0 QuantifiedInterpolants, 276502 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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 RESULT: Ultimate proved your program to be incorrect! Received shutdown request...