/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe-SemanticLooper.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix043_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 04:51:00,709 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 04:51:00,712 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 04:51:00,747 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 04:51:00,748 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 04:51:00,755 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 04:51:00,758 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 04:51:00,762 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 04:51:00,765 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 04:51:00,768 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 04:51:00,769 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 04:51:00,770 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 04:51:00,770 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 04:51:00,773 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 04:51:00,776 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 04:51:00,777 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 04:51:00,779 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 04:51:00,780 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 04:51:00,781 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 04:51:00,789 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 04:51:00,791 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 04:51:00,792 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 04:51:00,795 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 04:51:00,795 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 04:51:00,810 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 04:51:00,811 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 04:51:00,811 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 04:51:00,812 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 04:51:00,815 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 04:51:00,816 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 04:51:00,816 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 04:51:00,817 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 04:51:00,818 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 04:51:00,818 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 04:51:00,819 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 04:51:00,819 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 04:51:00,824 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 04:51:00,824 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 04:51:00,824 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 04:51:00,825 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 04:51:00,826 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 04:51:00,827 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-SemanticLooper.epf [2020-10-16 04:51:00,861 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 04:51:00,862 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 04:51:00,863 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 04:51:00,863 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 04:51:00,863 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 04:51:00,864 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 04:51:00,864 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 04:51:00,864 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 04:51:00,864 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 04:51:00,864 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 04:51:00,865 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 04:51:00,866 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 04:51:00,866 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 04:51:00,866 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 04:51:00,866 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 04:51:00,867 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 04:51:00,867 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 04:51:00,867 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 04:51:00,867 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 04:51:00,868 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 04:51:00,868 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 04:51:00,868 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 04:51:00,868 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 04:51:00,869 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 04:51:00,869 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 04:51:00,869 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 04:51:00,869 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 04:51:00,869 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 04:51:00,870 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 04:51:01,170 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 04:51:01,181 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 04:51:01,185 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 04:51:01,186 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 04:51:01,188 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 04:51:01,189 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix043_pso.opt.i [2020-10-16 04:51:01,265 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2edac5ebc/2cbf46e40b32437392837cedf4fc62e5/FLAG27aa9a08a [2020-10-16 04:51:01,818 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 04:51:01,818 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043_pso.opt.i [2020-10-16 04:51:01,837 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2edac5ebc/2cbf46e40b32437392837cedf4fc62e5/FLAG27aa9a08a [2020-10-16 04:51:02,093 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2edac5ebc/2cbf46e40b32437392837cedf4fc62e5 [2020-10-16 04:51:02,103 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 04:51:02,106 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 04:51:02,109 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 04:51:02,109 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 04:51:02,113 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 04:51:02,114 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:51:02" (1/1) ... [2020-10-16 04:51:02,117 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e1bafec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:51:02, skipping insertion in model container [2020-10-16 04:51:02,117 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:51:02" (1/1) ... [2020-10-16 04:51:02,125 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 04:51:02,174 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 04:51:02,696 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:51:02,711 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 04:51:02,803 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:51:02,882 INFO L208 MainTranslator]: Completed translation [2020-10-16 04:51:02,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:51:02 WrapperNode [2020-10-16 04:51:02,883 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 04:51:02,884 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 04:51:02,884 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 04:51:02,884 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 04:51:02,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:51:02" (1/1) ... [2020-10-16 04:51:02,915 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:51:02" (1/1) ... [2020-10-16 04:51:02,952 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 04:51:02,952 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 04:51:02,953 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 04:51:02,953 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 04:51:02,961 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:51:02" (1/1) ... [2020-10-16 04:51:02,961 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:51:02" (1/1) ... [2020-10-16 04:51:02,966 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:51:02" (1/1) ... [2020-10-16 04:51:02,967 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:51:02" (1/1) ... [2020-10-16 04:51:02,978 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:51:02" (1/1) ... [2020-10-16 04:51:02,982 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:51:02" (1/1) ... [2020-10-16 04:51:02,987 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:51:02" (1/1) ... [2020-10-16 04:51:02,993 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 04:51:02,994 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 04:51:02,994 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 04:51:02,994 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 04:51:02,995 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:51:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 04:51:03,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 04:51:03,063 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 04:51:03,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 04:51:03,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 04:51:03,063 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 04:51:03,064 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 04:51:03,065 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 04:51:03,065 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 04:51:03,066 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 04:51:03,066 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 04:51:03,068 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-16 04:51:03,068 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-16 04:51:03,068 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 04:51:03,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 04:51:03,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 04:51:03,071 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 04:51:05,033 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 04:51:05,034 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 04:51:05,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:51:05 BoogieIcfgContainer [2020-10-16 04:51:05,037 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 04:51:05,038 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 04:51:05,038 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 04:51:05,043 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 04:51:05,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 04:51:02" (1/3) ... [2020-10-16 04:51:05,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@517ed6da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:51:05, skipping insertion in model container [2020-10-16 04:51:05,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:51:02" (2/3) ... [2020-10-16 04:51:05,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@517ed6da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:51:05, skipping insertion in model container [2020-10-16 04:51:05,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:51:05" (3/3) ... [2020-10-16 04:51:05,047 INFO L111 eAbstractionObserver]: Analyzing ICFG mix043_pso.opt.i [2020-10-16 04:51:05,061 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 04:51:05,069 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 04:51:05,071 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 04:51:05,104 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,105 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,105 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,105 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,106 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,106 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,107 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,107 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,107 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,107 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,107 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,108 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,109 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,109 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,109 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,109 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,109 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,110 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,110 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,110 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,110 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,111 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,111 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,112 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,112 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,112 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,112 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,112 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,113 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,113 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,113 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,113 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,114 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,114 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,114 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,114 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,114 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,115 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,115 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,119 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,119 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,119 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,120 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,125 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,125 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,125 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,125 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,126 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,126 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,126 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,126 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,126 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,126 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,128 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,128 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,129 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,129 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,129 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,129 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,129 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,130 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,130 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,130 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,130 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,130 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,132 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,132 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,132 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,132 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:05,150 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-16 04:51:05,173 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 04:51:05,174 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 04:51:05,174 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 04:51:05,174 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 04:51:05,174 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 04:51:05,174 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 04:51:05,175 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 04:51:05,175 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 04:51:05,190 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 124 places, 113 transitions, 246 flow [2020-10-16 04:51:05,243 INFO L129 PetriNetUnfolder]: 2/109 cut-off events. [2020-10-16 04:51:05,243 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:51:05,249 INFO L80 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2020-10-16 04:51:05,249 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 113 transitions, 246 flow [2020-10-16 04:51:05,256 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 109 transitions, 230 flow [2020-10-16 04:51:05,259 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 04:51:05,262 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 109 transitions, 230 flow [2020-10-16 04:51:05,265 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 109 transitions, 230 flow [2020-10-16 04:51:05,266 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 120 places, 109 transitions, 230 flow [2020-10-16 04:51:05,294 INFO L129 PetriNetUnfolder]: 2/109 cut-off events. [2020-10-16 04:51:05,295 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:51:05,296 INFO L80 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2020-10-16 04:51:05,300 INFO L117 LiptonReduction]: Number of co-enabled transitions 2540 [2020-10-16 04:51:05,492 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:05,492 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:05,494 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:05,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:05,500 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:05,501 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:05,506 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:05,506 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:05,534 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:05,534 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:05,535 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:05,536 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:05,540 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:05,540 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:05,544 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:05,544 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:05,600 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:51:05,601 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:05,602 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:51:05,603 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:05,640 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:51:05,641 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:05,642 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:51:05,642 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:05,752 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:51:05,753 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:05,754 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:51:05,755 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:05,787 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:51:05,787 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:05,789 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:51:05,789 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:07,041 WARN L193 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 230 DAG size of output: 189 [2020-10-16 04:51:07,054 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-10-16 04:51:07,054 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:07,055 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:51:07,056 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:08,439 WARN L193 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 147 DAG size of output: 127 [2020-10-16 04:51:08,458 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:08,460 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:08,460 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:08,461 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:08,464 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:08,464 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:08,469 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:08,469 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:08,492 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:08,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:08,496 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:08,496 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:08,498 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:08,499 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:08,504 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:08,504 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:08,778 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:51:08,779 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:08,973 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2020-10-16 04:51:09,133 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:09,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:09,135 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:09,135 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:09,138 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:09,138 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:09,141 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:09,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:09,164 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:09,165 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:09,166 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:09,166 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:09,169 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:09,169 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:09,172 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:09,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:09,708 WARN L193 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-16 04:51:09,848 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 04:51:09,849 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:09,850 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term [2020-10-16 04:51:09,851 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:09,855 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:09,855 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:09,858 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:09,858 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:09,861 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:51:09,861 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:09,864 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:51:09,865 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:09,866 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 04:51:09,866 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:09,869 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:51:09,870 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:09,871 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:51:09,872 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:09,902 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 04:51:09,902 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:51:09,906 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 04:51:09,907 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:10,308 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 04:51:10,309 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:51:10,320 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 04:51:10,320 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:10,347 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 04:51:10,348 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:10,349 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term [2020-10-16 04:51:10,349 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:10,350 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:10,350 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:10,351 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:10,352 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:10,354 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:51:10,355 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:10,357 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:51:10,358 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:10,359 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 04:51:10,360 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:10,362 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:51:10,362 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:10,365 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:51:10,366 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:10,493 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 04:51:10,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:10,494 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term [2020-10-16 04:51:10,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:10,496 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:10,497 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:10,498 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:10,498 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:10,501 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:51:10,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:10,503 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:51:10,504 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:10,508 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 04:51:10,509 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:10,513 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:51:10,514 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:10,516 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:51:10,520 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:10,552 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 04:51:10,553 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:51:10,555 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 04:51:10,565 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:11,090 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 04:51:11,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:51:11,093 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 04:51:11,093 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:11,110 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 04:51:11,111 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:11,112 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term [2020-10-16 04:51:11,112 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:11,113 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:11,114 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:11,115 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:11,115 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:11,117 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:51:11,118 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:11,119 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:51:11,120 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:11,121 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 04:51:11,122 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:11,123 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:51:11,124 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:11,125 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:51:11,126 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:11,948 WARN L193 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2020-10-16 04:51:12,072 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-10-16 04:51:12,095 INFO L132 LiptonReduction]: Checked pairs total: 6368 [2020-10-16 04:51:12,095 INFO L134 LiptonReduction]: Total number of compositions: 92 [2020-10-16 04:51:12,098 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6841 [2020-10-16 04:51:12,107 INFO L129 PetriNetUnfolder]: 0/19 cut-off events. [2020-10-16 04:51:12,108 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:51:12,108 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:12,109 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:51:12,109 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:12,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:12,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1444069344, now seen corresponding path program 1 times [2020-10-16 04:51:12,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:12,127 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611286987] [2020-10-16 04:51:12,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:12,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:12,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:12,414 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611286987] [2020-10-16 04:51:12,415 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:12,415 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:51:12,416 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333160450] [2020-10-16 04:51:12,426 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:51:12,427 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:12,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:51:12,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:51:12,447 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 205 [2020-10-16 04:51:12,449 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 72 flow. Second operand 3 states. [2020-10-16 04:51:12,450 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:12,450 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 205 [2020-10-16 04:51:12,452 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:51:12,528 INFO L129 PetriNetUnfolder]: 16/74 cut-off events. [2020-10-16 04:51:12,529 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:51:12,530 INFO L80 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 74 events. 16/74 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 244 event pairs, 2 based on Foata normal form. 6/78 useless extension candidates. Maximal degree in co-relation 111. Up to 27 conditions per place. [2020-10-16 04:51:12,532 INFO L132 encePairwiseOnDemand]: 201/205 looper letters, 7 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2020-10-16 04:51:12,532 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 31 transitions, 92 flow [2020-10-16 04:51:12,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:51:12,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:51:12,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 546 transitions. [2020-10-16 04:51:12,552 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8878048780487805 [2020-10-16 04:51:12,553 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 546 transitions. [2020-10-16 04:51:12,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 546 transitions. [2020-10-16 04:51:12,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:51:12,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 546 transitions. [2020-10-16 04:51:12,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:51:12,577 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:51:12,578 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:51:12,580 INFO L185 Difference]: Start difference. First operand has 42 places, 30 transitions, 72 flow. Second operand 3 states and 546 transitions. [2020-10-16 04:51:12,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 31 transitions, 92 flow [2020-10-16 04:51:12,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 31 transitions, 88 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-16 04:51:12,593 INFO L241 Difference]: Finished difference. Result has 39 places, 28 transitions, 68 flow [2020-10-16 04:51:12,596 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2020-10-16 04:51:12,597 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2020-10-16 04:51:12,597 INFO L481 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 68 flow [2020-10-16 04:51:12,598 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:51:12,598 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:12,598 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:51:12,598 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 04:51:12,599 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:12,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:12,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1875609895, now seen corresponding path program 1 times [2020-10-16 04:51:12,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:12,600 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250673975] [2020-10-16 04:51:12,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:12,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:12,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:12,860 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250673975] [2020-10-16 04:51:12,860 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:12,861 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 04:51:12,861 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723395020] [2020-10-16 04:51:12,862 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:51:12,863 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:12,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:51:12,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:51:12,866 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 205 [2020-10-16 04:51:12,867 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 68 flow. Second operand 4 states. [2020-10-16 04:51:12,867 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:12,867 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 205 [2020-10-16 04:51:12,867 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:51:13,033 INFO L129 PetriNetUnfolder]: 48/128 cut-off events. [2020-10-16 04:51:13,034 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2020-10-16 04:51:13,036 INFO L80 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 128 events. 48/128 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 528 event pairs, 17 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 237. Up to 64 conditions per place. [2020-10-16 04:51:13,038 INFO L132 encePairwiseOnDemand]: 201/205 looper letters, 8 selfloop transitions, 2 changer transitions 9/38 dead transitions. [2020-10-16 04:51:13,038 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 38 transitions, 128 flow [2020-10-16 04:51:13,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:51:13,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:51:13,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 806 transitions. [2020-10-16 04:51:13,043 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7863414634146342 [2020-10-16 04:51:13,043 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 806 transitions. [2020-10-16 04:51:13,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 806 transitions. [2020-10-16 04:51:13,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:51:13,044 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 806 transitions. [2020-10-16 04:51:13,046 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:51:13,051 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:51:13,052 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:51:13,052 INFO L185 Difference]: Start difference. First operand has 39 places, 28 transitions, 68 flow. Second operand 5 states and 806 transitions. [2020-10-16 04:51:13,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 38 transitions, 128 flow [2020-10-16 04:51:13,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 38 transitions, 122 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:51:13,054 INFO L241 Difference]: Finished difference. Result has 44 places, 27 transitions, 74 flow [2020-10-16 04:51:13,054 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=74, PETRI_PLACES=44, PETRI_TRANSITIONS=27} [2020-10-16 04:51:13,056 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2020-10-16 04:51:13,059 INFO L481 AbstractCegarLoop]: Abstraction has has 44 places, 27 transitions, 74 flow [2020-10-16 04:51:13,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:51:13,059 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:13,059 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:51:13,060 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 04:51:13,062 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:13,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:13,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1973183834, now seen corresponding path program 1 times [2020-10-16 04:51:13,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:13,063 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818673370] [2020-10-16 04:51:13,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:13,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:13,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:13,208 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818673370] [2020-10-16 04:51:13,209 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:13,209 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:51:13,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98885917] [2020-10-16 04:51:13,209 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:51:13,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:13,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:51:13,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:51:13,211 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 205 [2020-10-16 04:51:13,212 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 27 transitions, 74 flow. Second operand 5 states. [2020-10-16 04:51:13,212 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:13,212 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 205 [2020-10-16 04:51:13,212 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:51:13,263 INFO L129 PetriNetUnfolder]: 2/39 cut-off events. [2020-10-16 04:51:13,263 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2020-10-16 04:51:13,264 INFO L80 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 39 events. 2/39 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 74 event pairs, 1 based on Foata normal form. 2/40 useless extension candidates. Maximal degree in co-relation 64. Up to 6 conditions per place. [2020-10-16 04:51:13,264 INFO L132 encePairwiseOnDemand]: 201/205 looper letters, 5 selfloop transitions, 2 changer transitions 2/30 dead transitions. [2020-10-16 04:51:13,264 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 30 transitions, 100 flow [2020-10-16 04:51:13,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:51:13,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:51:13,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 826 transitions. [2020-10-16 04:51:13,267 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8058536585365854 [2020-10-16 04:51:13,268 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 826 transitions. [2020-10-16 04:51:13,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 826 transitions. [2020-10-16 04:51:13,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:51:13,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 826 transitions. [2020-10-16 04:51:13,270 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:51:13,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:51:13,272 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:51:13,272 INFO L185 Difference]: Start difference. First operand has 44 places, 27 transitions, 74 flow. Second operand 5 states and 826 transitions. [2020-10-16 04:51:13,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 30 transitions, 100 flow [2020-10-16 04:51:13,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 30 transitions, 92 flow, removed 2 selfloop flow, removed 4 redundant places. [2020-10-16 04:51:13,274 INFO L241 Difference]: Finished difference. Result has 44 places, 27 transitions, 78 flow [2020-10-16 04:51:13,274 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=78, PETRI_PLACES=44, PETRI_TRANSITIONS=27} [2020-10-16 04:51:13,275 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2020-10-16 04:51:13,275 INFO L481 AbstractCegarLoop]: Abstraction has has 44 places, 27 transitions, 78 flow [2020-10-16 04:51:13,275 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:51:13,275 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:13,275 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:51:13,275 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 04:51:13,276 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:13,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:13,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1426112121, now seen corresponding path program 1 times [2020-10-16 04:51:13,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:13,276 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672610811] [2020-10-16 04:51:13,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:13,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:13,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:13,385 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672610811] [2020-10-16 04:51:13,385 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:13,385 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:51:13,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813761706] [2020-10-16 04:51:13,385 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 04:51:13,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:13,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 04:51:13,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 04:51:13,388 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 205 [2020-10-16 04:51:13,388 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 27 transitions, 78 flow. Second operand 6 states. [2020-10-16 04:51:13,388 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:13,389 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 205 [2020-10-16 04:51:13,389 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:51:13,492 INFO L129 PetriNetUnfolder]: 28/99 cut-off events. [2020-10-16 04:51:13,492 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2020-10-16 04:51:13,493 INFO L80 FinitePrefix]: Finished finitePrefix Result has 213 conditions, 99 events. 28/99 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 350 event pairs, 18 based on Foata normal form. 6/102 useless extension candidates. Maximal degree in co-relation 200. Up to 50 conditions per place. [2020-10-16 04:51:13,494 INFO L132 encePairwiseOnDemand]: 199/205 looper letters, 9 selfloop transitions, 5 changer transitions 6/39 dead transitions. [2020-10-16 04:51:13,494 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 39 transitions, 147 flow [2020-10-16 04:51:13,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 04:51:13,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 04:51:13,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 976 transitions. [2020-10-16 04:51:13,499 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7934959349593496 [2020-10-16 04:51:13,499 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 976 transitions. [2020-10-16 04:51:13,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 976 transitions. [2020-10-16 04:51:13,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:51:13,500 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 976 transitions. [2020-10-16 04:51:13,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 04:51:13,504 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 04:51:13,505 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 04:51:13,505 INFO L185 Difference]: Start difference. First operand has 44 places, 27 transitions, 78 flow. Second operand 6 states and 976 transitions. [2020-10-16 04:51:13,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 39 transitions, 147 flow [2020-10-16 04:51:13,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 39 transitions, 132 flow, removed 4 selfloop flow, removed 5 redundant places. [2020-10-16 04:51:13,507 INFO L241 Difference]: Finished difference. Result has 46 places, 31 transitions, 104 flow [2020-10-16 04:51:13,507 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=104, PETRI_PLACES=46, PETRI_TRANSITIONS=31} [2020-10-16 04:51:13,508 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2020-10-16 04:51:13,508 INFO L481 AbstractCegarLoop]: Abstraction has has 46 places, 31 transitions, 104 flow [2020-10-16 04:51:13,508 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 04:51:13,508 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:13,508 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:51:13,508 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 04:51:13,508 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:13,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:13,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1821870961, now seen corresponding path program 1 times [2020-10-16 04:51:13,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:13,509 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652505071] [2020-10-16 04:51:13,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:13,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:13,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:13,615 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652505071] [2020-10-16 04:51:13,616 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:13,616 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:51:13,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85771882] [2020-10-16 04:51:13,617 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:51:13,617 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:13,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:51:13,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:51:13,619 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 205 [2020-10-16 04:51:13,620 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 31 transitions, 104 flow. Second operand 7 states. [2020-10-16 04:51:13,620 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:13,620 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 205 [2020-10-16 04:51:13,620 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:51:13,823 INFO L129 PetriNetUnfolder]: 31/105 cut-off events. [2020-10-16 04:51:13,824 INFO L130 PetriNetUnfolder]: For 71/75 co-relation queries the response was YES. [2020-10-16 04:51:13,825 INFO L80 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 105 events. 31/105 cut-off events. For 71/75 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 388 event pairs, 8 based on Foata normal form. 10/115 useless extension candidates. Maximal degree in co-relation 251. Up to 44 conditions per place. [2020-10-16 04:51:13,825 INFO L132 encePairwiseOnDemand]: 198/205 looper letters, 11 selfloop transitions, 9 changer transitions 8/47 dead transitions. [2020-10-16 04:51:13,826 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 47 transitions, 226 flow [2020-10-16 04:51:13,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 04:51:13,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 04:51:13,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1275 transitions. [2020-10-16 04:51:13,830 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7774390243902439 [2020-10-16 04:51:13,830 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1275 transitions. [2020-10-16 04:51:13,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1275 transitions. [2020-10-16 04:51:13,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:51:13,832 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1275 transitions. [2020-10-16 04:51:13,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 04:51:13,838 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 04:51:13,838 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 04:51:13,838 INFO L185 Difference]: Start difference. First operand has 46 places, 31 transitions, 104 flow. Second operand 8 states and 1275 transitions. [2020-10-16 04:51:13,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 47 transitions, 226 flow [2020-10-16 04:51:13,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 47 transitions, 222 flow, removed 2 selfloop flow, removed 1 redundant places. [2020-10-16 04:51:13,841 INFO L241 Difference]: Finished difference. Result has 55 places, 36 transitions, 165 flow [2020-10-16 04:51:13,841 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=165, PETRI_PLACES=55, PETRI_TRANSITIONS=36} [2020-10-16 04:51:13,842 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 13 predicate places. [2020-10-16 04:51:13,842 INFO L481 AbstractCegarLoop]: Abstraction has has 55 places, 36 transitions, 165 flow [2020-10-16 04:51:13,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:51:13,842 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:13,842 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:51:13,842 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 04:51:13,843 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:13,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:13,843 INFO L82 PathProgramCache]: Analyzing trace with hash 398262842, now seen corresponding path program 1 times [2020-10-16 04:51:13,843 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:13,843 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953902519] [2020-10-16 04:51:13,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:13,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:13,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:13,914 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953902519] [2020-10-16 04:51:13,914 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:13,914 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:51:13,914 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923307157] [2020-10-16 04:51:13,915 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:51:13,915 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:13,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:51:13,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:51:13,916 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 205 [2020-10-16 04:51:13,917 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 36 transitions, 165 flow. Second operand 4 states. [2020-10-16 04:51:13,917 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:13,917 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 205 [2020-10-16 04:51:13,917 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:51:14,024 INFO L129 PetriNetUnfolder]: 187/402 cut-off events. [2020-10-16 04:51:14,024 INFO L130 PetriNetUnfolder]: For 512/556 co-relation queries the response was YES. [2020-10-16 04:51:14,028 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1093 conditions, 402 events. 187/402 cut-off events. For 512/556 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 2436 event pairs, 93 based on Foata normal form. 29/379 useless extension candidates. Maximal degree in co-relation 1073. Up to 214 conditions per place. [2020-10-16 04:51:14,031 INFO L132 encePairwiseOnDemand]: 198/205 looper letters, 10 selfloop transitions, 10 changer transitions 0/49 dead transitions. [2020-10-16 04:51:14,031 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 49 transitions, 231 flow [2020-10-16 04:51:14,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:51:14,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:51:14,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 872 transitions. [2020-10-16 04:51:14,035 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8507317073170731 [2020-10-16 04:51:14,035 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 872 transitions. [2020-10-16 04:51:14,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 872 transitions. [2020-10-16 04:51:14,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:51:14,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 872 transitions. [2020-10-16 04:51:14,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:51:14,040 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:51:14,040 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:51:14,040 INFO L185 Difference]: Start difference. First operand has 55 places, 36 transitions, 165 flow. Second operand 5 states and 872 transitions. [2020-10-16 04:51:14,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 49 transitions, 231 flow [2020-10-16 04:51:14,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 49 transitions, 216 flow, removed 7 selfloop flow, removed 4 redundant places. [2020-10-16 04:51:14,046 INFO L241 Difference]: Finished difference. Result has 55 places, 45 transitions, 225 flow [2020-10-16 04:51:14,046 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=225, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2020-10-16 04:51:14,046 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 13 predicate places. [2020-10-16 04:51:14,046 INFO L481 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 225 flow [2020-10-16 04:51:14,046 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:51:14,047 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:14,047 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:51:14,047 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 04:51:14,047 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:14,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:14,048 INFO L82 PathProgramCache]: Analyzing trace with hash 921334376, now seen corresponding path program 1 times [2020-10-16 04:51:14,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:14,048 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714286851] [2020-10-16 04:51:14,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:14,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:14,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:14,127 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714286851] [2020-10-16 04:51:14,128 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:14,128 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:51:14,128 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004846478] [2020-10-16 04:51:14,128 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:51:14,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:14,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:51:14,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:51:14,130 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 205 [2020-10-16 04:51:14,131 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 225 flow. Second operand 5 states. [2020-10-16 04:51:14,131 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:14,131 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 205 [2020-10-16 04:51:14,131 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:51:14,255 INFO L129 PetriNetUnfolder]: 159/356 cut-off events. [2020-10-16 04:51:14,255 INFO L130 PetriNetUnfolder]: For 476/1032 co-relation queries the response was YES. [2020-10-16 04:51:14,258 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1334 conditions, 356 events. 159/356 cut-off events. For 476/1032 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 1900 event pairs, 32 based on Foata normal form. 80/398 useless extension candidates. Maximal degree in co-relation 1313. Up to 238 conditions per place. [2020-10-16 04:51:14,261 INFO L132 encePairwiseOnDemand]: 198/205 looper letters, 10 selfloop transitions, 19 changer transitions 0/58 dead transitions. [2020-10-16 04:51:14,261 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 58 transitions, 359 flow [2020-10-16 04:51:14,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:51:14,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:51:14,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1221 transitions. [2020-10-16 04:51:14,265 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8508710801393728 [2020-10-16 04:51:14,266 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1221 transitions. [2020-10-16 04:51:14,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1221 transitions. [2020-10-16 04:51:14,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:51:14,267 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1221 transitions. [2020-10-16 04:51:14,269 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:51:14,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:51:14,272 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:51:14,272 INFO L185 Difference]: Start difference. First operand has 55 places, 45 transitions, 225 flow. Second operand 7 states and 1221 transitions. [2020-10-16 04:51:14,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 58 transitions, 359 flow [2020-10-16 04:51:14,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 58 transitions, 354 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 04:51:14,277 INFO L241 Difference]: Finished difference. Result has 63 places, 54 transitions, 354 flow [2020-10-16 04:51:14,277 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=354, PETRI_PLACES=63, PETRI_TRANSITIONS=54} [2020-10-16 04:51:14,278 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 21 predicate places. [2020-10-16 04:51:14,278 INFO L481 AbstractCegarLoop]: Abstraction has has 63 places, 54 transitions, 354 flow [2020-10-16 04:51:14,278 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:51:14,278 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:14,278 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:51:14,278 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 04:51:14,279 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:14,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:14,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1201652393, now seen corresponding path program 1 times [2020-10-16 04:51:14,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:14,280 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789791875] [2020-10-16 04:51:14,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:14,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:14,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:14,387 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789791875] [2020-10-16 04:51:14,387 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:14,387 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:51:14,388 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800356669] [2020-10-16 04:51:14,388 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:51:14,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:14,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:51:14,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:51:14,391 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 205 [2020-10-16 04:51:14,392 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 54 transitions, 354 flow. Second operand 7 states. [2020-10-16 04:51:14,392 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:14,392 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 205 [2020-10-16 04:51:14,392 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:51:14,792 INFO L129 PetriNetUnfolder]: 451/936 cut-off events. [2020-10-16 04:51:14,792 INFO L130 PetriNetUnfolder]: For 3537/4868 co-relation queries the response was YES. [2020-10-16 04:51:14,803 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4182 conditions, 936 events. 451/936 cut-off events. For 3537/4868 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 6300 event pairs, 47 based on Foata normal form. 77/946 useless extension candidates. Maximal degree in co-relation 4157. Up to 537 conditions per place. [2020-10-16 04:51:14,812 INFO L132 encePairwiseOnDemand]: 199/205 looper letters, 37 selfloop transitions, 11 changer transitions 0/86 dead transitions. [2020-10-16 04:51:14,812 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 86 transitions, 645 flow [2020-10-16 04:51:14,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 04:51:14,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 04:51:14,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1253 transitions. [2020-10-16 04:51:14,820 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7640243902439025 [2020-10-16 04:51:14,820 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1253 transitions. [2020-10-16 04:51:14,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1253 transitions. [2020-10-16 04:51:14,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:51:14,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1253 transitions. [2020-10-16 04:51:14,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 04:51:14,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 04:51:14,832 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 04:51:14,832 INFO L185 Difference]: Start difference. First operand has 63 places, 54 transitions, 354 flow. Second operand 8 states and 1253 transitions. [2020-10-16 04:51:14,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 86 transitions, 645 flow [2020-10-16 04:51:14,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 86 transitions, 595 flow, removed 17 selfloop flow, removed 3 redundant places. [2020-10-16 04:51:14,852 INFO L241 Difference]: Finished difference. Result has 70 places, 60 transitions, 372 flow [2020-10-16 04:51:14,853 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=372, PETRI_PLACES=70, PETRI_TRANSITIONS=60} [2020-10-16 04:51:14,853 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 28 predicate places. [2020-10-16 04:51:14,853 INFO L481 AbstractCegarLoop]: Abstraction has has 70 places, 60 transitions, 372 flow [2020-10-16 04:51:14,853 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:51:14,854 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:14,854 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:51:14,854 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 04:51:14,854 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:14,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:14,855 INFO L82 PathProgramCache]: Analyzing trace with hash -200880693, now seen corresponding path program 2 times [2020-10-16 04:51:14,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:14,856 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178851986] [2020-10-16 04:51:14,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:14,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:14,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:14,982 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178851986] [2020-10-16 04:51:14,982 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:14,982 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:51:14,983 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953925332] [2020-10-16 04:51:14,983 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 04:51:14,983 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:14,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 04:51:14,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 04:51:14,986 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 205 [2020-10-16 04:51:14,986 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 60 transitions, 372 flow. Second operand 6 states. [2020-10-16 04:51:14,986 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:14,987 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 205 [2020-10-16 04:51:14,987 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:51:15,174 INFO L129 PetriNetUnfolder]: 218/499 cut-off events. [2020-10-16 04:51:15,174 INFO L130 PetriNetUnfolder]: For 2062/3754 co-relation queries the response was YES. [2020-10-16 04:51:15,178 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2356 conditions, 499 events. 218/499 cut-off events. For 2062/3754 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 3027 event pairs, 9 based on Foata normal form. 222/674 useless extension candidates. Maximal degree in co-relation 2328. Up to 293 conditions per place. [2020-10-16 04:51:15,181 INFO L132 encePairwiseOnDemand]: 198/205 looper letters, 6 selfloop transitions, 27 changer transitions 5/73 dead transitions. [2020-10-16 04:51:15,181 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 73 transitions, 574 flow [2020-10-16 04:51:15,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 04:51:15,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 04:51:15,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1570 transitions. [2020-10-16 04:51:15,187 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8509485094850948 [2020-10-16 04:51:15,187 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1570 transitions. [2020-10-16 04:51:15,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1570 transitions. [2020-10-16 04:51:15,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:51:15,188 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1570 transitions. [2020-10-16 04:51:15,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 04:51:15,195 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 04:51:15,195 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 04:51:15,195 INFO L185 Difference]: Start difference. First operand has 70 places, 60 transitions, 372 flow. Second operand 9 states and 1570 transitions. [2020-10-16 04:51:15,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 73 transitions, 574 flow [2020-10-16 04:51:15,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 73 transitions, 563 flow, removed 3 selfloop flow, removed 2 redundant places. [2020-10-16 04:51:15,202 INFO L241 Difference]: Finished difference. Result has 79 places, 68 transitions, 527 flow [2020-10-16 04:51:15,203 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=527, PETRI_PLACES=79, PETRI_TRANSITIONS=68} [2020-10-16 04:51:15,203 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 37 predicate places. [2020-10-16 04:51:15,203 INFO L481 AbstractCegarLoop]: Abstraction has has 79 places, 68 transitions, 527 flow [2020-10-16 04:51:15,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 04:51:15,203 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:15,203 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:51:15,204 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 04:51:15,204 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:15,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:15,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1873934217, now seen corresponding path program 1 times [2020-10-16 04:51:15,204 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:15,205 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539684002] [2020-10-16 04:51:15,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:15,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:15,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:15,318 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539684002] [2020-10-16 04:51:15,318 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:15,319 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 04:51:15,319 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455062123] [2020-10-16 04:51:15,319 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:51:15,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:15,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:51:15,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:51:15,322 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 205 [2020-10-16 04:51:15,323 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 68 transitions, 527 flow. Second operand 7 states. [2020-10-16 04:51:15,323 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:15,323 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 205 [2020-10-16 04:51:15,323 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:51:15,542 INFO L129 PetriNetUnfolder]: 176/433 cut-off events. [2020-10-16 04:51:15,542 INFO L130 PetriNetUnfolder]: For 2776/4260 co-relation queries the response was YES. [2020-10-16 04:51:15,546 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2511 conditions, 433 events. 176/433 cut-off events. For 2776/4260 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 2715 event pairs, 0 based on Foata normal form. 213/601 useless extension candidates. Maximal degree in co-relation 2482. Up to 255 conditions per place. [2020-10-16 04:51:15,549 INFO L132 encePairwiseOnDemand]: 198/205 looper letters, 2 selfloop transitions, 32 changer transitions 8/73 dead transitions. [2020-10-16 04:51:15,549 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 73 transitions, 661 flow [2020-10-16 04:51:15,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-16 04:51:15,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-16 04:51:15,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1910 transitions. [2020-10-16 04:51:15,555 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8470066518847007 [2020-10-16 04:51:15,555 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1910 transitions. [2020-10-16 04:51:15,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1910 transitions. [2020-10-16 04:51:15,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:51:15,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1910 transitions. [2020-10-16 04:51:15,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-16 04:51:15,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-16 04:51:15,568 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-16 04:51:15,568 INFO L185 Difference]: Start difference. First operand has 79 places, 68 transitions, 527 flow. Second operand 11 states and 1910 transitions. [2020-10-16 04:51:15,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 73 transitions, 661 flow [2020-10-16 04:51:15,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 73 transitions, 554 flow, removed 38 selfloop flow, removed 6 redundant places. [2020-10-16 04:51:15,586 INFO L241 Difference]: Finished difference. Result has 86 places, 65 transitions, 482 flow [2020-10-16 04:51:15,586 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=482, PETRI_PLACES=86, PETRI_TRANSITIONS=65} [2020-10-16 04:51:15,586 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 44 predicate places. [2020-10-16 04:51:15,586 INFO L481 AbstractCegarLoop]: Abstraction has has 86 places, 65 transitions, 482 flow [2020-10-16 04:51:15,586 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:51:15,587 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:15,587 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:51:15,587 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 04:51:15,587 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:15,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:15,588 INFO L82 PathProgramCache]: Analyzing trace with hash -209619928, now seen corresponding path program 1 times [2020-10-16 04:51:15,588 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:15,589 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6777112] [2020-10-16 04:51:15,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:15,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:15,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:15,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6777112] [2020-10-16 04:51:15,787 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:15,787 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 04:51:15,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232276525] [2020-10-16 04:51:15,788 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 04:51:15,788 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:15,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 04:51:15,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-16 04:51:15,790 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 205 [2020-10-16 04:51:15,791 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 65 transitions, 482 flow. Second operand 8 states. [2020-10-16 04:51:15,791 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:15,791 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 205 [2020-10-16 04:51:15,792 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:51:16,065 INFO L129 PetriNetUnfolder]: 362/925 cut-off events. [2020-10-16 04:51:16,066 INFO L130 PetriNetUnfolder]: For 4517/4951 co-relation queries the response was YES. [2020-10-16 04:51:16,072 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3937 conditions, 925 events. 362/925 cut-off events. For 4517/4951 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 7443 event pairs, 2 based on Foata normal form. 37/841 useless extension candidates. Maximal degree in co-relation 3908. Up to 280 conditions per place. [2020-10-16 04:51:16,077 INFO L132 encePairwiseOnDemand]: 199/205 looper letters, 17 selfloop transitions, 7 changer transitions 6/81 dead transitions. [2020-10-16 04:51:16,077 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 81 transitions, 643 flow [2020-10-16 04:51:16,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:51:16,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:51:16,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1098 transitions. [2020-10-16 04:51:16,081 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7651567944250871 [2020-10-16 04:51:16,081 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1098 transitions. [2020-10-16 04:51:16,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1098 transitions. [2020-10-16 04:51:16,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:51:16,082 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1098 transitions. [2020-10-16 04:51:16,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:51:16,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:51:16,088 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:51:16,088 INFO L185 Difference]: Start difference. First operand has 86 places, 65 transitions, 482 flow. Second operand 7 states and 1098 transitions. [2020-10-16 04:51:16,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 81 transitions, 643 flow [2020-10-16 04:51:16,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 81 transitions, 514 flow, removed 35 selfloop flow, removed 12 redundant places. [2020-10-16 04:51:16,122 INFO L241 Difference]: Finished difference. Result has 81 places, 67 transitions, 410 flow [2020-10-16 04:51:16,123 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=410, PETRI_PLACES=81, PETRI_TRANSITIONS=67} [2020-10-16 04:51:16,123 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 39 predicate places. [2020-10-16 04:51:16,123 INFO L481 AbstractCegarLoop]: Abstraction has has 81 places, 67 transitions, 410 flow [2020-10-16 04:51:16,123 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 04:51:16,123 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:16,124 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:51:16,124 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 04:51:16,124 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:16,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:16,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1445201368, now seen corresponding path program 2 times [2020-10-16 04:51:16,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:16,125 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734860943] [2020-10-16 04:51:16,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:16,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:16,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:16,247 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734860943] [2020-10-16 04:51:16,247 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:16,247 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:51:16,247 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550930573] [2020-10-16 04:51:16,248 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:51:16,248 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:16,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:51:16,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:51:16,251 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 205 [2020-10-16 04:51:16,252 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 67 transitions, 410 flow. Second operand 7 states. [2020-10-16 04:51:16,253 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:16,253 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 205 [2020-10-16 04:51:16,253 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:51:16,521 INFO L129 PetriNetUnfolder]: 579/1460 cut-off events. [2020-10-16 04:51:16,521 INFO L130 PetriNetUnfolder]: For 3737/4005 co-relation queries the response was YES. [2020-10-16 04:51:16,530 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5083 conditions, 1460 events. 579/1460 cut-off events. For 3737/4005 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 13013 event pairs, 1 based on Foata normal form. 51/1320 useless extension candidates. Maximal degree in co-relation 5058. Up to 451 conditions per place. [2020-10-16 04:51:16,534 INFO L132 encePairwiseOnDemand]: 199/205 looper letters, 6 selfloop transitions, 2 changer transitions 17/76 dead transitions. [2020-10-16 04:51:16,534 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 76 transitions, 530 flow [2020-10-16 04:51:16,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:51:16,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:51:16,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1119 transitions. [2020-10-16 04:51:16,538 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7797909407665505 [2020-10-16 04:51:16,538 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1119 transitions. [2020-10-16 04:51:16,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1119 transitions. [2020-10-16 04:51:16,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:51:16,539 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1119 transitions. [2020-10-16 04:51:16,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:51:16,544 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:51:16,544 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:51:16,544 INFO L185 Difference]: Start difference. First operand has 81 places, 67 transitions, 410 flow. Second operand 7 states and 1119 transitions. [2020-10-16 04:51:16,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 76 transitions, 530 flow [2020-10-16 04:51:16,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 76 transitions, 525 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-16 04:51:16,616 INFO L241 Difference]: Finished difference. Result has 87 places, 58 transitions, 344 flow [2020-10-16 04:51:16,616 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=344, PETRI_PLACES=87, PETRI_TRANSITIONS=58} [2020-10-16 04:51:16,617 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 45 predicate places. [2020-10-16 04:51:16,617 INFO L481 AbstractCegarLoop]: Abstraction has has 87 places, 58 transitions, 344 flow [2020-10-16 04:51:16,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:51:16,617 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:16,617 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:51:16,617 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 04:51:16,617 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:16,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:16,618 INFO L82 PathProgramCache]: Analyzing trace with hash -887073682, now seen corresponding path program 3 times [2020-10-16 04:51:16,618 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:16,618 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460792077] [2020-10-16 04:51:16,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:16,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:16,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:16,724 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460792077] [2020-10-16 04:51:16,724 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:16,725 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:51:16,725 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647315470] [2020-10-16 04:51:16,725 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:51:16,725 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:16,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:51:16,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:51:16,728 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 205 [2020-10-16 04:51:16,728 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 58 transitions, 344 flow. Second operand 7 states. [2020-10-16 04:51:16,728 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:16,729 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 205 [2020-10-16 04:51:16,729 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:51:16,832 INFO L129 PetriNetUnfolder]: 167/414 cut-off events. [2020-10-16 04:51:16,833 INFO L130 PetriNetUnfolder]: For 712/738 co-relation queries the response was YES. [2020-10-16 04:51:16,836 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1475 conditions, 414 events. 167/414 cut-off events. For 712/738 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 2572 event pairs, 0 based on Foata normal form. 8/341 useless extension candidates. Maximal degree in co-relation 1447. Up to 116 conditions per place. [2020-10-16 04:51:16,837 INFO L132 encePairwiseOnDemand]: 200/205 looper letters, 5 selfloop transitions, 3 changer transitions 4/61 dead transitions. [2020-10-16 04:51:16,838 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 61 transitions, 388 flow [2020-10-16 04:51:16,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 04:51:16,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 04:51:16,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 959 transitions. [2020-10-16 04:51:16,841 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7796747967479675 [2020-10-16 04:51:16,841 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 959 transitions. [2020-10-16 04:51:16,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 959 transitions. [2020-10-16 04:51:16,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:51:16,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 959 transitions. [2020-10-16 04:51:16,844 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 04:51:16,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 04:51:16,847 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 04:51:16,847 INFO L185 Difference]: Start difference. First operand has 87 places, 58 transitions, 344 flow. Second operand 6 states and 959 transitions. [2020-10-16 04:51:16,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 61 transitions, 388 flow [2020-10-16 04:51:16,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 61 transitions, 357 flow, removed 8 selfloop flow, removed 12 redundant places. [2020-10-16 04:51:16,857 INFO L241 Difference]: Finished difference. Result has 76 places, 57 transitions, 320 flow [2020-10-16 04:51:16,857 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=320, PETRI_PLACES=76, PETRI_TRANSITIONS=57} [2020-10-16 04:51:16,858 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 34 predicate places. [2020-10-16 04:51:16,858 INFO L481 AbstractCegarLoop]: Abstraction has has 76 places, 57 transitions, 320 flow [2020-10-16 04:51:16,858 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:51:16,858 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:16,858 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:51:16,858 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 04:51:16,858 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:16,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:16,859 INFO L82 PathProgramCache]: Analyzing trace with hash -2109312710, now seen corresponding path program 4 times [2020-10-16 04:51:16,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:16,859 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934440318] [2020-10-16 04:51:16,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:16,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:16,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:16,977 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934440318] [2020-10-16 04:51:16,977 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:16,977 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:51:16,978 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280804290] [2020-10-16 04:51:16,978 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:51:16,978 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:16,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:51:16,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:51:16,980 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 205 [2020-10-16 04:51:16,982 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 57 transitions, 320 flow. Second operand 7 states. [2020-10-16 04:51:16,982 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:16,982 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 205 [2020-10-16 04:51:16,982 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:51:17,188 INFO L129 PetriNetUnfolder]: 285/714 cut-off events. [2020-10-16 04:51:17,188 INFO L130 PetriNetUnfolder]: For 1222/1277 co-relation queries the response was YES. [2020-10-16 04:51:17,195 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2479 conditions, 714 events. 285/714 cut-off events. For 1222/1277 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 5297 event pairs, 0 based on Foata normal form. 12/584 useless extension candidates. Maximal degree in co-relation 2455. Up to 200 conditions per place. [2020-10-16 04:51:17,198 INFO L132 encePairwiseOnDemand]: 200/205 looper letters, 5 selfloop transitions, 2 changer transitions 3/60 dead transitions. [2020-10-16 04:51:17,199 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 60 transitions, 360 flow [2020-10-16 04:51:17,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 04:51:17,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 04:51:17,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 959 transitions. [2020-10-16 04:51:17,205 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7796747967479675 [2020-10-16 04:51:17,205 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 959 transitions. [2020-10-16 04:51:17,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 959 transitions. [2020-10-16 04:51:17,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:51:17,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 959 transitions. [2020-10-16 04:51:17,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 04:51:17,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 04:51:17,215 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 04:51:17,215 INFO L185 Difference]: Start difference. First operand has 76 places, 57 transitions, 320 flow. Second operand 6 states and 959 transitions. [2020-10-16 04:51:17,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 60 transitions, 360 flow [2020-10-16 04:51:17,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 60 transitions, 355 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-16 04:51:17,246 INFO L241 Difference]: Finished difference. Result has 80 places, 57 transitions, 326 flow [2020-10-16 04:51:17,247 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=326, PETRI_PLACES=80, PETRI_TRANSITIONS=57} [2020-10-16 04:51:17,247 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 38 predicate places. [2020-10-16 04:51:17,247 INFO L481 AbstractCegarLoop]: Abstraction has has 80 places, 57 transitions, 326 flow [2020-10-16 04:51:17,247 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:51:17,248 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:17,248 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:51:17,248 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 04:51:17,248 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:17,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:17,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1812400664, now seen corresponding path program 5 times [2020-10-16 04:51:17,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:17,249 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047378264] [2020-10-16 04:51:17,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:17,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 04:51:17,308 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 04:51:17,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 04:51:17,404 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 04:51:17,454 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 04:51:17,454 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 04:51:17,455 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 04:51:17,494 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:17,495 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:17,497 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:17,497 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:17,497 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:17,497 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:17,498 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:17,498 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:17,498 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:17,498 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:17,498 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:17,498 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:17,499 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:17,499 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:17,500 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:17,500 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:17,501 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:17,501 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:17,501 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:17,501 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:17,501 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:17,502 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:17,502 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:17,502 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:17,503 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:17,503 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:17,504 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:17,504 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:17,504 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:17,504 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:17,505 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:17,505 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:17,505 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:17,506 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:17,506 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:17,506 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:17,506 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:17,507 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:17,507 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:17,507 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:17,507 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:17,507 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:17,507 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:17,508 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:17,508 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:17,508 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:17,508 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:17,508 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:17,508 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:17,509 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:17,509 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:17,509 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:17,509 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:17,509 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:17,509 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:17,510 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:17,510 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:17,510 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:17,510 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:17,510 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:17,511 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:17,511 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:17,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 04:51:17 BasicIcfg [2020-10-16 04:51:17,590 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 04:51:17,592 INFO L168 Benchmark]: Toolchain (without parser) took 15486.65 ms. Allocated memory was 254.3 MB in the beginning and 606.1 MB in the end (delta: 351.8 MB). Free memory was 209.6 MB in the beginning and 542.5 MB in the end (delta: -332.9 MB). Peak memory consumption was 333.5 MB. Max. memory is 14.2 GB. [2020-10-16 04:51:17,592 INFO L168 Benchmark]: CDTParser took 0.40 ms. Allocated memory is still 254.3 MB. Free memory is still 230.7 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 04:51:17,593 INFO L168 Benchmark]: CACSL2BoogieTranslator took 774.62 ms. Allocated memory was 254.3 MB in the beginning and 321.4 MB in the end (delta: 67.1 MB). Free memory was 209.6 MB in the beginning and 271.6 MB in the end (delta: -62.0 MB). Peak memory consumption was 33.2 MB. Max. memory is 14.2 GB. [2020-10-16 04:51:17,594 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.02 ms. Allocated memory is still 321.4 MB. Free memory was 271.6 MB in the beginning and 269.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 04:51:17,595 INFO L168 Benchmark]: Boogie Preprocessor took 41.13 ms. Allocated memory is still 321.4 MB. Free memory was 269.1 MB in the beginning and 266.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 04:51:17,595 INFO L168 Benchmark]: RCFGBuilder took 2042.85 ms. Allocated memory was 321.4 MB in the beginning and 360.7 MB in the end (delta: 39.3 MB). Free memory was 266.6 MB in the beginning and 209.4 MB in the end (delta: 57.2 MB). Peak memory consumption was 99.6 MB. Max. memory is 14.2 GB. [2020-10-16 04:51:17,596 INFO L168 Benchmark]: TraceAbstraction took 12551.86 ms. Allocated memory was 360.7 MB in the beginning and 606.1 MB in the end (delta: 245.4 MB). Free memory was 206.2 MB in the beginning and 542.5 MB in the end (delta: -336.3 MB). Peak memory consumption was 223.6 MB. Max. memory is 14.2 GB. [2020-10-16 04:51:17,600 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.40 ms. Allocated memory is still 254.3 MB. Free memory is still 230.7 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 774.62 ms. Allocated memory was 254.3 MB in the beginning and 321.4 MB in the end (delta: 67.1 MB). Free memory was 209.6 MB in the beginning and 271.6 MB in the end (delta: -62.0 MB). Peak memory consumption was 33.2 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 68.02 ms. Allocated memory is still 321.4 MB. Free memory was 271.6 MB in the beginning and 269.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 41.13 ms. Allocated memory is still 321.4 MB. Free memory was 269.1 MB in the beginning and 266.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2042.85 ms. Allocated memory was 321.4 MB in the beginning and 360.7 MB in the end (delta: 39.3 MB). Free memory was 266.6 MB in the beginning and 209.4 MB in the end (delta: 57.2 MB). Peak memory consumption was 99.6 MB. Max. memory is 14.2 GB. * TraceAbstraction took 12551.86 ms. Allocated memory was 360.7 MB in the beginning and 606.1 MB in the end (delta: 245.4 MB). Free memory was 206.2 MB in the beginning and 542.5 MB in the end (delta: -336.3 MB). Peak memory consumption was 223.6 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1728 VarBasedMoverChecksPositive, 75 VarBasedMoverChecksNegative, 27 SemBasedMoverChecksPositive, 48 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 206 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 6.8s, 120 PlacesBefore, 42 PlacesAfterwards, 109 TransitionsBefore, 30 TransitionsAfterwards, 2540 CoEnabledTransitionPairs, 6 FixpointIterations, 38 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 92 TotalNumberOfCompositions, 6368 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p0_EAX = 0; [L703] 0 int __unbuffered_p1_EAX = 0; [L705] 0 int __unbuffered_p3_EAX = 0; [L707] 0 int __unbuffered_p3_EBX = 0; [L709] 0 int a = 0; [L711] 0 int b = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff0_thd4; [L727] 0 _Bool z$r_buff1_thd0; [L728] 0 _Bool z$r_buff1_thd1; [L729] 0 _Bool z$r_buff1_thd2; [L730] 0 _Bool z$r_buff1_thd3; [L731] 0 _Bool z$r_buff1_thd4; [L732] 0 _Bool z$read_delayed; [L733] 0 int *z$read_delayed_var; [L734] 0 int z$w_buff0; [L735] 0 _Bool z$w_buff0_used; [L736] 0 int z$w_buff1; [L737] 0 _Bool z$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L837] 0 pthread_t t1141; [L838] FCALL, FORK 0 pthread_create(&t1141, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] 0 pthread_t t1142; [L840] FCALL, FORK 0 pthread_create(&t1142, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L841] 0 pthread_t t1143; [L842] FCALL, FORK 0 pthread_create(&t1143, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 0 pthread_t t1144; [L844] FCALL, FORK 0 pthread_create(&t1144, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 4 z$w_buff1 = z$w_buff0 [L794] 4 z$w_buff0 = 2 [L795] 4 z$w_buff1_used = z$w_buff0_used [L796] 4 z$w_buff0_used = (_Bool)1 [L7] COND FALSE 4 !(!expression) [L798] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L799] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L800] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L801] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L802] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L803] 4 z$r_buff0_thd4 = (_Bool)1 [L806] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L743] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L761] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L779] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L779] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L779] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L780] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L780] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L781] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L781] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L782] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L782] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L783] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L783] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L766] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L768] 2 return 0; [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L786] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L788] 3 return 0; [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L815] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L815] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L816] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L817] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L817] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L818] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L818] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L819] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L819] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L822] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L824] 4 return 0; [L846] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L850] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L852] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L852] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L853] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L854] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L854] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L857] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L858] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L859] 0 z$flush_delayed = weak$$choice2 [L860] 0 z$mem_tmp = z [L861] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1 [L861] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L861] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L862] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L862] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L863] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L863] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L863] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1 [L863] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L863] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L863] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L864] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L864] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L864] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L864] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L865] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L865] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L866] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L866] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L867] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L868] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L869] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L869] 0 z = z$flush_delayed ? z$mem_tmp : z [L870] 0 z$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 112 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 12.2s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.9s, HoareTripleCheckerStatistics: 59 SDtfs, 104 SDslu, 76 SDs, 0 SdLazy, 459 SolverSat, 149 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=527occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 295 NumberOfCodeBlocks, 295 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 254 ConstructedInterpolants, 0 QuantifiedInterpolants, 33091 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...