/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/mix045_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 04:51:53,786 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 04:51:53,790 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 04:51:53,830 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 04:51:53,830 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 04:51:53,842 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 04:51:53,843 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 04:51:53,847 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 04:51:53,850 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 04:51:53,852 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 04:51:53,853 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 04:51:53,857 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 04:51:53,857 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 04:51:53,861 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 04:51:53,863 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 04:51:53,864 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 04:51:53,866 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 04:51:53,867 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 04:51:53,869 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 04:51:53,875 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 04:51:53,879 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 04:51:53,880 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 04:51:53,882 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 04:51:53,883 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 04:51:53,887 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 04:51:53,888 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 04:51:53,888 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 04:51:53,891 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 04:51:53,891 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 04:51:53,892 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 04:51:53,892 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 04:51:53,893 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 04:51:53,894 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 04:51:53,896 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 04:51:53,897 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 04:51:53,897 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 04:51:53,898 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 04:51:53,898 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 04:51:53,898 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 04:51:53,899 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 04:51:53,901 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 04:51:53,901 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:53,943 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 04:51:53,943 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 04:51:53,945 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 04:51:53,945 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 04:51:53,946 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 04:51:53,946 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 04:51:53,946 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 04:51:53,947 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 04:51:53,947 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 04:51:53,947 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 04:51:53,948 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 04:51:53,948 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 04:51:53,948 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 04:51:53,949 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 04:51:53,949 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 04:51:53,949 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 04:51:53,949 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 04:51:53,950 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 04:51:53,950 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 04:51:53,950 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 04:51:53,950 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 04:51:53,950 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 04:51:53,951 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 04:51:53,951 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 04:51:53,951 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 04:51:53,951 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 04:51:53,951 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 04:51:53,952 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 04:51:53,952 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 04:51:54,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 04:51:54,249 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 04:51:54,253 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 04:51:54,254 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 04:51:54,255 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 04:51:54,256 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_rmo.opt.i [2020-10-16 04:51:54,337 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1e8345da/bb1a6d4222b040c484328dce430161eb/FLAGad9e68b32 [2020-10-16 04:51:54,900 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 04:51:54,900 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_rmo.opt.i [2020-10-16 04:51:54,925 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1e8345da/bb1a6d4222b040c484328dce430161eb/FLAGad9e68b32 [2020-10-16 04:51:55,155 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1e8345da/bb1a6d4222b040c484328dce430161eb [2020-10-16 04:51:55,165 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 04:51:55,166 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 04:51:55,167 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 04:51:55,167 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 04:51:55,171 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 04:51:55,172 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:51:55" (1/1) ... [2020-10-16 04:51:55,175 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77bf07c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:51:55, skipping insertion in model container [2020-10-16 04:51:55,176 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:51:55" (1/1) ... [2020-10-16 04:51:55,184 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 04:51:55,247 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 04:51:55,804 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:51:55,817 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 04:51:55,875 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:51:55,955 INFO L208 MainTranslator]: Completed translation [2020-10-16 04:51:55,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:51:55 WrapperNode [2020-10-16 04:51:55,956 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 04:51:55,956 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 04:51:55,957 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 04:51:55,957 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 04:51:55,966 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:55" (1/1) ... [2020-10-16 04:51:55,985 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:55" (1/1) ... [2020-10-16 04:51:56,028 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 04:51:56,028 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 04:51:56,028 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 04:51:56,029 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 04:51:56,039 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:55" (1/1) ... [2020-10-16 04:51:56,039 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:55" (1/1) ... [2020-10-16 04:51:56,044 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:55" (1/1) ... [2020-10-16 04:51:56,044 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:55" (1/1) ... [2020-10-16 04:51:56,057 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:55" (1/1) ... [2020-10-16 04:51:56,064 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:55" (1/1) ... [2020-10-16 04:51:56,075 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:55" (1/1) ... [2020-10-16 04:51:56,086 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 04:51:56,088 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 04:51:56,088 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 04:51:56,088 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 04:51:56,091 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:51:55" (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:56,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 04:51:56,152 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 04:51:56,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 04:51:56,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 04:51:56,152 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 04:51:56,152 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 04:51:56,152 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 04:51:56,152 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 04:51:56,153 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 04:51:56,153 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 04:51:56,153 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 04:51:56,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 04:51:56,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 04:51:56,155 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:58,078 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 04:51:58,079 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 04:51:58,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:51:58 BoogieIcfgContainer [2020-10-16 04:51:58,081 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 04:51:58,082 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 04:51:58,083 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 04:51:58,086 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 04:51:58,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 04:51:55" (1/3) ... [2020-10-16 04:51:58,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4127d02b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:51:58, skipping insertion in model container [2020-10-16 04:51:58,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:51:55" (2/3) ... [2020-10-16 04:51:58,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4127d02b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:51:58, skipping insertion in model container [2020-10-16 04:51:58,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:51:58" (3/3) ... [2020-10-16 04:51:58,090 INFO L111 eAbstractionObserver]: Analyzing ICFG mix045_rmo.opt.i [2020-10-16 04:51:58,103 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 04:51:58,111 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 04:51:58,112 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 04:51:58,143 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,144 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,144 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,144 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,145 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,145 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,146 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,146 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,146 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,146 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,147 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,147 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,147 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,147 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,147 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,147 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,148 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,148 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,149 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,149 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,149 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,150 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,150 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,150 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,151 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,151 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,151 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,152 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,152 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,152 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,152 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,152 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,153 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,153 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,153 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,154 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,158 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,158 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,159 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,159 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,162 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,162 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,162 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,162 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,163 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,163 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,163 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,163 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,164 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,164 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,168 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,168 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,169 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,169 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,169 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,169 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,169 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,170 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,170 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,170 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,170 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,171 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:58,190 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 04:51:58,214 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 04:51:58,214 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 04:51:58,215 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 04:51:58,215 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 04:51:58,215 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 04:51:58,215 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 04:51:58,215 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 04:51:58,215 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 04:51:58,231 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 103 places, 95 transitions, 205 flow [2020-10-16 04:51:58,281 INFO L129 PetriNetUnfolder]: 2/92 cut-off events. [2020-10-16 04:51:58,282 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:51:58,287 INFO L80 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 92 events. 2/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2020-10-16 04:51:58,288 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 95 transitions, 205 flow [2020-10-16 04:51:58,295 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 92 transitions, 193 flow [2020-10-16 04:51:58,298 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 04:51:58,301 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 193 flow [2020-10-16 04:51:58,305 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 193 flow [2020-10-16 04:51:58,306 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 193 flow [2020-10-16 04:51:58,329 INFO L129 PetriNetUnfolder]: 2/92 cut-off events. [2020-10-16 04:51:58,330 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:51:58,331 INFO L80 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 92 events. 2/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2020-10-16 04:51:58,334 INFO L117 LiptonReduction]: Number of co-enabled transitions 1692 [2020-10-16 04:51:58,455 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 04:51:58,456 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:58,458 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 04:51:58,459 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:58,493 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 04:51:58,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:58,496 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 04:51:58,496 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:58,848 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 04:51:58,848 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:58,850 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 04:51:58,851 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:58,875 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 04:51:58,875 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:58,877 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 04:51:58,878 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:00,077 WARN L193 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-10-16 04:52:00,097 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-16 04:52:00,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:00,099 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 04:52:00,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:00,978 WARN L193 SmtUtils]: Spent 874.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 125 [2020-10-16 04:52:01,046 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:52:01,049 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:01,850 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:01,850 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:01,852 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:01,852 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:01,855 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:01,856 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:52:01,859 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:52:01,859 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:52:01,887 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:52:01,888 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:01,889 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:01,889 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:01,893 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:01,893 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:52:01,896 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:52:01,897 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:52:02,075 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:52:02,075 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:02,185 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:52:02,186 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:02,187 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:02,188 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:02,190 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:02,190 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:52:02,193 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:52:02,193 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:52:02,244 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:02,245 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:02,246 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:02,246 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:02,248 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:02,249 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:52:02,251 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:52:02,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:52:02,636 WARN L193 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-16 04:52:02,744 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 04:52:02,757 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:02,757 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:02,759 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:02,759 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:02,762 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:02,763 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:52:02,765 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:52:02,766 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:52:02,795 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:52:02,795 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:02,796 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:02,796 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:02,798 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:02,798 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:52:02,802 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:52:02,803 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:52:02,861 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:52:02,861 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:02,862 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:02,863 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:02,864 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:02,864 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:52:02,867 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:52:02,868 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:52:02,883 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:52:02,884 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:02,885 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:02,885 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:02,887 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:02,889 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:52:02,891 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:52:02,896 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:52:03,049 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:03,050 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:03,051 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:03,051 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:03,052 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:03,053 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:03,054 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:52:03,054 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:03,067 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:52:03,068 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:03,068 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:03,069 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:03,071 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:03,072 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:52:03,074 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:52:03,074 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:52:03,124 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:03,125 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:03,125 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:03,126 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:03,128 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:03,128 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:52:03,130 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:52:03,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:52:03,144 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:03,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:03,146 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:03,146 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:03,147 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:03,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:03,149 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:52:03,150 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:03,228 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:52:03,229 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:03,230 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:03,230 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:03,232 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:03,232 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:52:03,233 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:52:03,234 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:52:03,244 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:03,245 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:03,245 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:03,246 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:03,248 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:03,248 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:03,251 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:52:03,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:03,267 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:52:03,268 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:03,269 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:03,269 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:03,270 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:03,271 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:03,275 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:52:03,275 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:03,296 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:52:03,297 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:03,298 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:03,298 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:03,302 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:03,303 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:52:03,305 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:52:03,306 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:52:03,800 WARN L193 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2020-10-16 04:52:03,915 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-16 04:52:03,921 INFO L132 LiptonReduction]: Checked pairs total: 4043 [2020-10-16 04:52:03,921 INFO L134 LiptonReduction]: Total number of compositions: 78 [2020-10-16 04:52:03,924 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5629 [2020-10-16 04:52:03,932 INFO L129 PetriNetUnfolder]: 0/14 cut-off events. [2020-10-16 04:52:03,932 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:52:03,933 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:52:03,933 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:52:03,934 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:52:03,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:52:03,940 INFO L82 PathProgramCache]: Analyzing trace with hash 606769950, now seen corresponding path program 1 times [2020-10-16 04:52:03,950 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:52:03,950 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144071127] [2020-10-16 04:52:03,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:52:04,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:52:04,241 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:52:04,242 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144071127] [2020-10-16 04:52:04,242 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:52:04,243 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:52:04,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572772714] [2020-10-16 04:52:04,253 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:52:04,253 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:52:04,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:52:04,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:52:04,270 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 173 [2020-10-16 04:52:04,272 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states. [2020-10-16 04:52:04,272 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:52:04,272 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 173 [2020-10-16 04:52:04,274 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:52:04,334 INFO L129 PetriNetUnfolder]: 16/65 cut-off events. [2020-10-16 04:52:04,334 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:52:04,335 INFO L80 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 65 events. 16/65 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 209 event pairs, 6 based on Foata normal form. 6/62 useless extension candidates. Maximal degree in co-relation 100. Up to 27 conditions per place. [2020-10-16 04:52:04,337 INFO L132 encePairwiseOnDemand]: 169/173 looper letters, 7 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2020-10-16 04:52:04,337 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 26 transitions, 79 flow [2020-10-16 04:52:04,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:52:04,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:52:04,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 459 transitions. [2020-10-16 04:52:04,356 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.884393063583815 [2020-10-16 04:52:04,356 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 459 transitions. [2020-10-16 04:52:04,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 459 transitions. [2020-10-16 04:52:04,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:52:04,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 459 transitions. [2020-10-16 04:52:04,367 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:52:04,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:52:04,375 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:52:04,377 INFO L185 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 459 transitions. [2020-10-16 04:52:04,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 26 transitions, 79 flow [2020-10-16 04:52:04,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 26 transitions, 76 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-16 04:52:04,384 INFO L241 Difference]: Finished difference. Result has 32 places, 23 transitions, 56 flow [2020-10-16 04:52:04,387 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=32, PETRI_TRANSITIONS=23} [2020-10-16 04:52:04,388 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2020-10-16 04:52:04,388 INFO L481 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 56 flow [2020-10-16 04:52:04,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:52:04,388 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:52:04,388 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:52:04,389 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 04:52:04,389 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:52:04,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:52:04,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1232015982, now seen corresponding path program 1 times [2020-10-16 04:52:04,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:52:04,390 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795387863] [2020-10-16 04:52:04,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:52:04,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:52:04,587 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:52:04,587 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795387863] [2020-10-16 04:52:04,588 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:52:04,588 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 04:52:04,589 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641473378] [2020-10-16 04:52:04,590 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:52:04,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:52:04,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:52:04,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:52:04,595 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 173 [2020-10-16 04:52:04,596 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 56 flow. Second operand 4 states. [2020-10-16 04:52:04,596 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:52:04,596 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 173 [2020-10-16 04:52:04,596 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:52:04,672 INFO L129 PetriNetUnfolder]: 6/42 cut-off events. [2020-10-16 04:52:04,672 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-10-16 04:52:04,672 INFO L80 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 42 events. 6/42 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 88 event pairs, 1 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 67. Up to 6 conditions per place. [2020-10-16 04:52:04,673 INFO L132 encePairwiseOnDemand]: 168/173 looper letters, 5 selfloop transitions, 2 changer transitions 6/29 dead transitions. [2020-10-16 04:52:04,673 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 29 transitions, 96 flow [2020-10-16 04:52:04,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:52:04,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:52:04,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 695 transitions. [2020-10-16 04:52:04,678 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8034682080924855 [2020-10-16 04:52:04,678 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 695 transitions. [2020-10-16 04:52:04,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 695 transitions. [2020-10-16 04:52:04,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:52:04,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 695 transitions. [2020-10-16 04:52:04,681 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:52:04,683 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:52:04,683 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:52:04,683 INFO L185 Difference]: Start difference. First operand has 32 places, 23 transitions, 56 flow. Second operand 5 states and 695 transitions. [2020-10-16 04:52:04,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 29 transitions, 96 flow [2020-10-16 04:52:04,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 29 transitions, 90 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:52:04,685 INFO L241 Difference]: Finished difference. Result has 37 places, 22 transitions, 62 flow [2020-10-16 04:52:04,685 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=62, PETRI_PLACES=37, PETRI_TRANSITIONS=22} [2020-10-16 04:52:04,686 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2020-10-16 04:52:04,686 INFO L481 AbstractCegarLoop]: Abstraction has has 37 places, 22 transitions, 62 flow [2020-10-16 04:52:04,686 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:52:04,686 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:52:04,686 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:52:04,686 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 04:52:04,687 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:52:04,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:52:04,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1443744297, now seen corresponding path program 1 times [2020-10-16 04:52:04,687 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:52:04,688 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474594306] [2020-10-16 04:52:04,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:52:04,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:52:04,800 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:52:04,801 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474594306] [2020-10-16 04:52:04,801 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:52:04,801 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:52:04,801 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645059714] [2020-10-16 04:52:04,802 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:52:04,802 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:52:04,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:52:04,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:52:04,804 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 173 [2020-10-16 04:52:04,805 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 22 transitions, 62 flow. Second operand 5 states. [2020-10-16 04:52:04,805 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:52:04,805 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 173 [2020-10-16 04:52:04,805 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:52:04,926 INFO L129 PetriNetUnfolder]: 89/216 cut-off events. [2020-10-16 04:52:04,926 INFO L130 PetriNetUnfolder]: For 54/54 co-relation queries the response was YES. [2020-10-16 04:52:04,928 INFO L80 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 216 events. 89/216 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1041 event pairs, 51 based on Foata normal form. 12/222 useless extension candidates. Maximal degree in co-relation 426. Up to 128 conditions per place. [2020-10-16 04:52:04,929 INFO L132 encePairwiseOnDemand]: 168/173 looper letters, 11 selfloop transitions, 3 changer transitions 8/35 dead transitions. [2020-10-16 04:52:04,930 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 35 transitions, 134 flow [2020-10-16 04:52:04,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:52:04,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:52:04,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 649 transitions. [2020-10-16 04:52:04,933 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7502890173410405 [2020-10-16 04:52:04,933 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 649 transitions. [2020-10-16 04:52:04,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 649 transitions. [2020-10-16 04:52:04,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:52:04,934 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 649 transitions. [2020-10-16 04:52:04,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:52:04,937 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:52:04,937 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:52:04,937 INFO L185 Difference]: Start difference. First operand has 37 places, 22 transitions, 62 flow. Second operand 5 states and 649 transitions. [2020-10-16 04:52:04,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 35 transitions, 134 flow [2020-10-16 04:52:04,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 35 transitions, 126 flow, removed 2 selfloop flow, removed 4 redundant places. [2020-10-16 04:52:04,940 INFO L241 Difference]: Finished difference. Result has 37 places, 24 transitions, 81 flow [2020-10-16 04:52:04,941 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=81, PETRI_PLACES=37, PETRI_TRANSITIONS=24} [2020-10-16 04:52:04,941 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2020-10-16 04:52:04,941 INFO L481 AbstractCegarLoop]: Abstraction has has 37 places, 24 transitions, 81 flow [2020-10-16 04:52:04,941 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:52:04,941 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:52:04,941 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:52:04,942 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 04:52:04,942 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:52:04,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:52:04,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1303783391, now seen corresponding path program 1 times [2020-10-16 04:52:04,942 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:52:04,943 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538226749] [2020-10-16 04:52:04,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:52:04,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:52:05,077 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:52:05,078 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538226749] [2020-10-16 04:52:05,078 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:52:05,078 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:52:05,078 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371687974] [2020-10-16 04:52:05,079 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 04:52:05,079 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:52:05,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 04:52:05,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 04:52:05,081 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 173 [2020-10-16 04:52:05,081 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 24 transitions, 81 flow. Second operand 6 states. [2020-10-16 04:52:05,082 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:52:05,082 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 173 [2020-10-16 04:52:05,082 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:52:05,203 INFO L129 PetriNetUnfolder]: 68/183 cut-off events. [2020-10-16 04:52:05,203 INFO L130 PetriNetUnfolder]: For 104/104 co-relation queries the response was YES. [2020-10-16 04:52:05,205 INFO L80 FinitePrefix]: Finished finitePrefix Result has 406 conditions, 183 events. 68/183 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 886 event pairs, 39 based on Foata normal form. 13/181 useless extension candidates. Maximal degree in co-relation 393. Up to 98 conditions per place. [2020-10-16 04:52:05,207 INFO L132 encePairwiseOnDemand]: 167/173 looper letters, 9 selfloop transitions, 5 changer transitions 6/36 dead transitions. [2020-10-16 04:52:05,207 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 36 transitions, 149 flow [2020-10-16 04:52:05,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 04:52:05,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 04:52:05,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 766 transitions. [2020-10-16 04:52:05,211 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7379576107899807 [2020-10-16 04:52:05,212 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 766 transitions. [2020-10-16 04:52:05,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 766 transitions. [2020-10-16 04:52:05,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:52:05,212 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 766 transitions. [2020-10-16 04:52:05,214 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 04:52:05,216 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 04:52:05,216 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 04:52:05,216 INFO L185 Difference]: Start difference. First operand has 37 places, 24 transitions, 81 flow. Second operand 6 states and 766 transitions. [2020-10-16 04:52:05,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 36 transitions, 149 flow [2020-10-16 04:52:05,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 36 transitions, 144 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 04:52:05,219 INFO L241 Difference]: Finished difference. Result has 42 places, 28 transitions, 114 flow [2020-10-16 04:52:05,219 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=114, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2020-10-16 04:52:05,219 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 8 predicate places. [2020-10-16 04:52:05,219 INFO L481 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 114 flow [2020-10-16 04:52:05,219 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 04:52:05,219 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:52:05,220 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:52:05,220 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 04:52:05,220 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:52:05,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:52:05,220 INFO L82 PathProgramCache]: Analyzing trace with hash -601802575, now seen corresponding path program 1 times [2020-10-16 04:52:05,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:52:05,221 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65452278] [2020-10-16 04:52:05,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:52:05,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:52:05,371 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:52:05,372 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65452278] [2020-10-16 04:52:05,372 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:52:05,372 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:52:05,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294907107] [2020-10-16 04:52:05,373 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:52:05,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:52:05,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:52:05,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:52:05,375 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 173 [2020-10-16 04:52:05,376 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 114 flow. Second operand 7 states. [2020-10-16 04:52:05,376 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:52:05,376 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 173 [2020-10-16 04:52:05,377 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:52:05,554 INFO L129 PetriNetUnfolder]: 77/202 cut-off events. [2020-10-16 04:52:05,555 INFO L130 PetriNetUnfolder]: For 233/237 co-relation queries the response was YES. [2020-10-16 04:52:05,557 INFO L80 FinitePrefix]: Finished finitePrefix Result has 574 conditions, 202 events. 77/202 cut-off events. For 233/237 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1000 event pairs, 2 based on Foata normal form. 10/205 useless extension candidates. Maximal degree in co-relation 557. Up to 93 conditions per place. [2020-10-16 04:52:05,569 INFO L132 encePairwiseOnDemand]: 166/173 looper letters, 12 selfloop transitions, 6 changer transitions 5/39 dead transitions. [2020-10-16 04:52:05,569 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 39 transitions, 200 flow [2020-10-16 04:52:05,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:52:05,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:52:05,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 891 transitions. [2020-10-16 04:52:05,578 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7357555739058629 [2020-10-16 04:52:05,578 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 891 transitions. [2020-10-16 04:52:05,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 891 transitions. [2020-10-16 04:52:05,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:52:05,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 891 transitions. [2020-10-16 04:52:05,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:52:05,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:52:05,584 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:52:05,584 INFO L185 Difference]: Start difference. First operand has 42 places, 28 transitions, 114 flow. Second operand 7 states and 891 transitions. [2020-10-16 04:52:05,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 39 transitions, 200 flow [2020-10-16 04:52:05,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 39 transitions, 198 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-16 04:52:05,588 INFO L241 Difference]: Finished difference. Result has 48 places, 30 transitions, 149 flow [2020-10-16 04:52:05,588 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=149, PETRI_PLACES=48, PETRI_TRANSITIONS=30} [2020-10-16 04:52:05,588 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 14 predicate places. [2020-10-16 04:52:05,588 INFO L481 AbstractCegarLoop]: Abstraction has has 48 places, 30 transitions, 149 flow [2020-10-16 04:52:05,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:52:05,589 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:52:05,589 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:52:05,589 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 04:52:05,589 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:52:05,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:52:05,590 INFO L82 PathProgramCache]: Analyzing trace with hash 164070705, now seen corresponding path program 2 times [2020-10-16 04:52:05,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:52:05,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132091401] [2020-10-16 04:52:05,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:52:05,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:52:05,675 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:52:05,675 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132091401] [2020-10-16 04:52:05,676 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:52:05,679 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:52:05,680 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623579721] [2020-10-16 04:52:05,680 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 04:52:05,680 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:52:05,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 04:52:05,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 04:52:05,683 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 173 [2020-10-16 04:52:05,684 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 30 transitions, 149 flow. Second operand 6 states. [2020-10-16 04:52:05,684 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:52:05,684 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 173 [2020-10-16 04:52:05,684 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:52:05,835 INFO L129 PetriNetUnfolder]: 71/200 cut-off events. [2020-10-16 04:52:05,836 INFO L130 PetriNetUnfolder]: For 463/475 co-relation queries the response was YES. [2020-10-16 04:52:05,837 INFO L80 FinitePrefix]: Finished finitePrefix Result has 708 conditions, 200 events. 71/200 cut-off events. For 463/475 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1014 event pairs, 18 based on Foata normal form. 22/215 useless extension candidates. Maximal degree in co-relation 687. Up to 88 conditions per place. [2020-10-16 04:52:05,840 INFO L132 encePairwiseOnDemand]: 167/173 looper letters, 12 selfloop transitions, 8 changer transitions 5/41 dead transitions. [2020-10-16 04:52:05,840 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 41 transitions, 285 flow [2020-10-16 04:52:05,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 04:52:05,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 04:52:05,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 812 transitions. [2020-10-16 04:52:05,843 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7822736030828517 [2020-10-16 04:52:05,843 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 812 transitions. [2020-10-16 04:52:05,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 812 transitions. [2020-10-16 04:52:05,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:52:05,844 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 812 transitions. [2020-10-16 04:52:05,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 04:52:05,848 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 04:52:05,848 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 04:52:05,848 INFO L185 Difference]: Start difference. First operand has 48 places, 30 transitions, 149 flow. Second operand 6 states and 812 transitions. [2020-10-16 04:52:05,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 41 transitions, 285 flow [2020-10-16 04:52:05,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 41 transitions, 258 flow, removed 8 selfloop flow, removed 4 redundant places. [2020-10-16 04:52:05,853 INFO L241 Difference]: Finished difference. Result has 50 places, 33 transitions, 190 flow [2020-10-16 04:52:05,853 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=190, PETRI_PLACES=50, PETRI_TRANSITIONS=33} [2020-10-16 04:52:05,853 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 16 predicate places. [2020-10-16 04:52:05,853 INFO L481 AbstractCegarLoop]: Abstraction has has 50 places, 33 transitions, 190 flow [2020-10-16 04:52:05,854 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 04:52:05,854 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:52:05,854 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:52:05,854 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 04:52:05,854 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:52:05,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:52:05,855 INFO L82 PathProgramCache]: Analyzing trace with hash -272058796, now seen corresponding path program 1 times [2020-10-16 04:52:05,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:52:05,855 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031823852] [2020-10-16 04:52:05,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:52:05,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:52:05,972 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:52:05,972 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031823852] [2020-10-16 04:52:05,972 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:52:05,973 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:52:05,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866672278] [2020-10-16 04:52:05,973 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:52:05,973 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:52:05,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:52:05,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:52:05,975 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 173 [2020-10-16 04:52:05,976 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 33 transitions, 190 flow. Second operand 7 states. [2020-10-16 04:52:05,976 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:52:05,976 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 173 [2020-10-16 04:52:05,976 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:52:06,153 INFO L129 PetriNetUnfolder]: 74/213 cut-off events. [2020-10-16 04:52:06,153 INFO L130 PetriNetUnfolder]: For 844/888 co-relation queries the response was YES. [2020-10-16 04:52:06,155 INFO L80 FinitePrefix]: Finished finitePrefix Result has 868 conditions, 213 events. 74/213 cut-off events. For 844/888 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1147 event pairs, 12 based on Foata normal form. 24/230 useless extension candidates. Maximal degree in co-relation 846. Up to 108 conditions per place. [2020-10-16 04:52:06,157 INFO L132 encePairwiseOnDemand]: 165/173 looper letters, 16 selfloop transitions, 10 changer transitions 2/44 dead transitions. [2020-10-16 04:52:06,158 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 44 transitions, 343 flow [2020-10-16 04:52:06,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:52:06,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:52:06,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 874 transitions. [2020-10-16 04:52:06,161 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7217175887696119 [2020-10-16 04:52:06,161 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 874 transitions. [2020-10-16 04:52:06,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 874 transitions. [2020-10-16 04:52:06,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:52:06,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 874 transitions. [2020-10-16 04:52:06,164 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:52:06,167 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:52:06,167 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:52:06,167 INFO L185 Difference]: Start difference. First operand has 50 places, 33 transitions, 190 flow. Second operand 7 states and 874 transitions. [2020-10-16 04:52:06,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 44 transitions, 343 flow [2020-10-16 04:52:06,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 44 transitions, 296 flow, removed 17 selfloop flow, removed 5 redundant places. [2020-10-16 04:52:06,173 INFO L241 Difference]: Finished difference. Result has 53 places, 39 transitions, 254 flow [2020-10-16 04:52:06,174 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=254, PETRI_PLACES=53, PETRI_TRANSITIONS=39} [2020-10-16 04:52:06,174 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 19 predicate places. [2020-10-16 04:52:06,174 INFO L481 AbstractCegarLoop]: Abstraction has has 53 places, 39 transitions, 254 flow [2020-10-16 04:52:06,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:52:06,174 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:52:06,174 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:52:06,175 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 04:52:06,175 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:52:06,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:52:06,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1476054380, now seen corresponding path program 2 times [2020-10-16 04:52:06,175 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:52:06,176 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929771825] [2020-10-16 04:52:06,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:52:06,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:52:06,340 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:52:06,340 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929771825] [2020-10-16 04:52:06,340 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:52:06,340 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 04:52:06,341 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399462730] [2020-10-16 04:52:06,341 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 04:52:06,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:52:06,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 04:52:06,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-16 04:52:06,344 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 173 [2020-10-16 04:52:06,345 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 39 transitions, 254 flow. Second operand 8 states. [2020-10-16 04:52:06,346 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:52:06,346 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 173 [2020-10-16 04:52:06,346 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:52:06,590 INFO L129 PetriNetUnfolder]: 69/204 cut-off events. [2020-10-16 04:52:06,590 INFO L130 PetriNetUnfolder]: For 714/764 co-relation queries the response was YES. [2020-10-16 04:52:06,593 INFO L80 FinitePrefix]: Finished finitePrefix Result has 863 conditions, 204 events. 69/204 cut-off events. For 714/764 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1052 event pairs, 4 based on Foata normal form. 22/219 useless extension candidates. Maximal degree in co-relation 840. Up to 76 conditions per place. [2020-10-16 04:52:06,595 INFO L132 encePairwiseOnDemand]: 167/173 looper letters, 19 selfloop transitions, 13 changer transitions 2/50 dead transitions. [2020-10-16 04:52:06,595 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 50 transitions, 414 flow [2020-10-16 04:52:06,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:52:06,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:52:06,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 867 transitions. [2020-10-16 04:52:06,598 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7159372419488026 [2020-10-16 04:52:06,599 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 867 transitions. [2020-10-16 04:52:06,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 867 transitions. [2020-10-16 04:52:06,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:52:06,600 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 867 transitions. [2020-10-16 04:52:06,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:52:06,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:52:06,604 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:52:06,604 INFO L185 Difference]: Start difference. First operand has 53 places, 39 transitions, 254 flow. Second operand 7 states and 867 transitions. [2020-10-16 04:52:06,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 50 transitions, 414 flow [2020-10-16 04:52:06,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 50 transitions, 380 flow, removed 10 selfloop flow, removed 4 redundant places. [2020-10-16 04:52:06,610 INFO L241 Difference]: Finished difference. Result has 56 places, 39 transitions, 273 flow [2020-10-16 04:52:06,610 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=273, PETRI_PLACES=56, PETRI_TRANSITIONS=39} [2020-10-16 04:52:06,610 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 22 predicate places. [2020-10-16 04:52:06,611 INFO L481 AbstractCegarLoop]: Abstraction has has 56 places, 39 transitions, 273 flow [2020-10-16 04:52:06,611 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 04:52:06,611 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:52:06,611 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:52:06,611 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 04:52:06,611 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:52:06,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:52:06,612 INFO L82 PathProgramCache]: Analyzing trace with hash 749079410, now seen corresponding path program 1 times [2020-10-16 04:52:06,612 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:52:06,612 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570719041] [2020-10-16 04:52:06,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:52:06,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:52:06,664 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:52:06,664 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570719041] [2020-10-16 04:52:06,664 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:52:06,664 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:52:06,665 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227365550] [2020-10-16 04:52:06,665 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:52:06,665 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:52:06,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:52:06,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:52:06,667 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 173 [2020-10-16 04:52:06,667 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 39 transitions, 273 flow. Second operand 4 states. [2020-10-16 04:52:06,667 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:52:06,668 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 173 [2020-10-16 04:52:06,668 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:52:06,750 INFO L129 PetriNetUnfolder]: 122/323 cut-off events. [2020-10-16 04:52:06,751 INFO L130 PetriNetUnfolder]: For 774/859 co-relation queries the response was YES. [2020-10-16 04:52:06,753 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1076 conditions, 323 events. 122/323 cut-off events. For 774/859 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1929 event pairs, 35 based on Foata normal form. 79/377 useless extension candidates. Maximal degree in co-relation 1052. Up to 129 conditions per place. [2020-10-16 04:52:06,755 INFO L132 encePairwiseOnDemand]: 167/173 looper letters, 9 selfloop transitions, 8 changer transitions 0/49 dead transitions. [2020-10-16 04:52:06,756 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 49 transitions, 327 flow [2020-10-16 04:52:06,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:52:06,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:52:06,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 723 transitions. [2020-10-16 04:52:06,759 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8358381502890173 [2020-10-16 04:52:06,759 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 723 transitions. [2020-10-16 04:52:06,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 723 transitions. [2020-10-16 04:52:06,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:52:06,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 723 transitions. [2020-10-16 04:52:06,761 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:52:06,763 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:52:06,763 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:52:06,763 INFO L185 Difference]: Start difference. First operand has 56 places, 39 transitions, 273 flow. Second operand 5 states and 723 transitions. [2020-10-16 04:52:06,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 49 transitions, 327 flow [2020-10-16 04:52:06,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 49 transitions, 293 flow, removed 4 selfloop flow, removed 6 redundant places. [2020-10-16 04:52:06,768 INFO L241 Difference]: Finished difference. Result has 55 places, 46 transitions, 303 flow [2020-10-16 04:52:06,768 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=303, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2020-10-16 04:52:06,768 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 21 predicate places. [2020-10-16 04:52:06,769 INFO L481 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 303 flow [2020-10-16 04:52:06,769 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:52:06,769 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:52:06,769 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:52:06,769 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 04:52:06,769 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:52:06,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:52:06,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1793790058, now seen corresponding path program 1 times [2020-10-16 04:52:06,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:52:06,770 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883079836] [2020-10-16 04:52:06,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:52:06,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:52:06,830 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:52:06,831 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883079836] [2020-10-16 04:52:06,831 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:52:06,831 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:52:06,831 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336683295] [2020-10-16 04:52:06,832 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:52:06,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:52:06,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:52:06,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:52:06,834 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 173 [2020-10-16 04:52:06,834 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 303 flow. Second operand 5 states. [2020-10-16 04:52:06,834 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:52:06,834 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 173 [2020-10-16 04:52:06,834 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:52:06,930 INFO L129 PetriNetUnfolder]: 58/203 cut-off events. [2020-10-16 04:52:06,931 INFO L130 PetriNetUnfolder]: For 581/1018 co-relation queries the response was YES. [2020-10-16 04:52:06,932 INFO L80 FinitePrefix]: Finished finitePrefix Result has 785 conditions, 203 events. 58/203 cut-off events. For 581/1018 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1093 event pairs, 5 based on Foata normal form. 149/337 useless extension candidates. Maximal degree in co-relation 760. Up to 98 conditions per place. [2020-10-16 04:52:06,934 INFO L132 encePairwiseOnDemand]: 167/173 looper letters, 6 selfloop transitions, 15 changer transitions 3/54 dead transitions. [2020-10-16 04:52:06,934 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 54 transitions, 389 flow [2020-10-16 04:52:06,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:52:06,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:52:06,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1012 transitions. [2020-10-16 04:52:06,938 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8356729975227085 [2020-10-16 04:52:06,938 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1012 transitions. [2020-10-16 04:52:06,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1012 transitions. [2020-10-16 04:52:06,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:52:06,939 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1012 transitions. [2020-10-16 04:52:06,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:52:06,943 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:52:06,944 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:52:06,944 INFO L185 Difference]: Start difference. First operand has 55 places, 46 transitions, 303 flow. Second operand 7 states and 1012 transitions. [2020-10-16 04:52:06,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 54 transitions, 389 flow [2020-10-16 04:52:06,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 54 transitions, 385 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 04:52:06,948 INFO L241 Difference]: Finished difference. Result has 63 places, 51 transitions, 382 flow [2020-10-16 04:52:06,948 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=382, PETRI_PLACES=63, PETRI_TRANSITIONS=51} [2020-10-16 04:52:06,948 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 29 predicate places. [2020-10-16 04:52:06,949 INFO L481 AbstractCegarLoop]: Abstraction has has 63 places, 51 transitions, 382 flow [2020-10-16 04:52:06,949 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:52:06,949 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:52:06,949 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:52:06,949 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 04:52:06,949 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:52:06,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:52:06,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1881285488, now seen corresponding path program 1 times [2020-10-16 04:52:06,950 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:52:06,950 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485659056] [2020-10-16 04:52:06,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:52:06,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:52:07,001 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:52:07,002 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485659056] [2020-10-16 04:52:07,002 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:52:07,002 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:52:07,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902783985] [2020-10-16 04:52:07,003 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:52:07,003 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:52:07,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:52:07,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:52:07,005 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 173 [2020-10-16 04:52:07,005 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 51 transitions, 382 flow. Second operand 5 states. [2020-10-16 04:52:07,005 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:52:07,005 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 173 [2020-10-16 04:52:07,006 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:52:07,135 INFO L129 PetriNetUnfolder]: 122/366 cut-off events. [2020-10-16 04:52:07,135 INFO L130 PetriNetUnfolder]: For 1298/1583 co-relation queries the response was YES. [2020-10-16 04:52:07,138 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1601 conditions, 366 events. 122/366 cut-off events. For 1298/1583 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2360 event pairs, 8 based on Foata normal form. 33/375 useless extension candidates. Maximal degree in co-relation 1572. Up to 194 conditions per place. [2020-10-16 04:52:07,140 INFO L132 encePairwiseOnDemand]: 169/173 looper letters, 6 selfloop transitions, 1 changer transitions 2/55 dead transitions. [2020-10-16 04:52:07,140 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 55 transitions, 432 flow [2020-10-16 04:52:07,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:52:07,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:52:07,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 715 transitions. [2020-10-16 04:52:07,143 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8265895953757225 [2020-10-16 04:52:07,143 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 715 transitions. [2020-10-16 04:52:07,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 715 transitions. [2020-10-16 04:52:07,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:52:07,144 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 715 transitions. [2020-10-16 04:52:07,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:52:07,148 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:52:07,148 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:52:07,149 INFO L185 Difference]: Start difference. First operand has 63 places, 51 transitions, 382 flow. Second operand 5 states and 715 transitions. [2020-10-16 04:52:07,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 55 transitions, 432 flow [2020-10-16 04:52:07,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 55 transitions, 397 flow, removed 13 selfloop flow, removed 2 redundant places. [2020-10-16 04:52:07,157 INFO L241 Difference]: Finished difference. Result has 68 places, 51 transitions, 356 flow [2020-10-16 04:52:07,157 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=356, PETRI_PLACES=68, PETRI_TRANSITIONS=51} [2020-10-16 04:52:07,158 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 34 predicate places. [2020-10-16 04:52:07,158 INFO L481 AbstractCegarLoop]: Abstraction has has 68 places, 51 transitions, 356 flow [2020-10-16 04:52:07,158 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:52:07,158 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:52:07,159 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:52:07,159 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 04:52:07,159 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:52:07,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:52:07,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1152033024, now seen corresponding path program 2 times [2020-10-16 04:52:07,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:52:07,160 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860107647] [2020-10-16 04:52:07,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:52:07,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:52:07,294 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:52:07,295 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860107647] [2020-10-16 04:52:07,296 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:52:07,296 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:52:07,296 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766295583] [2020-10-16 04:52:07,297 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:52:07,297 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:52:07,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:52:07,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:52:07,299 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 173 [2020-10-16 04:52:07,300 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 51 transitions, 356 flow. Second operand 4 states. [2020-10-16 04:52:07,300 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:52:07,300 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 173 [2020-10-16 04:52:07,300 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:52:07,390 INFO L129 PetriNetUnfolder]: 90/328 cut-off events. [2020-10-16 04:52:07,390 INFO L130 PetriNetUnfolder]: For 986/1050 co-relation queries the response was YES. [2020-10-16 04:52:07,392 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1244 conditions, 328 events. 90/328 cut-off events. For 986/1050 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2237 event pairs, 6 based on Foata normal form. 29/335 useless extension candidates. Maximal degree in co-relation 1212. Up to 97 conditions per place. [2020-10-16 04:52:07,394 INFO L132 encePairwiseOnDemand]: 169/173 looper letters, 5 selfloop transitions, 3 changer transitions 2/54 dead transitions. [2020-10-16 04:52:07,394 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 54 transitions, 404 flow [2020-10-16 04:52:07,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:52:07,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:52:07,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 726 transitions. [2020-10-16 04:52:07,397 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8393063583815029 [2020-10-16 04:52:07,397 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 726 transitions. [2020-10-16 04:52:07,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 726 transitions. [2020-10-16 04:52:07,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:52:07,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 726 transitions. [2020-10-16 04:52:07,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:52:07,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:52:07,402 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:52:07,402 INFO L185 Difference]: Start difference. First operand has 68 places, 51 transitions, 356 flow. Second operand 5 states and 726 transitions. [2020-10-16 04:52:07,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 54 transitions, 404 flow [2020-10-16 04:52:07,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 54 transitions, 391 flow, removed 6 selfloop flow, removed 3 redundant places. [2020-10-16 04:52:07,415 INFO L241 Difference]: Finished difference. Result has 70 places, 51 transitions, 364 flow [2020-10-16 04:52:07,416 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=364, PETRI_PLACES=70, PETRI_TRANSITIONS=51} [2020-10-16 04:52:07,416 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 36 predicate places. [2020-10-16 04:52:07,416 INFO L481 AbstractCegarLoop]: Abstraction has has 70 places, 51 transitions, 364 flow [2020-10-16 04:52:07,416 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:52:07,416 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:52:07,417 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:52:07,417 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 04:52:07,417 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:52:07,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:52:07,417 INFO L82 PathProgramCache]: Analyzing trace with hash -2089585592, now seen corresponding path program 1 times [2020-10-16 04:52:07,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:52:07,418 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670087724] [2020-10-16 04:52:07,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:52:07,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:52:07,504 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:52:07,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670087724] [2020-10-16 04:52:07,505 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:52:07,505 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:52:07,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74147943] [2020-10-16 04:52:07,506 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 04:52:07,506 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:52:07,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 04:52:07,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 04:52:07,507 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 173 [2020-10-16 04:52:07,508 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 51 transitions, 364 flow. Second operand 6 states. [2020-10-16 04:52:07,508 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:52:07,508 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 173 [2020-10-16 04:52:07,509 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:52:07,660 INFO L129 PetriNetUnfolder]: 69/257 cut-off events. [2020-10-16 04:52:07,660 INFO L130 PetriNetUnfolder]: For 833/1198 co-relation queries the response was YES. [2020-10-16 04:52:07,663 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1066 conditions, 257 events. 69/257 cut-off events. For 833/1198 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 1721 event pairs, 0 based on Foata normal form. 211/448 useless extension candidates. Maximal degree in co-relation 1036. Up to 90 conditions per place. [2020-10-16 04:52:07,665 INFO L132 encePairwiseOnDemand]: 167/173 looper letters, 2 selfloop transitions, 17 changer transitions 14/53 dead transitions. [2020-10-16 04:52:07,665 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 53 transitions, 420 flow [2020-10-16 04:52:07,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 04:52:07,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 04:52:07,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1295 transitions. [2020-10-16 04:52:07,672 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.831727681438664 [2020-10-16 04:52:07,672 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1295 transitions. [2020-10-16 04:52:07,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1295 transitions. [2020-10-16 04:52:07,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:52:07,674 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1295 transitions. [2020-10-16 04:52:07,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 04:52:07,681 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 04:52:07,681 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 04:52:07,682 INFO L185 Difference]: Start difference. First operand has 70 places, 51 transitions, 364 flow. Second operand 9 states and 1295 transitions. [2020-10-16 04:52:07,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 53 transitions, 420 flow [2020-10-16 04:52:07,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 53 transitions, 380 flow, removed 13 selfloop flow, removed 6 redundant places. [2020-10-16 04:52:07,687 INFO L241 Difference]: Finished difference. Result has 73 places, 39 transitions, 281 flow [2020-10-16 04:52:07,687 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=281, PETRI_PLACES=73, PETRI_TRANSITIONS=39} [2020-10-16 04:52:07,688 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 39 predicate places. [2020-10-16 04:52:07,688 INFO L481 AbstractCegarLoop]: Abstraction has has 73 places, 39 transitions, 281 flow [2020-10-16 04:52:07,688 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 04:52:07,688 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:52:07,689 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] [2020-10-16 04:52:07,689 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 04:52:07,689 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:52:07,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:52:07,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1689122923, now seen corresponding path program 1 times [2020-10-16 04:52:07,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:52:07,690 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874236028] [2020-10-16 04:52:07,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:52:07,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 04:52:07,732 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 04:52:07,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 04:52:07,772 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 04:52:07,815 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 04:52:07,815 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 04:52:07,816 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 04:52:07,837 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:52:07,837 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:07,839 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:52:07,839 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:07,839 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:52:07,839 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:07,840 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:52:07,840 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:07,840 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:52:07,840 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:07,840 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:52:07,841 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:07,841 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:52:07,841 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:07,842 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:52:07,842 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:07,842 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:52:07,843 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:07,843 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:52:07,843 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:07,843 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:52:07,844 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:07,844 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:52:07,844 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:07,846 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:52:07,846 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:07,846 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:52:07,846 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:07,847 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:52:07,847 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:07,847 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:52:07,847 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:07,847 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:52:07,848 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:07,848 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:52:07,848 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:07,849 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:52:07,849 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:07,849 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:52:07,849 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:07,849 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:52:07,849 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:07,850 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:52:07,850 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:07,850 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:52:07,850 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:07,850 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:52:07,851 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:07,851 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:52:07,851 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:07,851 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:52:07,851 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:07,851 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:52:07,851 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:07,852 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:52:07,852 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:07,852 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:52:07,852 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:07,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 04:52:07 BasicIcfg [2020-10-16 04:52:07,924 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 04:52:07,927 INFO L168 Benchmark]: Toolchain (without parser) took 12760.33 ms. Allocated memory was 252.7 MB in the beginning and 543.7 MB in the end (delta: 291.0 MB). Free memory was 207.1 MB in the beginning and 351.7 MB in the end (delta: -144.6 MB). Peak memory consumption was 146.4 MB. Max. memory is 14.2 GB. [2020-10-16 04:52:07,928 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 252.7 MB. Free memory was 230.8 MB in the beginning and 229.9 MB in the end (delta: 839.2 kB). Peak memory consumption was 839.2 kB. Max. memory is 14.2 GB. [2020-10-16 04:52:07,929 INFO L168 Benchmark]: CACSL2BoogieTranslator took 788.78 ms. Allocated memory was 252.7 MB in the beginning and 319.3 MB in the end (delta: 66.6 MB). Free memory was 207.1 MB in the beginning and 271.8 MB in the end (delta: -64.7 MB). Peak memory consumption was 34.6 MB. Max. memory is 14.2 GB. [2020-10-16 04:52:07,929 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.57 ms. Allocated memory is still 319.3 MB. Free memory was 271.8 MB in the beginning and 269.3 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:52:07,930 INFO L168 Benchmark]: Boogie Preprocessor took 57.65 ms. Allocated memory is still 319.3 MB. Free memory was 269.3 MB in the beginning and 266.8 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:52:07,931 INFO L168 Benchmark]: RCFGBuilder took 1993.18 ms. Allocated memory was 319.3 MB in the beginning and 359.7 MB in the end (delta: 40.4 MB). Free memory was 266.8 MB in the beginning and 216.2 MB in the end (delta: 50.6 MB). Peak memory consumption was 101.7 MB. Max. memory is 14.2 GB. [2020-10-16 04:52:07,932 INFO L168 Benchmark]: TraceAbstraction took 9842.11 ms. Allocated memory was 359.7 MB in the beginning and 543.7 MB in the end (delta: 184.0 MB). Free memory was 214.1 MB in the beginning and 351.7 MB in the end (delta: -137.6 MB). Peak memory consumption was 46.4 MB. Max. memory is 14.2 GB. [2020-10-16 04:52:07,937 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.27 ms. Allocated memory is still 252.7 MB. Free memory was 230.8 MB in the beginning and 229.9 MB in the end (delta: 839.2 kB). Peak memory consumption was 839.2 kB. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 788.78 ms. Allocated memory was 252.7 MB in the beginning and 319.3 MB in the end (delta: 66.6 MB). Free memory was 207.1 MB in the beginning and 271.8 MB in the end (delta: -64.7 MB). Peak memory consumption was 34.6 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 71.57 ms. Allocated memory is still 319.3 MB. Free memory was 271.8 MB in the beginning and 269.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 57.65 ms. Allocated memory is still 319.3 MB. Free memory was 269.3 MB in the beginning and 266.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 1993.18 ms. Allocated memory was 319.3 MB in the beginning and 359.7 MB in the end (delta: 40.4 MB). Free memory was 266.8 MB in the beginning and 216.2 MB in the end (delta: 50.6 MB). Peak memory consumption was 101.7 MB. Max. memory is 14.2 GB. * TraceAbstraction took 9842.11 ms. Allocated memory was 359.7 MB in the beginning and 543.7 MB in the end (delta: 184.0 MB). Free memory was 214.1 MB in the beginning and 351.7 MB in the end (delta: -137.6 MB). Peak memory consumption was 46.4 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1190 VarBasedMoverChecksPositive, 63 VarBasedMoverChecksNegative, 23 SemBasedMoverChecksPositive, 40 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 172 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 5.6s, 100 PlacesBefore, 34 PlacesAfterwards, 92 TransitionsBefore, 25 TransitionsAfterwards, 1692 CoEnabledTransitionPairs, 6 FixpointIterations, 33 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 78 TotalNumberOfCompositions, 4043 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p2_EAX = 0; [L702] 0 int __unbuffered_p2_EBX = 0; [L704] 0 int a = 0; [L705] 0 _Bool main$tmp_guard0; [L706] 0 _Bool main$tmp_guard1; [L708] 0 int x = 0; [L710] 0 int y = 0; [L711] 0 _Bool y$flush_delayed; [L712] 0 int y$mem_tmp; [L713] 0 _Bool y$r_buff0_thd0; [L714] 0 _Bool y$r_buff0_thd1; [L715] 0 _Bool y$r_buff0_thd2; [L716] 0 _Bool y$r_buff0_thd3; [L717] 0 _Bool y$r_buff1_thd0; [L718] 0 _Bool y$r_buff1_thd1; [L719] 0 _Bool y$r_buff1_thd2; [L720] 0 _Bool y$r_buff1_thd3; [L721] 0 _Bool y$read_delayed; [L722] 0 int *y$read_delayed_var; [L723] 0 int y$w_buff0; [L724] 0 _Bool y$w_buff0_used; [L725] 0 int y$w_buff1; [L726] 0 _Bool y$w_buff1_used; [L728] 0 int z = 0; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L812] 0 pthread_t t1208; [L813] FCALL, FORK 0 pthread_create(&t1208, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] 0 pthread_t t1209; [L815] FCALL, FORK 0 pthread_create(&t1209, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] 0 pthread_t t1210; [L817] FCALL, FORK 0 pthread_create(&t1210, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L769] 3 y$w_buff1 = y$w_buff0 [L770] 3 y$w_buff0 = 2 [L771] 3 y$w_buff1_used = y$w_buff0_used [L772] 3 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 3 !expression [L7] 3 __VERIFIER_error() [L774] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L775] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L776] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L777] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L778] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] 3 z = 1 [L784] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L734] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L737] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L752] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L755] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L755] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L755] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L756] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L756] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L757] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L757] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L758] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L758] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L759] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L759] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L790] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L792] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L794] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L742] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L744] 1 return 0; [L762] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 2 return 0; [L797] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 3 return 0; [L819] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L823] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L823] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L825] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L827] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L830] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L831] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L832] 0 y$flush_delayed = weak$$choice2 [L833] 0 y$mem_tmp = y [L834] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L834] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L835] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L835] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L836] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1 [L836] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L836] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L837] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L837] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L838] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L839] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L840] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L842] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L842] 0 y = y$flush_delayed ? y$mem_tmp : y [L843] 0 y$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 94 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: 9.6s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.7s, HoareTripleCheckerStatistics: 63 SDtfs, 51 SDslu, 66 SDs, 0 SdLazy, 315 SolverSat, 105 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=382occurred in iteration=10, 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.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 208 NumberOfCodeBlocks, 208 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 173 ConstructedInterpolants, 0 QuantifiedInterpolants, 16446 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...