./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi001_tso.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_41804208-30be-4d18-ae28-13d54f6aa5ef/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_41804208-30be-4d18-ae28-13d54f6aa5ef/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_41804208-30be-4d18-ae28-13d54f6aa5ef/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_41804208-30be-4d18-ae28-13d54f6aa5ef/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi001_tso.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_41804208-30be-4d18-ae28-13d54f6aa5ef/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_41804208-30be-4d18-ae28-13d54f6aa5ef/bin-2019/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 8779471c632a53a1c78816502893e61b74924e89 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.23-635dfa2 [2018-12-02 08:34:15,919 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 08:34:15,920 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 08:34:15,926 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 08:34:15,926 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 08:34:15,927 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 08:34:15,928 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 08:34:15,928 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 08:34:15,929 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 08:34:15,930 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 08:34:15,930 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 08:34:15,930 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 08:34:15,931 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 08:34:15,931 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 08:34:15,932 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 08:34:15,932 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 08:34:15,933 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 08:34:15,933 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 08:34:15,934 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 08:34:15,935 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 08:34:15,936 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 08:34:15,936 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 08:34:15,937 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 08:34:15,938 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 08:34:15,938 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 08:34:15,938 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 08:34:15,939 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 08:34:15,939 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 08:34:15,940 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 08:34:15,940 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 08:34:15,940 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 08:34:15,941 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 08:34:15,941 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 08:34:15,941 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 08:34:15,941 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 08:34:15,942 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 08:34:15,942 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_41804208-30be-4d18-ae28-13d54f6aa5ef/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-02 08:34:15,949 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 08:34:15,949 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 08:34:15,950 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 08:34:15,950 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 08:34:15,950 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 08:34:15,950 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 08:34:15,950 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 08:34:15,950 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 08:34:15,950 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 08:34:15,950 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 08:34:15,951 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 08:34:15,951 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 08:34:15,951 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 08:34:15,951 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 08:34:15,951 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 08:34:15,951 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 08:34:15,951 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 08:34:15,951 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 08:34:15,951 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 08:34:15,951 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 08:34:15,951 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 08:34:15,952 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 08:34:15,952 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 08:34:15,952 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 08:34:15,952 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 08:34:15,952 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 08:34:15,952 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 08:34:15,952 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 08:34:15,952 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 08:34:15,952 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 08:34:15,952 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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/working_dir_41804208-30be-4d18-ae28-13d54f6aa5ef/bin-2019/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 -> 8779471c632a53a1c78816502893e61b74924e89 [2018-12-02 08:34:15,970 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 08:34:15,979 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 08:34:15,982 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 08:34:15,983 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 08:34:15,983 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 08:34:15,984 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_41804208-30be-4d18-ae28-13d54f6aa5ef/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi001_tso.oepc_false-unreach-call.i [2018-12-02 08:34:16,021 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_41804208-30be-4d18-ae28-13d54f6aa5ef/bin-2019/uautomizer/data/e52aa8a7f/7126f27bb4814dce859b3b1dee4425d2/FLAG2c303d08d [2018-12-02 08:34:16,474 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 08:34:16,475 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_41804208-30be-4d18-ae28-13d54f6aa5ef/sv-benchmarks/c/pthread-wmm/rfi001_tso.oepc_false-unreach-call.i [2018-12-02 08:34:16,483 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_41804208-30be-4d18-ae28-13d54f6aa5ef/bin-2019/uautomizer/data/e52aa8a7f/7126f27bb4814dce859b3b1dee4425d2/FLAG2c303d08d [2018-12-02 08:34:16,492 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_41804208-30be-4d18-ae28-13d54f6aa5ef/bin-2019/uautomizer/data/e52aa8a7f/7126f27bb4814dce859b3b1dee4425d2 [2018-12-02 08:34:16,493 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 08:34:16,494 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 08:34:16,495 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 08:34:16,495 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 08:34:16,497 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 08:34:16,497 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:34:16" (1/1) ... [2018-12-02 08:34:16,499 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab2707f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:34:16, skipping insertion in model container [2018-12-02 08:34:16,499 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:34:16" (1/1) ... [2018-12-02 08:34:16,503 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 08:34:16,524 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 08:34:16,701 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 08:34:16,708 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 08:34:16,783 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 08:34:16,813 INFO L195 MainTranslator]: Completed translation [2018-12-02 08:34:16,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:34:16 WrapperNode [2018-12-02 08:34:16,813 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 08:34:16,814 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 08:34:16,814 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 08:34:16,814 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 08:34:16,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:34:16" (1/1) ... [2018-12-02 08:34:16,829 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:34:16" (1/1) ... [2018-12-02 08:34:16,847 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 08:34:16,848 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 08:34:16,848 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 08:34:16,848 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 08:34:16,855 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:34:16" (1/1) ... [2018-12-02 08:34:16,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:34:16" (1/1) ... [2018-12-02 08:34:16,857 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:34:16" (1/1) ... [2018-12-02 08:34:16,857 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:34:16" (1/1) ... [2018-12-02 08:34:16,863 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:34:16" (1/1) ... [2018-12-02 08:34:16,865 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:34:16" (1/1) ... [2018-12-02 08:34:16,866 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:34:16" (1/1) ... [2018-12-02 08:34:16,868 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 08:34:16,869 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 08:34:16,869 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 08:34:16,869 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 08:34:16,870 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:34:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_41804208-30be-4d18-ae28-13d54f6aa5ef/bin-2019/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 [2018-12-02 08:34:16,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 08:34:16,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 08:34:16,901 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 08:34:16,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 08:34:16,901 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 08:34:16,901 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 08:34:16,901 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 08:34:16,901 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 08:34:16,901 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 08:34:16,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 08:34:16,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 08:34:16,902 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-02 08:34:17,213 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 08:34:17,213 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 08:34:17,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:34:17 BoogieIcfgContainer [2018-12-02 08:34:17,214 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 08:34:17,215 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 08:34:17,215 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 08:34:17,217 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 08:34:17,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:34:16" (1/3) ... [2018-12-02 08:34:17,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37700c8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:34:17, skipping insertion in model container [2018-12-02 08:34:17,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:34:16" (2/3) ... [2018-12-02 08:34:17,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37700c8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:34:17, skipping insertion in model container [2018-12-02 08:34:17,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:34:17" (3/3) ... [2018-12-02 08:34:17,220 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi001_tso.oepc_false-unreach-call.i [2018-12-02 08:34:17,250 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,250 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,251 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,251 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,251 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,251 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,251 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,251 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,252 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,252 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,252 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,252 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,252 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,252 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,252 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,253 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,253 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,253 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,253 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,253 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,253 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,254 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,254 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,254 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,254 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,254 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,254 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,254 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,255 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,255 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,255 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,255 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,255 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,255 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,256 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,256 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,256 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,256 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,256 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,256 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,256 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,256 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,257 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,257 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,257 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,257 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,257 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,257 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,257 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,258 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,258 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,258 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,258 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,258 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,258 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,259 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,259 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,259 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,259 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,259 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,259 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,259 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,259 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,260 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,260 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,260 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,260 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,260 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,260 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,260 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,261 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,261 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:34:17,267 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 08:34:17,267 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 08:34:17,274 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 08:34:17,285 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 08:34:17,300 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 08:34:17,301 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 08:34:17,301 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 08:34:17,301 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 08:34:17,301 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 08:34:17,301 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 08:34:17,301 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 08:34:17,301 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 08:34:17,301 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 08:34:17,309 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2018-12-02 08:34:18,234 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25089 states. [2018-12-02 08:34:18,235 INFO L276 IsEmpty]: Start isEmpty. Operand 25089 states. [2018-12-02 08:34:18,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-02 08:34:18,241 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:34:18,242 INFO L402 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] [2018-12-02 08:34:18,243 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:34:18,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:34:18,247 INFO L82 PathProgramCache]: Analyzing trace with hash 2006103772, now seen corresponding path program 1 times [2018-12-02 08:34:18,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:34:18,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:34:18,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:34:18,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:34:18,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:34:18,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:34:18,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:34:18,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:34:18,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 08:34:18,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 08:34:18,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 08:34:18,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 08:34:18,398 INFO L87 Difference]: Start difference. First operand 25089 states. Second operand 4 states. [2018-12-02 08:34:18,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:34:18,806 INFO L93 Difference]: Finished difference Result 45389 states and 177627 transitions. [2018-12-02 08:34:18,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 08:34:18,807 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-12-02 08:34:18,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:34:18,955 INFO L225 Difference]: With dead ends: 45389 [2018-12-02 08:34:18,956 INFO L226 Difference]: Without dead ends: 40629 [2018-12-02 08:34:18,957 INFO L631 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 [2018-12-02 08:34:19,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40629 states. [2018-12-02 08:34:19,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40629 to 23663. [2018-12-02 08:34:19,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23663 states. [2018-12-02 08:34:19,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23663 states to 23663 states and 92544 transitions. [2018-12-02 08:34:19,661 INFO L78 Accepts]: Start accepts. Automaton has 23663 states and 92544 transitions. Word has length 38 [2018-12-02 08:34:19,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:34:19,662 INFO L480 AbstractCegarLoop]: Abstraction has 23663 states and 92544 transitions. [2018-12-02 08:34:19,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 08:34:19,662 INFO L276 IsEmpty]: Start isEmpty. Operand 23663 states and 92544 transitions. [2018-12-02 08:34:19,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 08:34:19,665 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:34:19,665 INFO L402 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] [2018-12-02 08:34:19,665 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:34:19,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:34:19,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1004185729, now seen corresponding path program 1 times [2018-12-02 08:34:19,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:34:19,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:34:19,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:34:19,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:34:19,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:34:19,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:34:19,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:34:19,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:34:19,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 08:34:19,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 08:34:19,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 08:34:19,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:34:19,702 INFO L87 Difference]: Start difference. First operand 23663 states and 92544 transitions. Second operand 3 states. [2018-12-02 08:34:19,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:34:19,849 INFO L93 Difference]: Finished difference Result 23663 states and 92160 transitions. [2018-12-02 08:34:19,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 08:34:19,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-12-02 08:34:19,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:34:19,906 INFO L225 Difference]: With dead ends: 23663 [2018-12-02 08:34:19,906 INFO L226 Difference]: Without dead ends: 23663 [2018-12-02 08:34:19,907 INFO L631 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 [2018-12-02 08:34:20,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23663 states. [2018-12-02 08:34:20,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23663 to 23663. [2018-12-02 08:34:20,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23663 states. [2018-12-02 08:34:20,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23663 states to 23663 states and 92160 transitions. [2018-12-02 08:34:20,344 INFO L78 Accepts]: Start accepts. Automaton has 23663 states and 92160 transitions. Word has length 45 [2018-12-02 08:34:20,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:34:20,345 INFO L480 AbstractCegarLoop]: Abstraction has 23663 states and 92160 transitions. [2018-12-02 08:34:20,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 08:34:20,345 INFO L276 IsEmpty]: Start isEmpty. Operand 23663 states and 92160 transitions. [2018-12-02 08:34:20,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 08:34:20,346 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:34:20,346 INFO L402 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] [2018-12-02 08:34:20,347 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:34:20,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:34:20,347 INFO L82 PathProgramCache]: Analyzing trace with hash -792765630, now seen corresponding path program 1 times [2018-12-02 08:34:20,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:34:20,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:34:20,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:34:20,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:34:20,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:34:20,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:34:20,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:34:20,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:34:20,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 08:34:20,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 08:34:20,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 08:34:20,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 08:34:20,390 INFO L87 Difference]: Start difference. First operand 23663 states and 92160 transitions. Second operand 5 states. [2018-12-02 08:34:20,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:34:20,984 INFO L93 Difference]: Finished difference Result 64831 states and 240932 transitions. [2018-12-02 08:34:20,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 08:34:20,985 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-12-02 08:34:20,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:34:21,095 INFO L225 Difference]: With dead ends: 64831 [2018-12-02 08:34:21,095 INFO L226 Difference]: Without dead ends: 64671 [2018-12-02 08:34:21,095 INFO L631 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 [2018-12-02 08:34:21,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64671 states. [2018-12-02 08:34:21,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64671 to 37143. [2018-12-02 08:34:21,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37143 states. [2018-12-02 08:34:21,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37143 states to 37143 states and 137901 transitions. [2018-12-02 08:34:21,840 INFO L78 Accepts]: Start accepts. Automaton has 37143 states and 137901 transitions. Word has length 45 [2018-12-02 08:34:21,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:34:21,841 INFO L480 AbstractCegarLoop]: Abstraction has 37143 states and 137901 transitions. [2018-12-02 08:34:21,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 08:34:21,841 INFO L276 IsEmpty]: Start isEmpty. Operand 37143 states and 137901 transitions. [2018-12-02 08:34:21,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 08:34:21,843 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:34:21,843 INFO L402 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] [2018-12-02 08:34:21,843 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:34:21,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:34:21,843 INFO L82 PathProgramCache]: Analyzing trace with hash -636463316, now seen corresponding path program 1 times [2018-12-02 08:34:21,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:34:21,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:34:21,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:34:21,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:34:21,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:34:21,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:34:21,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:34:21,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:34:21,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 08:34:21,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 08:34:21,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 08:34:21,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:34:21,884 INFO L87 Difference]: Start difference. First operand 37143 states and 137901 transitions. Second operand 3 states. [2018-12-02 08:34:22,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:34:22,130 INFO L93 Difference]: Finished difference Result 37143 states and 137892 transitions. [2018-12-02 08:34:22,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 08:34:22,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-12-02 08:34:22,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:34:22,191 INFO L225 Difference]: With dead ends: 37143 [2018-12-02 08:34:22,191 INFO L226 Difference]: Without dead ends: 37143 [2018-12-02 08:34:22,191 INFO L631 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 [2018-12-02 08:34:22,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37143 states. [2018-12-02 08:34:22,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37143 to 37143. [2018-12-02 08:34:22,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37143 states. [2018-12-02 08:34:22,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37143 states to 37143 states and 137892 transitions. [2018-12-02 08:34:22,707 INFO L78 Accepts]: Start accepts. Automaton has 37143 states and 137892 transitions. Word has length 46 [2018-12-02 08:34:22,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:34:22,707 INFO L480 AbstractCegarLoop]: Abstraction has 37143 states and 137892 transitions. [2018-12-02 08:34:22,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 08:34:22,707 INFO L276 IsEmpty]: Start isEmpty. Operand 37143 states and 137892 transitions. [2018-12-02 08:34:22,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 08:34:22,710 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:34:22,710 INFO L402 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] [2018-12-02 08:34:22,710 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:34:22,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:34:22,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1106347019, now seen corresponding path program 1 times [2018-12-02 08:34:22,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:34:22,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:34:22,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:34:22,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:34:22,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:34:22,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:34:22,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:34:22,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:34:22,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 08:34:22,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 08:34:22,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 08:34:22,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 08:34:22,763 INFO L87 Difference]: Start difference. First operand 37143 states and 137892 transitions. Second operand 4 states. [2018-12-02 08:34:22,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:34:22,808 INFO L93 Difference]: Finished difference Result 12365 states and 41168 transitions. [2018-12-02 08:34:22,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 08:34:22,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-12-02 08:34:22,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:34:22,822 INFO L225 Difference]: With dead ends: 12365 [2018-12-02 08:34:22,822 INFO L226 Difference]: Without dead ends: 11844 [2018-12-02 08:34:22,822 INFO L631 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 [2018-12-02 08:34:22,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11844 states. [2018-12-02 08:34:23,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11844 to 11844. [2018-12-02 08:34:23,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11844 states. [2018-12-02 08:34:23,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11844 states to 11844 states and 39616 transitions. [2018-12-02 08:34:23,019 INFO L78 Accepts]: Start accepts. Automaton has 11844 states and 39616 transitions. Word has length 46 [2018-12-02 08:34:23,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:34:23,019 INFO L480 AbstractCegarLoop]: Abstraction has 11844 states and 39616 transitions. [2018-12-02 08:34:23,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 08:34:23,019 INFO L276 IsEmpty]: Start isEmpty. Operand 11844 states and 39616 transitions. [2018-12-02 08:34:23,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-02 08:34:23,022 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:34:23,022 INFO L402 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] [2018-12-02 08:34:23,022 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:34:23,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:34:23,022 INFO L82 PathProgramCache]: Analyzing trace with hash 218290349, now seen corresponding path program 1 times [2018-12-02 08:34:23,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:34:23,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:34:23,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:34:23,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:34:23,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:34:23,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:34:23,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:34:23,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:34:23,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 08:34:23,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 08:34:23,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 08:34:23,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 08:34:23,060 INFO L87 Difference]: Start difference. First operand 11844 states and 39616 transitions. Second operand 4 states. [2018-12-02 08:34:23,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:34:23,209 INFO L93 Difference]: Finished difference Result 17020 states and 55692 transitions. [2018-12-02 08:34:23,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 08:34:23,210 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-12-02 08:34:23,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:34:23,230 INFO L225 Difference]: With dead ends: 17020 [2018-12-02 08:34:23,230 INFO L226 Difference]: Without dead ends: 17020 [2018-12-02 08:34:23,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 08:34:23,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17020 states. [2018-12-02 08:34:23,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17020 to 12880. [2018-12-02 08:34:23,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12880 states. [2018-12-02 08:34:23,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12880 states to 12880 states and 42719 transitions. [2018-12-02 08:34:23,388 INFO L78 Accepts]: Start accepts. Automaton has 12880 states and 42719 transitions. Word has length 59 [2018-12-02 08:34:23,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:34:23,389 INFO L480 AbstractCegarLoop]: Abstraction has 12880 states and 42719 transitions. [2018-12-02 08:34:23,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 08:34:23,389 INFO L276 IsEmpty]: Start isEmpty. Operand 12880 states and 42719 transitions. [2018-12-02 08:34:23,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-02 08:34:23,391 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:34:23,391 INFO L402 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] [2018-12-02 08:34:23,392 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:34:23,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:34:23,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1961100684, now seen corresponding path program 1 times [2018-12-02 08:34:23,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:34:23,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:34:23,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:34:23,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:34:23,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:34:23,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:34:23,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:34:23,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:34:23,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 08:34:23,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 08:34:23,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 08:34:23,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 08:34:23,432 INFO L87 Difference]: Start difference. First operand 12880 states and 42719 transitions. Second operand 4 states. [2018-12-02 08:34:23,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:34:23,778 INFO L93 Difference]: Finished difference Result 18387 states and 59996 transitions. [2018-12-02 08:34:23,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 08:34:23,778 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-12-02 08:34:23,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:34:23,802 INFO L225 Difference]: With dead ends: 18387 [2018-12-02 08:34:23,802 INFO L226 Difference]: Without dead ends: 18387 [2018-12-02 08:34:23,803 INFO L631 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 [2018-12-02 08:34:23,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18387 states. [2018-12-02 08:34:23,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18387 to 16344. [2018-12-02 08:34:23,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16344 states. [2018-12-02 08:34:23,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16344 states to 16344 states and 53813 transitions. [2018-12-02 08:34:23,984 INFO L78 Accepts]: Start accepts. Automaton has 16344 states and 53813 transitions. Word has length 59 [2018-12-02 08:34:23,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:34:23,985 INFO L480 AbstractCegarLoop]: Abstraction has 16344 states and 53813 transitions. [2018-12-02 08:34:23,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 08:34:23,985 INFO L276 IsEmpty]: Start isEmpty. Operand 16344 states and 53813 transitions. [2018-12-02 08:34:23,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-02 08:34:23,988 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:34:23,988 INFO L402 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] [2018-12-02 08:34:23,989 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:34:23,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:34:23,989 INFO L82 PathProgramCache]: Analyzing trace with hash -980556915, now seen corresponding path program 1 times [2018-12-02 08:34:23,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:34:23,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:34:23,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:34:23,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:34:23,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:34:23,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:34:24,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:34:24,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:34:24,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 08:34:24,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 08:34:24,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 08:34:24,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 08:34:24,033 INFO L87 Difference]: Start difference. First operand 16344 states and 53813 transitions. Second operand 5 states. [2018-12-02 08:34:24,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:34:24,054 INFO L93 Difference]: Finished difference Result 2852 states and 7522 transitions. [2018-12-02 08:34:24,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 08:34:24,055 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2018-12-02 08:34:24,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:34:24,056 INFO L225 Difference]: With dead ends: 2852 [2018-12-02 08:34:24,056 INFO L226 Difference]: Without dead ends: 2352 [2018-12-02 08:34:24,057 INFO L631 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 [2018-12-02 08:34:24,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2352 states. [2018-12-02 08:34:24,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2352 to 2245. [2018-12-02 08:34:24,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2245 states. [2018-12-02 08:34:24,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 2245 states and 5897 transitions. [2018-12-02 08:34:24,072 INFO L78 Accepts]: Start accepts. Automaton has 2245 states and 5897 transitions. Word has length 59 [2018-12-02 08:34:24,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:34:24,072 INFO L480 AbstractCegarLoop]: Abstraction has 2245 states and 5897 transitions. [2018-12-02 08:34:24,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 08:34:24,072 INFO L276 IsEmpty]: Start isEmpty. Operand 2245 states and 5897 transitions. [2018-12-02 08:34:24,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-02 08:34:24,074 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:34:24,074 INFO L402 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:34:24,074 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:34:24,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:34:24,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1465881044, now seen corresponding path program 1 times [2018-12-02 08:34:24,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:34:24,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:34:24,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:34:24,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:34:24,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:34:24,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:34:24,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:34:24,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:34:24,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 08:34:24,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 08:34:24,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 08:34:24,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 08:34:24,124 INFO L87 Difference]: Start difference. First operand 2245 states and 5897 transitions. Second operand 4 states. [2018-12-02 08:34:24,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:34:24,218 INFO L93 Difference]: Finished difference Result 2767 states and 7108 transitions. [2018-12-02 08:34:24,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 08:34:24,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-02 08:34:24,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:34:24,220 INFO L225 Difference]: With dead ends: 2767 [2018-12-02 08:34:24,220 INFO L226 Difference]: Without dead ends: 2739 [2018-12-02 08:34:24,221 INFO L631 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 [2018-12-02 08:34:24,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2739 states. [2018-12-02 08:34:24,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2739 to 2382. [2018-12-02 08:34:24,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2382 states. [2018-12-02 08:34:24,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2382 states to 2382 states and 6202 transitions. [2018-12-02 08:34:24,241 INFO L78 Accepts]: Start accepts. Automaton has 2382 states and 6202 transitions. Word has length 92 [2018-12-02 08:34:24,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:34:24,241 INFO L480 AbstractCegarLoop]: Abstraction has 2382 states and 6202 transitions. [2018-12-02 08:34:24,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 08:34:24,241 INFO L276 IsEmpty]: Start isEmpty. Operand 2382 states and 6202 transitions. [2018-12-02 08:34:24,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-02 08:34:24,243 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:34:24,243 INFO L402 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:34:24,243 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:34:24,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:34:24,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1859505229, now seen corresponding path program 1 times [2018-12-02 08:34:24,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:34:24,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:34:24,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:34:24,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:34:24,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:34:24,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:34:24,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:34:24,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:34:24,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 08:34:24,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 08:34:24,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 08:34:24,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 08:34:24,277 INFO L87 Difference]: Start difference. First operand 2382 states and 6202 transitions. Second operand 4 states. [2018-12-02 08:34:24,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:34:24,406 INFO L93 Difference]: Finished difference Result 3290 states and 8632 transitions. [2018-12-02 08:34:24,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 08:34:24,406 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-02 08:34:24,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:34:24,408 INFO L225 Difference]: With dead ends: 3290 [2018-12-02 08:34:24,408 INFO L226 Difference]: Without dead ends: 3290 [2018-12-02 08:34:24,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 08:34:24,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3290 states. [2018-12-02 08:34:24,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3290 to 2263. [2018-12-02 08:34:24,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2263 states. [2018-12-02 08:34:24,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2263 states to 2263 states and 5847 transitions. [2018-12-02 08:34:24,429 INFO L78 Accepts]: Start accepts. Automaton has 2263 states and 5847 transitions. Word has length 92 [2018-12-02 08:34:24,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:34:24,429 INFO L480 AbstractCegarLoop]: Abstraction has 2263 states and 5847 transitions. [2018-12-02 08:34:24,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 08:34:24,429 INFO L276 IsEmpty]: Start isEmpty. Operand 2263 states and 5847 transitions. [2018-12-02 08:34:24,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-02 08:34:24,432 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:34:24,432 INFO L402 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:34:24,432 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:34:24,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:34:24,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1699619141, now seen corresponding path program 2 times [2018-12-02 08:34:24,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:34:24,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:34:24,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:34:24,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:34:24,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:34:24,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:34:24,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:34:24,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:34:24,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 08:34:24,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 08:34:24,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 08:34:24,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 08:34:24,497 INFO L87 Difference]: Start difference. First operand 2263 states and 5847 transitions. Second operand 5 states. [2018-12-02 08:34:24,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:34:24,602 INFO L93 Difference]: Finished difference Result 2653 states and 6764 transitions. [2018-12-02 08:34:24,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 08:34:24,603 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2018-12-02 08:34:24,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:34:24,605 INFO L225 Difference]: With dead ends: 2653 [2018-12-02 08:34:24,605 INFO L226 Difference]: Without dead ends: 2625 [2018-12-02 08:34:24,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 08:34:24,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2625 states. [2018-12-02 08:34:24,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2625 to 2256. [2018-12-02 08:34:24,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2256 states. [2018-12-02 08:34:24,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2256 states to 2256 states and 5823 transitions. [2018-12-02 08:34:24,622 INFO L78 Accepts]: Start accepts. Automaton has 2256 states and 5823 transitions. Word has length 92 [2018-12-02 08:34:24,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:34:24,622 INFO L480 AbstractCegarLoop]: Abstraction has 2256 states and 5823 transitions. [2018-12-02 08:34:24,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 08:34:24,622 INFO L276 IsEmpty]: Start isEmpty. Operand 2256 states and 5823 transitions. [2018-12-02 08:34:24,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 08:34:24,624 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:34:24,624 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:34:24,624 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:34:24,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:34:24,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1380208170, now seen corresponding path program 1 times [2018-12-02 08:34:24,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:34:24,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:34:24,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:34:24,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 08:34:24,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:34:24,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:34:24,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:34:24,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:34:24,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 08:34:24,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 08:34:24,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 08:34:24,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 08:34:24,670 INFO L87 Difference]: Start difference. First operand 2256 states and 5823 transitions. Second operand 4 states. [2018-12-02 08:34:24,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:34:24,767 INFO L93 Difference]: Finished difference Result 4123 states and 10774 transitions. [2018-12-02 08:34:24,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 08:34:24,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-02 08:34:24,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:34:24,771 INFO L225 Difference]: With dead ends: 4123 [2018-12-02 08:34:24,771 INFO L226 Difference]: Without dead ends: 4095 [2018-12-02 08:34:24,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 08:34:24,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4095 states. [2018-12-02 08:34:24,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4095 to 2182. [2018-12-02 08:34:24,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2182 states. [2018-12-02 08:34:24,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 2182 states and 5597 transitions. [2018-12-02 08:34:24,798 INFO L78 Accepts]: Start accepts. Automaton has 2182 states and 5597 transitions. Word has length 94 [2018-12-02 08:34:24,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:34:24,798 INFO L480 AbstractCegarLoop]: Abstraction has 2182 states and 5597 transitions. [2018-12-02 08:34:24,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 08:34:24,798 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 5597 transitions. [2018-12-02 08:34:24,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 08:34:24,800 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:34:24,800 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:34:24,800 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:34:24,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:34:24,800 INFO L82 PathProgramCache]: Analyzing trace with hash 81371829, now seen corresponding path program 1 times [2018-12-02 08:34:24,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:34:24,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:34:24,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:34:24,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:34:24,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:34:24,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:34:24,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:34:24,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:34:24,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 08:34:24,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 08:34:24,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 08:34:24,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 08:34:24,848 INFO L87 Difference]: Start difference. First operand 2182 states and 5597 transitions. Second operand 6 states. [2018-12-02 08:34:25,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:34:25,055 INFO L93 Difference]: Finished difference Result 2496 states and 6214 transitions. [2018-12-02 08:34:25,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 08:34:25,055 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-02 08:34:25,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:34:25,057 INFO L225 Difference]: With dead ends: 2496 [2018-12-02 08:34:25,057 INFO L226 Difference]: Without dead ends: 2425 [2018-12-02 08:34:25,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 08:34:25,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2425 states. [2018-12-02 08:34:25,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2425 to 2336. [2018-12-02 08:34:25,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2336 states. [2018-12-02 08:34:25,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2336 states to 2336 states and 5899 transitions. [2018-12-02 08:34:25,072 INFO L78 Accepts]: Start accepts. Automaton has 2336 states and 5899 transitions. Word has length 94 [2018-12-02 08:34:25,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:34:25,072 INFO L480 AbstractCegarLoop]: Abstraction has 2336 states and 5899 transitions. [2018-12-02 08:34:25,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 08:34:25,073 INFO L276 IsEmpty]: Start isEmpty. Operand 2336 states and 5899 transitions. [2018-12-02 08:34:25,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 08:34:25,074 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:34:25,074 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:34:25,074 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:34:25,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:34:25,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1782112308, now seen corresponding path program 1 times [2018-12-02 08:34:25,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:34:25,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:34:25,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:34:25,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:34:25,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:34:25,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:34:25,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:34:25,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:34:25,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 08:34:25,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 08:34:25,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 08:34:25,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 08:34:25,130 INFO L87 Difference]: Start difference. First operand 2336 states and 5899 transitions. Second operand 7 states. [2018-12-02 08:34:25,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:34:25,257 INFO L93 Difference]: Finished difference Result 2551 states and 6435 transitions. [2018-12-02 08:34:25,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 08:34:25,257 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-02 08:34:25,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:34:25,259 INFO L225 Difference]: With dead ends: 2551 [2018-12-02 08:34:25,259 INFO L226 Difference]: Without dead ends: 2551 [2018-12-02 08:34:25,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 08:34:25,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2551 states. [2018-12-02 08:34:25,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2551 to 2315. [2018-12-02 08:34:25,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2315 states. [2018-12-02 08:34:25,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2315 states to 2315 states and 5859 transitions. [2018-12-02 08:34:25,275 INFO L78 Accepts]: Start accepts. Automaton has 2315 states and 5859 transitions. Word has length 94 [2018-12-02 08:34:25,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:34:25,275 INFO L480 AbstractCegarLoop]: Abstraction has 2315 states and 5859 transitions. [2018-12-02 08:34:25,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 08:34:25,275 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 5859 transitions. [2018-12-02 08:34:25,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 08:34:25,277 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:34:25,277 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:34:25,277 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:34:25,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:34:25,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1101975468, now seen corresponding path program 1 times [2018-12-02 08:34:25,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:34:25,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:34:25,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:34:25,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:34:25,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:34:25,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:34:25,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:34:25,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:34:25,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 08:34:25,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 08:34:25,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 08:34:25,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 08:34:25,315 INFO L87 Difference]: Start difference. First operand 2315 states and 5859 transitions. Second operand 5 states. [2018-12-02 08:34:25,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:34:25,394 INFO L93 Difference]: Finished difference Result 2041 states and 5171 transitions. [2018-12-02 08:34:25,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 08:34:25,394 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-02 08:34:25,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:34:25,396 INFO L225 Difference]: With dead ends: 2041 [2018-12-02 08:34:25,396 INFO L226 Difference]: Without dead ends: 2041 [2018-12-02 08:34:25,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 08:34:25,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2041 states. [2018-12-02 08:34:25,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2041 to 1953. [2018-12-02 08:34:25,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1953 states. [2018-12-02 08:34:25,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1953 states to 1953 states and 4988 transitions. [2018-12-02 08:34:25,455 INFO L78 Accepts]: Start accepts. Automaton has 1953 states and 4988 transitions. Word has length 94 [2018-12-02 08:34:25,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:34:25,456 INFO L480 AbstractCegarLoop]: Abstraction has 1953 states and 4988 transitions. [2018-12-02 08:34:25,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 08:34:25,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1953 states and 4988 transitions. [2018-12-02 08:34:25,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 08:34:25,458 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:34:25,458 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:34:25,459 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:34:25,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:34:25,459 INFO L82 PathProgramCache]: Analyzing trace with hash -554293397, now seen corresponding path program 1 times [2018-12-02 08:34:25,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:34:25,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:34:25,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:34:25,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:34:25,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:34:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:34:25,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:34:25,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:34:25,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 08:34:25,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 08:34:25,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 08:34:25,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 08:34:25,510 INFO L87 Difference]: Start difference. First operand 1953 states and 4988 transitions. Second operand 5 states. [2018-12-02 08:34:25,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:34:25,621 INFO L93 Difference]: Finished difference Result 3431 states and 9030 transitions. [2018-12-02 08:34:25,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 08:34:25,621 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-02 08:34:25,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:34:25,624 INFO L225 Difference]: With dead ends: 3431 [2018-12-02 08:34:25,624 INFO L226 Difference]: Without dead ends: 3431 [2018-12-02 08:34:25,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-02 08:34:25,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3431 states. [2018-12-02 08:34:25,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3431 to 1989. [2018-12-02 08:34:25,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1989 states. [2018-12-02 08:34:25,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 5068 transitions. [2018-12-02 08:34:25,644 INFO L78 Accepts]: Start accepts. Automaton has 1989 states and 5068 transitions. Word has length 94 [2018-12-02 08:34:25,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:34:25,644 INFO L480 AbstractCegarLoop]: Abstraction has 1989 states and 5068 transitions. [2018-12-02 08:34:25,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 08:34:25,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1989 states and 5068 transitions. [2018-12-02 08:34:25,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 08:34:25,646 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:34:25,646 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:34:25,646 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:34:25,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:34:25,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1381366890, now seen corresponding path program 1 times [2018-12-02 08:34:25,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:34:25,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:34:25,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:34:25,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:34:25,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:34:25,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:34:25,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:34:25,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:34:25,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 08:34:25,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 08:34:25,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 08:34:25,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 08:34:25,675 INFO L87 Difference]: Start difference. First operand 1989 states and 5068 transitions. Second operand 4 states. [2018-12-02 08:34:25,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:34:25,748 INFO L93 Difference]: Finished difference Result 2325 states and 5988 transitions. [2018-12-02 08:34:25,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 08:34:25,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-02 08:34:25,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:34:25,751 INFO L225 Difference]: With dead ends: 2325 [2018-12-02 08:34:25,752 INFO L226 Difference]: Without dead ends: 2325 [2018-12-02 08:34:25,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 08:34:25,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2325 states. [2018-12-02 08:34:25,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2325 to 2293. [2018-12-02 08:34:25,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2293 states. [2018-12-02 08:34:25,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2293 states to 2293 states and 5908 transitions. [2018-12-02 08:34:25,773 INFO L78 Accepts]: Start accepts. Automaton has 2293 states and 5908 transitions. Word has length 94 [2018-12-02 08:34:25,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:34:25,773 INFO L480 AbstractCegarLoop]: Abstraction has 2293 states and 5908 transitions. [2018-12-02 08:34:25,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 08:34:25,773 INFO L276 IsEmpty]: Start isEmpty. Operand 2293 states and 5908 transitions. [2018-12-02 08:34:25,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 08:34:25,774 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:34:25,775 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:34:25,775 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:34:25,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:34:25,775 INFO L82 PathProgramCache]: Analyzing trace with hash -695842453, now seen corresponding path program 1 times [2018-12-02 08:34:25,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:34:25,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:34:25,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:34:25,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:34:25,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:34:25,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:34:25,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:34:25,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:34:25,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 08:34:25,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 08:34:25,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 08:34:25,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 08:34:25,874 INFO L87 Difference]: Start difference. First operand 2293 states and 5908 transitions. Second operand 6 states. [2018-12-02 08:34:25,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:34:25,944 INFO L93 Difference]: Finished difference Result 2005 states and 5012 transitions. [2018-12-02 08:34:25,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 08:34:25,945 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-02 08:34:25,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:34:25,946 INFO L225 Difference]: With dead ends: 2005 [2018-12-02 08:34:25,946 INFO L226 Difference]: Without dead ends: 2005 [2018-12-02 08:34:25,946 INFO L631 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 [2018-12-02 08:34:25,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2005 states. [2018-12-02 08:34:25,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2005 to 1668. [2018-12-02 08:34:25,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1668 states. [2018-12-02 08:34:25,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 4216 transitions. [2018-12-02 08:34:25,958 INFO L78 Accepts]: Start accepts. Automaton has 1668 states and 4216 transitions. Word has length 94 [2018-12-02 08:34:25,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:34:25,958 INFO L480 AbstractCegarLoop]: Abstraction has 1668 states and 4216 transitions. [2018-12-02 08:34:25,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 08:34:25,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 4216 transitions. [2018-12-02 08:34:25,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 08:34:25,959 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:34:25,960 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:34:25,960 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:34:25,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:34:25,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1001566435, now seen corresponding path program 1 times [2018-12-02 08:34:25,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:34:25,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:34:25,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:34:25,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:34:25,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:34:25,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:34:26,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:34:26,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:34:26,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 08:34:26,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 08:34:26,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 08:34:26,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 08:34:26,008 INFO L87 Difference]: Start difference. First operand 1668 states and 4216 transitions. Second operand 8 states. [2018-12-02 08:34:26,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:34:26,306 INFO L93 Difference]: Finished difference Result 3044 states and 7595 transitions. [2018-12-02 08:34:26,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 08:34:26,307 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2018-12-02 08:34:26,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:34:26,309 INFO L225 Difference]: With dead ends: 3044 [2018-12-02 08:34:26,309 INFO L226 Difference]: Without dead ends: 3044 [2018-12-02 08:34:26,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-12-02 08:34:26,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3044 states. [2018-12-02 08:34:26,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3044 to 2386. [2018-12-02 08:34:26,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2386 states. [2018-12-02 08:34:26,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2386 states to 2386 states and 6058 transitions. [2018-12-02 08:34:26,326 INFO L78 Accepts]: Start accepts. Automaton has 2386 states and 6058 transitions. Word has length 96 [2018-12-02 08:34:26,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:34:26,326 INFO L480 AbstractCegarLoop]: Abstraction has 2386 states and 6058 transitions. [2018-12-02 08:34:26,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 08:34:26,326 INFO L276 IsEmpty]: Start isEmpty. Operand 2386 states and 6058 transitions. [2018-12-02 08:34:26,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 08:34:26,328 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:34:26,328 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:34:26,328 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:34:26,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:34:26,328 INFO L82 PathProgramCache]: Analyzing trace with hash -2048636380, now seen corresponding path program 1 times [2018-12-02 08:34:26,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:34:26,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:34:26,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:34:26,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:34:26,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:34:26,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:34:26,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:34:26,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:34:26,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 08:34:26,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 08:34:26,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 08:34:26,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 08:34:26,388 INFO L87 Difference]: Start difference. First operand 2386 states and 6058 transitions. Second operand 7 states. [2018-12-02 08:34:26,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:34:26,559 INFO L93 Difference]: Finished difference Result 2463 states and 6197 transitions. [2018-12-02 08:34:26,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 08:34:26,560 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-02 08:34:26,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:34:26,561 INFO L225 Difference]: With dead ends: 2463 [2018-12-02 08:34:26,561 INFO L226 Difference]: Without dead ends: 2443 [2018-12-02 08:34:26,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-12-02 08:34:26,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2443 states. [2018-12-02 08:34:26,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2443 to 2370. [2018-12-02 08:34:26,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2370 states. [2018-12-02 08:34:26,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2370 states to 2370 states and 6018 transitions. [2018-12-02 08:34:26,577 INFO L78 Accepts]: Start accepts. Automaton has 2370 states and 6018 transitions. Word has length 96 [2018-12-02 08:34:26,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:34:26,577 INFO L480 AbstractCegarLoop]: Abstraction has 2370 states and 6018 transitions. [2018-12-02 08:34:26,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 08:34:26,577 INFO L276 IsEmpty]: Start isEmpty. Operand 2370 states and 6018 transitions. [2018-12-02 08:34:26,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 08:34:26,579 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:34:26,579 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:34:26,579 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:34:26,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:34:26,579 INFO L82 PathProgramCache]: Analyzing trace with hash -77696923, now seen corresponding path program 1 times [2018-12-02 08:34:26,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:34:26,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:34:26,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:34:26,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:34:26,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:34:26,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:34:26,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:34:26,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:34:26,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 08:34:26,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 08:34:26,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 08:34:26,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 08:34:26,635 INFO L87 Difference]: Start difference. First operand 2370 states and 6018 transitions. Second operand 6 states. [2018-12-02 08:34:26,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:34:26,756 INFO L93 Difference]: Finished difference Result 2483 states and 6279 transitions. [2018-12-02 08:34:26,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 08:34:26,756 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-02 08:34:26,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:34:26,758 INFO L225 Difference]: With dead ends: 2483 [2018-12-02 08:34:26,758 INFO L226 Difference]: Without dead ends: 2483 [2018-12-02 08:34:26,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-12-02 08:34:26,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2483 states. [2018-12-02 08:34:26,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2483 to 2423. [2018-12-02 08:34:26,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2423 states. [2018-12-02 08:34:26,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2423 states to 2423 states and 6147 transitions. [2018-12-02 08:34:26,775 INFO L78 Accepts]: Start accepts. Automaton has 2423 states and 6147 transitions. Word has length 96 [2018-12-02 08:34:26,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:34:26,775 INFO L480 AbstractCegarLoop]: Abstraction has 2423 states and 6147 transitions. [2018-12-02 08:34:26,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 08:34:26,775 INFO L276 IsEmpty]: Start isEmpty. Operand 2423 states and 6147 transitions. [2018-12-02 08:34:26,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 08:34:26,777 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:34:26,777 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:34:26,777 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:34:26,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:34:26,777 INFO L82 PathProgramCache]: Analyzing trace with hash -992695643, now seen corresponding path program 1 times [2018-12-02 08:34:26,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:34:26,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:34:26,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:34:26,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:34:26,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:34:26,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:34:26,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:34:26,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:34:26,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 08:34:26,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 08:34:26,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 08:34:26,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 08:34:26,813 INFO L87 Difference]: Start difference. First operand 2423 states and 6147 transitions. Second operand 5 states. [2018-12-02 08:34:26,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:34:26,911 INFO L93 Difference]: Finished difference Result 2743 states and 6947 transitions. [2018-12-02 08:34:26,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 08:34:26,911 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-02 08:34:26,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:34:26,913 INFO L225 Difference]: With dead ends: 2743 [2018-12-02 08:34:26,913 INFO L226 Difference]: Without dead ends: 2743 [2018-12-02 08:34:26,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 08:34:26,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2743 states. [2018-12-02 08:34:26,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2743 to 2152. [2018-12-02 08:34:26,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2152 states. [2018-12-02 08:34:26,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 2152 states and 5472 transitions. [2018-12-02 08:34:26,931 INFO L78 Accepts]: Start accepts. Automaton has 2152 states and 5472 transitions. Word has length 96 [2018-12-02 08:34:26,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:34:26,931 INFO L480 AbstractCegarLoop]: Abstraction has 2152 states and 5472 transitions. [2018-12-02 08:34:26,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 08:34:26,931 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 5472 transitions. [2018-12-02 08:34:26,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 08:34:26,932 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:34:26,933 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:34:26,933 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:34:26,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:34:26,933 INFO L82 PathProgramCache]: Analyzing trace with hash 252068838, now seen corresponding path program 1 times [2018-12-02 08:34:26,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:34:26,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:34:26,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:34:26,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:34:26,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:34:26,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:34:26,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:34:26,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:34:26,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 08:34:26,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 08:34:26,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 08:34:26,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-02 08:34:26,995 INFO L87 Difference]: Start difference. First operand 2152 states and 5472 transitions. Second operand 9 states. [2018-12-02 08:34:27,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:34:27,086 INFO L93 Difference]: Finished difference Result 3904 states and 10123 transitions. [2018-12-02 08:34:27,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 08:34:27,087 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2018-12-02 08:34:27,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:34:27,088 INFO L225 Difference]: With dead ends: 3904 [2018-12-02 08:34:27,088 INFO L226 Difference]: Without dead ends: 1836 [2018-12-02 08:34:27,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-12-02 08:34:27,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1836 states. [2018-12-02 08:34:27,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1836 to 1836. [2018-12-02 08:34:27,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1836 states. [2018-12-02 08:34:27,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1836 states to 1836 states and 4797 transitions. [2018-12-02 08:34:27,100 INFO L78 Accepts]: Start accepts. Automaton has 1836 states and 4797 transitions. Word has length 96 [2018-12-02 08:34:27,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:34:27,100 INFO L480 AbstractCegarLoop]: Abstraction has 1836 states and 4797 transitions. [2018-12-02 08:34:27,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 08:34:27,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1836 states and 4797 transitions. [2018-12-02 08:34:27,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 08:34:27,102 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:34:27,102 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:34:27,102 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:34:27,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:34:27,102 INFO L82 PathProgramCache]: Analyzing trace with hash 981350673, now seen corresponding path program 2 times [2018-12-02 08:34:27,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:34:27,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:34:27,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:34:27,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:34:27,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:34:27,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:34:27,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:34:27,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:34:27,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 08:34:27,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 08:34:27,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 08:34:27,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 08:34:27,183 INFO L87 Difference]: Start difference. First operand 1836 states and 4797 transitions. Second operand 6 states. [2018-12-02 08:34:27,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:34:27,324 INFO L93 Difference]: Finished difference Result 1912 states and 4951 transitions. [2018-12-02 08:34:27,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 08:34:27,324 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-02 08:34:27,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:34:27,326 INFO L225 Difference]: With dead ends: 1912 [2018-12-02 08:34:27,326 INFO L226 Difference]: Without dead ends: 1912 [2018-12-02 08:34:27,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-12-02 08:34:27,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1912 states. [2018-12-02 08:34:27,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1912 to 1846. [2018-12-02 08:34:27,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1846 states. [2018-12-02 08:34:27,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1846 states to 1846 states and 4824 transitions. [2018-12-02 08:34:27,338 INFO L78 Accepts]: Start accepts. Automaton has 1846 states and 4824 transitions. Word has length 96 [2018-12-02 08:34:27,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:34:27,338 INFO L480 AbstractCegarLoop]: Abstraction has 1846 states and 4824 transitions. [2018-12-02 08:34:27,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 08:34:27,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1846 states and 4824 transitions. [2018-12-02 08:34:27,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 08:34:27,340 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:34:27,340 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:34:27,340 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:34:27,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:34:27,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1311116434, now seen corresponding path program 2 times [2018-12-02 08:34:27,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:34:27,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:34:27,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:34:27,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 08:34:27,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:34:27,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:34:27,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:34:27,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:34:27,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 08:34:27,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 08:34:27,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 08:34:27,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 08:34:27,437 INFO L87 Difference]: Start difference. First operand 1846 states and 4824 transitions. Second operand 12 states. [2018-12-02 08:34:27,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:34:27,768 INFO L93 Difference]: Finished difference Result 3508 states and 9256 transitions. [2018-12-02 08:34:27,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 08:34:27,768 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2018-12-02 08:34:27,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:34:27,770 INFO L225 Difference]: With dead ends: 3508 [2018-12-02 08:34:27,770 INFO L226 Difference]: Without dead ends: 2532 [2018-12-02 08:34:27,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-02 08:34:27,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2532 states. [2018-12-02 08:34:27,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2532 to 2380. [2018-12-02 08:34:27,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2380 states. [2018-12-02 08:34:27,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2380 states to 2380 states and 6080 transitions. [2018-12-02 08:34:27,786 INFO L78 Accepts]: Start accepts. Automaton has 2380 states and 6080 transitions. Word has length 96 [2018-12-02 08:34:27,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:34:27,786 INFO L480 AbstractCegarLoop]: Abstraction has 2380 states and 6080 transitions. [2018-12-02 08:34:27,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 08:34:27,786 INFO L276 IsEmpty]: Start isEmpty. Operand 2380 states and 6080 transitions. [2018-12-02 08:34:27,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 08:34:27,788 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:34:27,788 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:34:27,788 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:34:27,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:34:27,789 INFO L82 PathProgramCache]: Analyzing trace with hash 187348118, now seen corresponding path program 3 times [2018-12-02 08:34:27,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:34:27,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:34:27,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:34:27,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 08:34:27,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:34:27,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:34:27,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:34:27,826 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 08:34:27,891 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 08:34:27,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 08:34:27 BasicIcfg [2018-12-02 08:34:27,892 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 08:34:27,892 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 08:34:27,892 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 08:34:27,892 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 08:34:27,892 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:34:17" (3/4) ... [2018-12-02 08:34:27,894 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 08:34:27,959 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_41804208-30be-4d18-ae28-13d54f6aa5ef/bin-2019/uautomizer/witness.graphml [2018-12-02 08:34:27,959 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 08:34:27,960 INFO L168 Benchmark]: Toolchain (without parser) took 11466.50 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.3 GB). Free memory was 956.0 MB in the beginning and 932.9 MB in the end (delta: 23.1 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2018-12-02 08:34:27,961 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 08:34:27,961 INFO L168 Benchmark]: CACSL2BoogieTranslator took 318.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -146.4 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2018-12-02 08:34:27,961 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.08 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-12-02 08:34:27,961 INFO L168 Benchmark]: Boogie Preprocessor took 20.77 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. [2018-12-02 08:34:27,961 INFO L168 Benchmark]: RCFGBuilder took 345.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.0 MB). Peak memory consumption was 48.0 MB. Max. memory is 11.5 GB. [2018-12-02 08:34:27,962 INFO L168 Benchmark]: TraceAbstraction took 10677.08 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 1.0 GB in the beginning and 982.4 MB in the end (delta: 65.0 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2018-12-02 08:34:27,962 INFO L168 Benchmark]: Witness Printer took 67.74 ms. Allocated memory is still 2.3 GB. Free memory was 982.4 MB in the beginning and 932.9 MB in the end (delta: 49.6 MB). Peak memory consumption was 49.6 MB. Max. memory is 11.5 GB. [2018-12-02 08:34:27,963 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 318.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -146.4 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.08 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.77 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 345.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.0 MB). Peak memory consumption was 48.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10677.08 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 1.0 GB in the beginning and 982.4 MB in the end (delta: 65.0 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 67.74 ms. Allocated memory is still 2.3 GB. Free memory was 982.4 MB in the beginning and 932.9 MB in the end (delta: 49.6 MB). Peak memory consumption was 49.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L681] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L682] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=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] [L683] -1 int y$mem_tmp; VAL [__unbuffered_cnt=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] [L684] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=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] [L685] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=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] [L686] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=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] [L687] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=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] [L688] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=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] [L689] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=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] [L690] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=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] [L691] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=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}] [L692] -1 int y$w_buff0; VAL [__unbuffered_cnt=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] [L693] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=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] [L694] -1 int y$w_buff1; VAL [__unbuffered_cnt=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] [L695] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=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] [L697] -1 int z = 0; VAL [__unbuffered_cnt=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] [L698] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=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] [L699] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=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] [L765] -1 pthread_t t1615; VAL [__unbuffered_cnt=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] [L766] FCALL, FORK -1 pthread_create(&t1615, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L767] -1 pthread_t t1616; VAL [__unbuffered_cnt=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] [L768] FCALL, FORK -1 pthread_create(&t1616, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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] [L723] 0 y$w_buff1 = y$w_buff0 [L724] 0 y$w_buff0 = 2 [L725] 0 y$w_buff1_used = y$w_buff0_used [L726] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L728] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L729] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L730] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L731] 0 y$r_buff0_thd2 = (_Bool)1 [L734] 0 z = 1 [L737] 0 __unbuffered_p1_EAX = z [L740] 0 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L743] EXPR 0 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_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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L703] 1 x = 1 [L706] 1 y = 1 VAL [__unbuffered_cnt=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=0, weak$$choice2=0, x=1, y=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L743] 0 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L744] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=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=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L709] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=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=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L709] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y VAL [__unbuffered_cnt=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=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2, z=1] [L745] EXPR 0 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2, z=1] [L745] 0 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 [L709] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=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=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2, z=1] [L709] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L710] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=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=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=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=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L710] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L746] 0 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L747] EXPR 0 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 0 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 [L750] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L711] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L711] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L712] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L712] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L713] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L713] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L716] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L770] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] EXPR -1 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] EXPR -1 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L775] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L775] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L776] EXPR -1 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L776] -1 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 [L777] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L777] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L778] EXPR -1 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L778] -1 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 [L781] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L782] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L783] -1 y$flush_delayed = weak$$choice2 [L784] -1 y$mem_tmp = y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L785] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L785] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L786] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L786] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L787] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L788] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L788] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L789] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L789] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L790] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L791] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L792] -1 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L793] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L793] -1 y = y$flush_delayed ? y$mem_tmp : y [L794] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, 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=2, 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, 181 locations, 3 error locations. UNSAFE Result, 10.5s OverallTime, 26 OverallIterations, 1 TraceHistogramMax, 4.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5253 SDtfs, 4713 SDslu, 10752 SDs, 0 SdLazy, 3859 SolverSat, 248 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 234 GetRequests, 71 SyntacticMatches, 17 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37143occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.2s AutomataMinimizationTime, 25 MinimizatonAttempts, 58274 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 2099 NumberOfCodeBlocks, 2099 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1978 ConstructedInterpolants, 0 QuantifiedInterpolants, 405445 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...