./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix054_rmo.opt_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_d8691dde-a897-4ec8-a994-5ac1241ba8ee/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d8691dde-a897-4ec8-a994-5ac1241ba8ee/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d8691dde-a897-4ec8-a994-5ac1241ba8ee/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d8691dde-a897-4ec8-a994-5ac1241ba8ee/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix054_rmo.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d8691dde-a897-4ec8-a994-5ac1241ba8ee/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d8691dde-a897-4ec8-a994-5ac1241ba8ee/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 43cc8d329ef8ccfa7682208cd3c203d89dd9d0dc ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 02:43:52,794 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 02:43:52,795 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 02:43:52,801 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 02:43:52,801 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 02:43:52,802 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 02:43:52,802 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 02:43:52,803 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 02:43:52,804 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 02:43:52,804 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 02:43:52,805 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 02:43:52,805 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 02:43:52,805 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 02:43:52,806 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 02:43:52,806 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 02:43:52,807 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 02:43:52,807 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 02:43:52,808 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 02:43:52,809 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 02:43:52,810 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 02:43:52,810 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 02:43:52,811 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 02:43:52,812 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 02:43:52,812 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 02:43:52,812 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 02:43:52,813 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 02:43:52,813 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 02:43:52,814 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 02:43:52,814 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 02:43:52,815 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 02:43:52,815 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 02:43:52,815 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 02:43:52,815 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 02:43:52,816 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 02:43:52,816 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 02:43:52,817 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 02:43:52,817 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d8691dde-a897-4ec8-a994-5ac1241ba8ee/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-02 02:43:52,824 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 02:43:52,824 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 02:43:52,824 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 02:43:52,825 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 02:43:52,825 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 02:43:52,825 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 02:43:52,825 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 02:43:52,825 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 02:43:52,826 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 02:43:52,826 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 02:43:52,826 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 02:43:52,826 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 02:43:52,826 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 02:43:52,826 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 02:43:52,826 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 02:43:52,826 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 02:43:52,827 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 02:43:52,827 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 02:43:52,827 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 02:43:52,827 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 02:43:52,827 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 02:43:52,827 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 02:43:52,827 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 02:43:52,827 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 02:43:52,828 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 02:43:52,828 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 02:43:52,828 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 02:43:52,828 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 02:43:52,828 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 02:43:52,828 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 02:43:52,828 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_d8691dde-a897-4ec8-a994-5ac1241ba8ee/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 -> 43cc8d329ef8ccfa7682208cd3c203d89dd9d0dc [2018-12-02 02:43:52,847 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 02:43:52,856 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 02:43:52,858 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 02:43:52,859 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 02:43:52,860 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 02:43:52,860 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d8691dde-a897-4ec8-a994-5ac1241ba8ee/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix054_rmo.opt_false-unreach-call.i [2018-12-02 02:43:52,904 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d8691dde-a897-4ec8-a994-5ac1241ba8ee/bin-2019/uautomizer/data/58e457e9b/10fd7133d07149b985a73aeb3dc71ae3/FLAGd00108516 [2018-12-02 02:43:53,292 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 02:43:53,293 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d8691dde-a897-4ec8-a994-5ac1241ba8ee/sv-benchmarks/c/pthread-wmm/mix054_rmo.opt_false-unreach-call.i [2018-12-02 02:43:53,301 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d8691dde-a897-4ec8-a994-5ac1241ba8ee/bin-2019/uautomizer/data/58e457e9b/10fd7133d07149b985a73aeb3dc71ae3/FLAGd00108516 [2018-12-02 02:43:53,309 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d8691dde-a897-4ec8-a994-5ac1241ba8ee/bin-2019/uautomizer/data/58e457e9b/10fd7133d07149b985a73aeb3dc71ae3 [2018-12-02 02:43:53,311 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 02:43:53,312 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 02:43:53,313 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 02:43:53,313 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 02:43:53,315 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 02:43:53,315 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:43:53" (1/1) ... [2018-12-02 02:43:53,317 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ca176b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:43:53, skipping insertion in model container [2018-12-02 02:43:53,317 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:43:53" (1/1) ... [2018-12-02 02:43:53,321 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 02:43:53,342 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 02:43:53,516 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 02:43:53,524 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 02:43:53,608 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 02:43:53,649 INFO L195 MainTranslator]: Completed translation [2018-12-02 02:43:53,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:43:53 WrapperNode [2018-12-02 02:43:53,650 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 02:43:53,651 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 02:43:53,651 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 02:43:53,651 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 02:43:53,657 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:43:53" (1/1) ... [2018-12-02 02:43:53,672 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:43:53" (1/1) ... [2018-12-02 02:43:53,696 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 02:43:53,696 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 02:43:53,696 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 02:43:53,697 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 02:43:53,704 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:43:53" (1/1) ... [2018-12-02 02:43:53,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:43:53" (1/1) ... [2018-12-02 02:43:53,707 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:43:53" (1/1) ... [2018-12-02 02:43:53,707 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:43:53" (1/1) ... [2018-12-02 02:43:53,713 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:43:53" (1/1) ... [2018-12-02 02:43:53,716 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:43:53" (1/1) ... [2018-12-02 02:43:53,717 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:43:53" (1/1) ... [2018-12-02 02:43:53,720 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 02:43:53,721 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 02:43:53,721 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 02:43:53,721 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 02:43:53,722 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:43:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d8691dde-a897-4ec8-a994-5ac1241ba8ee/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 02:43:53,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 02:43:53,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 02:43:53,764 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 02:43:53,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 02:43:53,765 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 02:43:53,765 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 02:43:53,765 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 02:43:53,765 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 02:43:53,765 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 02:43:53,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 02:43:53,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 02:43:53,766 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 02:43:54,077 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 02:43:54,078 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 02:43:54,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:43:54 BoogieIcfgContainer [2018-12-02 02:43:54,078 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 02:43:54,079 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 02:43:54,079 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 02:43:54,081 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 02:43:54,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:43:53" (1/3) ... [2018-12-02 02:43:54,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4409b022 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:43:54, skipping insertion in model container [2018-12-02 02:43:54,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:43:53" (2/3) ... [2018-12-02 02:43:54,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4409b022 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:43:54, skipping insertion in model container [2018-12-02 02:43:54,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:43:54" (3/3) ... [2018-12-02 02:43:54,083 INFO L112 eAbstractionObserver]: Analyzing ICFG mix054_rmo.opt_false-unreach-call.i [2018-12-02 02:43:54,109 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,109 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,109 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,109 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,109 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,110 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,110 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,110 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,110 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,110 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,110 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,110 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,110 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,110 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,111 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,111 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,111 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,111 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,111 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,111 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,111 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,112 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,112 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,112 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,112 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,112 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,112 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,112 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,113 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,113 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,113 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,113 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,113 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,113 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,113 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,114 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,114 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,114 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,114 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,114 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,114 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,114 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,114 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,115 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,115 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,115 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,115 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,115 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,115 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,115 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,116 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,116 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,116 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,116 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,116 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,116 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,117 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,117 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,117 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,117 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,117 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,117 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,117 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,118 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,118 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,118 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,118 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,118 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,118 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,118 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,119 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,119 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:43:54,123 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 02:43:54,123 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 02:43:54,128 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 02:43:54,138 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 02:43:54,154 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 02:43:54,155 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 02:43:54,155 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 02:43:54,155 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 02:43:54,155 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 02:43:54,155 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 02:43:54,155 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 02:43:54,155 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 02:43:54,155 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 02:43:54,163 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 141places, 179 transitions [2018-12-02 02:43:55,261 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25087 states. [2018-12-02 02:43:55,262 INFO L276 IsEmpty]: Start isEmpty. Operand 25087 states. [2018-12-02 02:43:55,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 02:43:55,268 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:43:55,268 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] [2018-12-02 02:43:55,269 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:43:55,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:43:55,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1104590460, now seen corresponding path program 1 times [2018-12-02 02:43:55,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:43:55,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:43:55,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:43:55,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:43:55,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:43:55,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:43:55,413 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 02:43:55,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:43:55,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 02:43:55,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 02:43:55,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 02:43:55,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 02:43:55,426 INFO L87 Difference]: Start difference. First operand 25087 states. Second operand 4 states. [2018-12-02 02:43:55,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:43:55,818 INFO L93 Difference]: Finished difference Result 45387 states and 177625 transitions. [2018-12-02 02:43:55,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 02:43:55,819 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-12-02 02:43:55,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:43:55,971 INFO L225 Difference]: With dead ends: 45387 [2018-12-02 02:43:55,971 INFO L226 Difference]: Without dead ends: 40627 [2018-12-02 02:43:55,973 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 02:43:56,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40627 states. [2018-12-02 02:43:56,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40627 to 23661. [2018-12-02 02:43:56,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23661 states. [2018-12-02 02:43:56,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23661 states to 23661 states and 92542 transitions. [2018-12-02 02:43:56,732 INFO L78 Accepts]: Start accepts. Automaton has 23661 states and 92542 transitions. Word has length 36 [2018-12-02 02:43:56,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:43:56,733 INFO L480 AbstractCegarLoop]: Abstraction has 23661 states and 92542 transitions. [2018-12-02 02:43:56,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 02:43:56,733 INFO L276 IsEmpty]: Start isEmpty. Operand 23661 states and 92542 transitions. [2018-12-02 02:43:56,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-02 02:43:56,735 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:43:56,736 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] [2018-12-02 02:43:56,736 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:43:56,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:43:56,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1826409231, now seen corresponding path program 1 times [2018-12-02 02:43:56,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:43:56,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:43:56,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:43:56,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:43:56,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:43:56,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:43:56,791 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 02:43:56,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:43:56,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 02:43:56,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 02:43:56,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 02:43:56,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 02:43:56,793 INFO L87 Difference]: Start difference. First operand 23661 states and 92542 transitions. Second operand 5 states. [2018-12-02 02:43:57,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:43:57,511 INFO L93 Difference]: Finished difference Result 64829 states and 241368 transitions. [2018-12-02 02:43:57,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 02:43:57,512 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-12-02 02:43:57,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:43:57,675 INFO L225 Difference]: With dead ends: 64829 [2018-12-02 02:43:57,675 INFO L226 Difference]: Without dead ends: 64669 [2018-12-02 02:43:57,675 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 02:43:57,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64669 states. [2018-12-02 02:43:58,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64669 to 37141. [2018-12-02 02:43:58,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37141 states. [2018-12-02 02:43:58,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37141 states to 37141 states and 138283 transitions. [2018-12-02 02:43:58,472 INFO L78 Accepts]: Start accepts. Automaton has 37141 states and 138283 transitions. Word has length 43 [2018-12-02 02:43:58,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:43:58,474 INFO L480 AbstractCegarLoop]: Abstraction has 37141 states and 138283 transitions. [2018-12-02 02:43:58,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 02:43:58,474 INFO L276 IsEmpty]: Start isEmpty. Operand 37141 states and 138283 transitions. [2018-12-02 02:43:58,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-02 02:43:58,478 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:43:58,478 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] [2018-12-02 02:43:58,478 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:43:58,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:43:58,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1003362560, now seen corresponding path program 1 times [2018-12-02 02:43:58,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:43:58,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:43:58,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:43:58,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:43:58,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:43:58,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:43:58,546 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 02:43:58,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:43:58,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 02:43:58,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 02:43:58,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 02:43:58,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 02:43:58,547 INFO L87 Difference]: Start difference. First operand 37141 states and 138283 transitions. Second operand 4 states. [2018-12-02 02:43:58,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:43:58,593 INFO L93 Difference]: Finished difference Result 12363 states and 41176 transitions. [2018-12-02 02:43:58,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 02:43:58,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-12-02 02:43:58,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:43:58,609 INFO L225 Difference]: With dead ends: 12363 [2018-12-02 02:43:58,610 INFO L226 Difference]: Without dead ends: 11842 [2018-12-02 02:43:58,610 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 02:43:58,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11842 states. [2018-12-02 02:43:58,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11842 to 11842. [2018-12-02 02:43:58,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11842 states. [2018-12-02 02:43:58,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11842 states to 11842 states and 39621 transitions. [2018-12-02 02:43:58,749 INFO L78 Accepts]: Start accepts. Automaton has 11842 states and 39621 transitions. Word has length 44 [2018-12-02 02:43:58,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:43:58,749 INFO L480 AbstractCegarLoop]: Abstraction has 11842 states and 39621 transitions. [2018-12-02 02:43:58,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 02:43:58,749 INFO L276 IsEmpty]: Start isEmpty. Operand 11842 states and 39621 transitions. [2018-12-02 02:43:58,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-02 02:43:58,752 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:43:58,752 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] [2018-12-02 02:43:58,752 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:43:58,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:43:58,752 INFO L82 PathProgramCache]: Analyzing trace with hash 77217480, now seen corresponding path program 1 times [2018-12-02 02:43:58,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:43:58,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:43:58,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:43:58,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:43:58,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:43:58,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:43:58,803 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 02:43:58,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:43:58,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 02:43:58,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 02:43:58,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 02:43:58,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 02:43:58,804 INFO L87 Difference]: Start difference. First operand 11842 states and 39621 transitions. Second operand 4 states. [2018-12-02 02:43:58,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:43:58,954 INFO L93 Difference]: Finished difference Result 17018 states and 55692 transitions. [2018-12-02 02:43:58,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 02:43:58,954 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2018-12-02 02:43:58,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:43:58,978 INFO L225 Difference]: With dead ends: 17018 [2018-12-02 02:43:58,978 INFO L226 Difference]: Without dead ends: 17018 [2018-12-02 02:43:58,979 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 02:43:59,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17018 states. [2018-12-02 02:43:59,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17018 to 12878. [2018-12-02 02:43:59,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12878 states. [2018-12-02 02:43:59,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12878 states to 12878 states and 42719 transitions. [2018-12-02 02:43:59,199 INFO L78 Accepts]: Start accepts. Automaton has 12878 states and 42719 transitions. Word has length 57 [2018-12-02 02:43:59,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:43:59,200 INFO L480 AbstractCegarLoop]: Abstraction has 12878 states and 42719 transitions. [2018-12-02 02:43:59,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 02:43:59,200 INFO L276 IsEmpty]: Start isEmpty. Operand 12878 states and 42719 transitions. [2018-12-02 02:43:59,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-02 02:43:59,205 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:43:59,205 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] [2018-12-02 02:43:59,205 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:43:59,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:43:59,205 INFO L82 PathProgramCache]: Analyzing trace with hash -257181528, now seen corresponding path program 1 times [2018-12-02 02:43:59,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:43:59,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:43:59,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:43:59,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:43:59,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:43:59,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:43:59,248 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 02:43:59,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:43:59,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 02:43:59,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 02:43:59,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 02:43:59,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 02:43:59,249 INFO L87 Difference]: Start difference. First operand 12878 states and 42719 transitions. Second operand 5 states. [2018-12-02 02:43:59,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:43:59,287 INFO L93 Difference]: Finished difference Result 2522 states and 6736 transitions. [2018-12-02 02:43:59,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 02:43:59,287 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2018-12-02 02:43:59,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:43:59,290 INFO L225 Difference]: With dead ends: 2522 [2018-12-02 02:43:59,290 INFO L226 Difference]: Without dead ends: 2110 [2018-12-02 02:43:59,290 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 02:43:59,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2110 states. [2018-12-02 02:43:59,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2110 to 2007. [2018-12-02 02:43:59,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2007 states. [2018-12-02 02:43:59,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2007 states to 2007 states and 5339 transitions. [2018-12-02 02:43:59,362 INFO L78 Accepts]: Start accepts. Automaton has 2007 states and 5339 transitions. Word has length 57 [2018-12-02 02:43:59,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:43:59,362 INFO L480 AbstractCegarLoop]: Abstraction has 2007 states and 5339 transitions. [2018-12-02 02:43:59,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 02:43:59,362 INFO L276 IsEmpty]: Start isEmpty. Operand 2007 states and 5339 transitions. [2018-12-02 02:43:59,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-02 02:43:59,364 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:43:59,365 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] [2018-12-02 02:43:59,365 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:43:59,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:43:59,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1229710074, now seen corresponding path program 1 times [2018-12-02 02:43:59,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:43:59,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:43:59,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:43:59,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:43:59,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:43:59,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:43:59,444 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 02:43:59,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:43:59,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 02:43:59,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 02:43:59,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 02:43:59,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-02 02:43:59,445 INFO L87 Difference]: Start difference. First operand 2007 states and 5339 transitions. Second operand 7 states. [2018-12-02 02:43:59,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:43:59,668 INFO L93 Difference]: Finished difference Result 2413 states and 6166 transitions. [2018-12-02 02:43:59,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 02:43:59,668 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2018-12-02 02:43:59,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:43:59,670 INFO L225 Difference]: With dead ends: 2413 [2018-12-02 02:43:59,670 INFO L226 Difference]: Without dead ends: 2329 [2018-12-02 02:43:59,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-02 02:43:59,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2329 states. [2018-12-02 02:43:59,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2329 to 2253. [2018-12-02 02:43:59,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2253 states. [2018-12-02 02:43:59,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2253 states to 2253 states and 5861 transitions. [2018-12-02 02:43:59,685 INFO L78 Accepts]: Start accepts. Automaton has 2253 states and 5861 transitions. Word has length 90 [2018-12-02 02:43:59,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:43:59,685 INFO L480 AbstractCegarLoop]: Abstraction has 2253 states and 5861 transitions. [2018-12-02 02:43:59,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 02:43:59,685 INFO L276 IsEmpty]: Start isEmpty. Operand 2253 states and 5861 transitions. [2018-12-02 02:43:59,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-02 02:43:59,687 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:43:59,687 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] [2018-12-02 02:43:59,687 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:43:59,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:43:59,687 INFO L82 PathProgramCache]: Analyzing trace with hash -2095676199, now seen corresponding path program 1 times [2018-12-02 02:43:59,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:43:59,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:43:59,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:43:59,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:43:59,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:43:59,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:43:59,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 02:43:59,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:43:59,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 02:43:59,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 02:43:59,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 02:43:59,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 02:43:59,762 INFO L87 Difference]: Start difference. First operand 2253 states and 5861 transitions. Second operand 5 states. [2018-12-02 02:43:59,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:43:59,873 INFO L93 Difference]: Finished difference Result 2790 states and 7091 transitions. [2018-12-02 02:43:59,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 02:43:59,874 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2018-12-02 02:43:59,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:43:59,876 INFO L225 Difference]: With dead ends: 2790 [2018-12-02 02:43:59,876 INFO L226 Difference]: Without dead ends: 2751 [2018-12-02 02:43:59,876 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 02:43:59,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2751 states. [2018-12-02 02:43:59,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2751 to 2379. [2018-12-02 02:43:59,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2379 states. [2018-12-02 02:43:59,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2379 states to 2379 states and 6127 transitions. [2018-12-02 02:43:59,895 INFO L78 Accepts]: Start accepts. Automaton has 2379 states and 6127 transitions. Word has length 90 [2018-12-02 02:43:59,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:43:59,895 INFO L480 AbstractCegarLoop]: Abstraction has 2379 states and 6127 transitions. [2018-12-02 02:43:59,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 02:43:59,895 INFO L276 IsEmpty]: Start isEmpty. Operand 2379 states and 6127 transitions. [2018-12-02 02:43:59,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-02 02:43:59,897 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:43:59,897 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] [2018-12-02 02:43:59,898 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:43:59,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:43:59,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1989063700, now seen corresponding path program 1 times [2018-12-02 02:43:59,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:43:59,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:43:59,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:43:59,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:43:59,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:43:59,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:43:59,927 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 02:43:59,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:43:59,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:43:59,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:43:59,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:43:59,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:43:59,929 INFO L87 Difference]: Start difference. First operand 2379 states and 6127 transitions. Second operand 3 states. [2018-12-02 02:43:59,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:43:59,994 INFO L93 Difference]: Finished difference Result 2489 states and 6361 transitions. [2018-12-02 02:43:59,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:43:59,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2018-12-02 02:43:59,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:43:59,997 INFO L225 Difference]: With dead ends: 2489 [2018-12-02 02:43:59,997 INFO L226 Difference]: Without dead ends: 2489 [2018-12-02 02:43:59,997 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 02:43:59,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2489 states. [2018-12-02 02:44:00,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2489 to 2417. [2018-12-02 02:44:00,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2417 states. [2018-12-02 02:44:00,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2417 states to 2417 states and 6205 transitions. [2018-12-02 02:44:00,013 INFO L78 Accepts]: Start accepts. Automaton has 2417 states and 6205 transitions. Word has length 90 [2018-12-02 02:44:00,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:44:00,014 INFO L480 AbstractCegarLoop]: Abstraction has 2417 states and 6205 transitions. [2018-12-02 02:44:00,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:44:00,014 INFO L276 IsEmpty]: Start isEmpty. Operand 2417 states and 6205 transitions. [2018-12-02 02:44:00,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-02 02:44:00,017 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:44:00,017 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 02:44:00,018 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:44:00,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:44:00,018 INFO L82 PathProgramCache]: Analyzing trace with hash 353378826, now seen corresponding path program 1 times [2018-12-02 02:44:00,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:44:00,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:44:00,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:00,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:44:00,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:00,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:44:00,049 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 02:44:00,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:44:00,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 02:44:00,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 02:44:00,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 02:44:00,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 02:44:00,050 INFO L87 Difference]: Start difference. First operand 2417 states and 6205 transitions. Second operand 4 states. [2018-12-02 02:44:00,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:44:00,158 INFO L93 Difference]: Finished difference Result 4371 states and 11304 transitions. [2018-12-02 02:44:00,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 02:44:00,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-02 02:44:00,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:44:00,162 INFO L225 Difference]: With dead ends: 4371 [2018-12-02 02:44:00,162 INFO L226 Difference]: Without dead ends: 4371 [2018-12-02 02:44:00,162 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 02:44:00,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4371 states. [2018-12-02 02:44:00,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4371 to 2349. [2018-12-02 02:44:00,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2349 states. [2018-12-02 02:44:00,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2349 states to 2349 states and 5959 transitions. [2018-12-02 02:44:00,185 INFO L78 Accepts]: Start accepts. Automaton has 2349 states and 5959 transitions. Word has length 92 [2018-12-02 02:44:00,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:44:00,185 INFO L480 AbstractCegarLoop]: Abstraction has 2349 states and 5959 transitions. [2018-12-02 02:44:00,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 02:44:00,185 INFO L276 IsEmpty]: Start isEmpty. Operand 2349 states and 5959 transitions. [2018-12-02 02:44:00,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-02 02:44:00,187 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:44:00,187 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 02:44:00,187 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:44:00,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:44:00,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1349001223, now seen corresponding path program 1 times [2018-12-02 02:44:00,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:44:00,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:44:00,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:00,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:44:00,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:00,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:44:00,222 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 02:44:00,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:44:00,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 02:44:00,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 02:44:00,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 02:44:00,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 02:44:00,223 INFO L87 Difference]: Start difference. First operand 2349 states and 5959 transitions. Second operand 4 states. [2018-12-02 02:44:00,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:44:00,290 INFO L93 Difference]: Finished difference Result 2685 states and 6879 transitions. [2018-12-02 02:44:00,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 02:44:00,291 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-02 02:44:00,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:44:00,294 INFO L225 Difference]: With dead ends: 2685 [2018-12-02 02:44:00,294 INFO L226 Difference]: Without dead ends: 2685 [2018-12-02 02:44:00,294 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 02:44:00,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2685 states. [2018-12-02 02:44:00,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2685 to 2653. [2018-12-02 02:44:00,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2653 states. [2018-12-02 02:44:00,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2653 states to 2653 states and 6799 transitions. [2018-12-02 02:44:00,316 INFO L78 Accepts]: Start accepts. Automaton has 2653 states and 6799 transitions. Word has length 92 [2018-12-02 02:44:00,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:44:00,316 INFO L480 AbstractCegarLoop]: Abstraction has 2653 states and 6799 transitions. [2018-12-02 02:44:00,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 02:44:00,316 INFO L276 IsEmpty]: Start isEmpty. Operand 2653 states and 6799 transitions. [2018-12-02 02:44:00,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-02 02:44:00,319 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:44:00,320 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 02:44:00,320 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:44:00,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:44:00,320 INFO L82 PathProgramCache]: Analyzing trace with hash 868756730, now seen corresponding path program 1 times [2018-12-02 02:44:00,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:44:00,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:44:00,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:00,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:44:00,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:00,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:44:00,411 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 02:44:00,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:44:00,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 02:44:00,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 02:44:00,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 02:44:00,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 02:44:00,412 INFO L87 Difference]: Start difference. First operand 2653 states and 6799 transitions. Second operand 6 states. [2018-12-02 02:44:00,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:44:00,606 INFO L93 Difference]: Finished difference Result 3995 states and 10189 transitions. [2018-12-02 02:44:00,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 02:44:00,607 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2018-12-02 02:44:00,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:44:00,610 INFO L225 Difference]: With dead ends: 3995 [2018-12-02 02:44:00,610 INFO L226 Difference]: Without dead ends: 3963 [2018-12-02 02:44:00,610 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 02:44:00,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3963 states. [2018-12-02 02:44:00,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3963 to 3559. [2018-12-02 02:44:00,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3559 states. [2018-12-02 02:44:00,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3559 states to 3559 states and 9122 transitions. [2018-12-02 02:44:00,637 INFO L78 Accepts]: Start accepts. Automaton has 3559 states and 9122 transitions. Word has length 92 [2018-12-02 02:44:00,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:44:00,637 INFO L480 AbstractCegarLoop]: Abstraction has 3559 states and 9122 transitions. [2018-12-02 02:44:00,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 02:44:00,637 INFO L276 IsEmpty]: Start isEmpty. Operand 3559 states and 9122 transitions. [2018-12-02 02:44:00,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-02 02:44:00,641 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:44:00,641 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 02:44:00,641 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:44:00,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:44:00,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1830370747, now seen corresponding path program 1 times [2018-12-02 02:44:00,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:44:00,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:44:00,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:00,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:44:00,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:00,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:44:00,694 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 02:44:00,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:44:00,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 02:44:00,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 02:44:00,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 02:44:00,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 02:44:00,694 INFO L87 Difference]: Start difference. First operand 3559 states and 9122 transitions. Second operand 7 states. [2018-12-02 02:44:00,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:44:00,972 INFO L93 Difference]: Finished difference Result 7660 states and 19944 transitions. [2018-12-02 02:44:00,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 02:44:00,972 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2018-12-02 02:44:00,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:44:00,978 INFO L225 Difference]: With dead ends: 7660 [2018-12-02 02:44:00,978 INFO L226 Difference]: Without dead ends: 7660 [2018-12-02 02:44:00,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-12-02 02:44:00,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7660 states. [2018-12-02 02:44:01,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7660 to 4179. [2018-12-02 02:44:01,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4179 states. [2018-12-02 02:44:01,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4179 states to 4179 states and 10752 transitions. [2018-12-02 02:44:01,020 INFO L78 Accepts]: Start accepts. Automaton has 4179 states and 10752 transitions. Word has length 92 [2018-12-02 02:44:01,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:44:01,020 INFO L480 AbstractCegarLoop]: Abstraction has 4179 states and 10752 transitions. [2018-12-02 02:44:01,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 02:44:01,020 INFO L276 IsEmpty]: Start isEmpty. Operand 4179 states and 10752 transitions. [2018-12-02 02:44:01,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-02 02:44:01,024 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:44:01,024 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 02:44:01,024 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:44:01,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:44:01,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1219832068, now seen corresponding path program 1 times [2018-12-02 02:44:01,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:44:01,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:44:01,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:01,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:44:01,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:01,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:44:01,124 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 02:44:01,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:44:01,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 02:44:01,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 02:44:01,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 02:44:01,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 02:44:01,125 INFO L87 Difference]: Start difference. First operand 4179 states and 10752 transitions. Second operand 7 states. [2018-12-02 02:44:01,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:44:01,301 INFO L93 Difference]: Finished difference Result 3925 states and 10102 transitions. [2018-12-02 02:44:01,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 02:44:01,301 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2018-12-02 02:44:01,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:44:01,305 INFO L225 Difference]: With dead ends: 3925 [2018-12-02 02:44:01,305 INFO L226 Difference]: Without dead ends: 3925 [2018-12-02 02:44:01,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-12-02 02:44:01,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3925 states. [2018-12-02 02:44:01,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3925 to 3771. [2018-12-02 02:44:01,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3771 states. [2018-12-02 02:44:01,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3771 states to 3771 states and 9774 transitions. [2018-12-02 02:44:01,390 INFO L78 Accepts]: Start accepts. Automaton has 3771 states and 9774 transitions. Word has length 92 [2018-12-02 02:44:01,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:44:01,390 INFO L480 AbstractCegarLoop]: Abstraction has 3771 states and 9774 transitions. [2018-12-02 02:44:01,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 02:44:01,390 INFO L276 IsEmpty]: Start isEmpty. Operand 3771 states and 9774 transitions. [2018-12-02 02:44:01,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-02 02:44:01,394 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:44:01,394 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 02:44:01,395 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:44:01,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:44:01,395 INFO L82 PathProgramCache]: Analyzing trace with hash -124272980, now seen corresponding path program 1 times [2018-12-02 02:44:01,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:44:01,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:44:01,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:01,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:44:01,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:01,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:44:01,467 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 02:44:01,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:44:01,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 02:44:01,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 02:44:01,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 02:44:01,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 02:44:01,468 INFO L87 Difference]: Start difference. First operand 3771 states and 9774 transitions. Second operand 7 states. [2018-12-02 02:44:01,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:44:01,687 INFO L93 Difference]: Finished difference Result 4019 states and 10380 transitions. [2018-12-02 02:44:01,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 02:44:01,688 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2018-12-02 02:44:01,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:44:01,690 INFO L225 Difference]: With dead ends: 4019 [2018-12-02 02:44:01,691 INFO L226 Difference]: Without dead ends: 4019 [2018-12-02 02:44:01,691 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 02:44:01,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4019 states. [2018-12-02 02:44:01,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4019 to 3753. [2018-12-02 02:44:01,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3753 states. [2018-12-02 02:44:01,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3753 states to 3753 states and 9738 transitions. [2018-12-02 02:44:01,717 INFO L78 Accepts]: Start accepts. Automaton has 3753 states and 9738 transitions. Word has length 92 [2018-12-02 02:44:01,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:44:01,717 INFO L480 AbstractCegarLoop]: Abstraction has 3753 states and 9738 transitions. [2018-12-02 02:44:01,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 02:44:01,717 INFO L276 IsEmpty]: Start isEmpty. Operand 3753 states and 9738 transitions. [2018-12-02 02:44:01,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-02 02:44:01,720 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:44:01,720 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 02:44:01,720 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:44:01,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:44:01,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1286606540, now seen corresponding path program 1 times [2018-12-02 02:44:01,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:44:01,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:44:01,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:01,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:44:01,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:01,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:44:01,788 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 02:44:01,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:44:01,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 02:44:01,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 02:44:01,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 02:44:01,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 02:44:01,789 INFO L87 Difference]: Start difference. First operand 3753 states and 9738 transitions. Second operand 5 states. [2018-12-02 02:44:01,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:44:01,855 INFO L93 Difference]: Finished difference Result 3485 states and 9046 transitions. [2018-12-02 02:44:01,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 02:44:01,855 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2018-12-02 02:44:01,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:44:01,858 INFO L225 Difference]: With dead ends: 3485 [2018-12-02 02:44:01,858 INFO L226 Difference]: Without dead ends: 3485 [2018-12-02 02:44:01,858 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 02:44:01,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3485 states. [2018-12-02 02:44:01,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3485 to 3485. [2018-12-02 02:44:01,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3485 states. [2018-12-02 02:44:01,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3485 states to 3485 states and 9046 transitions. [2018-12-02 02:44:01,885 INFO L78 Accepts]: Start accepts. Automaton has 3485 states and 9046 transitions. Word has length 92 [2018-12-02 02:44:01,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:44:01,885 INFO L480 AbstractCegarLoop]: Abstraction has 3485 states and 9046 transitions. [2018-12-02 02:44:01,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 02:44:01,886 INFO L276 IsEmpty]: Start isEmpty. Operand 3485 states and 9046 transitions. [2018-12-02 02:44:01,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-02 02:44:01,889 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:44:01,889 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 02:44:01,889 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:44:01,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:44:01,889 INFO L82 PathProgramCache]: Analyzing trace with hash -649053747, now seen corresponding path program 1 times [2018-12-02 02:44:01,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:44:01,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:44:01,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:01,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:44:01,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:01,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:44:01,948 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 02:44:01,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:44:01,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 02:44:01,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 02:44:01,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 02:44:01,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 02:44:01,949 INFO L87 Difference]: Start difference. First operand 3485 states and 9046 transitions. Second operand 6 states. [2018-12-02 02:44:02,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:44:02,034 INFO L93 Difference]: Finished difference Result 2877 states and 7206 transitions. [2018-12-02 02:44:02,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 02:44:02,035 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2018-12-02 02:44:02,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:44:02,037 INFO L225 Difference]: With dead ends: 2877 [2018-12-02 02:44:02,037 INFO L226 Difference]: Without dead ends: 2877 [2018-12-02 02:44:02,037 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 02:44:02,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2877 states. [2018-12-02 02:44:02,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2877 to 1898. [2018-12-02 02:44:02,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1898 states. [2018-12-02 02:44:02,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 4870 transitions. [2018-12-02 02:44:02,052 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 4870 transitions. Word has length 92 [2018-12-02 02:44:02,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:44:02,052 INFO L480 AbstractCegarLoop]: Abstraction has 1898 states and 4870 transitions. [2018-12-02 02:44:02,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 02:44:02,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 4870 transitions. [2018-12-02 02:44:02,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 02:44:02,053 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:44:02,053 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 02:44:02,054 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:44:02,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:44:02,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1039708687, now seen corresponding path program 1 times [2018-12-02 02:44:02,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:44:02,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:44:02,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:02,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:44:02,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:02,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:44:02,093 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 02:44:02,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:44:02,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 02:44:02,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 02:44:02,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 02:44:02,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 02:44:02,094 INFO L87 Difference]: Start difference. First operand 1898 states and 4870 transitions. Second operand 7 states. [2018-12-02 02:44:02,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:44:02,380 INFO L93 Difference]: Finished difference Result 2829 states and 7095 transitions. [2018-12-02 02:44:02,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 02:44:02,380 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-02 02:44:02,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:44:02,382 INFO L225 Difference]: With dead ends: 2829 [2018-12-02 02:44:02,382 INFO L226 Difference]: Without dead ends: 2829 [2018-12-02 02:44:02,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-02 02:44:02,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2829 states. [2018-12-02 02:44:02,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2829 to 2248. [2018-12-02 02:44:02,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2248 states. [2018-12-02 02:44:02,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2248 states to 2248 states and 5728 transitions. [2018-12-02 02:44:02,398 INFO L78 Accepts]: Start accepts. Automaton has 2248 states and 5728 transitions. Word has length 94 [2018-12-02 02:44:02,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:44:02,399 INFO L480 AbstractCegarLoop]: Abstraction has 2248 states and 5728 transitions. [2018-12-02 02:44:02,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 02:44:02,399 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 5728 transitions. [2018-12-02 02:44:02,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 02:44:02,400 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:44:02,400 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 02:44:02,401 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:44:02,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:44:02,401 INFO L82 PathProgramCache]: Analyzing trace with hash -2010494128, now seen corresponding path program 1 times [2018-12-02 02:44:02,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:44:02,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:44:02,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:02,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:44:02,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:02,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:44:02,473 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 02:44:02,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:44:02,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 02:44:02,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 02:44:02,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 02:44:02,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 02:44:02,474 INFO L87 Difference]: Start difference. First operand 2248 states and 5728 transitions. Second operand 6 states. [2018-12-02 02:44:02,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:44:02,583 INFO L93 Difference]: Finished difference Result 2288 states and 5773 transitions. [2018-12-02 02:44:02,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 02:44:02,584 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-02 02:44:02,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:44:02,585 INFO L225 Difference]: With dead ends: 2288 [2018-12-02 02:44:02,585 INFO L226 Difference]: Without dead ends: 2288 [2018-12-02 02:44:02,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-02 02:44:02,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2288 states. [2018-12-02 02:44:02,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2288 to 2233. [2018-12-02 02:44:02,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2233 states. [2018-12-02 02:44:02,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2233 states to 2233 states and 5666 transitions. [2018-12-02 02:44:02,600 INFO L78 Accepts]: Start accepts. Automaton has 2233 states and 5666 transitions. Word has length 94 [2018-12-02 02:44:02,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:44:02,600 INFO L480 AbstractCegarLoop]: Abstraction has 2233 states and 5666 transitions. [2018-12-02 02:44:02,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 02:44:02,600 INFO L276 IsEmpty]: Start isEmpty. Operand 2233 states and 5666 transitions. [2018-12-02 02:44:02,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 02:44:02,601 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:44:02,601 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 02:44:02,602 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:44:02,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:44:02,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1369474448, now seen corresponding path program 1 times [2018-12-02 02:44:02,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:44:02,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:44:02,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:02,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:44:02,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:02,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:44:02,667 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 02:44:02,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:44:02,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 02:44:02,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 02:44:02,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 02:44:02,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 02:44:02,668 INFO L87 Difference]: Start difference. First operand 2233 states and 5666 transitions. Second operand 6 states. [2018-12-02 02:44:02,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:44:02,830 INFO L93 Difference]: Finished difference Result 2807 states and 6976 transitions. [2018-12-02 02:44:02,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 02:44:02,831 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-02 02:44:02,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:44:02,833 INFO L225 Difference]: With dead ends: 2807 [2018-12-02 02:44:02,833 INFO L226 Difference]: Without dead ends: 2807 [2018-12-02 02:44:02,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-02 02:44:02,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2807 states. [2018-12-02 02:44:02,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2807 to 2281. [2018-12-02 02:44:02,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2281 states. [2018-12-02 02:44:02,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 2281 states and 5746 transitions. [2018-12-02 02:44:02,850 INFO L78 Accepts]: Start accepts. Automaton has 2281 states and 5746 transitions. Word has length 94 [2018-12-02 02:44:02,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:44:02,850 INFO L480 AbstractCegarLoop]: Abstraction has 2281 states and 5746 transitions. [2018-12-02 02:44:02,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 02:44:02,850 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 5746 transitions. [2018-12-02 02:44:02,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 02:44:02,852 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:44:02,852 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 02:44:02,852 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:44:02,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:44:02,852 INFO L82 PathProgramCache]: Analyzing trace with hash 2138644463, now seen corresponding path program 1 times [2018-12-02 02:44:02,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:44:02,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:44:02,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:02,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:44:02,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:02,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:44:02,893 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 02:44:02,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:44:02,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 02:44:02,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 02:44:02,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 02:44:02,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 02:44:02,894 INFO L87 Difference]: Start difference. First operand 2281 states and 5746 transitions. Second operand 5 states. [2018-12-02 02:44:02,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:44:02,986 INFO L93 Difference]: Finished difference Result 2601 states and 6546 transitions. [2018-12-02 02:44:02,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 02:44:02,986 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-02 02:44:02,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:44:02,988 INFO L225 Difference]: With dead ends: 2601 [2018-12-02 02:44:02,988 INFO L226 Difference]: Without dead ends: 2601 [2018-12-02 02:44:02,988 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 02:44:02,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2601 states. [2018-12-02 02:44:03,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2601 to 2009. [2018-12-02 02:44:03,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2009 states. [2018-12-02 02:44:03,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2009 states to 2009 states and 5085 transitions. [2018-12-02 02:44:03,003 INFO L78 Accepts]: Start accepts. Automaton has 2009 states and 5085 transitions. Word has length 94 [2018-12-02 02:44:03,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:44:03,003 INFO L480 AbstractCegarLoop]: Abstraction has 2009 states and 5085 transitions. [2018-12-02 02:44:03,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 02:44:03,003 INFO L276 IsEmpty]: Start isEmpty. Operand 2009 states and 5085 transitions. [2018-12-02 02:44:03,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 02:44:03,004 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:44:03,005 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 02:44:03,005 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:44:03,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:44:03,005 INFO L82 PathProgramCache]: Analyzing trace with hash -911558352, now seen corresponding path program 1 times [2018-12-02 02:44:03,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:44:03,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:44:03,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:03,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:44:03,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:03,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:44:03,110 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 02:44:03,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:44:03,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 02:44:03,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 02:44:03,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 02:44:03,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-02 02:44:03,110 INFO L87 Difference]: Start difference. First operand 2009 states and 5085 transitions. Second operand 10 states. [2018-12-02 02:44:03,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:44:03,359 INFO L93 Difference]: Finished difference Result 3694 states and 9553 transitions. [2018-12-02 02:44:03,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 02:44:03,359 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2018-12-02 02:44:03,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:44:03,361 INFO L225 Difference]: With dead ends: 3694 [2018-12-02 02:44:03,361 INFO L226 Difference]: Without dead ends: 1719 [2018-12-02 02:44:03,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-12-02 02:44:03,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1719 states. [2018-12-02 02:44:03,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1719 to 1719. [2018-12-02 02:44:03,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1719 states. [2018-12-02 02:44:03,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 4515 transitions. [2018-12-02 02:44:03,372 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 4515 transitions. Word has length 94 [2018-12-02 02:44:03,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:44:03,372 INFO L480 AbstractCegarLoop]: Abstraction has 1719 states and 4515 transitions. [2018-12-02 02:44:03,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 02:44:03,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 4515 transitions. [2018-12-02 02:44:03,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 02:44:03,373 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:44:03,373 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 02:44:03,374 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:44:03,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:44:03,374 INFO L82 PathProgramCache]: Analyzing trace with hash 220287440, now seen corresponding path program 1 times [2018-12-02 02:44:03,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:44:03,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:44:03,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:03,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:44:03,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:03,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:44:03,423 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 02:44:03,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:44:03,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 02:44:03,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 02:44:03,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 02:44:03,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 02:44:03,423 INFO L87 Difference]: Start difference. First operand 1719 states and 4515 transitions. Second operand 6 states. [2018-12-02 02:44:03,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:44:03,599 INFO L93 Difference]: Finished difference Result 1963 states and 5062 transitions. [2018-12-02 02:44:03,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 02:44:03,600 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-02 02:44:03,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:44:03,601 INFO L225 Difference]: With dead ends: 1963 [2018-12-02 02:44:03,601 INFO L226 Difference]: Without dead ends: 1963 [2018-12-02 02:44:03,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-12-02 02:44:03,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1963 states. [2018-12-02 02:44:03,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1963 to 1746. [2018-12-02 02:44:03,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1746 states. [2018-12-02 02:44:03,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1746 states to 1746 states and 4570 transitions. [2018-12-02 02:44:03,617 INFO L78 Accepts]: Start accepts. Automaton has 1746 states and 4570 transitions. Word has length 94 [2018-12-02 02:44:03,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:44:03,618 INFO L480 AbstractCegarLoop]: Abstraction has 1746 states and 4570 transitions. [2018-12-02 02:44:03,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 02:44:03,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1746 states and 4570 transitions. [2018-12-02 02:44:03,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 02:44:03,619 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:44:03,620 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 02:44:03,620 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:44:03,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:44:03,620 INFO L82 PathProgramCache]: Analyzing trace with hash 550053201, now seen corresponding path program 1 times [2018-12-02 02:44:03,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:44:03,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:44:03,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:03,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:44:03,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:03,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:44:03,683 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 02:44:03,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:44:03,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 02:44:03,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 02:44:03,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 02:44:03,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 02:44:03,684 INFO L87 Difference]: Start difference. First operand 1746 states and 4570 transitions. Second operand 6 states. [2018-12-02 02:44:03,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:44:03,770 INFO L93 Difference]: Finished difference Result 1805 states and 4679 transitions. [2018-12-02 02:44:03,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 02:44:03,770 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-02 02:44:03,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:44:03,772 INFO L225 Difference]: With dead ends: 1805 [2018-12-02 02:44:03,772 INFO L226 Difference]: Without dead ends: 1789 [2018-12-02 02:44:03,773 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 02:44:03,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2018-12-02 02:44:03,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1719. [2018-12-02 02:44:03,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1719 states. [2018-12-02 02:44:03,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 4507 transitions. [2018-12-02 02:44:03,790 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 4507 transitions. Word has length 94 [2018-12-02 02:44:03,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:44:03,790 INFO L480 AbstractCegarLoop]: Abstraction has 1719 states and 4507 transitions. [2018-12-02 02:44:03,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 02:44:03,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 4507 transitions. [2018-12-02 02:44:03,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 02:44:03,792 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:44:03,792 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 02:44:03,792 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:44:03,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:44:03,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1480453039, now seen corresponding path program 1 times [2018-12-02 02:44:03,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:44:03,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:44:03,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:03,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:44:03,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:03,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:44:03,880 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 02:44:03,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:44:03,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 02:44:03,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 02:44:03,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 02:44:03,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 02:44:03,881 INFO L87 Difference]: Start difference. First operand 1719 states and 4507 transitions. Second operand 6 states. [2018-12-02 02:44:03,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:44:03,996 INFO L93 Difference]: Finished difference Result 1761 states and 4583 transitions. [2018-12-02 02:44:03,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 02:44:03,996 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-02 02:44:03,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:44:03,998 INFO L225 Difference]: With dead ends: 1761 [2018-12-02 02:44:03,998 INFO L226 Difference]: Without dead ends: 1761 [2018-12-02 02:44:03,998 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 02:44:04,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1761 states. [2018-12-02 02:44:04,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1761 to 1754. [2018-12-02 02:44:04,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1754 states. [2018-12-02 02:44:04,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1754 states and 4570 transitions. [2018-12-02 02:44:04,010 INFO L78 Accepts]: Start accepts. Automaton has 1754 states and 4570 transitions. Word has length 94 [2018-12-02 02:44:04,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:44:04,010 INFO L480 AbstractCegarLoop]: Abstraction has 1754 states and 4570 transitions. [2018-12-02 02:44:04,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 02:44:04,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 4570 transitions. [2018-12-02 02:44:04,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 02:44:04,012 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:44:04,012 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 02:44:04,012 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:44:04,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:44:04,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1150687278, now seen corresponding path program 2 times [2018-12-02 02:44:04,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:44:04,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:44:04,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:04,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:44:04,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:04,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:44:04,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:44:04,065 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 02:44:04,151 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 02:44:04,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 02:44:04 BasicIcfg [2018-12-02 02:44:04,152 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 02:44:04,153 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 02:44:04,153 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 02:44:04,153 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 02:44:04,154 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:43:54" (3/4) ... [2018-12-02 02:44:04,156 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 02:44:04,234 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d8691dde-a897-4ec8-a994-5ac1241ba8ee/bin-2019/uautomizer/witness.graphml [2018-12-02 02:44:04,234 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 02:44:04,234 INFO L168 Benchmark]: Toolchain (without parser) took 10922.66 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.2 GB). Free memory was 951.7 MB in the beginning and 813.5 MB in the end (delta: 138.2 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2018-12-02 02:44:04,235 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 02:44:04,235 INFO L168 Benchmark]: CACSL2BoogieTranslator took 337.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -184.7 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. [2018-12-02 02:44:04,236 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.69 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-02 02:44:04,236 INFO L168 Benchmark]: Boogie Preprocessor took 23.81 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 02:44:04,236 INFO L168 Benchmark]: RCFGBuilder took 357.71 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: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. [2018-12-02 02:44:04,236 INFO L168 Benchmark]: TraceAbstraction took 10073.67 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.0 GB). Free memory was 1.1 GB in the beginning and 837.8 MB in the end (delta: 245.1 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2018-12-02 02:44:04,236 INFO L168 Benchmark]: Witness Printer took 80.93 ms. Allocated memory is still 2.2 GB. Free memory was 837.8 MB in the beginning and 813.5 MB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2018-12-02 02:44:04,238 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 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 337.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -184.7 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.69 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.81 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 357.71 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: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10073.67 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.0 GB). Free memory was 1.1 GB in the beginning and 837.8 MB in the end (delta: 245.1 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * Witness Printer took 80.93 ms. Allocated memory is still 2.2 GB. Free memory was 837.8 MB in the beginning and 813.5 MB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 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] [L674] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L675] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L677] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L678] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L679] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L680] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L681] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L682] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L683] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L684] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L685] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L686] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L687] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L688] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L689] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L690] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L691] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L693] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L694] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L695] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L755] -1 pthread_t t1453; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] FCALL, FORK -1 pthread_create(&t1453, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L757] -1 pthread_t t1454; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] FCALL, FORK -1 pthread_create(&t1454, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L719] 0 x$w_buff1 = x$w_buff0 [L720] 0 x$w_buff0 = 2 [L721] 0 x$w_buff1_used = x$w_buff0_used [L722] 0 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L724] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L725] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L726] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L727] 0 x$r_buff0_thd2 = (_Bool)1 [L730] 0 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L699] 1 y = 1 [L702] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L705] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L705] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=1] [L705] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=1] [L705] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L706] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L706] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L707] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L733] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L707] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L733] 0 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L734] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L734] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L735] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L735] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L736] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L736] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L737] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L737] 0 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L740] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L708] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L708] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L709] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L709] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L712] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L760] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L764] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L764] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L764] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L764] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L765] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L765] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L766] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L766] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L767] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L767] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L768] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L768] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L771] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L772] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L773] -1 x$flush_delayed = weak$$choice2 [L774] -1 x$mem_tmp = x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] EXPR -1 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] -1 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L776] EXPR -1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L776] -1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L777] EXPR -1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L777] -1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L778] EXPR -1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L778] -1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L779] EXPR -1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L779] -1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L780] EXPR -1 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L780] -1 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L781] EXPR -1 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L781] -1 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L782] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L783] EXPR -1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L783] -1 x = x$flush_delayed ? x$mem_tmp : x [L784] -1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 179 locations, 3 error locations. UNSAFE Result, 10.0s OverallTime, 25 OverallIterations, 1 TraceHistogramMax, 4.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4907 SDtfs, 4375 SDslu, 10892 SDs, 0 SdLazy, 4434 SolverSat, 246 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 217 GetRequests, 60 SyntacticMatches, 17 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37141occurred in iteration=2, 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: 2.4s AutomataMinimizationTime, 24 MinimizatonAttempts, 58643 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 2089 NumberOfCodeBlocks, 2089 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1971 ConstructedInterpolants, 0 QuantifiedInterpolants, 415065 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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...