/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-11 20:28:37,678 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-11 20:28:37,681 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-11 20:28:37,724 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-11 20:28:37,724 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-11 20:28:37,728 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-11 20:28:37,731 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-11 20:28:37,737 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-11 20:28:37,740 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-11 20:28:37,745 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-11 20:28:37,746 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-11 20:28:37,747 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-11 20:28:37,748 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-11 20:28:37,750 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-11 20:28:37,751 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-11 20:28:37,752 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-11 20:28:37,755 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-11 20:28:37,757 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-11 20:28:37,759 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-11 20:28:37,768 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-11 20:28:37,769 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-11 20:28:37,772 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-11 20:28:37,773 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-11 20:28:37,775 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-11 20:28:37,777 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-11 20:28:37,777 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-11 20:28:37,777 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-11 20:28:37,779 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-11 20:28:37,779 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-11 20:28:37,780 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-11 20:28:37,780 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-11 20:28:37,781 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-11 20:28:37,783 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-11 20:28:37,783 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-11 20:28:37,784 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-11 20:28:37,784 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-11 20:28:37,785 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-11 20:28:37,785 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-11 20:28:37,785 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-11 20:28:37,786 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-11 20:28:37,786 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-11 20:28:37,790 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2021-03-11 20:28:37,826 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-11 20:28:37,826 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-11 20:28:37,830 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-11 20:28:37,830 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-11 20:28:37,830 INFO L138 SettingsManager]: * Use SBE=true [2021-03-11 20:28:37,831 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-11 20:28:37,831 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-11 20:28:37,831 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-11 20:28:37,831 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-11 20:28:37,831 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-11 20:28:37,832 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-11 20:28:37,832 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-11 20:28:37,832 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-11 20:28:37,833 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-11 20:28:37,833 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-11 20:28:37,833 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-11 20:28:37,833 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-11 20:28:37,833 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-11 20:28:37,833 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-11 20:28:37,833 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-11 20:28:37,833 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-11 20:28:37,834 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 20:28:37,834 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-11 20:28:37,834 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-11 20:28:37,834 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-11 20:28:37,834 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-11 20:28:37,834 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-11 20:28:37,834 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-11 20:28:37,835 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-11 20:28:38,139 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-11 20:28:38,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-11 20:28:38,165 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-11 20:28:38,166 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-11 20:28:38,167 INFO L275 PluginConnector]: CDTParser initialized [2021-03-11 20:28:38,168 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.oepc.i [2021-03-11 20:28:38,227 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/add4e53b3/ce46af24549148b1a719af59011ae7f2/FLAGc00cbe100 [2021-03-11 20:28:38,741 INFO L306 CDTParser]: Found 1 translation units. [2021-03-11 20:28:38,741 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.oepc.i [2021-03-11 20:28:38,753 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/add4e53b3/ce46af24549148b1a719af59011ae7f2/FLAGc00cbe100 [2021-03-11 20:28:39,065 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/add4e53b3/ce46af24549148b1a719af59011ae7f2 [2021-03-11 20:28:39,071 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-11 20:28:39,076 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-11 20:28:39,077 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-11 20:28:39,077 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-11 20:28:39,080 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-11 20:28:39,081 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 08:28:39" (1/1) ... [2021-03-11 20:28:39,082 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fc90c80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:28:39, skipping insertion in model container [2021-03-11 20:28:39,082 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 08:28:39" (1/1) ... [2021-03-11 20:28:39,088 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-11 20:28:39,141 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-11 20:28:39,248 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.oepc.i[952,965] [2021-03-11 20:28:39,404 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 20:28:39,429 INFO L203 MainTranslator]: Completed pre-run [2021-03-11 20:28:39,439 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.oepc.i[952,965] [2021-03-11 20:28:39,493 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 20:28:39,569 INFO L208 MainTranslator]: Completed translation [2021-03-11 20:28:39,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:28:39 WrapperNode [2021-03-11 20:28:39,569 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-11 20:28:39,571 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-11 20:28:39,571 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-11 20:28:39,572 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-11 20:28:39,578 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:28:39" (1/1) ... [2021-03-11 20:28:39,609 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:28:39" (1/1) ... [2021-03-11 20:28:39,647 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-11 20:28:39,647 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-11 20:28:39,647 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-11 20:28:39,648 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-11 20:28:39,654 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:28:39" (1/1) ... [2021-03-11 20:28:39,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:28:39" (1/1) ... [2021-03-11 20:28:39,672 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:28:39" (1/1) ... [2021-03-11 20:28:39,673 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:28:39" (1/1) ... [2021-03-11 20:28:39,679 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:28:39" (1/1) ... [2021-03-11 20:28:39,681 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:28:39" (1/1) ... [2021-03-11 20:28:39,684 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:28:39" (1/1) ... [2021-03-11 20:28:39,706 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-11 20:28:39,706 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-11 20:28:39,707 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-11 20:28:39,707 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-11 20:28:39,707 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:28:39" (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 [2021-03-11 20:28:39,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-11 20:28:39,776 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-11 20:28:39,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-11 20:28:39,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-11 20:28:39,777 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-11 20:28:39,777 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-11 20:28:39,778 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-11 20:28:39,778 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-11 20:28:39,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-11 20:28:39,779 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-11 20:28:39,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-11 20:28:39,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-11 20:28:39,780 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-11 20:28:41,526 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-11 20:28:41,527 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-11 20:28:41,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 08:28:41 BoogieIcfgContainer [2021-03-11 20:28:41,529 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-11 20:28:41,531 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-11 20:28:41,531 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-11 20:28:41,533 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-11 20:28:41,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 08:28:39" (1/3) ... [2021-03-11 20:28:41,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ba8f9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 08:28:41, skipping insertion in model container [2021-03-11 20:28:41,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:28:39" (2/3) ... [2021-03-11 20:28:41,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ba8f9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 08:28:41, skipping insertion in model container [2021-03-11 20:28:41,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 08:28:41" (3/3) ... [2021-03-11 20:28:41,536 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_power.oepc.i [2021-03-11 20:28:41,541 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-11 20:28:41,549 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-11 20:28:41,550 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-11 20:28:41,581 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,581 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,581 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,582 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,582 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,582 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,582 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,582 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,582 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,582 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,583 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,583 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,583 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,583 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,583 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,583 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,584 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,584 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,584 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,584 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,584 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,584 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,584 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,585 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,585 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,585 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,585 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,586 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,586 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,586 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,587 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,587 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,587 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,587 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,588 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,588 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,589 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,589 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,589 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,589 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,589 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,589 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,590 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,590 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,590 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,590 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,590 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,590 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,591 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,591 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,591 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,591 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,591 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,591 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,592 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,592 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,592 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,592 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,594 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,594 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,594 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,594 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,595 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,595 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,595 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,595 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,595 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,595 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,595 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,596 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,597 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,598 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,600 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:41,601 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 20:28:41,616 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-03-11 20:28:41,641 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 20:28:41,642 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-11 20:28:41,642 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 20:28:41,642 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 20:28:41,642 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 20:28:41,642 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 20:28:41,642 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 20:28:41,642 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 20:28:41,658 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 84 places, 79 transitions, 168 flow [2021-03-11 20:28:41,691 INFO L129 PetriNetUnfolder]: 2/77 cut-off events. [2021-03-11 20:28:41,691 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:28:41,703 INFO L84 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 77 events. 2/77 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2021-03-11 20:28:41,703 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 79 transitions, 168 flow [2021-03-11 20:28:41,710 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 77 transitions, 160 flow [2021-03-11 20:28:41,713 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 20:28:41,723 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 77 transitions, 160 flow [2021-03-11 20:28:41,725 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 77 transitions, 160 flow [2021-03-11 20:28:41,726 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 82 places, 77 transitions, 160 flow [2021-03-11 20:28:41,740 INFO L129 PetriNetUnfolder]: 2/77 cut-off events. [2021-03-11 20:28:41,740 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:28:41,740 INFO L84 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 77 events. 2/77 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2021-03-11 20:28:41,741 INFO L116 LiptonReduction]: Number of co-enabled transitions 926 [2021-03-11 20:28:42,337 WARN L205 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-11 20:28:42,792 WARN L205 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-11 20:28:42,939 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-11 20:28:45,704 WARN L205 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 104 [2021-03-11 20:28:45,816 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-03-11 20:28:46,078 WARN L205 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 104 [2021-03-11 20:28:46,212 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-03-11 20:28:46,215 INFO L131 LiptonReduction]: Checked pairs total: 2282 [2021-03-11 20:28:46,215 INFO L133 LiptonReduction]: Total number of compositions: 70 [2021-03-11 20:28:46,216 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4505 [2021-03-11 20:28:46,222 INFO L129 PetriNetUnfolder]: 0/4 cut-off events. [2021-03-11 20:28:46,222 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:28:46,222 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:28:46,223 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2021-03-11 20:28:46,223 INFO L428 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:28:46,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:28:46,227 INFO L82 PathProgramCache]: Analyzing trace with hash 911288, now seen corresponding path program 1 times [2021-03-11 20:28:46,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:28:46,234 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020467783] [2021-03-11 20:28:46,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:28:46,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:28:46,433 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:28:46,433 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:28:46,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:28:46,450 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020467783] [2021-03-11 20:28:46,450 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:28:46,451 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 20:28:46,451 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175298255] [2021-03-11 20:28:46,457 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 20:28:46,457 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:28:46,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 20:28:46,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 20:28:46,469 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 149 [2021-03-11 20:28:46,472 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 19 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:46,472 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:28:46,472 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 149 [2021-03-11 20:28:46,473 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:28:46,519 INFO L129 PetriNetUnfolder]: 16/58 cut-off events. [2021-03-11 20:28:46,520 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:28:46,520 INFO L84 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 58 events. 16/58 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 200 event pairs, 11 based on Foata normal form. 6/57 useless extension candidates. Maximal degree in co-relation 91. Up to 27 conditions per place. [2021-03-11 20:28:46,522 INFO L132 encePairwiseOnDemand]: 145/149 looper letters, 7 selfloop transitions, 2 changer transitions 0/20 dead transitions. [2021-03-11 20:28:46,522 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 20 transitions, 64 flow [2021-03-11 20:28:46,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 20:28:46,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 20:28:46,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 381 transitions. [2021-03-11 20:28:46,538 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8523489932885906 [2021-03-11 20:28:46,538 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 381 transitions. [2021-03-11 20:28:46,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 381 transitions. [2021-03-11 20:28:46,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:28:46,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 381 transitions. [2021-03-11 20:28:46,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:46,552 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 149.0) internal successors, (596), 4 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:46,552 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 149.0) internal successors, (596), 4 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:46,554 INFO L185 Difference]: Start difference. First operand has 25 places, 19 transitions, 44 flow. Second operand 3 states and 381 transitions. [2021-03-11 20:28:46,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 20 transitions, 64 flow [2021-03-11 20:28:46,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 20 transitions, 62 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-11 20:28:46,557 INFO L241 Difference]: Finished difference. Result has 24 places, 17 transitions, 42 flow [2021-03-11 20:28:46,558 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=24, PETRI_TRANSITIONS=17} [2021-03-11 20:28:46,559 INFO L335 CegarLoopForPetriNet]: 25 programPoint places, -1 predicate places. [2021-03-11 20:28:46,559 INFO L480 AbstractCegarLoop]: Abstraction has has 24 places, 17 transitions, 42 flow [2021-03-11 20:28:46,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:46,559 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:28:46,559 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:28:46,560 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-11 20:28:46,560 INFO L428 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:28:46,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:28:46,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1368173984, now seen corresponding path program 1 times [2021-03-11 20:28:46,561 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:28:46,561 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41503599] [2021-03-11 20:28:46,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:28:46,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:28:46,699 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:28:46,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:28:46,705 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-03-11 20:28:46,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 20:28:46,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:28:46,719 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41503599] [2021-03-11 20:28:46,720 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:28:46,720 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 20:28:46,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125549355] [2021-03-11 20:28:46,721 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:28:46,721 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:28:46,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:28:46,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:28:46,723 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 149 [2021-03-11 20:28:46,723 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 17 transitions, 42 flow. Second operand has 4 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:46,723 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:28:46,724 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 149 [2021-03-11 20:28:46,724 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:28:46,765 INFO L129 PetriNetUnfolder]: 12/64 cut-off events. [2021-03-11 20:28:46,765 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:28:46,765 INFO L84 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 64 events. 12/64 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 229 event pairs, 3 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 97. Up to 20 conditions per place. [2021-03-11 20:28:46,766 INFO L132 encePairwiseOnDemand]: 144/149 looper letters, 4 selfloop transitions, 3 changer transitions 8/26 dead transitions. [2021-03-11 20:28:46,766 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 26 transitions, 90 flow [2021-03-11 20:28:46,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:28:46,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:28:46,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 602 transitions. [2021-03-11 20:28:46,768 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8080536912751678 [2021-03-11 20:28:46,768 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 602 transitions. [2021-03-11 20:28:46,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 602 transitions. [2021-03-11 20:28:46,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:28:46,769 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 602 transitions. [2021-03-11 20:28:46,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:46,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 149.0) internal successors, (894), 6 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:46,773 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 149.0) internal successors, (894), 6 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:46,773 INFO L185 Difference]: Start difference. First operand has 24 places, 17 transitions, 42 flow. Second operand 5 states and 602 transitions. [2021-03-11 20:28:46,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 26 transitions, 90 flow [2021-03-11 20:28:46,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 26 transitions, 86 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-11 20:28:46,774 INFO L241 Difference]: Finished difference. Result has 29 places, 18 transitions, 63 flow [2021-03-11 20:28:46,774 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=63, PETRI_PLACES=29, PETRI_TRANSITIONS=18} [2021-03-11 20:28:46,774 INFO L335 CegarLoopForPetriNet]: 25 programPoint places, 4 predicate places. [2021-03-11 20:28:46,775 INFO L480 AbstractCegarLoop]: Abstraction has has 29 places, 18 transitions, 63 flow [2021-03-11 20:28:46,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:46,775 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:28:46,775 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:28:46,775 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-11 20:28:46,775 INFO L428 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:28:46,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:28:46,776 INFO L82 PathProgramCache]: Analyzing trace with hash 491311452, now seen corresponding path program 1 times [2021-03-11 20:28:46,776 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:28:46,776 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651772665] [2021-03-11 20:28:46,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:28:46,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:28:46,914 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:28:46,914 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 20:28:46,921 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:28:46,923 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:28:46,932 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-03-11 20:28:46,933 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 20:28:46,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:28:46,954 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651772665] [2021-03-11 20:28:46,955 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:28:46,955 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:28:46,955 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186187699] [2021-03-11 20:28:46,955 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:28:46,955 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:28:46,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:28:46,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:28:46,957 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 149 [2021-03-11 20:28:46,957 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 18 transitions, 63 flow. Second operand has 5 states, 5 states have (on average 102.8) internal successors, (514), 5 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:46,958 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:28:46,958 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 149 [2021-03-11 20:28:46,958 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:28:47,082 INFO L129 PetriNetUnfolder]: 58/142 cut-off events. [2021-03-11 20:28:47,082 INFO L130 PetriNetUnfolder]: For 80/80 co-relation queries the response was YES. [2021-03-11 20:28:47,085 INFO L84 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 142 events. 58/142 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 579 event pairs, 39 based on Foata normal form. 12/149 useless extension candidates. Maximal degree in co-relation 319. Up to 90 conditions per place. [2021-03-11 20:28:47,086 INFO L132 encePairwiseOnDemand]: 144/149 looper letters, 8 selfloop transitions, 3 changer transitions 7/28 dead transitions. [2021-03-11 20:28:47,086 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 28 transitions, 121 flow [2021-03-11 20:28:47,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:28:47,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:28:47,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 530 transitions. [2021-03-11 20:28:47,088 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7114093959731543 [2021-03-11 20:28:47,088 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 530 transitions. [2021-03-11 20:28:47,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 530 transitions. [2021-03-11 20:28:47,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:28:47,089 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 530 transitions. [2021-03-11 20:28:47,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.0) internal successors, (530), 5 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:47,092 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 149.0) internal successors, (894), 6 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:47,092 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 149.0) internal successors, (894), 6 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:47,092 INFO L185 Difference]: Start difference. First operand has 29 places, 18 transitions, 63 flow. Second operand 5 states and 530 transitions. [2021-03-11 20:28:47,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 28 transitions, 121 flow [2021-03-11 20:28:47,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 28 transitions, 116 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-11 20:28:47,095 INFO L241 Difference]: Finished difference. Result has 31 places, 20 transitions, 85 flow [2021-03-11 20:28:47,095 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=85, PETRI_PLACES=31, PETRI_TRANSITIONS=20} [2021-03-11 20:28:47,095 INFO L335 CegarLoopForPetriNet]: 25 programPoint places, 6 predicate places. [2021-03-11 20:28:47,095 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 20 transitions, 85 flow [2021-03-11 20:28:47,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 102.8) internal successors, (514), 5 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:47,096 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:28:47,096 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:28:47,096 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-11 20:28:47,096 INFO L428 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:28:47,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:28:47,096 INFO L82 PathProgramCache]: Analyzing trace with hash -835614733, now seen corresponding path program 1 times [2021-03-11 20:28:47,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:28:47,097 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44856119] [2021-03-11 20:28:47,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:28:47,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:28:47,211 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:28:47,212 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:28:47,212 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:28:47,213 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:28:47,219 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-03-11 20:28:47,220 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 20:28:47,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:28:47,239 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44856119] [2021-03-11 20:28:47,239 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:28:47,240 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:28:47,240 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214083915] [2021-03-11 20:28:47,240 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:28:47,240 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:28:47,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:28:47,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:28:47,241 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 149 [2021-03-11 20:28:47,243 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 20 transitions, 85 flow. Second operand has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:47,243 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:28:47,244 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 149 [2021-03-11 20:28:47,244 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:28:47,296 INFO L129 PetriNetUnfolder]: 10/66 cut-off events. [2021-03-11 20:28:47,296 INFO L130 PetriNetUnfolder]: For 85/92 co-relation queries the response was YES. [2021-03-11 20:28:47,297 INFO L84 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 66 events. 10/66 cut-off events. For 85/92 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 276 event pairs, 5 based on Foata normal form. 5/68 useless extension candidates. Maximal degree in co-relation 166. Up to 22 conditions per place. [2021-03-11 20:28:47,297 INFO L132 encePairwiseOnDemand]: 145/149 looper letters, 5 selfloop transitions, 3 changer transitions 2/23 dead transitions. [2021-03-11 20:28:47,298 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 23 transitions, 125 flow [2021-03-11 20:28:47,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:28:47,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:28:47,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 596 transitions. [2021-03-11 20:28:47,299 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8 [2021-03-11 20:28:47,300 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 596 transitions. [2021-03-11 20:28:47,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 596 transitions. [2021-03-11 20:28:47,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:28:47,300 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 596 transitions. [2021-03-11 20:28:47,301 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.2) internal successors, (596), 5 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:47,303 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 149.0) internal successors, (894), 6 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:47,303 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 149.0) internal successors, (894), 6 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:47,303 INFO L185 Difference]: Start difference. First operand has 31 places, 20 transitions, 85 flow. Second operand 5 states and 596 transitions. [2021-03-11 20:28:47,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 23 transitions, 125 flow [2021-03-11 20:28:47,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 23 transitions, 114 flow, removed 4 selfloop flow, removed 2 redundant places. [2021-03-11 20:28:47,306 INFO L241 Difference]: Finished difference. Result has 34 places, 20 transitions, 93 flow [2021-03-11 20:28:47,306 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=93, PETRI_PLACES=34, PETRI_TRANSITIONS=20} [2021-03-11 20:28:47,306 INFO L335 CegarLoopForPetriNet]: 25 programPoint places, 9 predicate places. [2021-03-11 20:28:47,306 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 20 transitions, 93 flow [2021-03-11 20:28:47,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:47,307 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:28:47,307 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:28:47,307 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-11 20:28:47,307 INFO L428 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:28:47,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:28:47,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1310571612, now seen corresponding path program 1 times [2021-03-11 20:28:47,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:28:47,311 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483006394] [2021-03-11 20:28:47,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:28:47,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:28:47,407 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:28:47,408 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:28:47,417 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:28:47,418 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 20:28:47,430 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:28:47,430 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:28:47,440 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-03-11 20:28:47,441 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 20:28:47,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:28:47,458 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483006394] [2021-03-11 20:28:47,458 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:28:47,458 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:28:47,459 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455993391] [2021-03-11 20:28:47,459 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 20:28:47,459 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:28:47,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 20:28:47,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-11 20:28:47,460 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 149 [2021-03-11 20:28:47,461 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 20 transitions, 93 flow. Second operand has 6 states, 6 states have (on average 98.83333333333333) internal successors, (593), 6 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:47,461 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:28:47,461 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 149 [2021-03-11 20:28:47,461 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:28:47,596 INFO L129 PetriNetUnfolder]: 54/156 cut-off events. [2021-03-11 20:28:47,597 INFO L130 PetriNetUnfolder]: For 359/363 co-relation queries the response was YES. [2021-03-11 20:28:47,597 INFO L84 FinitePrefix]: Finished finitePrefix Result has 453 conditions, 156 events. 54/156 cut-off events. For 359/363 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 740 event pairs, 19 based on Foata normal form. 15/171 useless extension candidates. Maximal degree in co-relation 436. Up to 96 conditions per place. [2021-03-11 20:28:47,598 INFO L132 encePairwiseOnDemand]: 143/149 looper letters, 9 selfloop transitions, 5 changer transitions 6/30 dead transitions. [2021-03-11 20:28:47,600 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 30 transitions, 171 flow [2021-03-11 20:28:47,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-11 20:28:47,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-11 20:28:47,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 610 transitions. [2021-03-11 20:28:47,604 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.6823266219239373 [2021-03-11 20:28:47,605 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 610 transitions. [2021-03-11 20:28:47,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 610 transitions. [2021-03-11 20:28:47,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:28:47,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 610 transitions. [2021-03-11 20:28:47,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 101.66666666666667) internal successors, (610), 6 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:47,609 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 149.0) internal successors, (1043), 7 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:47,610 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 149.0) internal successors, (1043), 7 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:47,610 INFO L185 Difference]: Start difference. First operand has 34 places, 20 transitions, 93 flow. Second operand 6 states and 610 transitions. [2021-03-11 20:28:47,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 30 transitions, 171 flow [2021-03-11 20:28:47,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 30 transitions, 162 flow, removed 3 selfloop flow, removed 3 redundant places. [2021-03-11 20:28:47,613 INFO L241 Difference]: Finished difference. Result has 37 places, 22 transitions, 119 flow [2021-03-11 20:28:47,613 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=119, PETRI_PLACES=37, PETRI_TRANSITIONS=22} [2021-03-11 20:28:47,614 INFO L335 CegarLoopForPetriNet]: 25 programPoint places, 12 predicate places. [2021-03-11 20:28:47,614 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 22 transitions, 119 flow [2021-03-11 20:28:47,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 98.83333333333333) internal successors, (593), 6 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:47,614 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:28:47,614 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:28:47,614 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-11 20:28:47,614 INFO L428 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:28:47,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:28:47,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1949134340, now seen corresponding path program 1 times [2021-03-11 20:28:47,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:28:47,615 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306997605] [2021-03-11 20:28:47,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:28:47,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:28:47,685 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:28:47,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:28:47,693 INFO L142 QuantifierPusher]: treesize reduction 1, result has 96.8 percent of original size [2021-03-11 20:28:47,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-11 20:28:47,714 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.1 percent of original size [2021-03-11 20:28:47,719 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-11 20:28:47,739 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-03-11 20:28:47,740 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 20:28:47,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:28:47,756 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306997605] [2021-03-11 20:28:47,756 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:28:47,756 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:28:47,756 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410023292] [2021-03-11 20:28:47,757 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 20:28:47,757 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:28:47,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 20:28:47,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-11 20:28:47,759 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 149 [2021-03-11 20:28:47,760 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 22 transitions, 119 flow. Second operand has 6 states, 6 states have (on average 104.83333333333333) internal successors, (629), 6 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:47,760 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:28:47,760 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 149 [2021-03-11 20:28:47,760 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:28:47,930 INFO L129 PetriNetUnfolder]: 53/141 cut-off events. [2021-03-11 20:28:47,931 INFO L130 PetriNetUnfolder]: For 382/392 co-relation queries the response was YES. [2021-03-11 20:28:47,931 INFO L84 FinitePrefix]: Finished finitePrefix Result has 500 conditions, 141 events. 53/141 cut-off events. For 382/392 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 584 event pairs, 26 based on Foata normal form. 12/151 useless extension candidates. Maximal degree in co-relation 481. Up to 88 conditions per place. [2021-03-11 20:28:47,932 INFO L132 encePairwiseOnDemand]: 142/149 looper letters, 12 selfloop transitions, 7 changer transitions 6/35 dead transitions. [2021-03-11 20:28:47,932 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 35 transitions, 235 flow [2021-03-11 20:28:47,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:28:47,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:28:47,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 753 transitions. [2021-03-11 20:28:47,935 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7219558964525408 [2021-03-11 20:28:47,935 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 753 transitions. [2021-03-11 20:28:47,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 753 transitions. [2021-03-11 20:28:47,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:28:47,935 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 753 transitions. [2021-03-11 20:28:47,937 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 107.57142857142857) internal successors, (753), 7 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:47,939 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 149.0) internal successors, (1192), 8 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:47,939 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 149.0) internal successors, (1192), 8 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:47,939 INFO L185 Difference]: Start difference. First operand has 37 places, 22 transitions, 119 flow. Second operand 7 states and 753 transitions. [2021-03-11 20:28:47,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 35 transitions, 235 flow [2021-03-11 20:28:47,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 35 transitions, 220 flow, removed 4 selfloop flow, removed 3 redundant places. [2021-03-11 20:28:47,941 INFO L241 Difference]: Finished difference. Result has 42 places, 25 transitions, 148 flow [2021-03-11 20:28:47,941 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=148, PETRI_PLACES=42, PETRI_TRANSITIONS=25} [2021-03-11 20:28:47,942 INFO L335 CegarLoopForPetriNet]: 25 programPoint places, 17 predicate places. [2021-03-11 20:28:47,942 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 25 transitions, 148 flow [2021-03-11 20:28:47,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 104.83333333333333) internal successors, (629), 6 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:47,942 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:28:47,942 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:28:47,942 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-11 20:28:47,942 INFO L428 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:28:47,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:28:47,943 INFO L82 PathProgramCache]: Analyzing trace with hash -2007111470, now seen corresponding path program 2 times [2021-03-11 20:28:47,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:28:47,943 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693655357] [2021-03-11 20:28:47,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:28:47,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:28:47,978 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:28:47,978 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:28:47,983 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:28:47,984 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:28:47,992 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:28:47,993 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-11 20:28:48,004 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-03-11 20:28:48,004 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 20:28:48,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:28:48,019 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693655357] [2021-03-11 20:28:48,019 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:28:48,019 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:28:48,020 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000720596] [2021-03-11 20:28:48,020 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 20:28:48,020 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:28:48,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 20:28:48,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-11 20:28:48,021 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 149 [2021-03-11 20:28:48,022 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 25 transitions, 148 flow. Second operand has 6 states, 6 states have (on average 105.83333333333333) internal successors, (635), 6 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:48,022 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:28:48,022 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 149 [2021-03-11 20:28:48,022 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:28:48,118 INFO L129 PetriNetUnfolder]: 48/131 cut-off events. [2021-03-11 20:28:48,119 INFO L130 PetriNetUnfolder]: For 565/575 co-relation queries the response was YES. [2021-03-11 20:28:48,119 INFO L84 FinitePrefix]: Finished finitePrefix Result has 551 conditions, 131 events. 48/131 cut-off events. For 565/575 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 542 event pairs, 26 based on Foata normal form. 12/141 useless extension candidates. Maximal degree in co-relation 529. Up to 84 conditions per place. [2021-03-11 20:28:48,120 INFO L132 encePairwiseOnDemand]: 142/149 looper letters, 10 selfloop transitions, 7 changer transitions 5/32 dead transitions. [2021-03-11 20:28:48,120 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 32 transitions, 240 flow [2021-03-11 20:28:48,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-11 20:28:48,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-11 20:28:48,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 651 transitions. [2021-03-11 20:28:48,122 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7281879194630873 [2021-03-11 20:28:48,122 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 651 transitions. [2021-03-11 20:28:48,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 651 transitions. [2021-03-11 20:28:48,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:28:48,123 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 651 transitions. [2021-03-11 20:28:48,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:48,126 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 149.0) internal successors, (1043), 7 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:48,126 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 149.0) internal successors, (1043), 7 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:48,126 INFO L185 Difference]: Start difference. First operand has 42 places, 25 transitions, 148 flow. Second operand 6 states and 651 transitions. [2021-03-11 20:28:48,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 32 transitions, 240 flow [2021-03-11 20:28:48,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 32 transitions, 223 flow, removed 6 selfloop flow, removed 3 redundant places. [2021-03-11 20:28:48,129 INFO L241 Difference]: Finished difference. Result has 44 places, 25 transitions, 160 flow [2021-03-11 20:28:48,129 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=160, PETRI_PLACES=44, PETRI_TRANSITIONS=25} [2021-03-11 20:28:48,129 INFO L335 CegarLoopForPetriNet]: 25 programPoint places, 19 predicate places. [2021-03-11 20:28:48,129 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 25 transitions, 160 flow [2021-03-11 20:28:48,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 105.83333333333333) internal successors, (635), 6 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:48,129 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:28:48,130 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:28:48,130 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-11 20:28:48,130 INFO L428 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:28:48,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:28:48,130 INFO L82 PathProgramCache]: Analyzing trace with hash -289304346, now seen corresponding path program 1 times [2021-03-11 20:28:48,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:28:48,130 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353791476] [2021-03-11 20:28:48,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:28:48,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:28:48,194 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:28:48,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:28:48,200 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:28:48,201 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:28:48,208 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:28:48,210 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 20:28:48,219 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:28:48,220 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-11 20:28:48,231 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-03-11 20:28:48,232 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 20:28:48,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:28:48,251 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353791476] [2021-03-11 20:28:48,251 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:28:48,251 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 20:28:48,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668548122] [2021-03-11 20:28:48,252 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 20:28:48,252 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:28:48,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 20:28:48,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-11 20:28:48,253 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 149 [2021-03-11 20:28:48,254 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 25 transitions, 160 flow. Second operand has 7 states, 7 states have (on average 98.85714285714286) internal successors, (692), 7 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:48,254 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:28:48,254 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 149 [2021-03-11 20:28:48,254 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:28:48,466 INFO L129 PetriNetUnfolder]: 42/138 cut-off events. [2021-03-11 20:28:48,466 INFO L130 PetriNetUnfolder]: For 644/655 co-relation queries the response was YES. [2021-03-11 20:28:48,467 INFO L84 FinitePrefix]: Finished finitePrefix Result has 554 conditions, 138 events. 42/138 cut-off events. For 644/655 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 656 event pairs, 5 based on Foata normal form. 20/156 useless extension candidates. Maximal degree in co-relation 530. Up to 54 conditions per place. [2021-03-11 20:28:48,468 INFO L132 encePairwiseOnDemand]: 142/149 looper letters, 10 selfloop transitions, 10 changer transitions 11/41 dead transitions. [2021-03-11 20:28:48,468 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 41 transitions, 338 flow [2021-03-11 20:28:48,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-11 20:28:48,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-11 20:28:48,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1010 transitions. [2021-03-11 20:28:48,472 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.6778523489932886 [2021-03-11 20:28:48,472 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1010 transitions. [2021-03-11 20:28:48,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1010 transitions. [2021-03-11 20:28:48,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:28:48,473 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1010 transitions. [2021-03-11 20:28:48,476 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 101.0) internal successors, (1010), 10 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:48,479 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 149.0) internal successors, (1639), 11 states have internal predecessors, (1639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:48,480 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 149.0) internal successors, (1639), 11 states have internal predecessors, (1639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:48,481 INFO L185 Difference]: Start difference. First operand has 44 places, 25 transitions, 160 flow. Second operand 10 states and 1010 transitions. [2021-03-11 20:28:48,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 41 transitions, 338 flow [2021-03-11 20:28:48,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 41 transitions, 308 flow, removed 7 selfloop flow, removed 6 redundant places. [2021-03-11 20:28:48,484 INFO L241 Difference]: Finished difference. Result has 51 places, 26 transitions, 200 flow [2021-03-11 20:28:48,484 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=200, PETRI_PLACES=51, PETRI_TRANSITIONS=26} [2021-03-11 20:28:48,484 INFO L335 CegarLoopForPetriNet]: 25 programPoint places, 26 predicate places. [2021-03-11 20:28:48,484 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 26 transitions, 200 flow [2021-03-11 20:28:48,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 98.85714285714286) internal successors, (692), 7 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:48,485 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:28:48,485 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:28:48,485 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-11 20:28:48,485 INFO L428 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:28:48,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:28:48,485 INFO L82 PathProgramCache]: Analyzing trace with hash 135515271, now seen corresponding path program 1 times [2021-03-11 20:28:48,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:28:48,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660874393] [2021-03-11 20:28:48,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:28:48,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:28:48,540 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:28:48,541 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:28:48,565 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-11 20:28:48,565 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 20:28:48,572 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:28:48,572 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:28:48,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:28:48,574 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660874393] [2021-03-11 20:28:48,576 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:28:48,576 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:28:48,576 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428234872] [2021-03-11 20:28:48,576 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:28:48,576 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:28:48,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:28:48,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:28:48,577 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 149 [2021-03-11 20:28:48,578 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 26 transitions, 200 flow. Second operand has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:48,578 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:28:48,578 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 149 [2021-03-11 20:28:48,578 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:28:48,620 INFO L129 PetriNetUnfolder]: 30/115 cut-off events. [2021-03-11 20:28:48,620 INFO L130 PetriNetUnfolder]: For 483/506 co-relation queries the response was YES. [2021-03-11 20:28:48,621 INFO L84 FinitePrefix]: Finished finitePrefix Result has 471 conditions, 115 events. 30/115 cut-off events. For 483/506 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 518 event pairs, 11 based on Foata normal form. 26/139 useless extension candidates. Maximal degree in co-relation 444. Up to 45 conditions per place. [2021-03-11 20:28:48,621 INFO L132 encePairwiseOnDemand]: 144/149 looper letters, 4 selfloop transitions, 6 changer transitions 2/31 dead transitions. [2021-03-11 20:28:48,622 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 31 transitions, 222 flow [2021-03-11 20:28:48,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:28:48,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:28:48,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2021-03-11 20:28:48,624 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7906040268456376 [2021-03-11 20:28:48,624 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 589 transitions. [2021-03-11 20:28:48,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 589 transitions. [2021-03-11 20:28:48,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:28:48,625 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 589 transitions. [2021-03-11 20:28:48,626 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:48,628 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 149.0) internal successors, (894), 6 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:48,628 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 149.0) internal successors, (894), 6 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:48,628 INFO L185 Difference]: Start difference. First operand has 51 places, 26 transitions, 200 flow. Second operand 5 states and 589 transitions. [2021-03-11 20:28:48,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 31 transitions, 222 flow [2021-03-11 20:28:48,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 31 transitions, 186 flow, removed 8 selfloop flow, removed 10 redundant places. [2021-03-11 20:28:48,631 INFO L241 Difference]: Finished difference. Result has 45 places, 29 transitions, 189 flow [2021-03-11 20:28:48,631 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=189, PETRI_PLACES=45, PETRI_TRANSITIONS=29} [2021-03-11 20:28:48,631 INFO L335 CegarLoopForPetriNet]: 25 programPoint places, 20 predicate places. [2021-03-11 20:28:48,631 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 29 transitions, 189 flow [2021-03-11 20:28:48,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:48,632 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:28:48,632 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:28:48,632 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-11 20:28:48,632 INFO L428 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:28:48,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:28:48,633 INFO L82 PathProgramCache]: Analyzing trace with hash -64757132, now seen corresponding path program 1 times [2021-03-11 20:28:48,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:28:48,633 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831948674] [2021-03-11 20:28:48,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:28:48,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:28:48,704 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:28:48,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:28:48,708 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:28:48,711 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:28:48,724 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-11 20:28:48,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 20:28:48,732 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:28:48,733 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:28:48,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:28:48,733 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831948674] [2021-03-11 20:28:48,733 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:28:48,733 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:28:48,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661674836] [2021-03-11 20:28:48,734 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:28:48,734 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:28:48,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:28:48,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:28:48,737 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 149 [2021-03-11 20:28:48,737 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 29 transitions, 189 flow. Second operand has 5 states, 5 states have (on average 115.8) internal successors, (579), 5 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:48,737 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:28:48,737 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 149 [2021-03-11 20:28:48,737 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:28:48,790 INFO L129 PetriNetUnfolder]: 9/66 cut-off events. [2021-03-11 20:28:48,790 INFO L130 PetriNetUnfolder]: For 191/254 co-relation queries the response was YES. [2021-03-11 20:28:48,790 INFO L84 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 66 events. 9/66 cut-off events. For 191/254 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 269 event pairs, 0 based on Foata normal form. 51/117 useless extension candidates. Maximal degree in co-relation 238. Up to 20 conditions per place. [2021-03-11 20:28:48,791 INFO L132 encePairwiseOnDemand]: 144/149 looper letters, 2 selfloop transitions, 9 changer transitions 6/32 dead transitions. [2021-03-11 20:28:48,791 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 32 transitions, 227 flow [2021-03-11 20:28:48,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:28:48,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:28:48,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 820 transitions. [2021-03-11 20:28:48,793 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7861936720997124 [2021-03-11 20:28:48,793 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 820 transitions. [2021-03-11 20:28:48,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 820 transitions. [2021-03-11 20:28:48,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:28:48,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 820 transitions. [2021-03-11 20:28:48,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.14285714285714) internal successors, (820), 7 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:48,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 149.0) internal successors, (1192), 8 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:48,798 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 149.0) internal successors, (1192), 8 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:48,798 INFO L185 Difference]: Start difference. First operand has 45 places, 29 transitions, 189 flow. Second operand 7 states and 820 transitions. [2021-03-11 20:28:48,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 32 transitions, 227 flow [2021-03-11 20:28:48,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 32 transitions, 191 flow, removed 18 selfloop flow, removed 4 redundant places. [2021-03-11 20:28:48,801 INFO L241 Difference]: Finished difference. Result has 50 places, 26 transitions, 167 flow [2021-03-11 20:28:48,801 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=167, PETRI_PLACES=50, PETRI_TRANSITIONS=26} [2021-03-11 20:28:48,801 INFO L335 CegarLoopForPetriNet]: 25 programPoint places, 25 predicate places. [2021-03-11 20:28:48,801 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 26 transitions, 167 flow [2021-03-11 20:28:48,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 115.8) internal successors, (579), 5 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:48,802 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:28:48,802 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:28:48,802 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-11 20:28:48,802 INFO L428 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:28:48,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:28:48,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1187993813, now seen corresponding path program 1 times [2021-03-11 20:28:48,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:28:48,803 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497134829] [2021-03-11 20:28:48,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:28:48,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:28:48,878 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:28:48,880 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:28:48,888 INFO L142 QuantifierPusher]: treesize reduction 4, result has 88.9 percent of original size [2021-03-11 20:28:48,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-11 20:28:48,917 INFO L142 QuantifierPusher]: treesize reduction 26, result has 60.6 percent of original size [2021-03-11 20:28:48,918 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-11 20:28:48,952 INFO L142 QuantifierPusher]: treesize reduction 26, result has 62.3 percent of original size [2021-03-11 20:28:48,953 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2021-03-11 20:28:48,991 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:28:48,992 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 20:28:49,005 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:28:49,006 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:28:49,018 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-03-11 20:28:49,020 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 20:28:49,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:28:49,041 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497134829] [2021-03-11 20:28:49,041 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:28:49,041 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-11 20:28:49,041 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399158161] [2021-03-11 20:28:49,042 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-11 20:28:49,042 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:28:49,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-11 20:28:49,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-03-11 20:28:49,046 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 149 [2021-03-11 20:28:49,047 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 26 transitions, 167 flow. Second operand has 9 states, 9 states have (on average 92.88888888888889) internal successors, (836), 9 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:49,047 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:28:49,047 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 149 [2021-03-11 20:28:49,047 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:28:49,201 INFO L129 PetriNetUnfolder]: 3/51 cut-off events. [2021-03-11 20:28:49,201 INFO L130 PetriNetUnfolder]: For 152/167 co-relation queries the response was YES. [2021-03-11 20:28:49,201 INFO L84 FinitePrefix]: Finished finitePrefix Result has 214 conditions, 51 events. 3/51 cut-off events. For 152/167 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 157 event pairs, 0 based on Foata normal form. 11/62 useless extension candidates. Maximal degree in co-relation 189. Up to 17 conditions per place. [2021-03-11 20:28:49,201 INFO L132 encePairwiseOnDemand]: 142/149 looper letters, 8 selfloop transitions, 5 changer transitions 9/32 dead transitions. [2021-03-11 20:28:49,201 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 32 transitions, 242 flow [2021-03-11 20:28:49,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-11 20:28:49,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-11 20:28:49,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 755 transitions. [2021-03-11 20:28:49,204 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.6333892617449665 [2021-03-11 20:28:49,204 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 755 transitions. [2021-03-11 20:28:49,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 755 transitions. [2021-03-11 20:28:49,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:28:49,204 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 755 transitions. [2021-03-11 20:28:49,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 94.375) internal successors, (755), 8 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:49,207 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 149.0) internal successors, (1341), 9 states have internal predecessors, (1341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:49,208 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 149.0) internal successors, (1341), 9 states have internal predecessors, (1341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:49,208 INFO L185 Difference]: Start difference. First operand has 50 places, 26 transitions, 167 flow. Second operand 8 states and 755 transitions. [2021-03-11 20:28:49,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 32 transitions, 242 flow [2021-03-11 20:28:49,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 32 transitions, 189 flow, removed 14 selfloop flow, removed 11 redundant places. [2021-03-11 20:28:49,209 INFO L241 Difference]: Finished difference. Result has 46 places, 20 transitions, 102 flow [2021-03-11 20:28:49,210 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=102, PETRI_PLACES=46, PETRI_TRANSITIONS=20} [2021-03-11 20:28:49,210 INFO L335 CegarLoopForPetriNet]: 25 programPoint places, 21 predicate places. [2021-03-11 20:28:49,210 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 20 transitions, 102 flow [2021-03-11 20:28:49,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 92.88888888888889) internal successors, (836), 9 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:49,210 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:28:49,210 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:28:49,210 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-11 20:28:49,211 INFO L428 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:28:49,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:28:49,211 INFO L82 PathProgramCache]: Analyzing trace with hash -160598965, now seen corresponding path program 2 times [2021-03-11 20:28:49,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:28:49,211 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110557394] [2021-03-11 20:28:49,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:28:49,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 20:28:49,241 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 20:28:49,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 20:28:49,274 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 20:28:49,295 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 20:28:49,296 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 20:28:49,296 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-11 20:28:49,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.03 08:28:49 BasicIcfg [2021-03-11 20:28:49,340 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-11 20:28:49,341 INFO L168 Benchmark]: Toolchain (without parser) took 10268.16 ms. Allocated memory was 255.9 MB in the beginning and 541.1 MB in the end (delta: 285.2 MB). Free memory was 234.8 MB in the beginning and 362.1 MB in the end (delta: -127.3 MB). Peak memory consumption was 157.3 MB. Max. memory is 16.0 GB. [2021-03-11 20:28:49,341 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 255.9 MB. Free memory is still 238.0 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-11 20:28:49,341 INFO L168 Benchmark]: CACSL2BoogieTranslator took 492.40 ms. Allocated memory was 255.9 MB in the beginning and 369.1 MB in the end (delta: 113.2 MB). Free memory was 233.9 MB in the beginning and 332.1 MB in the end (delta: -98.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.0 GB. [2021-03-11 20:28:49,342 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.02 ms. Allocated memory is still 369.1 MB. Free memory was 332.1 MB in the beginning and 329.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 20:28:49,342 INFO L168 Benchmark]: Boogie Preprocessor took 58.49 ms. Allocated memory is still 369.1 MB. Free memory was 329.5 MB in the beginning and 327.2 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 20:28:49,342 INFO L168 Benchmark]: RCFGBuilder took 1823.10 ms. Allocated memory is still 369.1 MB. Free memory was 327.2 MB in the beginning and 345.7 MB in the end (delta: -18.5 MB). Peak memory consumption was 71.1 MB. Max. memory is 16.0 GB. [2021-03-11 20:28:49,342 INFO L168 Benchmark]: TraceAbstraction took 7809.50 ms. Allocated memory was 369.1 MB in the beginning and 541.1 MB in the end (delta: 172.0 MB). Free memory was 344.7 MB in the beginning and 362.1 MB in the end (delta: -17.3 MB). Peak memory consumption was 155.7 MB. Max. memory is 16.0 GB. [2021-03-11 20:28:49,355 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 255.9 MB. Free memory is still 238.0 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 492.40 ms. Allocated memory was 255.9 MB in the beginning and 369.1 MB in the end (delta: 113.2 MB). Free memory was 233.9 MB in the beginning and 332.1 MB in the end (delta: -98.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 76.02 ms. Allocated memory is still 369.1 MB. Free memory was 332.1 MB in the beginning and 329.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 58.49 ms. Allocated memory is still 369.1 MB. Free memory was 329.5 MB in the beginning and 327.2 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1823.10 ms. Allocated memory is still 369.1 MB. Free memory was 327.2 MB in the beginning and 345.7 MB in the end (delta: -18.5 MB). Peak memory consumption was 71.1 MB. Max. memory is 16.0 GB. * TraceAbstraction took 7809.50 ms. Allocated memory was 369.1 MB in the beginning and 541.1 MB in the end (delta: 172.0 MB). Free memory was 344.7 MB in the beginning and 362.1 MB in the end (delta: -17.3 MB). Peak memory consumption was 155.7 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4490.2ms, 82 PlacesBefore, 25 PlacesAfterwards, 77 TransitionsBefore, 19 TransitionsAfterwards, 926 CoEnabledTransitionPairs, 6 FixpointIterations, 31 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 70 TotalNumberOfCompositions, 2282 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1042, positive: 938, positive conditional: 0, positive unconditional: 938, negative: 104, negative conditional: 0, negative unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 610, positive: 581, positive conditional: 0, positive unconditional: 581, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 610, positive: 569, positive conditional: 0, positive unconditional: 569, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 41, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 585, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 563, negative conditional: 0, negative unconditional: 563, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1042, positive: 357, positive conditional: 0, positive unconditional: 357, negative: 75, negative conditional: 0, negative unconditional: 75, unknown: 610, unknown conditional: 0, unknown unconditional: 610] , Statistics on independence cache: Total cache size (in pairs): 73, Positive cache size: 52, Positive conditional cache size: 0, Positive unconditional cache size: 52, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L714] 0 int y = 0; [L715] 0 _Bool y$flush_delayed; [L716] 0 int y$mem_tmp; [L717] 0 _Bool y$r_buff0_thd0; [L718] 0 _Bool y$r_buff0_thd1; [L719] 0 _Bool y$r_buff0_thd2; [L720] 0 _Bool y$r_buff1_thd0; [L721] 0 _Bool y$r_buff1_thd1; [L722] 0 _Bool y$r_buff1_thd2; [L723] 0 _Bool y$read_delayed; [L724] 0 int *y$read_delayed_var; [L725] 0 int y$w_buff0; [L726] 0 _Bool y$w_buff0_used; [L727] 0 int y$w_buff1; [L728] 0 _Bool y$w_buff1_used; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2473; [L791] FCALL, FORK 0 pthread_create(&t2473, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L734] 1 y$w_buff1 = y$w_buff0 [L735] 1 y$w_buff0 = 2 [L736] 1 y$w_buff1_used = y$w_buff0_used [L737] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L739] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L740] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L741] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L742] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L745] 1 x = 1 VAL [__unbuffered_cnt=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L792] 0 pthread_t t2474; [L793] FCALL, FORK 0 pthread_create(&t2474, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L762] 2 x = 2 VAL [__unbuffered_cnt=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L765] 2 y = 1 VAL [__unbuffered_cnt=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L748] 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) [L748] 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) [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] 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 [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L752] 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 [L768] 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) [L768] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L768] 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) [L768] 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) [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L770] 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 [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L772] 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 [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L757] 1 return 0; [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L799] 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) [L799] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L799] 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) [L799] 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) [L800] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L800] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L801] 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 [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L802] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L803] 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 [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 y$flush_delayed = weak$$choice2 [L809] 0 y$mem_tmp = y [L810] 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) [L810] 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) [L811] 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)) [L811] 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)) [L812] 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)) [L812] 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)) [L813] 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)) [L813] 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)) [L814] 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)) [L814] 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)) [L815] 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)) [L815] 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)) [L816] 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)) [L816] 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)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L818] 0 y = y$flush_delayed ? y$mem_tmp : y [L819] 0 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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 3 procedures, 78 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 1.5ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 7659.7ms, OverallIterations: 12, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1320.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 4577.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 61 SDtfs, 44 SDslu, 58 SDs, 0 SdLazy, 314 SolverSat, 79 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 462.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 700.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=200occurred in iteration=8, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 36.5ms SsaConstructionTime, 400.2ms SatisfiabilityAnalysisTime, 1065.9ms InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 101 ConstructedInterpolants, 0 QuantifiedInterpolants, 888 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...