./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi004_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_94af0725-af29-4ed4-b1d5-fcf08c5de711/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_94af0725-af29-4ed4-b1d5-fcf08c5de711/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_94af0725-af29-4ed4-b1d5-fcf08c5de711/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_94af0725-af29-4ed4-b1d5-fcf08c5de711/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi004_tso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_94af0725-af29-4ed4-b1d5-fcf08c5de711/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_94af0725-af29-4ed4-b1d5-fcf08c5de711/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7428687e693da3f402e553d86eaa28ca77c57a09 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:44:31,804 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:44:31,806 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:44:31,822 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:44:31,823 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:44:31,824 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:44:31,826 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:44:31,836 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:44:31,841 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:44:31,844 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:44:31,846 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:44:31,847 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:44:31,848 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:44:31,849 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:44:31,850 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:44:31,850 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:44:31,851 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:44:31,851 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:44:31,852 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:44:31,854 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:44:31,855 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:44:31,855 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:44:31,856 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:44:31,857 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:44:31,858 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:44:31,859 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:44:31,859 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:44:31,859 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:44:31,860 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:44:31,865 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:44:31,866 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:44:31,866 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:44:31,867 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:44:31,867 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:44:31,869 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:44:31,869 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:44:31,870 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:44:31,870 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:44:31,870 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:44:31,872 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:44:31,873 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:44:31,874 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_94af0725-af29-4ed4-b1d5-fcf08c5de711/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 21:44:31,897 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:44:31,899 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:44:31,901 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:44:31,901 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:44:31,901 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:44:31,901 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:44:31,902 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:44:31,902 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:44:31,902 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:44:31,902 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:44:31,902 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 21:44:31,903 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:44:31,903 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 21:44:31,903 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:44:31,903 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:44:31,903 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:44:31,904 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 21:44:31,904 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:44:31,904 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:44:31,904 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:44:31,904 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:44:31,905 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:44:31,905 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:44:31,905 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:44:31,905 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 21:44:31,905 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:44:31,906 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 21:44:31,906 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 21:44:31,906 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_94af0725-af29-4ed4-b1d5-fcf08c5de711/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7428687e693da3f402e553d86eaa28ca77c57a09 [2019-11-15 21:44:31,938 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:44:31,946 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:44:31,950 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:44:31,951 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:44:31,951 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:44:31,951 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_94af0725-af29-4ed4-b1d5-fcf08c5de711/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi004_tso.opt.i [2019-11-15 21:44:31,998 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_94af0725-af29-4ed4-b1d5-fcf08c5de711/bin/uautomizer/data/b35451011/a7208eea89ac4318acc8a885008627da/FLAG5ee4e651a [2019-11-15 21:44:32,514 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:44:32,517 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_94af0725-af29-4ed4-b1d5-fcf08c5de711/sv-benchmarks/c/pthread-wmm/rfi004_tso.opt.i [2019-11-15 21:44:32,539 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_94af0725-af29-4ed4-b1d5-fcf08c5de711/bin/uautomizer/data/b35451011/a7208eea89ac4318acc8a885008627da/FLAG5ee4e651a [2019-11-15 21:44:33,021 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_94af0725-af29-4ed4-b1d5-fcf08c5de711/bin/uautomizer/data/b35451011/a7208eea89ac4318acc8a885008627da [2019-11-15 21:44:33,023 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:44:33,024 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:44:33,025 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:44:33,026 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:44:33,030 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:44:33,031 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:44:33" (1/1) ... [2019-11-15 21:44:33,033 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c1ea15e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:44:33, skipping insertion in model container [2019-11-15 21:44:33,034 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:44:33" (1/1) ... [2019-11-15 21:44:33,041 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:44:33,101 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:44:33,488 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:44:33,500 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:44:33,598 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:44:33,680 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:44:33,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:44:33 WrapperNode [2019-11-15 21:44:33,681 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:44:33,681 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:44:33,682 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:44:33,682 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:44:33,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:44:33" (1/1) ... [2019-11-15 21:44:33,712 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:44:33" (1/1) ... [2019-11-15 21:44:33,739 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:44:33,739 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:44:33,740 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:44:33,740 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:44:33,746 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:44:33" (1/1) ... [2019-11-15 21:44:33,747 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:44:33" (1/1) ... [2019-11-15 21:44:33,751 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:44:33" (1/1) ... [2019-11-15 21:44:33,751 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:44:33" (1/1) ... [2019-11-15 21:44:33,762 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:44:33" (1/1) ... [2019-11-15 21:44:33,767 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:44:33" (1/1) ... [2019-11-15 21:44:33,770 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:44:33" (1/1) ... [2019-11-15 21:44:33,775 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:44:33,775 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:44:33,776 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:44:33,776 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:44:33,777 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:44:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_94af0725-af29-4ed4-b1d5-fcf08c5de711/bin/uautomizer/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 [2019-11-15 21:44:33,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 21:44:33,849 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-15 21:44:33,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 21:44:33,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:44:33,851 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-15 21:44:33,852 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-15 21:44:33,852 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-15 21:44:33,852 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-15 21:44:33,852 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-15 21:44:33,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:44:33,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:44:33,858 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-15 21:44:34,522 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:44:34,522 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 21:44:34,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:44:34 BoogieIcfgContainer [2019-11-15 21:44:34,523 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:44:34,524 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:44:34,524 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:44:34,526 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:44:34,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:44:33" (1/3) ... [2019-11-15 21:44:34,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2115d2bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:44:34, skipping insertion in model container [2019-11-15 21:44:34,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:44:33" (2/3) ... [2019-11-15 21:44:34,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2115d2bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:44:34, skipping insertion in model container [2019-11-15 21:44:34,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:44:34" (3/3) ... [2019-11-15 21:44:34,529 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi004_tso.opt.i [2019-11-15 21:44:34,585 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,585 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,586 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,586 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,586 WARN L315 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,586 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,586 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,587 WARN L315 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,587 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,587 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,587 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,588 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,588 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,588 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,588 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,589 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,589 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,589 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,589 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,589 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,590 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,590 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,590 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,591 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,591 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,591 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,591 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,592 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,592 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,592 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,592 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,593 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,593 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,593 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,593 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,594 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,594 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,594 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,595 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,595 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,595 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,596 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,596 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,597 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,597 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,597 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,598 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,598 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,598 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,599 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,599 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,599 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,599 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,600 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,600 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,600 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,600 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,600 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,601 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,601 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,601 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,601 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,602 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,602 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,602 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,602 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,602 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,603 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,604 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,604 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,604 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,609 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,609 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,609 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,609 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,610 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,610 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,610 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,610 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,611 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,611 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,611 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,611 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,612 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,612 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,612 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,612 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,613 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,613 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,613 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,613 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,613 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,614 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,614 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,615 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,615 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,615 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,615 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,615 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,616 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,616 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,616 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,616 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,617 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,617 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,617 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,617 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,618 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,618 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,618 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,618 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,619 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,619 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,619 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,619 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,619 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,620 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,620 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,620 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,620 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,621 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,621 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,621 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,621 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,622 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,622 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,622 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,622 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:44:34,628 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-15 21:44:34,628 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:44:34,635 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-15 21:44:34,645 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-15 21:44:34,661 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:44:34,662 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 21:44:34,662 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:44:34,662 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:44:34,662 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:44:34,662 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:44:34,662 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:44:34,663 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:44:34,674 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 130 places, 162 transitions [2019-11-15 21:44:36,522 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25976 states. [2019-11-15 21:44:36,523 INFO L276 IsEmpty]: Start isEmpty. Operand 25976 states. [2019-11-15 21:44:36,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 21:44:36,532 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:44:36,533 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:44:36,535 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:44:36,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:44:36,539 INFO L82 PathProgramCache]: Analyzing trace with hash 607370489, now seen corresponding path program 1 times [2019-11-15 21:44:36,545 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:44:36,545 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515161165] [2019-11-15 21:44:36,545 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:36,545 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:36,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:44:36,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:44:36,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:44:36,812 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515161165] [2019-11-15 21:44:36,813 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:44:36,813 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:44:36,814 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352151171] [2019-11-15 21:44:36,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:44:36,818 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:44:36,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:44:36,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:44:36,834 INFO L87 Difference]: Start difference. First operand 25976 states. Second operand 4 states. [2019-11-15 21:44:37,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:44:37,364 INFO L93 Difference]: Finished difference Result 26616 states and 102121 transitions. [2019-11-15 21:44:37,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:44:37,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-11-15 21:44:37,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:44:37,585 INFO L225 Difference]: With dead ends: 26616 [2019-11-15 21:44:37,585 INFO L226 Difference]: Without dead ends: 20360 [2019-11-15 21:44:37,587 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:44:37,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20360 states. [2019-11-15 21:44:38,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20360 to 20360. [2019-11-15 21:44:38,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20360 states. [2019-11-15 21:44:38,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20360 states to 20360 states and 78425 transitions. [2019-11-15 21:44:38,859 INFO L78 Accepts]: Start accepts. Automaton has 20360 states and 78425 transitions. Word has length 39 [2019-11-15 21:44:38,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:44:38,860 INFO L462 AbstractCegarLoop]: Abstraction has 20360 states and 78425 transitions. [2019-11-15 21:44:38,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:44:38,860 INFO L276 IsEmpty]: Start isEmpty. Operand 20360 states and 78425 transitions. [2019-11-15 21:44:38,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-15 21:44:38,876 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:44:38,876 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:44:38,877 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:44:38,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:44:38,877 INFO L82 PathProgramCache]: Analyzing trace with hash -885351668, now seen corresponding path program 1 times [2019-11-15 21:44:38,878 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:44:38,878 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427091409] [2019-11-15 21:44:38,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:38,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:38,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:44:38,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:44:39,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:44:39,006 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427091409] [2019-11-15 21:44:39,006 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:44:39,006 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:44:39,006 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876391360] [2019-11-15 21:44:39,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:44:39,008 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:44:39,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:44:39,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:44:39,008 INFO L87 Difference]: Start difference. First operand 20360 states and 78425 transitions. Second operand 5 states. [2019-11-15 21:44:40,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:44:40,177 INFO L93 Difference]: Finished difference Result 31838 states and 116042 transitions. [2019-11-15 21:44:40,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:44:40,177 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-11-15 21:44:40,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:44:40,310 INFO L225 Difference]: With dead ends: 31838 [2019-11-15 21:44:40,310 INFO L226 Difference]: Without dead ends: 31286 [2019-11-15 21:44:40,311 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:44:41,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31286 states. [2019-11-15 21:44:41,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31286 to 29705. [2019-11-15 21:44:41,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29705 states. [2019-11-15 21:44:41,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29705 states to 29705 states and 109519 transitions. [2019-11-15 21:44:41,745 INFO L78 Accepts]: Start accepts. Automaton has 29705 states and 109519 transitions. Word has length 47 [2019-11-15 21:44:41,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:44:41,747 INFO L462 AbstractCegarLoop]: Abstraction has 29705 states and 109519 transitions. [2019-11-15 21:44:41,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:44:41,747 INFO L276 IsEmpty]: Start isEmpty. Operand 29705 states and 109519 transitions. [2019-11-15 21:44:41,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 21:44:41,753 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:44:41,754 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:44:41,754 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:44:41,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:44:41,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1873873386, now seen corresponding path program 1 times [2019-11-15 21:44:41,755 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:44:41,755 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048903662] [2019-11-15 21:44:41,758 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:41,758 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:41,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:44:41,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:44:41,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:44:41,876 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048903662] [2019-11-15 21:44:41,876 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:44:41,876 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:44:41,877 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782426042] [2019-11-15 21:44:41,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:44:41,877 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:44:41,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:44:41,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:44:41,878 INFO L87 Difference]: Start difference. First operand 29705 states and 109519 transitions. Second operand 5 states. [2019-11-15 21:44:42,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:44:42,455 INFO L93 Difference]: Finished difference Result 38696 states and 139691 transitions. [2019-11-15 21:44:42,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:44:42,456 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-11-15 21:44:42,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:44:43,066 INFO L225 Difference]: With dead ends: 38696 [2019-11-15 21:44:43,067 INFO L226 Difference]: Without dead ends: 38248 [2019-11-15 21:44:43,068 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:44:43,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38248 states. [2019-11-15 21:44:43,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38248 to 32951. [2019-11-15 21:44:43,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32951 states. [2019-11-15 21:44:43,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32951 states to 32951 states and 120528 transitions. [2019-11-15 21:44:43,979 INFO L78 Accepts]: Start accepts. Automaton has 32951 states and 120528 transitions. Word has length 48 [2019-11-15 21:44:43,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:44:43,979 INFO L462 AbstractCegarLoop]: Abstraction has 32951 states and 120528 transitions. [2019-11-15 21:44:43,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:44:43,979 INFO L276 IsEmpty]: Start isEmpty. Operand 32951 states and 120528 transitions. [2019-11-15 21:44:43,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-15 21:44:43,988 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:44:43,988 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:44:43,989 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:44:43,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:44:43,989 INFO L82 PathProgramCache]: Analyzing trace with hash -317500932, now seen corresponding path program 1 times [2019-11-15 21:44:43,990 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:44:43,990 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740705751] [2019-11-15 21:44:43,990 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:43,990 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:43,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:44:44,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:44:44,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:44:44,054 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740705751] [2019-11-15 21:44:44,055 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:44:44,055 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:44:44,055 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834429769] [2019-11-15 21:44:44,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:44:44,055 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:44:44,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:44:44,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:44:44,056 INFO L87 Difference]: Start difference. First operand 32951 states and 120528 transitions. Second operand 3 states. [2019-11-15 21:44:44,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:44:44,882 INFO L93 Difference]: Finished difference Result 42412 states and 152019 transitions. [2019-11-15 21:44:44,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:44:44,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-15 21:44:44,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:44:45,028 INFO L225 Difference]: With dead ends: 42412 [2019-11-15 21:44:45,028 INFO L226 Difference]: Without dead ends: 42412 [2019-11-15 21:44:45,028 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:44:45,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42412 states. [2019-11-15 21:44:45,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42412 to 37665. [2019-11-15 21:44:45,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37665 states. [2019-11-15 21:44:46,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37665 states to 37665 states and 136332 transitions. [2019-11-15 21:44:46,042 INFO L78 Accepts]: Start accepts. Automaton has 37665 states and 136332 transitions. Word has length 50 [2019-11-15 21:44:46,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:44:46,042 INFO L462 AbstractCegarLoop]: Abstraction has 37665 states and 136332 transitions. [2019-11-15 21:44:46,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:44:46,043 INFO L276 IsEmpty]: Start isEmpty. Operand 37665 states and 136332 transitions. [2019-11-15 21:44:46,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-15 21:44:46,059 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:44:46,060 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:44:46,060 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:44:46,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:44:46,060 INFO L82 PathProgramCache]: Analyzing trace with hash 259150685, now seen corresponding path program 1 times [2019-11-15 21:44:46,061 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:44:46,061 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676912902] [2019-11-15 21:44:46,061 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:46,061 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:46,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:44:46,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:44:46,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:44:46,185 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676912902] [2019-11-15 21:44:46,185 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:44:46,185 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:44:46,186 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877126732] [2019-11-15 21:44:46,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:44:46,186 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:44:46,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:44:46,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:44:46,187 INFO L87 Difference]: Start difference. First operand 37665 states and 136332 transitions. Second operand 6 states. [2019-11-15 21:44:46,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:44:46,915 INFO L93 Difference]: Finished difference Result 48756 states and 172981 transitions. [2019-11-15 21:44:46,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 21:44:46,916 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-11-15 21:44:46,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:44:47,043 INFO L225 Difference]: With dead ends: 48756 [2019-11-15 21:44:47,043 INFO L226 Difference]: Without dead ends: 48236 [2019-11-15 21:44:47,043 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-11-15 21:44:47,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48236 states. [2019-11-15 21:44:48,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48236 to 38229. [2019-11-15 21:44:48,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38229 states. [2019-11-15 21:44:48,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38229 states to 38229 states and 138495 transitions. [2019-11-15 21:44:48,679 INFO L78 Accepts]: Start accepts. Automaton has 38229 states and 138495 transitions. Word has length 54 [2019-11-15 21:44:48,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:44:48,679 INFO L462 AbstractCegarLoop]: Abstraction has 38229 states and 138495 transitions. [2019-11-15 21:44:48,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:44:48,679 INFO L276 IsEmpty]: Start isEmpty. Operand 38229 states and 138495 transitions. [2019-11-15 21:44:48,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-15 21:44:48,697 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:44:48,698 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:44:48,698 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:44:48,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:44:48,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1550627923, now seen corresponding path program 1 times [2019-11-15 21:44:48,699 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:44:48,699 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286027488] [2019-11-15 21:44:48,699 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:48,699 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:48,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:44:48,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:44:48,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:44:48,804 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286027488] [2019-11-15 21:44:48,804 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:44:48,804 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:44:48,805 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242880385] [2019-11-15 21:44:48,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:44:48,805 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:44:48,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:44:48,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:44:48,806 INFO L87 Difference]: Start difference. First operand 38229 states and 138495 transitions. Second operand 6 states. [2019-11-15 21:44:49,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:44:49,563 INFO L93 Difference]: Finished difference Result 53005 states and 189571 transitions. [2019-11-15 21:44:49,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:44:49,563 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-11-15 21:44:49,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:44:49,679 INFO L225 Difference]: With dead ends: 53005 [2019-11-15 21:44:49,679 INFO L226 Difference]: Without dead ends: 52029 [2019-11-15 21:44:49,679 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:44:49,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52029 states. [2019-11-15 21:44:51,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52029 to 48782. [2019-11-15 21:44:51,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48782 states. [2019-11-15 21:44:51,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48782 states to 48782 states and 175226 transitions. [2019-11-15 21:44:51,429 INFO L78 Accepts]: Start accepts. Automaton has 48782 states and 175226 transitions. Word has length 54 [2019-11-15 21:44:51,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:44:51,430 INFO L462 AbstractCegarLoop]: Abstraction has 48782 states and 175226 transitions. [2019-11-15 21:44:51,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:44:51,430 INFO L276 IsEmpty]: Start isEmpty. Operand 48782 states and 175226 transitions. [2019-11-15 21:44:51,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-15 21:44:51,448 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:44:51,449 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:44:51,449 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:44:51,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:44:51,449 INFO L82 PathProgramCache]: Analyzing trace with hash 947388014, now seen corresponding path program 1 times [2019-11-15 21:44:51,449 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:44:51,450 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527476290] [2019-11-15 21:44:51,450 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:51,450 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:51,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:44:51,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:44:51,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:44:51,544 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527476290] [2019-11-15 21:44:51,545 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:44:51,545 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:44:51,545 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085698527] [2019-11-15 21:44:51,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:44:51,546 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:44:51,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:44:51,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:44:51,546 INFO L87 Difference]: Start difference. First operand 48782 states and 175226 transitions. Second operand 7 states. [2019-11-15 21:44:52,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:44:52,664 INFO L93 Difference]: Finished difference Result 70897 states and 244523 transitions. [2019-11-15 21:44:52,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 21:44:52,665 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-11-15 21:44:52,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:44:52,802 INFO L225 Difference]: With dead ends: 70897 [2019-11-15 21:44:52,802 INFO L226 Difference]: Without dead ends: 70897 [2019-11-15 21:44:52,802 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:44:53,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70897 states. [2019-11-15 21:44:57,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70897 to 57890. [2019-11-15 21:44:57,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57890 states. [2019-11-15 21:44:57,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57890 states to 57890 states and 203150 transitions. [2019-11-15 21:44:57,646 INFO L78 Accepts]: Start accepts. Automaton has 57890 states and 203150 transitions. Word has length 54 [2019-11-15 21:44:57,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:44:57,646 INFO L462 AbstractCegarLoop]: Abstraction has 57890 states and 203150 transitions. [2019-11-15 21:44:57,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:44:57,646 INFO L276 IsEmpty]: Start isEmpty. Operand 57890 states and 203150 transitions. [2019-11-15 21:44:57,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-15 21:44:57,658 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:44:57,658 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:44:57,658 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:44:57,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:44:57,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1834891695, now seen corresponding path program 1 times [2019-11-15 21:44:57,658 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:44:57,659 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982377265] [2019-11-15 21:44:57,659 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:57,659 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:57,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:44:57,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:44:57,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:44:57,729 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982377265] [2019-11-15 21:44:57,729 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:44:57,729 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:44:57,730 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041191481] [2019-11-15 21:44:57,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:44:57,730 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:44:57,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:44:57,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:44:57,731 INFO L87 Difference]: Start difference. First operand 57890 states and 203150 transitions. Second operand 4 states. [2019-11-15 21:44:57,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:44:57,797 INFO L93 Difference]: Finished difference Result 10860 states and 33395 transitions. [2019-11-15 21:44:57,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:44:57,798 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-11-15 21:44:57,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:44:57,811 INFO L225 Difference]: With dead ends: 10860 [2019-11-15 21:44:57,811 INFO L226 Difference]: Without dead ends: 9361 [2019-11-15 21:44:57,811 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:44:57,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9361 states. [2019-11-15 21:44:57,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9361 to 9313. [2019-11-15 21:44:57,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9313 states. [2019-11-15 21:44:57,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9313 states to 9313 states and 28345 transitions. [2019-11-15 21:44:57,931 INFO L78 Accepts]: Start accepts. Automaton has 9313 states and 28345 transitions. Word has length 54 [2019-11-15 21:44:57,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:44:57,931 INFO L462 AbstractCegarLoop]: Abstraction has 9313 states and 28345 transitions. [2019-11-15 21:44:57,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:44:57,931 INFO L276 IsEmpty]: Start isEmpty. Operand 9313 states and 28345 transitions. [2019-11-15 21:44:57,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-15 21:44:57,936 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:44:57,937 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:44:57,937 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:44:57,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:44:57,937 INFO L82 PathProgramCache]: Analyzing trace with hash -345267242, now seen corresponding path program 1 times [2019-11-15 21:44:57,938 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:44:57,938 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65224232] [2019-11-15 21:44:57,938 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:57,938 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:57,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:44:57,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:44:57,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:44:57,996 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65224232] [2019-11-15 21:44:57,997 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:44:57,997 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:44:57,998 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909617090] [2019-11-15 21:44:57,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:44:57,998 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:44:57,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:44:57,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:44:57,999 INFO L87 Difference]: Start difference. First operand 9313 states and 28345 transitions. Second operand 4 states. [2019-11-15 21:44:58,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:44:58,173 INFO L93 Difference]: Finished difference Result 10888 states and 33037 transitions. [2019-11-15 21:44:58,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:44:58,173 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-11-15 21:44:58,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:44:58,192 INFO L225 Difference]: With dead ends: 10888 [2019-11-15 21:44:58,192 INFO L226 Difference]: Without dead ends: 10888 [2019-11-15 21:44:58,193 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:44:58,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10888 states. [2019-11-15 21:44:58,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10888 to 9880. [2019-11-15 21:44:58,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9880 states. [2019-11-15 21:44:58,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9880 states to 9880 states and 30016 transitions. [2019-11-15 21:44:58,340 INFO L78 Accepts]: Start accepts. Automaton has 9880 states and 30016 transitions. Word has length 64 [2019-11-15 21:44:58,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:44:58,340 INFO L462 AbstractCegarLoop]: Abstraction has 9880 states and 30016 transitions. [2019-11-15 21:44:58,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:44:58,341 INFO L276 IsEmpty]: Start isEmpty. Operand 9880 states and 30016 transitions. [2019-11-15 21:44:58,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-15 21:44:58,346 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:44:58,346 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:44:58,347 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:44:58,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:44:58,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1397543093, now seen corresponding path program 1 times [2019-11-15 21:44:58,347 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:44:58,348 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438013118] [2019-11-15 21:44:58,348 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:58,348 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:58,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:44:58,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:44:58,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:44:58,489 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438013118] [2019-11-15 21:44:58,490 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:44:58,490 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:44:58,490 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643377361] [2019-11-15 21:44:58,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:44:58,491 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:44:58,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:44:58,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:44:58,492 INFO L87 Difference]: Start difference. First operand 9880 states and 30016 transitions. Second operand 6 states. [2019-11-15 21:44:58,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:44:58,991 INFO L93 Difference]: Finished difference Result 12786 states and 38226 transitions. [2019-11-15 21:44:58,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 21:44:58,992 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-11-15 21:44:58,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:44:59,014 INFO L225 Difference]: With dead ends: 12786 [2019-11-15 21:44:59,015 INFO L226 Difference]: Without dead ends: 12738 [2019-11-15 21:44:59,015 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-11-15 21:44:59,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12738 states. [2019-11-15 21:44:59,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12738 to 10619. [2019-11-15 21:44:59,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10619 states. [2019-11-15 21:44:59,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10619 states to 10619 states and 32069 transitions. [2019-11-15 21:44:59,159 INFO L78 Accepts]: Start accepts. Automaton has 10619 states and 32069 transitions. Word has length 64 [2019-11-15 21:44:59,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:44:59,159 INFO L462 AbstractCegarLoop]: Abstraction has 10619 states and 32069 transitions. [2019-11-15 21:44:59,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:44:59,159 INFO L276 IsEmpty]: Start isEmpty. Operand 10619 states and 32069 transitions. [2019-11-15 21:44:59,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 21:44:59,165 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:44:59,166 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:44:59,166 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:44:59,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:44:59,166 INFO L82 PathProgramCache]: Analyzing trace with hash -960211393, now seen corresponding path program 1 times [2019-11-15 21:44:59,167 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:44:59,167 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097114648] [2019-11-15 21:44:59,167 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:59,167 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:59,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:44:59,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:44:59,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:44:59,222 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097114648] [2019-11-15 21:44:59,222 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:44:59,222 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:44:59,222 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969845479] [2019-11-15 21:44:59,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:44:59,223 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:44:59,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:44:59,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:44:59,223 INFO L87 Difference]: Start difference. First operand 10619 states and 32069 transitions. Second operand 4 states. [2019-11-15 21:44:59,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:44:59,534 INFO L93 Difference]: Finished difference Result 13321 states and 39671 transitions. [2019-11-15 21:44:59,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:44:59,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-15 21:44:59,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:44:59,552 INFO L225 Difference]: With dead ends: 13321 [2019-11-15 21:44:59,552 INFO L226 Difference]: Without dead ends: 13321 [2019-11-15 21:44:59,553 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:44:59,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13321 states. [2019-11-15 21:44:59,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13321 to 12175. [2019-11-15 21:44:59,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12175 states. [2019-11-15 21:44:59,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12175 states to 12175 states and 36360 transitions. [2019-11-15 21:44:59,703 INFO L78 Accepts]: Start accepts. Automaton has 12175 states and 36360 transitions. Word has length 66 [2019-11-15 21:44:59,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:44:59,703 INFO L462 AbstractCegarLoop]: Abstraction has 12175 states and 36360 transitions. [2019-11-15 21:44:59,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:44:59,703 INFO L276 IsEmpty]: Start isEmpty. Operand 12175 states and 36360 transitions. [2019-11-15 21:44:59,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 21:44:59,712 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:44:59,713 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:44:59,713 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:44:59,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:44:59,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1257546560, now seen corresponding path program 1 times [2019-11-15 21:44:59,713 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:44:59,713 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902727655] [2019-11-15 21:44:59,714 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:59,714 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:59,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:44:59,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:44:59,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:44:59,754 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902727655] [2019-11-15 21:44:59,754 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:44:59,754 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:44:59,754 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946123159] [2019-11-15 21:44:59,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:44:59,755 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:44:59,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:44:59,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:44:59,755 INFO L87 Difference]: Start difference. First operand 12175 states and 36360 transitions. Second operand 3 states. [2019-11-15 21:44:59,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:44:59,937 INFO L93 Difference]: Finished difference Result 12701 states and 37765 transitions. [2019-11-15 21:44:59,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:44:59,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-15 21:44:59,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:44:59,954 INFO L225 Difference]: With dead ends: 12701 [2019-11-15 21:44:59,954 INFO L226 Difference]: Without dead ends: 12701 [2019-11-15 21:44:59,954 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:44:59,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12701 states. [2019-11-15 21:45:00,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12701 to 12463. [2019-11-15 21:45:00,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12463 states. [2019-11-15 21:45:00,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12463 states to 12463 states and 37124 transitions. [2019-11-15 21:45:00,127 INFO L78 Accepts]: Start accepts. Automaton has 12463 states and 37124 transitions. Word has length 66 [2019-11-15 21:45:00,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:45:00,128 INFO L462 AbstractCegarLoop]: Abstraction has 12463 states and 37124 transitions. [2019-11-15 21:45:00,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:45:00,128 INFO L276 IsEmpty]: Start isEmpty. Operand 12463 states and 37124 transitions. [2019-11-15 21:45:00,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 21:45:00,142 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:45:00,142 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:45:00,142 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:45:00,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:45:00,143 INFO L82 PathProgramCache]: Analyzing trace with hash -749438172, now seen corresponding path program 1 times [2019-11-15 21:45:00,143 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:45:00,143 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077181110] [2019-11-15 21:45:00,143 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:45:00,144 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:45:00,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:45:00,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:45:00,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:45:00,236 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077181110] [2019-11-15 21:45:00,237 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:45:00,237 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:45:00,237 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094521900] [2019-11-15 21:45:00,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:45:00,238 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:45:00,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:45:00,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:45:00,238 INFO L87 Difference]: Start difference. First operand 12463 states and 37124 transitions. Second operand 6 states. [2019-11-15 21:45:00,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:45:00,746 INFO L93 Difference]: Finished difference Result 13734 states and 40363 transitions. [2019-11-15 21:45:00,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:45:00,746 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-11-15 21:45:00,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:45:00,763 INFO L225 Difference]: With dead ends: 13734 [2019-11-15 21:45:00,763 INFO L226 Difference]: Without dead ends: 13734 [2019-11-15 21:45:00,763 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:45:00,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13734 states. [2019-11-15 21:45:01,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13734 to 13248. [2019-11-15 21:45:01,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13248 states. [2019-11-15 21:45:01,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13248 states to 13248 states and 39079 transitions. [2019-11-15 21:45:01,230 INFO L78 Accepts]: Start accepts. Automaton has 13248 states and 39079 transitions. Word has length 68 [2019-11-15 21:45:01,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:45:01,230 INFO L462 AbstractCegarLoop]: Abstraction has 13248 states and 39079 transitions. [2019-11-15 21:45:01,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:45:01,230 INFO L276 IsEmpty]: Start isEmpty. Operand 13248 states and 39079 transitions. [2019-11-15 21:45:01,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 21:45:01,242 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:45:01,242 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:45:01,242 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:45:01,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:45:01,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1468319781, now seen corresponding path program 1 times [2019-11-15 21:45:01,242 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:45:01,243 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989983798] [2019-11-15 21:45:01,243 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:45:01,243 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:45:01,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:45:01,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:45:01,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:45:01,349 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989983798] [2019-11-15 21:45:01,349 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:45:01,349 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:45:01,349 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724526328] [2019-11-15 21:45:01,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:45:01,350 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:45:01,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:45:01,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:45:01,350 INFO L87 Difference]: Start difference. First operand 13248 states and 39079 transitions. Second operand 6 states. [2019-11-15 21:45:01,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:45:01,708 INFO L93 Difference]: Finished difference Result 15571 states and 44589 transitions. [2019-11-15 21:45:01,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:45:01,709 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-11-15 21:45:01,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:45:01,738 INFO L225 Difference]: With dead ends: 15571 [2019-11-15 21:45:01,738 INFO L226 Difference]: Without dead ends: 15571 [2019-11-15 21:45:01,739 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:45:01,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15571 states. [2019-11-15 21:45:01,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15571 to 13822. [2019-11-15 21:45:01,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13822 states. [2019-11-15 21:45:01,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13822 states to 13822 states and 39929 transitions. [2019-11-15 21:45:01,988 INFO L78 Accepts]: Start accepts. Automaton has 13822 states and 39929 transitions. Word has length 68 [2019-11-15 21:45:01,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:45:01,988 INFO L462 AbstractCegarLoop]: Abstraction has 13822 states and 39929 transitions. [2019-11-15 21:45:01,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:45:01,988 INFO L276 IsEmpty]: Start isEmpty. Operand 13822 states and 39929 transitions. [2019-11-15 21:45:02,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 21:45:02,002 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:45:02,002 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:45:02,002 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:45:02,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:45:02,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1679670694, now seen corresponding path program 1 times [2019-11-15 21:45:02,003 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:45:02,003 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793079877] [2019-11-15 21:45:02,003 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:45:02,003 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:45:02,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:45:02,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:45:02,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:45:02,077 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793079877] [2019-11-15 21:45:02,077 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:45:02,077 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:45:02,077 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915344809] [2019-11-15 21:45:02,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:45:02,077 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:45:02,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:45:02,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:45:02,078 INFO L87 Difference]: Start difference. First operand 13822 states and 39929 transitions. Second operand 5 states. [2019-11-15 21:45:02,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:45:02,491 INFO L93 Difference]: Finished difference Result 17383 states and 50008 transitions. [2019-11-15 21:45:02,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:45:02,492 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-11-15 21:45:02,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:45:02,523 INFO L225 Difference]: With dead ends: 17383 [2019-11-15 21:45:02,523 INFO L226 Difference]: Without dead ends: 17383 [2019-11-15 21:45:02,524 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:45:02,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17383 states. [2019-11-15 21:45:02,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17383 to 14860. [2019-11-15 21:45:02,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14860 states. [2019-11-15 21:45:02,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14860 states to 14860 states and 42561 transitions. [2019-11-15 21:45:02,736 INFO L78 Accepts]: Start accepts. Automaton has 14860 states and 42561 transitions. Word has length 68 [2019-11-15 21:45:02,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:45:02,736 INFO L462 AbstractCegarLoop]: Abstraction has 14860 states and 42561 transitions. [2019-11-15 21:45:02,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:45:02,736 INFO L276 IsEmpty]: Start isEmpty. Operand 14860 states and 42561 transitions. [2019-11-15 21:45:02,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 21:45:02,744 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:45:02,745 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:45:02,745 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:45:02,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:45:02,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1169136517, now seen corresponding path program 1 times [2019-11-15 21:45:02,745 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:45:02,745 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380627362] [2019-11-15 21:45:02,745 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:45:02,745 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:45:02,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:45:02,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:45:02,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:45:02,800 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380627362] [2019-11-15 21:45:02,800 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:45:02,800 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:45:02,801 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130735735] [2019-11-15 21:45:02,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:45:02,801 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:45:02,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:45:02,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:45:02,801 INFO L87 Difference]: Start difference. First operand 14860 states and 42561 transitions. Second operand 5 states. [2019-11-15 21:45:03,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:45:03,209 INFO L93 Difference]: Finished difference Result 19765 states and 56508 transitions. [2019-11-15 21:45:03,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:45:03,210 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-11-15 21:45:03,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:45:03,234 INFO L225 Difference]: With dead ends: 19765 [2019-11-15 21:45:03,234 INFO L226 Difference]: Without dead ends: 19765 [2019-11-15 21:45:03,234 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:45:03,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19765 states. [2019-11-15 21:45:03,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19765 to 15765. [2019-11-15 21:45:03,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15765 states. [2019-11-15 21:45:03,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15765 states to 15765 states and 45147 transitions. [2019-11-15 21:45:03,442 INFO L78 Accepts]: Start accepts. Automaton has 15765 states and 45147 transitions. Word has length 68 [2019-11-15 21:45:03,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:45:03,442 INFO L462 AbstractCegarLoop]: Abstraction has 15765 states and 45147 transitions. [2019-11-15 21:45:03,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:45:03,443 INFO L276 IsEmpty]: Start isEmpty. Operand 15765 states and 45147 transitions. [2019-11-15 21:45:03,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 21:45:03,451 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:45:03,451 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:45:03,451 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:45:03,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:45:03,452 INFO L82 PathProgramCache]: Analyzing trace with hash -638317946, now seen corresponding path program 1 times [2019-11-15 21:45:03,452 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:45:03,452 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402975132] [2019-11-15 21:45:03,452 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:45:03,452 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:45:03,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:45:03,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:45:03,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:45:03,533 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402975132] [2019-11-15 21:45:03,533 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:45:03,533 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:45:03,533 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482596523] [2019-11-15 21:45:03,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:45:03,534 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:45:03,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:45:03,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:45:03,534 INFO L87 Difference]: Start difference. First operand 15765 states and 45147 transitions. Second operand 6 states. [2019-11-15 21:45:04,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:45:04,211 INFO L93 Difference]: Finished difference Result 24912 states and 71471 transitions. [2019-11-15 21:45:04,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:45:04,211 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-11-15 21:45:04,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:45:04,242 INFO L225 Difference]: With dead ends: 24912 [2019-11-15 21:45:04,242 INFO L226 Difference]: Without dead ends: 24912 [2019-11-15 21:45:04,243 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:45:04,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24912 states. [2019-11-15 21:45:04,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24912 to 19875. [2019-11-15 21:45:04,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19875 states. [2019-11-15 21:45:04,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19875 states to 19875 states and 57550 transitions. [2019-11-15 21:45:04,520 INFO L78 Accepts]: Start accepts. Automaton has 19875 states and 57550 transitions. Word has length 68 [2019-11-15 21:45:04,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:45:04,520 INFO L462 AbstractCegarLoop]: Abstraction has 19875 states and 57550 transitions. [2019-11-15 21:45:04,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:45:04,520 INFO L276 IsEmpty]: Start isEmpty. Operand 19875 states and 57550 transitions. [2019-11-15 21:45:04,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 21:45:04,530 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:45:04,530 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:45:04,530 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:45:04,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:45:04,531 INFO L82 PathProgramCache]: Analyzing trace with hash 249185735, now seen corresponding path program 1 times [2019-11-15 21:45:04,531 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:45:04,531 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350826676] [2019-11-15 21:45:04,531 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:45:04,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:45:04,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:45:04,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:45:04,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:45:04,583 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350826676] [2019-11-15 21:45:04,584 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:45:04,584 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:45:04,584 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003794446] [2019-11-15 21:45:04,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:45:04,585 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:45:04,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:45:04,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:45:04,585 INFO L87 Difference]: Start difference. First operand 19875 states and 57550 transitions. Second operand 4 states. [2019-11-15 21:45:05,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:45:05,022 INFO L93 Difference]: Finished difference Result 21582 states and 61994 transitions. [2019-11-15 21:45:05,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:45:05,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-11-15 21:45:05,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:45:05,046 INFO L225 Difference]: With dead ends: 21582 [2019-11-15 21:45:05,047 INFO L226 Difference]: Without dead ends: 21246 [2019-11-15 21:45:05,047 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:45:05,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21246 states. [2019-11-15 21:45:05,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21246 to 19704. [2019-11-15 21:45:05,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19704 states. [2019-11-15 21:45:05,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19704 states to 19704 states and 56674 transitions. [2019-11-15 21:45:05,300 INFO L78 Accepts]: Start accepts. Automaton has 19704 states and 56674 transitions. Word has length 68 [2019-11-15 21:45:05,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:45:05,301 INFO L462 AbstractCegarLoop]: Abstraction has 19704 states and 56674 transitions. [2019-11-15 21:45:05,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:45:05,301 INFO L276 IsEmpty]: Start isEmpty. Operand 19704 states and 56674 transitions. [2019-11-15 21:45:05,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 21:45:05,313 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:45:05,314 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:45:05,314 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:45:05,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:45:05,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1859697991, now seen corresponding path program 1 times [2019-11-15 21:45:05,315 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:45:05,315 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140482443] [2019-11-15 21:45:05,315 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:45:05,315 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:45:05,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:45:05,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:45:05,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:45:05,445 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140482443] [2019-11-15 21:45:05,446 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:45:05,446 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 21:45:05,446 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770610495] [2019-11-15 21:45:05,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 21:45:05,447 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:45:05,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 21:45:05,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:45:05,448 INFO L87 Difference]: Start difference. First operand 19704 states and 56674 transitions. Second operand 9 states. [2019-11-15 21:45:06,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:45:06,024 INFO L93 Difference]: Finished difference Result 25031 states and 71607 transitions. [2019-11-15 21:45:06,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 21:45:06,025 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2019-11-15 21:45:06,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:45:06,057 INFO L225 Difference]: With dead ends: 25031 [2019-11-15 21:45:06,057 INFO L226 Difference]: Without dead ends: 25031 [2019-11-15 21:45:06,058 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:45:06,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25031 states. [2019-11-15 21:45:06,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25031 to 21057. [2019-11-15 21:45:06,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21057 states. [2019-11-15 21:45:06,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21057 states to 21057 states and 60604 transitions. [2019-11-15 21:45:06,389 INFO L78 Accepts]: Start accepts. Automaton has 21057 states and 60604 transitions. Word has length 68 [2019-11-15 21:45:06,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:45:06,390 INFO L462 AbstractCegarLoop]: Abstraction has 21057 states and 60604 transitions. [2019-11-15 21:45:06,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 21:45:06,390 INFO L276 IsEmpty]: Start isEmpty. Operand 21057 states and 60604 transitions. [2019-11-15 21:45:06,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 21:45:06,403 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:45:06,403 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:45:06,403 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:45:06,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:45:06,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1547765624, now seen corresponding path program 1 times [2019-11-15 21:45:06,404 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:45:06,404 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241921082] [2019-11-15 21:45:06,404 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:45:06,404 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:45:06,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:45:06,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:45:06,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:45:06,723 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241921082] [2019-11-15 21:45:06,723 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:45:06,723 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:45:06,723 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855383532] [2019-11-15 21:45:06,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:45:06,724 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:45:06,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:45:06,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:45:06,724 INFO L87 Difference]: Start difference. First operand 21057 states and 60604 transitions. Second operand 5 states. [2019-11-15 21:45:06,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:45:06,781 INFO L93 Difference]: Finished difference Result 6189 states and 14491 transitions. [2019-11-15 21:45:06,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:45:06,782 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-11-15 21:45:06,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:45:06,787 INFO L225 Difference]: With dead ends: 6189 [2019-11-15 21:45:06,787 INFO L226 Difference]: Without dead ends: 5017 [2019-11-15 21:45:06,788 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:45:06,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5017 states. [2019-11-15 21:45:06,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5017 to 4280. [2019-11-15 21:45:06,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4280 states. [2019-11-15 21:45:06,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4280 states to 4280 states and 9827 transitions. [2019-11-15 21:45:06,846 INFO L78 Accepts]: Start accepts. Automaton has 4280 states and 9827 transitions. Word has length 68 [2019-11-15 21:45:06,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:45:06,846 INFO L462 AbstractCegarLoop]: Abstraction has 4280 states and 9827 transitions. [2019-11-15 21:45:06,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:45:06,846 INFO L276 IsEmpty]: Start isEmpty. Operand 4280 states and 9827 transitions. [2019-11-15 21:45:06,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-15 21:45:06,851 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:45:06,851 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:45:06,852 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:45:06,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:45:06,852 INFO L82 PathProgramCache]: Analyzing trace with hash -95985690, now seen corresponding path program 1 times [2019-11-15 21:45:06,852 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:45:06,853 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77426189] [2019-11-15 21:45:06,853 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:45:06,853 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:45:06,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:45:06,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:45:06,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:45:06,942 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77426189] [2019-11-15 21:45:06,942 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:45:06,943 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:45:06,943 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046169425] [2019-11-15 21:45:06,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:45:06,944 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:45:06,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:45:06,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:45:06,948 INFO L87 Difference]: Start difference. First operand 4280 states and 9827 transitions. Second operand 5 states. [2019-11-15 21:45:07,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:45:07,151 INFO L93 Difference]: Finished difference Result 4933 states and 11178 transitions. [2019-11-15 21:45:07,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:45:07,152 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-11-15 21:45:07,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:45:07,157 INFO L225 Difference]: With dead ends: 4933 [2019-11-15 21:45:07,157 INFO L226 Difference]: Without dead ends: 4902 [2019-11-15 21:45:07,158 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:45:07,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4902 states. [2019-11-15 21:45:07,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4902 to 4417. [2019-11-15 21:45:07,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4417 states. [2019-11-15 21:45:07,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4417 states to 4417 states and 10096 transitions. [2019-11-15 21:45:07,200 INFO L78 Accepts]: Start accepts. Automaton has 4417 states and 10096 transitions. Word has length 83 [2019-11-15 21:45:07,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:45:07,200 INFO L462 AbstractCegarLoop]: Abstraction has 4417 states and 10096 transitions. [2019-11-15 21:45:07,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:45:07,200 INFO L276 IsEmpty]: Start isEmpty. Operand 4417 states and 10096 transitions. [2019-11-15 21:45:07,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-15 21:45:07,205 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:45:07,205 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:45:07,205 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:45:07,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:45:07,206 INFO L82 PathProgramCache]: Analyzing trace with hash -770290477, now seen corresponding path program 1 times [2019-11-15 21:45:07,206 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:45:07,206 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146900236] [2019-11-15 21:45:07,206 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:45:07,206 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:45:07,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:45:07,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:45:07,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:45:07,308 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146900236] [2019-11-15 21:45:07,308 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:45:07,308 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:45:07,309 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891505410] [2019-11-15 21:45:07,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:45:07,309 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:45:07,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:45:07,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:45:07,310 INFO L87 Difference]: Start difference. First operand 4417 states and 10096 transitions. Second operand 6 states. [2019-11-15 21:45:07,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:45:07,414 INFO L93 Difference]: Finished difference Result 4273 states and 9661 transitions. [2019-11-15 21:45:07,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:45:07,414 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-11-15 21:45:07,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:45:07,417 INFO L225 Difference]: With dead ends: 4273 [2019-11-15 21:45:07,417 INFO L226 Difference]: Without dead ends: 4273 [2019-11-15 21:45:07,418 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:45:07,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4273 states. [2019-11-15 21:45:07,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4273 to 3066. [2019-11-15 21:45:07,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3066 states. [2019-11-15 21:45:07,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3066 states to 3066 states and 7020 transitions. [2019-11-15 21:45:07,451 INFO L78 Accepts]: Start accepts. Automaton has 3066 states and 7020 transitions. Word has length 83 [2019-11-15 21:45:07,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:45:07,451 INFO L462 AbstractCegarLoop]: Abstraction has 3066 states and 7020 transitions. [2019-11-15 21:45:07,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:45:07,451 INFO L276 IsEmpty]: Start isEmpty. Operand 3066 states and 7020 transitions. [2019-11-15 21:45:07,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-15 21:45:07,454 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:45:07,455 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:45:07,455 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:45:07,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:45:07,455 INFO L82 PathProgramCache]: Analyzing trace with hash -221962901, now seen corresponding path program 1 times [2019-11-15 21:45:07,455 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:45:07,456 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636496998] [2019-11-15 21:45:07,456 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:45:07,456 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:45:07,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:45:07,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:45:07,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:45:07,607 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636496998] [2019-11-15 21:45:07,608 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:45:07,608 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 21:45:07,608 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108214538] [2019-11-15 21:45:07,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:45:07,610 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:45:07,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:45:07,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:45:07,611 INFO L87 Difference]: Start difference. First operand 3066 states and 7020 transitions. Second operand 8 states. [2019-11-15 21:45:07,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:45:07,941 INFO L93 Difference]: Finished difference Result 3566 states and 8087 transitions. [2019-11-15 21:45:07,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 21:45:07,941 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 85 [2019-11-15 21:45:07,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:45:07,944 INFO L225 Difference]: With dead ends: 3566 [2019-11-15 21:45:07,944 INFO L226 Difference]: Without dead ends: 3566 [2019-11-15 21:45:07,945 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-11-15 21:45:07,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3566 states. [2019-11-15 21:45:07,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3566 to 3165. [2019-11-15 21:45:07,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3165 states. [2019-11-15 21:45:07,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3165 states to 3165 states and 7225 transitions. [2019-11-15 21:45:07,975 INFO L78 Accepts]: Start accepts. Automaton has 3165 states and 7225 transitions. Word has length 85 [2019-11-15 21:45:07,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:45:07,975 INFO L462 AbstractCegarLoop]: Abstraction has 3165 states and 7225 transitions. [2019-11-15 21:45:07,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:45:07,975 INFO L276 IsEmpty]: Start isEmpty. Operand 3165 states and 7225 transitions. [2019-11-15 21:45:07,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-15 21:45:07,977 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:45:07,977 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:45:07,978 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:45:07,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:45:07,978 INFO L82 PathProgramCache]: Analyzing trace with hash 665540780, now seen corresponding path program 1 times [2019-11-15 21:45:07,978 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:45:07,978 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581550063] [2019-11-15 21:45:07,978 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:45:07,978 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:45:07,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:45:07,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:45:08,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:45:08,099 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581550063] [2019-11-15 21:45:08,099 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:45:08,099 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 21:45:08,099 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405841280] [2019-11-15 21:45:08,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:45:08,100 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:45:08,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:45:08,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:45:08,100 INFO L87 Difference]: Start difference. First operand 3165 states and 7225 transitions. Second operand 8 states. [2019-11-15 21:45:08,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:45:08,194 INFO L93 Difference]: Finished difference Result 5378 states and 12352 transitions. [2019-11-15 21:45:08,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:45:08,194 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 85 [2019-11-15 21:45:08,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:45:08,197 INFO L225 Difference]: With dead ends: 5378 [2019-11-15 21:45:08,197 INFO L226 Difference]: Without dead ends: 2302 [2019-11-15 21:45:08,197 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:45:08,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2302 states. [2019-11-15 21:45:08,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2302 to 2302. [2019-11-15 21:45:08,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2302 states. [2019-11-15 21:45:08,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2302 states to 2302 states and 5273 transitions. [2019-11-15 21:45:08,220 INFO L78 Accepts]: Start accepts. Automaton has 2302 states and 5273 transitions. Word has length 85 [2019-11-15 21:45:08,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:45:08,220 INFO L462 AbstractCegarLoop]: Abstraction has 2302 states and 5273 transitions. [2019-11-15 21:45:08,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:45:08,220 INFO L276 IsEmpty]: Start isEmpty. Operand 2302 states and 5273 transitions. [2019-11-15 21:45:08,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-15 21:45:08,222 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:45:08,222 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:45:08,222 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:45:08,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:45:08,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1245991308, now seen corresponding path program 2 times [2019-11-15 21:45:08,222 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:45:08,223 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186735046] [2019-11-15 21:45:08,223 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:45:08,223 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:45:08,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:45:08,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:45:08,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:45:08,351 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186735046] [2019-11-15 21:45:08,351 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:45:08,351 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 21:45:08,351 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70689211] [2019-11-15 21:45:08,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 21:45:08,352 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:45:08,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 21:45:08,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:45:08,352 INFO L87 Difference]: Start difference. First operand 2302 states and 5273 transitions. Second operand 9 states. [2019-11-15 21:45:08,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:45:08,626 INFO L93 Difference]: Finished difference Result 3937 states and 9009 transitions. [2019-11-15 21:45:08,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 21:45:08,627 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-11-15 21:45:08,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:45:08,629 INFO L225 Difference]: With dead ends: 3937 [2019-11-15 21:45:08,629 INFO L226 Difference]: Without dead ends: 2587 [2019-11-15 21:45:08,629 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-11-15 21:45:08,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2587 states. [2019-11-15 21:45:08,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2587 to 2357. [2019-11-15 21:45:08,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2357 states. [2019-11-15 21:45:08,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2357 states to 2357 states and 5342 transitions. [2019-11-15 21:45:08,649 INFO L78 Accepts]: Start accepts. Automaton has 2357 states and 5342 transitions. Word has length 85 [2019-11-15 21:45:08,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:45:08,649 INFO L462 AbstractCegarLoop]: Abstraction has 2357 states and 5342 transitions. [2019-11-15 21:45:08,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 21:45:08,650 INFO L276 IsEmpty]: Start isEmpty. Operand 2357 states and 5342 transitions. [2019-11-15 21:45:08,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-15 21:45:08,651 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:45:08,651 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:45:08,652 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:45:08,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:45:08,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1284678937, now seen corresponding path program 1 times [2019-11-15 21:45:08,652 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:45:08,652 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244119973] [2019-11-15 21:45:08,653 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:45:08,653 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:45:08,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:45:08,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:45:08,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:45:08,763 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244119973] [2019-11-15 21:45:08,763 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:45:08,763 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:45:08,763 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941401790] [2019-11-15 21:45:08,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:45:08,764 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:45:08,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:45:08,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:45:08,764 INFO L87 Difference]: Start difference. First operand 2357 states and 5342 transitions. Second operand 6 states. [2019-11-15 21:45:08,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:45:08,900 INFO L93 Difference]: Finished difference Result 2638 states and 5934 transitions. [2019-11-15 21:45:08,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:45:08,900 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2019-11-15 21:45:08,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:45:08,902 INFO L225 Difference]: With dead ends: 2638 [2019-11-15 21:45:08,902 INFO L226 Difference]: Without dead ends: 2598 [2019-11-15 21:45:08,902 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:45:08,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2598 states. [2019-11-15 21:45:08,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2598 to 2304. [2019-11-15 21:45:08,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2304 states. [2019-11-15 21:45:08,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2304 states to 2304 states and 5189 transitions. [2019-11-15 21:45:08,926 INFO L78 Accepts]: Start accepts. Automaton has 2304 states and 5189 transitions. Word has length 85 [2019-11-15 21:45:08,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:45:08,926 INFO L462 AbstractCegarLoop]: Abstraction has 2304 states and 5189 transitions. [2019-11-15 21:45:08,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:45:08,927 INFO L276 IsEmpty]: Start isEmpty. Operand 2304 states and 5189 transitions. [2019-11-15 21:45:08,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-15 21:45:08,928 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:45:08,928 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:45:08,929 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:45:08,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:45:08,929 INFO L82 PathProgramCache]: Analyzing trace with hash -792530406, now seen corresponding path program 3 times [2019-11-15 21:45:08,929 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:45:08,929 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715989507] [2019-11-15 21:45:08,929 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:45:08,929 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:45:08,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:45:08,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:45:09,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:45:09,009 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715989507] [2019-11-15 21:45:09,009 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:45:09,009 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:45:09,009 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192658208] [2019-11-15 21:45:09,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:45:09,010 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:45:09,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:45:09,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:45:09,011 INFO L87 Difference]: Start difference. First operand 2304 states and 5189 transitions. Second operand 5 states. [2019-11-15 21:45:09,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:45:09,069 INFO L93 Difference]: Finished difference Result 2429 states and 5444 transitions. [2019-11-15 21:45:09,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:45:09,070 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-11-15 21:45:09,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:45:09,072 INFO L225 Difference]: With dead ends: 2429 [2019-11-15 21:45:09,072 INFO L226 Difference]: Without dead ends: 2429 [2019-11-15 21:45:09,073 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:45:09,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2429 states. [2019-11-15 21:45:09,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2429 to 2388. [2019-11-15 21:45:09,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2388 states. [2019-11-15 21:45:09,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2388 states to 2388 states and 5359 transitions. [2019-11-15 21:45:09,101 INFO L78 Accepts]: Start accepts. Automaton has 2388 states and 5359 transitions. Word has length 85 [2019-11-15 21:45:09,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:45:09,101 INFO L462 AbstractCegarLoop]: Abstraction has 2388 states and 5359 transitions. [2019-11-15 21:45:09,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:45:09,102 INFO L276 IsEmpty]: Start isEmpty. Operand 2388 states and 5359 transitions. [2019-11-15 21:45:09,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-15 21:45:09,104 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:45:09,104 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:45:09,105 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:45:09,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:45:09,105 INFO L82 PathProgramCache]: Analyzing trace with hash 841580247, now seen corresponding path program 1 times [2019-11-15 21:45:09,105 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:45:09,105 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937733606] [2019-11-15 21:45:09,105 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:45:09,106 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:45:09,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:45:09,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:45:09,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:45:09,208 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:45:09,208 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 21:45:09,384 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-15 21:45:09,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 09:45:09 BasicIcfg [2019-11-15 21:45:09,386 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 21:45:09,387 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:45:09,387 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:45:09,387 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:45:09,387 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:44:34" (3/4) ... [2019-11-15 21:45:09,390 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 21:45:09,563 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_94af0725-af29-4ed4-b1d5-fcf08c5de711/bin/uautomizer/witness.graphml [2019-11-15 21:45:09,563 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:45:09,566 INFO L168 Benchmark]: Toolchain (without parser) took 36540.00 ms. Allocated memory was 1.0 GB in the beginning and 4.2 GB in the end (delta: 3.1 GB). Free memory was 938.0 MB in the beginning and 2.7 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-11-15 21:45:09,566 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:45:09,566 INFO L168 Benchmark]: CACSL2BoogieTranslator took 655.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -162.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:45:09,567 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:45:09,567 INFO L168 Benchmark]: Boogie Preprocessor took 35.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:45:09,567 INFO L168 Benchmark]: RCFGBuilder took 747.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. [2019-11-15 21:45:09,568 INFO L168 Benchmark]: TraceAbstraction took 34862.57 ms. Allocated memory was 1.2 GB in the beginning and 4.2 GB in the end (delta: 3.0 GB). Free memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-11-15 21:45:09,568 INFO L168 Benchmark]: Witness Printer took 176.32 ms. Allocated memory is still 4.2 GB. Free memory was 2.7 GB in the beginning and 2.7 GB in the end (delta: 51.9 MB). Peak memory consumption was 51.9 MB. Max. memory is 11.5 GB. [2019-11-15 21:45:09,570 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 655.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -162.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 747.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 34862.57 ms. Allocated memory was 1.2 GB in the beginning and 4.2 GB in the end (delta: 3.0 GB). Free memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * Witness Printer took 176.32 ms. Allocated memory is still 4.2 GB. Free memory was 2.7 GB in the beginning and 2.7 GB in the end (delta: 51.9 MB). Peak memory consumption was 51.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L699] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L701] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L702] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L703] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L705] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L707] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L708] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L709] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L710] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L711] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L712] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L713] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L714] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L715] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L716] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L717] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L718] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L719] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L720] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L721] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L723] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L724] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L725] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L801] 0 pthread_t t1663; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] FCALL, FORK 0 pthread_create(&t1663, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L803] 0 pthread_t t1664; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] FCALL, FORK 0 pthread_create(&t1664, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L759] 2 y$w_buff1 = y$w_buff0 [L760] 2 y$w_buff0 = 1 [L761] 2 y$w_buff1_used = y$w_buff0_used [L762] 2 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L764] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L765] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L766] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L767] 2 y$r_buff0_thd2 = (_Bool)1 [L770] 2 z = 1 [L773] 2 __unbuffered_p1_EAX = z [L776] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] 1 x = 1 [L734] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L735] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L736] 1 y$flush_delayed = weak$$choice2 [L737] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L738] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L738] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L739] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L779] 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) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L740] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L741] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L741] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L742] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L742] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L743] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L744] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L779] 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) [L780] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=1, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L780] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L781] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=1, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L781] 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 [L782] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=1, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L782] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L783] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=1, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L783] 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 [L786] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=1, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=1, y$flush_delayed=3, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 1 y = y$flush_delayed ? y$mem_tmp : y [L747] 1 y$flush_delayed = (_Bool)0 [L752] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L806] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 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) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 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) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 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) [L811] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L812] 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 [L813] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] 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 [L817] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 196 locations, 3 error locations. Result: UNSAFE, OverallTime: 34.7s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 13.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7184 SDtfs, 8260 SDslu, 15432 SDs, 0 SdLazy, 5896 SolverSat, 447 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 248 GetRequests, 70 SyntacticMatches, 12 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57890occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 15.8s AutomataMinimizationTime, 27 MinimizatonAttempts, 65151 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1880 NumberOfCodeBlocks, 1880 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1768 ConstructedInterpolants, 0 QuantifiedInterpolants, 339096 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...