./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix012_rmo.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_98b51391-6c0d-400f-b4b5-bcce3f75ea99/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_98b51391-6c0d-400f-b4b5-bcce3f75ea99/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_98b51391-6c0d-400f-b4b5-bcce3f75ea99/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_98b51391-6c0d-400f-b4b5-bcce3f75ea99/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix012_rmo.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_98b51391-6c0d-400f-b4b5-bcce3f75ea99/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_98b51391-6c0d-400f-b4b5-bcce3f75ea99/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 874a9972fda7c5371d5beee908ce94ffa39446d7 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-09 12:56:49,883 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 12:56:49,884 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 12:56:49,890 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 12:56:49,890 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 12:56:49,890 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 12:56:49,891 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 12:56:49,892 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 12:56:49,893 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 12:56:49,893 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 12:56:49,894 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 12:56:49,894 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 12:56:49,894 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 12:56:49,895 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 12:56:49,895 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 12:56:49,896 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 12:56:49,896 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 12:56:49,897 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 12:56:49,898 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 12:56:49,899 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 12:56:49,899 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 12:56:49,900 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 12:56:49,901 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 12:56:49,901 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 12:56:49,901 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 12:56:49,902 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 12:56:49,902 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 12:56:49,903 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 12:56:49,903 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 12:56:49,904 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 12:56:49,904 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 12:56:49,904 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 12:56:49,904 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 12:56:49,905 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 12:56:49,905 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 12:56:49,905 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 12:56:49,906 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_98b51391-6c0d-400f-b4b5-bcce3f75ea99/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-09 12:56:49,913 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 12:56:49,913 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 12:56:49,914 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 12:56:49,914 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 12:56:49,914 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 12:56:49,914 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 12:56:49,914 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 12:56:49,914 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 12:56:49,915 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 12:56:49,915 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 12:56:49,915 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 12:56:49,915 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 12:56:49,915 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 12:56:49,915 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 12:56:49,915 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 12:56:49,915 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 12:56:49,916 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 12:56:49,916 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 12:56:49,916 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 12:56:49,916 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 12:56:49,916 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 12:56:49,916 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 12:56:49,916 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 12:56:49,917 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 12:56:49,917 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 12:56:49,917 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 12:56:49,917 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 12:56:49,917 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 12:56:49,917 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 12:56:49,917 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 12:56:49,917 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_98b51391-6c0d-400f-b4b5-bcce3f75ea99/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 -> 874a9972fda7c5371d5beee908ce94ffa39446d7 [2018-12-09 12:56:49,936 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 12:56:49,945 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 12:56:49,947 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 12:56:49,948 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 12:56:49,949 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 12:56:49,949 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_98b51391-6c0d-400f-b4b5-bcce3f75ea99/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix012_rmo.oepc_false-unreach-call.i [2018-12-09 12:56:49,992 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_98b51391-6c0d-400f-b4b5-bcce3f75ea99/bin-2019/uautomizer/data/ab928a78b/aecb95bf111a4210b63c595be57d9943/FLAG5dab84160 [2018-12-09 12:56:50,392 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 12:56:50,392 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_98b51391-6c0d-400f-b4b5-bcce3f75ea99/sv-benchmarks/c/pthread-wmm/mix012_rmo.oepc_false-unreach-call.i [2018-12-09 12:56:50,399 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_98b51391-6c0d-400f-b4b5-bcce3f75ea99/bin-2019/uautomizer/data/ab928a78b/aecb95bf111a4210b63c595be57d9943/FLAG5dab84160 [2018-12-09 12:56:50,407 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_98b51391-6c0d-400f-b4b5-bcce3f75ea99/bin-2019/uautomizer/data/ab928a78b/aecb95bf111a4210b63c595be57d9943 [2018-12-09 12:56:50,409 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 12:56:50,410 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 12:56:50,410 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 12:56:50,410 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 12:56:50,412 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 12:56:50,413 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:56:50" (1/1) ... [2018-12-09 12:56:50,415 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cdc5e03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:56:50, skipping insertion in model container [2018-12-09 12:56:50,415 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:56:50" (1/1) ... [2018-12-09 12:56:50,419 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 12:56:50,439 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 12:56:50,620 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 12:56:50,628 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 12:56:50,698 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 12:56:50,728 INFO L195 MainTranslator]: Completed translation [2018-12-09 12:56:50,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:56:50 WrapperNode [2018-12-09 12:56:50,728 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 12:56:50,729 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 12:56:50,729 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 12:56:50,729 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 12:56:50,734 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:56:50" (1/1) ... [2018-12-09 12:56:50,744 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:56:50" (1/1) ... [2018-12-09 12:56:50,759 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 12:56:50,759 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 12:56:50,760 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 12:56:50,760 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 12:56:50,765 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:56:50" (1/1) ... [2018-12-09 12:56:50,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:56:50" (1/1) ... [2018-12-09 12:56:50,768 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:56:50" (1/1) ... [2018-12-09 12:56:50,768 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:56:50" (1/1) ... [2018-12-09 12:56:50,773 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:56:50" (1/1) ... [2018-12-09 12:56:50,775 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:56:50" (1/1) ... [2018-12-09 12:56:50,777 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:56:50" (1/1) ... [2018-12-09 12:56:50,779 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 12:56:50,779 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 12:56:50,779 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 12:56:50,779 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 12:56:50,780 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:56:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_98b51391-6c0d-400f-b4b5-bcce3f75ea99/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-09 12:56:50,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 12:56:50,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 12:56:50,811 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 12:56:50,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 12:56:50,812 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 12:56:50,812 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 12:56:50,812 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 12:56:50,812 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 12:56:50,812 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 12:56:50,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 12:56:50,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 12:56:50,813 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-09 12:56:51,102 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 12:56:51,102 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 12:56:51,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:56:51 BoogieIcfgContainer [2018-12-09 12:56:51,103 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 12:56:51,103 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 12:56:51,103 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 12:56:51,105 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 12:56:51,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 12:56:50" (1/3) ... [2018-12-09 12:56:51,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41ca8d2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:56:51, skipping insertion in model container [2018-12-09 12:56:51,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:56:50" (2/3) ... [2018-12-09 12:56:51,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41ca8d2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:56:51, skipping insertion in model container [2018-12-09 12:56:51,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:56:51" (3/3) ... [2018-12-09 12:56:51,107 INFO L112 eAbstractionObserver]: Analyzing ICFG mix012_rmo.oepc_false-unreach-call.i [2018-12-09 12:56:51,130 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,130 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,130 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,131 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,131 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,131 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,131 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,131 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,131 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,132 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,132 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,132 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,132 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,132 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,132 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,133 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,133 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,133 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,133 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,133 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,133 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,133 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,134 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,134 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,134 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,134 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,134 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,134 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,134 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,135 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,135 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,135 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,135 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,135 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,135 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,135 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,135 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,136 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,136 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,136 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,136 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,136 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,137 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,137 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,137 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,137 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,137 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,137 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,137 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,137 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,138 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,138 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,138 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,138 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,138 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,138 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,139 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,139 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,139 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,139 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,139 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,139 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,139 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,139 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,140 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,140 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,140 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,140 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,140 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,140 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,140 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,141 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,141 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,141 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,141 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,141 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,141 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,141 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,142 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,142 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,142 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,142 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,142 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,142 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,142 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,142 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,143 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,143 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,143 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,143 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,143 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,143 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,143 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,144 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,144 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,144 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,144 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,144 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,144 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,144 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,144 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,145 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,145 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,145 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,145 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,145 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,145 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,145 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,145 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,146 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,146 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,146 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,146 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,146 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,146 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,146 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,147 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,147 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,147 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,147 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,147 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,147 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,147 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,147 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,148 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,148 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,148 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,148 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,148 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,148 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,148 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,148 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,149 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,149 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,149 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,149 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,149 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,149 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,149 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,149 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,150 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,150 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,150 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,150 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,150 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,150 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,150 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,150 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,151 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,151 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,151 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,151 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,151 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,151 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,151 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,151 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,152 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,152 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,152 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,152 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,152 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,152 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,152 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,152 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:56:51,160 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 12:56:51,161 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 12:56:51,166 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 12:56:51,175 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 12:56:51,188 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 12:56:51,189 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 12:56:51,189 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 12:56:51,189 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 12:56:51,189 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 12:56:51,189 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 12:56:51,189 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 12:56:51,189 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 12:56:51,189 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 12:56:51,196 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2018-12-09 12:56:52,720 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34807 states. [2018-12-09 12:56:52,721 INFO L276 IsEmpty]: Start isEmpty. Operand 34807 states. [2018-12-09 12:56:52,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 12:56:52,726 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:56:52,727 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] [2018-12-09 12:56:52,728 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:56:52,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:56:52,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1782476305, now seen corresponding path program 1 times [2018-12-09 12:56:52,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:56:52,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:56:52,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:56:52,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:56:52,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:56:52,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:56:52,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-09 12:56:52,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:56:52,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:56:52,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:56:52,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:56:52,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:56:52,894 INFO L87 Difference]: Start difference. First operand 34807 states. Second operand 4 states. [2018-12-09 12:56:53,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:56:53,393 INFO L93 Difference]: Finished difference Result 60791 states and 234494 transitions. [2018-12-09 12:56:53,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:56:53,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-12-09 12:56:53,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:56:53,560 INFO L225 Difference]: With dead ends: 60791 [2018-12-09 12:56:53,560 INFO L226 Difference]: Without dead ends: 44271 [2018-12-09 12:56:53,561 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-09 12:56:53,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44271 states. [2018-12-09 12:56:54,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44271 to 27339. [2018-12-09 12:56:54,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27339 states. [2018-12-09 12:56:54,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27339 states to 27339 states and 105500 transitions. [2018-12-09 12:56:54,346 INFO L78 Accepts]: Start accepts. Automaton has 27339 states and 105500 transitions. Word has length 34 [2018-12-09 12:56:54,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:56:54,346 INFO L480 AbstractCegarLoop]: Abstraction has 27339 states and 105500 transitions. [2018-12-09 12:56:54,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:56:54,346 INFO L276 IsEmpty]: Start isEmpty. Operand 27339 states and 105500 transitions. [2018-12-09 12:56:54,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 12:56:54,350 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:56:54,351 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:56:54,351 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:56:54,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:56:54,351 INFO L82 PathProgramCache]: Analyzing trace with hash -983112731, now seen corresponding path program 1 times [2018-12-09 12:56:54,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:56:54,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:56:54,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:56:54,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:56:54,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:56:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:56:54,410 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-09 12:56:54,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:56:54,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:56:54,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:56:54,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:56:54,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:56:54,412 INFO L87 Difference]: Start difference. First operand 27339 states and 105500 transitions. Second operand 5 states. [2018-12-09 12:56:55,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:56:55,043 INFO L93 Difference]: Finished difference Result 64005 states and 235335 transitions. [2018-12-09 12:56:55,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 12:56:55,043 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-09 12:56:55,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:56:55,175 INFO L225 Difference]: With dead ends: 64005 [2018-12-09 12:56:55,175 INFO L226 Difference]: Without dead ends: 63453 [2018-12-09 12:56:55,176 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-09 12:56:55,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63453 states. [2018-12-09 12:56:55,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63453 to 41421. [2018-12-09 12:56:55,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41421 states. [2018-12-09 12:56:55,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41421 states to 41421 states and 152330 transitions. [2018-12-09 12:56:55,972 INFO L78 Accepts]: Start accepts. Automaton has 41421 states and 152330 transitions. Word has length 46 [2018-12-09 12:56:55,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:56:55,973 INFO L480 AbstractCegarLoop]: Abstraction has 41421 states and 152330 transitions. [2018-12-09 12:56:55,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:56:55,973 INFO L276 IsEmpty]: Start isEmpty. Operand 41421 states and 152330 transitions. [2018-12-09 12:56:55,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 12:56:55,976 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:56:55,977 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] [2018-12-09 12:56:55,977 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:56:55,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:56:55,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1484418599, now seen corresponding path program 1 times [2018-12-09 12:56:55,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:56:55,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:56:55,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:56:55,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:56:55,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:56:55,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:56:56,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:56:56,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:56:56,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:56:56,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:56:56,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:56:56,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:56:56,033 INFO L87 Difference]: Start difference. First operand 41421 states and 152330 transitions. Second operand 5 states. [2018-12-09 12:56:56,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:56:56,442 INFO L93 Difference]: Finished difference Result 81367 states and 298048 transitions. [2018-12-09 12:56:56,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 12:56:56,442 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-09 12:56:56,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:56:56,594 INFO L225 Difference]: With dead ends: 81367 [2018-12-09 12:56:56,594 INFO L226 Difference]: Without dead ends: 80855 [2018-12-09 12:56:56,595 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-09 12:56:56,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80855 states. [2018-12-09 12:56:57,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80855 to 45375. [2018-12-09 12:56:57,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45375 states. [2018-12-09 12:56:57,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45375 states to 45375 states and 166018 transitions. [2018-12-09 12:56:57,554 INFO L78 Accepts]: Start accepts. Automaton has 45375 states and 166018 transitions. Word has length 47 [2018-12-09 12:56:57,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:56:57,555 INFO L480 AbstractCegarLoop]: Abstraction has 45375 states and 166018 transitions. [2018-12-09 12:56:57,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:56:57,555 INFO L276 IsEmpty]: Start isEmpty. Operand 45375 states and 166018 transitions. [2018-12-09 12:56:57,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-09 12:56:57,559 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:56:57,559 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] [2018-12-09 12:56:57,559 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:56:57,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:56:57,559 INFO L82 PathProgramCache]: Analyzing trace with hash 375052511, now seen corresponding path program 1 times [2018-12-09 12:56:57,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:56:57,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:56:57,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:56:57,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:56:57,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:56:57,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:56:57,582 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-09 12:56:57,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:56:57,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 12:56:57,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 12:56:57,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 12:56:57,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:56:57,583 INFO L87 Difference]: Start difference. First operand 45375 states and 166018 transitions. Second operand 3 states. [2018-12-09 12:56:57,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:56:57,797 INFO L93 Difference]: Finished difference Result 65251 states and 235814 transitions. [2018-12-09 12:56:57,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 12:56:57,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-09 12:56:57,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:56:57,908 INFO L225 Difference]: With dead ends: 65251 [2018-12-09 12:56:57,908 INFO L226 Difference]: Without dead ends: 65251 [2018-12-09 12:56:57,908 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-09 12:56:58,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65251 states. [2018-12-09 12:56:58,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65251 to 50945. [2018-12-09 12:56:58,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50945 states. [2018-12-09 12:56:58,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50945 states to 50945 states and 184325 transitions. [2018-12-09 12:56:58,806 INFO L78 Accepts]: Start accepts. Automaton has 50945 states and 184325 transitions. Word has length 49 [2018-12-09 12:56:58,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:56:58,806 INFO L480 AbstractCegarLoop]: Abstraction has 50945 states and 184325 transitions. [2018-12-09 12:56:58,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 12:56:58,806 INFO L276 IsEmpty]: Start isEmpty. Operand 50945 states and 184325 transitions. [2018-12-09 12:56:58,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 12:56:58,814 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:56:58,814 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] [2018-12-09 12:56:58,814 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:56:58,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:56:58,814 INFO L82 PathProgramCache]: Analyzing trace with hash -559765890, now seen corresponding path program 1 times [2018-12-09 12:56:58,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:56:58,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:56:58,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:56:58,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:56:58,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:56:58,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:56:58,896 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-09 12:56:58,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:56:58,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:56:58,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:56:58,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:56:58,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:56:58,897 INFO L87 Difference]: Start difference. First operand 50945 states and 184325 transitions. Second operand 6 states. [2018-12-09 12:56:59,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:56:59,432 INFO L93 Difference]: Finished difference Result 67511 states and 242185 transitions. [2018-12-09 12:56:59,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 12:56:59,433 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-09 12:56:59,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:56:59,548 INFO L225 Difference]: With dead ends: 67511 [2018-12-09 12:56:59,549 INFO L226 Difference]: Without dead ends: 67511 [2018-12-09 12:56:59,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 12:56:59,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67511 states. [2018-12-09 12:57:00,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67511 to 63436. [2018-12-09 12:57:00,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63436 states. [2018-12-09 12:57:00,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63436 states to 63436 states and 227584 transitions. [2018-12-09 12:57:00,566 INFO L78 Accepts]: Start accepts. Automaton has 63436 states and 227584 transitions. Word has length 53 [2018-12-09 12:57:00,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:57:00,567 INFO L480 AbstractCegarLoop]: Abstraction has 63436 states and 227584 transitions. [2018-12-09 12:57:00,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:57:00,567 INFO L276 IsEmpty]: Start isEmpty. Operand 63436 states and 227584 transitions. [2018-12-09 12:57:00,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 12:57:00,575 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:57:00,575 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] [2018-12-09 12:57:00,576 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:57:00,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:57:00,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1938250047, now seen corresponding path program 1 times [2018-12-09 12:57:00,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:57:00,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:57:00,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:00,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:57:00,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:00,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:57:00,636 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-09 12:57:00,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:57:00,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 12:57:00,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:57:00,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:57:00,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:57:00,637 INFO L87 Difference]: Start difference. First operand 63436 states and 227584 transitions. Second operand 7 states. [2018-12-09 12:57:01,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:57:01,677 INFO L93 Difference]: Finished difference Result 88528 states and 306201 transitions. [2018-12-09 12:57:01,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 12:57:01,677 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-12-09 12:57:01,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:57:01,963 INFO L225 Difference]: With dead ends: 88528 [2018-12-09 12:57:01,963 INFO L226 Difference]: Without dead ends: 88528 [2018-12-09 12:57:01,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-09 12:57:02,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88528 states. [2018-12-09 12:57:02,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88528 to 74881. [2018-12-09 12:57:02,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74881 states. [2018-12-09 12:57:03,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74881 states to 74881 states and 262987 transitions. [2018-12-09 12:57:03,053 INFO L78 Accepts]: Start accepts. Automaton has 74881 states and 262987 transitions. Word has length 53 [2018-12-09 12:57:03,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:57:03,053 INFO L480 AbstractCegarLoop]: Abstraction has 74881 states and 262987 transitions. [2018-12-09 12:57:03,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:57:03,054 INFO L276 IsEmpty]: Start isEmpty. Operand 74881 states and 262987 transitions. [2018-12-09 12:57:03,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 12:57:03,063 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:57:03,063 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] [2018-12-09 12:57:03,063 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:57:03,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:57:03,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1469213568, now seen corresponding path program 1 times [2018-12-09 12:57:03,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:57:03,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:57:03,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:03,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:57:03,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:03,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:57:03,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-09 12:57:03,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:57:03,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 12:57:03,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 12:57:03,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 12:57:03,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:57:03,093 INFO L87 Difference]: Start difference. First operand 74881 states and 262987 transitions. Second operand 3 states. [2018-12-09 12:57:03,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:57:03,277 INFO L93 Difference]: Finished difference Result 57182 states and 199435 transitions. [2018-12-09 12:57:03,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 12:57:03,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2018-12-09 12:57:03,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:57:03,377 INFO L225 Difference]: With dead ends: 57182 [2018-12-09 12:57:03,377 INFO L226 Difference]: Without dead ends: 57182 [2018-12-09 12:57:03,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:57:03,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57182 states. [2018-12-09 12:57:04,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57182 to 56447. [2018-12-09 12:57:04,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56447 states. [2018-12-09 12:57:04,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56447 states to 56447 states and 197181 transitions. [2018-12-09 12:57:04,303 INFO L78 Accepts]: Start accepts. Automaton has 56447 states and 197181 transitions. Word has length 53 [2018-12-09 12:57:04,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:57:04,303 INFO L480 AbstractCegarLoop]: Abstraction has 56447 states and 197181 transitions. [2018-12-09 12:57:04,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 12:57:04,303 INFO L276 IsEmpty]: Start isEmpty. Operand 56447 states and 197181 transitions. [2018-12-09 12:57:04,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 12:57:04,309 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:57:04,309 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] [2018-12-09 12:57:04,309 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:57:04,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:57:04,310 INFO L82 PathProgramCache]: Analyzing trace with hash -211879190, now seen corresponding path program 1 times [2018-12-09 12:57:04,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:57:04,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:57:04,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:04,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:57:04,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:04,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:57:04,359 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-09 12:57:04,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:57:04,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:57:04,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:57:04,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:57:04,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:57:04,360 INFO L87 Difference]: Start difference. First operand 56447 states and 197181 transitions. Second operand 6 states. [2018-12-09 12:57:04,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:57:04,881 INFO L93 Difference]: Finished difference Result 97908 states and 340995 transitions. [2018-12-09 12:57:04,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 12:57:04,882 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-09 12:57:04,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:57:05,052 INFO L225 Difference]: With dead ends: 97908 [2018-12-09 12:57:05,052 INFO L226 Difference]: Without dead ends: 97332 [2018-12-09 12:57:05,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-09 12:57:05,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97332 states. [2018-12-09 12:57:06,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97332 to 56676. [2018-12-09 12:57:06,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56676 states. [2018-12-09 12:57:06,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56676 states to 56676 states and 198353 transitions. [2018-12-09 12:57:06,179 INFO L78 Accepts]: Start accepts. Automaton has 56676 states and 198353 transitions. Word has length 53 [2018-12-09 12:57:06,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:57:06,179 INFO L480 AbstractCegarLoop]: Abstraction has 56676 states and 198353 transitions. [2018-12-09 12:57:06,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:57:06,179 INFO L276 IsEmpty]: Start isEmpty. Operand 56676 states and 198353 transitions. [2018-12-09 12:57:06,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 12:57:06,187 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:57:06,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] [2018-12-09 12:57:06,187 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:57:06,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:57:06,187 INFO L82 PathProgramCache]: Analyzing trace with hash 2074481868, now seen corresponding path program 1 times [2018-12-09 12:57:06,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:57:06,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:57:06,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:06,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:57:06,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:06,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:57:06,256 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-09 12:57:06,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:57:06,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:57:06,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:57:06,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:57:06,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:57:06,257 INFO L87 Difference]: Start difference. First operand 56676 states and 198353 transitions. Second operand 5 states. [2018-12-09 12:57:06,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:57:06,605 INFO L93 Difference]: Finished difference Result 56810 states and 198218 transitions. [2018-12-09 12:57:06,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 12:57:06,606 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-12-09 12:57:06,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:57:06,698 INFO L225 Difference]: With dead ends: 56810 [2018-12-09 12:57:06,699 INFO L226 Difference]: Without dead ends: 56810 [2018-12-09 12:57:06,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:57:06,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56810 states. [2018-12-09 12:57:07,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56810 to 56721. [2018-12-09 12:57:07,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56721 states. [2018-12-09 12:57:07,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56721 states to 56721 states and 197943 transitions. [2018-12-09 12:57:07,515 INFO L78 Accepts]: Start accepts. Automaton has 56721 states and 197943 transitions. Word has length 54 [2018-12-09 12:57:07,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:57:07,515 INFO L480 AbstractCegarLoop]: Abstraction has 56721 states and 197943 transitions. [2018-12-09 12:57:07,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:57:07,515 INFO L276 IsEmpty]: Start isEmpty. Operand 56721 states and 197943 transitions. [2018-12-09 12:57:07,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 12:57:07,523 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:57:07,523 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] [2018-12-09 12:57:07,523 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:57:07,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:57:07,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1332981747, now seen corresponding path program 1 times [2018-12-09 12:57:07,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:57:07,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:57:07,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:07,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:57:07,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:07,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:57:07,561 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-09 12:57:07,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:57:07,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:57:07,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:57:07,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:57:07,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:57:07,562 INFO L87 Difference]: Start difference. First operand 56721 states and 197943 transitions. Second operand 4 states. [2018-12-09 12:57:07,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:57:07,628 INFO L93 Difference]: Finished difference Result 12705 states and 39562 transitions. [2018-12-09 12:57:07,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 12:57:07,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-12-09 12:57:07,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:57:07,643 INFO L225 Difference]: With dead ends: 12705 [2018-12-09 12:57:07,643 INFO L226 Difference]: Without dead ends: 10887 [2018-12-09 12:57:07,643 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-09 12:57:07,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10887 states. [2018-12-09 12:57:07,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10887 to 10839. [2018-12-09 12:57:07,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10839 states. [2018-12-09 12:57:07,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10839 states to 10839 states and 33378 transitions. [2018-12-09 12:57:07,745 INFO L78 Accepts]: Start accepts. Automaton has 10839 states and 33378 transitions. Word has length 54 [2018-12-09 12:57:07,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:57:07,745 INFO L480 AbstractCegarLoop]: Abstraction has 10839 states and 33378 transitions. [2018-12-09 12:57:07,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:57:07,745 INFO L276 IsEmpty]: Start isEmpty. Operand 10839 states and 33378 transitions. [2018-12-09 12:57:07,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-09 12:57:07,747 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:57:07,747 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] [2018-12-09 12:57:07,747 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:57:07,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:57:07,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1760614074, now seen corresponding path program 1 times [2018-12-09 12:57:07,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:57:07,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:57:07,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:07,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:57:07,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:07,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:57:07,777 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-09 12:57:07,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:57:07,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:57:07,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:57:07,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:57:07,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:57:07,778 INFO L87 Difference]: Start difference. First operand 10839 states and 33378 transitions. Second operand 4 states. [2018-12-09 12:57:07,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:57:07,858 INFO L93 Difference]: Finished difference Result 12386 states and 38207 transitions. [2018-12-09 12:57:07,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 12:57:07,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-12-09 12:57:07,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:57:07,871 INFO L225 Difference]: With dead ends: 12386 [2018-12-09 12:57:07,871 INFO L226 Difference]: Without dead ends: 12386 [2018-12-09 12:57:07,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-09 12:57:07,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12386 states. [2018-12-09 12:57:07,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12386 to 11359. [2018-12-09 12:57:07,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11359 states. [2018-12-09 12:57:07,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11359 states to 11359 states and 34991 transitions. [2018-12-09 12:57:07,988 INFO L78 Accepts]: Start accepts. Automaton has 11359 states and 34991 transitions. Word has length 61 [2018-12-09 12:57:07,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:57:07,988 INFO L480 AbstractCegarLoop]: Abstraction has 11359 states and 34991 transitions. [2018-12-09 12:57:07,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:57:07,988 INFO L276 IsEmpty]: Start isEmpty. Operand 11359 states and 34991 transitions. [2018-12-09 12:57:07,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-09 12:57:07,990 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:57:07,990 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] [2018-12-09 12:57:07,990 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:57:07,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:57:07,991 INFO L82 PathProgramCache]: Analyzing trace with hash -17803739, now seen corresponding path program 1 times [2018-12-09 12:57:07,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:57:07,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:57:07,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:07,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:57:07,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:07,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:57:08,036 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-09 12:57:08,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:57:08,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:57:08,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:57:08,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:57:08,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:57:08,037 INFO L87 Difference]: Start difference. First operand 11359 states and 34991 transitions. Second operand 6 states. [2018-12-09 12:57:08,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:57:08,270 INFO L93 Difference]: Finished difference Result 20935 states and 64392 transitions. [2018-12-09 12:57:08,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 12:57:08,270 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-12-09 12:57:08,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:57:08,291 INFO L225 Difference]: With dead ends: 20935 [2018-12-09 12:57:08,291 INFO L226 Difference]: Without dead ends: 20864 [2018-12-09 12:57:08,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-09 12:57:08,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20864 states. [2018-12-09 12:57:08,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20864 to 13298. [2018-12-09 12:57:08,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13298 states. [2018-12-09 12:57:08,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13298 states to 13298 states and 40676 transitions. [2018-12-09 12:57:08,466 INFO L78 Accepts]: Start accepts. Automaton has 13298 states and 40676 transitions. Word has length 61 [2018-12-09 12:57:08,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:57:08,466 INFO L480 AbstractCegarLoop]: Abstraction has 13298 states and 40676 transitions. [2018-12-09 12:57:08,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:57:08,466 INFO L276 IsEmpty]: Start isEmpty. Operand 13298 states and 40676 transitions. [2018-12-09 12:57:08,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 12:57:08,470 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:57:08,470 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] [2018-12-09 12:57:08,470 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:57:08,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:57:08,470 INFO L82 PathProgramCache]: Analyzing trace with hash 859851853, now seen corresponding path program 1 times [2018-12-09 12:57:08,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:57:08,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:57:08,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:08,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:57:08,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:08,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:57:08,502 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-09 12:57:08,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:57:08,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 12:57:08,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 12:57:08,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 12:57:08,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:57:08,503 INFO L87 Difference]: Start difference. First operand 13298 states and 40676 transitions. Second operand 3 states. [2018-12-09 12:57:08,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:57:08,616 INFO L93 Difference]: Finished difference Result 13930 states and 42328 transitions. [2018-12-09 12:57:08,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 12:57:08,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-09 12:57:08,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:57:08,630 INFO L225 Difference]: With dead ends: 13930 [2018-12-09 12:57:08,630 INFO L226 Difference]: Without dead ends: 13930 [2018-12-09 12:57:08,630 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-09 12:57:08,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13930 states. [2018-12-09 12:57:08,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13930 to 13614. [2018-12-09 12:57:08,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13614 states. [2018-12-09 12:57:08,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13614 states to 13614 states and 41502 transitions. [2018-12-09 12:57:08,755 INFO L78 Accepts]: Start accepts. Automaton has 13614 states and 41502 transitions. Word has length 67 [2018-12-09 12:57:08,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:57:08,756 INFO L480 AbstractCegarLoop]: Abstraction has 13614 states and 41502 transitions. [2018-12-09 12:57:08,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 12:57:08,756 INFO L276 IsEmpty]: Start isEmpty. Operand 13614 states and 41502 transitions. [2018-12-09 12:57:08,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 12:57:08,759 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:57:08,759 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] [2018-12-09 12:57:08,759 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:57:08,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:57:08,760 INFO L82 PathProgramCache]: Analyzing trace with hash -101762164, now seen corresponding path program 1 times [2018-12-09 12:57:08,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:57:08,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:57:08,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:08,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:57:08,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:08,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:57:08,796 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-09 12:57:08,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:57:08,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:57:08,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:57:08,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:57:08,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:57:08,798 INFO L87 Difference]: Start difference. First operand 13614 states and 41502 transitions. Second operand 4 states. [2018-12-09 12:57:08,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:57:08,974 INFO L93 Difference]: Finished difference Result 17463 states and 52707 transitions. [2018-12-09 12:57:08,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:57:08,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-09 12:57:08,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:57:08,992 INFO L225 Difference]: With dead ends: 17463 [2018-12-09 12:57:08,992 INFO L226 Difference]: Without dead ends: 17463 [2018-12-09 12:57:08,992 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-09 12:57:09,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17463 states. [2018-12-09 12:57:09,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17463 to 15244. [2018-12-09 12:57:09,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15244 states. [2018-12-09 12:57:09,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15244 states to 15244 states and 46162 transitions. [2018-12-09 12:57:09,162 INFO L78 Accepts]: Start accepts. Automaton has 15244 states and 46162 transitions. Word has length 67 [2018-12-09 12:57:09,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:57:09,162 INFO L480 AbstractCegarLoop]: Abstraction has 15244 states and 46162 transitions. [2018-12-09 12:57:09,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:57:09,163 INFO L276 IsEmpty]: Start isEmpty. Operand 15244 states and 46162 transitions. [2018-12-09 12:57:09,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 12:57:09,168 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:57:09,169 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] [2018-12-09 12:57:09,169 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:57:09,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:57:09,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1143002317, now seen corresponding path program 1 times [2018-12-09 12:57:09,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:57:09,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:57:09,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:09,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:57:09,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:09,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:57:09,234 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-09 12:57:09,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:57:09,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:57:09,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:57:09,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:57:09,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:57:09,235 INFO L87 Difference]: Start difference. First operand 15244 states and 46162 transitions. Second operand 6 states. [2018-12-09 12:57:09,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:57:09,777 INFO L93 Difference]: Finished difference Result 18862 states and 56070 transitions. [2018-12-09 12:57:09,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 12:57:09,777 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-09 12:57:09,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:57:09,796 INFO L225 Difference]: With dead ends: 18862 [2018-12-09 12:57:09,796 INFO L226 Difference]: Without dead ends: 18862 [2018-12-09 12:57:09,796 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-09 12:57:09,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18862 states. [2018-12-09 12:57:09,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18862 to 17720. [2018-12-09 12:57:09,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17720 states. [2018-12-09 12:57:09,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17720 states to 17720 states and 53130 transitions. [2018-12-09 12:57:09,981 INFO L78 Accepts]: Start accepts. Automaton has 17720 states and 53130 transitions. Word has length 67 [2018-12-09 12:57:09,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:57:09,981 INFO L480 AbstractCegarLoop]: Abstraction has 17720 states and 53130 transitions. [2018-12-09 12:57:09,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:57:09,981 INFO L276 IsEmpty]: Start isEmpty. Operand 17720 states and 53130 transitions. [2018-12-09 12:57:09,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 12:57:09,987 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:57:09,987 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] [2018-12-09 12:57:09,987 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:57:09,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:57:09,987 INFO L82 PathProgramCache]: Analyzing trace with hash -934207026, now seen corresponding path program 1 times [2018-12-09 12:57:09,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:57:09,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:57:09,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:09,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:57:09,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:09,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:57:10,039 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-09 12:57:10,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:57:10,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:57:10,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:57:10,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:57:10,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:57:10,040 INFO L87 Difference]: Start difference. First operand 17720 states and 53130 transitions. Second operand 6 states. [2018-12-09 12:57:10,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:57:10,273 INFO L93 Difference]: Finished difference Result 20389 states and 59192 transitions. [2018-12-09 12:57:10,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 12:57:10,274 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-09 12:57:10,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:57:10,292 INFO L225 Difference]: With dead ends: 20389 [2018-12-09 12:57:10,292 INFO L226 Difference]: Without dead ends: 20389 [2018-12-09 12:57:10,293 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-09 12:57:10,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20389 states. [2018-12-09 12:57:10,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20389 to 18002. [2018-12-09 12:57:10,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18002 states. [2018-12-09 12:57:10,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18002 states to 18002 states and 53141 transitions. [2018-12-09 12:57:10,476 INFO L78 Accepts]: Start accepts. Automaton has 18002 states and 53141 transitions. Word has length 67 [2018-12-09 12:57:10,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:57:10,476 INFO L480 AbstractCegarLoop]: Abstraction has 18002 states and 53141 transitions. [2018-12-09 12:57:10,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:57:10,476 INFO L276 IsEmpty]: Start isEmpty. Operand 18002 states and 53141 transitions. [2018-12-09 12:57:10,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 12:57:10,482 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:57:10,482 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] [2018-12-09 12:57:10,482 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:57:10,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:57:10,483 INFO L82 PathProgramCache]: Analyzing trace with hash -722856113, now seen corresponding path program 1 times [2018-12-09 12:57:10,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:57:10,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:57:10,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:10,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:57:10,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:10,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:57:10,520 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-09 12:57:10,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:57:10,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:57:10,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:57:10,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:57:10,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:57:10,521 INFO L87 Difference]: Start difference. First operand 18002 states and 53141 transitions. Second operand 5 states. [2018-12-09 12:57:10,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:57:10,729 INFO L93 Difference]: Finished difference Result 23413 states and 68634 transitions. [2018-12-09 12:57:10,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 12:57:10,729 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-09 12:57:10,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:57:10,752 INFO L225 Difference]: With dead ends: 23413 [2018-12-09 12:57:10,752 INFO L226 Difference]: Without dead ends: 23413 [2018-12-09 12:57:10,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:57:10,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23413 states. [2018-12-09 12:57:10,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23413 to 21350. [2018-12-09 12:57:10,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21350 states. [2018-12-09 12:57:10,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21350 states to 21350 states and 62545 transitions. [2018-12-09 12:57:10,971 INFO L78 Accepts]: Start accepts. Automaton has 21350 states and 62545 transitions. Word has length 67 [2018-12-09 12:57:10,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:57:10,971 INFO L480 AbstractCegarLoop]: Abstraction has 21350 states and 62545 transitions. [2018-12-09 12:57:10,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:57:10,971 INFO L276 IsEmpty]: Start isEmpty. Operand 21350 states and 62545 transitions. [2018-12-09 12:57:10,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 12:57:10,978 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:57:10,978 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] [2018-12-09 12:57:10,979 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:57:10,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:57:10,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1233390290, now seen corresponding path program 1 times [2018-12-09 12:57:10,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:57:10,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:57:10,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:10,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:57:10,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:10,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:57:11,020 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-09 12:57:11,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:57:11,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:57:11,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:57:11,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:57:11,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:57:11,021 INFO L87 Difference]: Start difference. First operand 21350 states and 62545 transitions. Second operand 4 states. [2018-12-09 12:57:11,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:57:11,342 INFO L93 Difference]: Finished difference Result 26638 states and 78155 transitions. [2018-12-09 12:57:11,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 12:57:11,342 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-09 12:57:11,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:57:11,370 INFO L225 Difference]: With dead ends: 26638 [2018-12-09 12:57:11,370 INFO L226 Difference]: Without dead ends: 26342 [2018-12-09 12:57:11,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:57:11,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26342 states. [2018-12-09 12:57:11,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26342 to 25026. [2018-12-09 12:57:11,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25026 states. [2018-12-09 12:57:11,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25026 states to 25026 states and 73322 transitions. [2018-12-09 12:57:11,642 INFO L78 Accepts]: Start accepts. Automaton has 25026 states and 73322 transitions. Word has length 67 [2018-12-09 12:57:11,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:57:11,642 INFO L480 AbstractCegarLoop]: Abstraction has 25026 states and 73322 transitions. [2018-12-09 12:57:11,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:57:11,642 INFO L276 IsEmpty]: Start isEmpty. Operand 25026 states and 73322 transitions. [2018-12-09 12:57:11,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 12:57:11,649 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:57:11,649 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] [2018-12-09 12:57:11,649 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:57:11,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:57:11,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1264625647, now seen corresponding path program 1 times [2018-12-09 12:57:11,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:57:11,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:57:11,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:11,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:57:11,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:11,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:57:11,676 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-09 12:57:11,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:57:11,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:57:11,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:57:11,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:57:11,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:57:11,677 INFO L87 Difference]: Start difference. First operand 25026 states and 73322 transitions. Second operand 5 states. [2018-12-09 12:57:11,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:57:11,716 INFO L93 Difference]: Finished difference Result 7314 states and 17674 transitions. [2018-12-09 12:57:11,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 12:57:11,716 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-09 12:57:11,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:57:11,720 INFO L225 Difference]: With dead ends: 7314 [2018-12-09 12:57:11,721 INFO L226 Difference]: Without dead ends: 6004 [2018-12-09 12:57:11,721 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-09 12:57:11,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6004 states. [2018-12-09 12:57:11,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6004 to 5514. [2018-12-09 12:57:11,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5514 states. [2018-12-09 12:57:11,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5514 states to 5514 states and 12848 transitions. [2018-12-09 12:57:11,757 INFO L78 Accepts]: Start accepts. Automaton has 5514 states and 12848 transitions. Word has length 67 [2018-12-09 12:57:11,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:57:11,758 INFO L480 AbstractCegarLoop]: Abstraction has 5514 states and 12848 transitions. [2018-12-09 12:57:11,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:57:11,758 INFO L276 IsEmpty]: Start isEmpty. Operand 5514 states and 12848 transitions. [2018-12-09 12:57:11,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 12:57:11,761 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:57:11,761 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] [2018-12-09 12:57:11,761 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:57:11,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:57:11,761 INFO L82 PathProgramCache]: Analyzing trace with hash 288361846, now seen corresponding path program 1 times [2018-12-09 12:57:11,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:57:11,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:57:11,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:11,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:57:11,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:11,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:57:11,784 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-09 12:57:11,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:57:11,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 12:57:11,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 12:57:11,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 12:57:11,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:57:11,785 INFO L87 Difference]: Start difference. First operand 5514 states and 12848 transitions. Second operand 3 states. [2018-12-09 12:57:11,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:57:11,806 INFO L93 Difference]: Finished difference Result 7126 states and 16417 transitions. [2018-12-09 12:57:11,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 12:57:11,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-09 12:57:11,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:57:11,811 INFO L225 Difference]: With dead ends: 7126 [2018-12-09 12:57:11,812 INFO L226 Difference]: Without dead ends: 7126 [2018-12-09 12:57:11,812 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-09 12:57:11,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7126 states. [2018-12-09 12:57:11,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7126 to 5453. [2018-12-09 12:57:11,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5453 states. [2018-12-09 12:57:11,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5453 states to 5453 states and 12388 transitions. [2018-12-09 12:57:11,855 INFO L78 Accepts]: Start accepts. Automaton has 5453 states and 12388 transitions. Word has length 67 [2018-12-09 12:57:11,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:57:11,855 INFO L480 AbstractCegarLoop]: Abstraction has 5453 states and 12388 transitions. [2018-12-09 12:57:11,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 12:57:11,855 INFO L276 IsEmpty]: Start isEmpty. Operand 5453 states and 12388 transitions. [2018-12-09 12:57:11,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-09 12:57:11,859 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:57:11,859 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] [2018-12-09 12:57:11,859 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:57:11,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:57:11,860 INFO L82 PathProgramCache]: Analyzing trace with hash -211461463, now seen corresponding path program 1 times [2018-12-09 12:57:11,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:57:11,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:57:11,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:11,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:57:11,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:11,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:57:11,889 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-09 12:57:11,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:57:11,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:57:11,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:57:11,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:57:11,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:57:11,890 INFO L87 Difference]: Start difference. First operand 5453 states and 12388 transitions. Second operand 5 states. [2018-12-09 12:57:11,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:57:11,994 INFO L93 Difference]: Finished difference Result 6617 states and 15012 transitions. [2018-12-09 12:57:11,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 12:57:11,994 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-12-09 12:57:11,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:57:11,998 INFO L225 Difference]: With dead ends: 6617 [2018-12-09 12:57:11,998 INFO L226 Difference]: Without dead ends: 6617 [2018-12-09 12:57:11,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-09 12:57:12,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6617 states. [2018-12-09 12:57:12,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6617 to 5897. [2018-12-09 12:57:12,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5897 states. [2018-12-09 12:57:12,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5897 states to 5897 states and 13392 transitions. [2018-12-09 12:57:12,038 INFO L78 Accepts]: Start accepts. Automaton has 5897 states and 13392 transitions. Word has length 73 [2018-12-09 12:57:12,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:57:12,038 INFO L480 AbstractCegarLoop]: Abstraction has 5897 states and 13392 transitions. [2018-12-09 12:57:12,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:57:12,038 INFO L276 IsEmpty]: Start isEmpty. Operand 5897 states and 13392 transitions. [2018-12-09 12:57:12,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-09 12:57:12,042 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:57:12,042 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] [2018-12-09 12:57:12,042 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:57:12,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:57:12,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1531348872, now seen corresponding path program 1 times [2018-12-09 12:57:12,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:57:12,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:57:12,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:12,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:57:12,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:12,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:57:12,086 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-09 12:57:12,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:57:12,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 12:57:12,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:57:12,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:57:12,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:57:12,087 INFO L87 Difference]: Start difference. First operand 5897 states and 13392 transitions. Second operand 7 states. [2018-12-09 12:57:12,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:57:12,317 INFO L93 Difference]: Finished difference Result 7099 states and 15961 transitions. [2018-12-09 12:57:12,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 12:57:12,317 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2018-12-09 12:57:12,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:57:12,323 INFO L225 Difference]: With dead ends: 7099 [2018-12-09 12:57:12,323 INFO L226 Difference]: Without dead ends: 6980 [2018-12-09 12:57:12,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-12-09 12:57:12,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6980 states. [2018-12-09 12:57:12,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6980 to 5994. [2018-12-09 12:57:12,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5994 states. [2018-12-09 12:57:12,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5994 states to 5994 states and 13485 transitions. [2018-12-09 12:57:12,370 INFO L78 Accepts]: Start accepts. Automaton has 5994 states and 13485 transitions. Word has length 73 [2018-12-09 12:57:12,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:57:12,370 INFO L480 AbstractCegarLoop]: Abstraction has 5994 states and 13485 transitions. [2018-12-09 12:57:12,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:57:12,370 INFO L276 IsEmpty]: Start isEmpty. Operand 5994 states and 13485 transitions. [2018-12-09 12:57:12,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 12:57:12,375 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:57:12,375 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-09 12:57:12,375 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:57:12,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:57:12,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1678014975, now seen corresponding path program 1 times [2018-12-09 12:57:12,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:57:12,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:57:12,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:12,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:57:12,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:12,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:57:12,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-09 12:57:12,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:57:12,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:57:12,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:57:12,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:57:12,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:57:12,411 INFO L87 Difference]: Start difference. First operand 5994 states and 13485 transitions. Second operand 5 states. [2018-12-09 12:57:12,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:57:12,592 INFO L93 Difference]: Finished difference Result 5550 states and 12354 transitions. [2018-12-09 12:57:12,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 12:57:12,592 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-09 12:57:12,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:57:12,596 INFO L225 Difference]: With dead ends: 5550 [2018-12-09 12:57:12,596 INFO L226 Difference]: Without dead ends: 5550 [2018-12-09 12:57:12,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:57:12,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5550 states. [2018-12-09 12:57:12,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5550 to 5153. [2018-12-09 12:57:12,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5153 states. [2018-12-09 12:57:12,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5153 states to 5153 states and 11452 transitions. [2018-12-09 12:57:12,630 INFO L78 Accepts]: Start accepts. Automaton has 5153 states and 11452 transitions. Word has length 94 [2018-12-09 12:57:12,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:57:12,631 INFO L480 AbstractCegarLoop]: Abstraction has 5153 states and 11452 transitions. [2018-12-09 12:57:12,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:57:12,631 INFO L276 IsEmpty]: Start isEmpty. Operand 5153 states and 11452 transitions. [2018-12-09 12:57:12,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 12:57:12,634 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:57:12,634 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-09 12:57:12,635 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:57:12,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:57:12,635 INFO L82 PathProgramCache]: Analyzing trace with hash -451364121, now seen corresponding path program 1 times [2018-12-09 12:57:12,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:57:12,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:57:12,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:12,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:57:12,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:12,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:57:12,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:57:12,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:57:12,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:57:12,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:57:12,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:57:12,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:57:12,670 INFO L87 Difference]: Start difference. First operand 5153 states and 11452 transitions. Second operand 4 states. [2018-12-09 12:57:12,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:57:12,732 INFO L93 Difference]: Finished difference Result 6337 states and 14007 transitions. [2018-12-09 12:57:12,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:57:12,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-09 12:57:12,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:57:12,736 INFO L225 Difference]: With dead ends: 6337 [2018-12-09 12:57:12,736 INFO L226 Difference]: Without dead ends: 6337 [2018-12-09 12:57:12,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:57:12,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6337 states. [2018-12-09 12:57:12,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6337 to 5568. [2018-12-09 12:57:12,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5568 states. [2018-12-09 12:57:12,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5568 states to 5568 states and 12373 transitions. [2018-12-09 12:57:12,779 INFO L78 Accepts]: Start accepts. Automaton has 5568 states and 12373 transitions. Word has length 94 [2018-12-09 12:57:12,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:57:12,779 INFO L480 AbstractCegarLoop]: Abstraction has 5568 states and 12373 transitions. [2018-12-09 12:57:12,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:57:12,779 INFO L276 IsEmpty]: Start isEmpty. Operand 5568 states and 12373 transitions. [2018-12-09 12:57:12,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 12:57:12,783 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:57:12,783 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:57:12,783 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:57:12,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:57:12,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1661573399, now seen corresponding path program 1 times [2018-12-09 12:57:12,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:57:12,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:57:12,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:12,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:57:12,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:12,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:57:12,825 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-09 12:57:12,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:57:12,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:57:12,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:57:12,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:57:12,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:57:12,826 INFO L87 Difference]: Start difference. First operand 5568 states and 12373 transitions. Second operand 5 states. [2018-12-09 12:57:12,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:57:12,893 INFO L93 Difference]: Finished difference Result 6441 states and 14301 transitions. [2018-12-09 12:57:12,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 12:57:12,893 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-09 12:57:12,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:57:12,897 INFO L225 Difference]: With dead ends: 6441 [2018-12-09 12:57:12,897 INFO L226 Difference]: Without dead ends: 6441 [2018-12-09 12:57:12,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:57:12,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6441 states. [2018-12-09 12:57:12,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6441 to 5079. [2018-12-09 12:57:12,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5079 states. [2018-12-09 12:57:12,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5079 states to 5079 states and 11282 transitions. [2018-12-09 12:57:12,935 INFO L78 Accepts]: Start accepts. Automaton has 5079 states and 11282 transitions. Word has length 96 [2018-12-09 12:57:12,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:57:12,935 INFO L480 AbstractCegarLoop]: Abstraction has 5079 states and 11282 transitions. [2018-12-09 12:57:12,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:57:12,935 INFO L276 IsEmpty]: Start isEmpty. Operand 5079 states and 11282 transitions. [2018-12-09 12:57:12,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 12:57:12,938 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:57:12,938 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:57:12,939 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:57:12,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:57:12,939 INFO L82 PathProgramCache]: Analyzing trace with hash -28769400, now seen corresponding path program 1 times [2018-12-09 12:57:12,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:57:12,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:57:12,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:12,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:57:12,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:12,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:57:13,026 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-09 12:57:13,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:57:13,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 12:57:13,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:57:13,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:57:13,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:57:13,027 INFO L87 Difference]: Start difference. First operand 5079 states and 11282 transitions. Second operand 7 states. [2018-12-09 12:57:13,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:57:13,209 INFO L93 Difference]: Finished difference Result 6777 states and 14905 transitions. [2018-12-09 12:57:13,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 12:57:13,209 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-09 12:57:13,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:57:13,213 INFO L225 Difference]: With dead ends: 6777 [2018-12-09 12:57:13,213 INFO L226 Difference]: Without dead ends: 6723 [2018-12-09 12:57:13,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-09 12:57:13,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6723 states. [2018-12-09 12:57:13,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6723 to 5556. [2018-12-09 12:57:13,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5556 states. [2018-12-09 12:57:13,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5556 states to 5556 states and 12272 transitions. [2018-12-09 12:57:13,255 INFO L78 Accepts]: Start accepts. Automaton has 5556 states and 12272 transitions. Word has length 96 [2018-12-09 12:57:13,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:57:13,255 INFO L480 AbstractCegarLoop]: Abstraction has 5556 states and 12272 transitions. [2018-12-09 12:57:13,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:57:13,256 INFO L276 IsEmpty]: Start isEmpty. Operand 5556 states and 12272 transitions. [2018-12-09 12:57:13,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 12:57:13,259 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:57:13,259 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:57:13,260 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:57:13,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:57:13,260 INFO L82 PathProgramCache]: Analyzing trace with hash -543358231, now seen corresponding path program 1 times [2018-12-09 12:57:13,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:57:13,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:57:13,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:13,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:57:13,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:13,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:57:13,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:57:13,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:57:13,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:57:13,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:57:13,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:57:13,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:57:13,316 INFO L87 Difference]: Start difference. First operand 5556 states and 12272 transitions. Second operand 6 states. [2018-12-09 12:57:13,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:57:13,533 INFO L93 Difference]: Finished difference Result 6493 states and 14426 transitions. [2018-12-09 12:57:13,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 12:57:13,533 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-09 12:57:13,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:57:13,538 INFO L225 Difference]: With dead ends: 6493 [2018-12-09 12:57:13,538 INFO L226 Difference]: Without dead ends: 6493 [2018-12-09 12:57:13,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-09 12:57:13,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6493 states. [2018-12-09 12:57:13,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6493 to 5763. [2018-12-09 12:57:13,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5763 states. [2018-12-09 12:57:13,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5763 states to 5763 states and 12725 transitions. [2018-12-09 12:57:13,578 INFO L78 Accepts]: Start accepts. Automaton has 5763 states and 12725 transitions. Word has length 96 [2018-12-09 12:57:13,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:57:13,579 INFO L480 AbstractCegarLoop]: Abstraction has 5763 states and 12725 transitions. [2018-12-09 12:57:13,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:57:13,579 INFO L276 IsEmpty]: Start isEmpty. Operand 5763 states and 12725 transitions. [2018-12-09 12:57:13,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 12:57:13,583 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:57:13,583 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:57:13,583 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:57:13,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:57:13,583 INFO L82 PathProgramCache]: Analyzing trace with hash 400392135, now seen corresponding path program 1 times [2018-12-09 12:57:13,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:57:13,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:57:13,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:13,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:57:13,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:13,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:57:13,626 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-09 12:57:13,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:57:13,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:57:13,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:57:13,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:57:13,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:57:13,627 INFO L87 Difference]: Start difference. First operand 5763 states and 12725 transitions. Second operand 6 states. [2018-12-09 12:57:13,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:57:13,964 INFO L93 Difference]: Finished difference Result 7787 states and 17066 transitions. [2018-12-09 12:57:13,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 12:57:13,964 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-09 12:57:13,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:57:13,969 INFO L225 Difference]: With dead ends: 7787 [2018-12-09 12:57:13,969 INFO L226 Difference]: Without dead ends: 7771 [2018-12-09 12:57:13,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-12-09 12:57:13,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7771 states. [2018-12-09 12:57:14,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7771 to 6210. [2018-12-09 12:57:14,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6210 states. [2018-12-09 12:57:14,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6210 states to 6210 states and 13818 transitions. [2018-12-09 12:57:14,017 INFO L78 Accepts]: Start accepts. Automaton has 6210 states and 13818 transitions. Word has length 96 [2018-12-09 12:57:14,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:57:14,018 INFO L480 AbstractCegarLoop]: Abstraction has 6210 states and 13818 transitions. [2018-12-09 12:57:14,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:57:14,018 INFO L276 IsEmpty]: Start isEmpty. Operand 6210 states and 13818 transitions. [2018-12-09 12:57:14,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 12:57:14,022 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:57:14,022 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 12:57:14,022 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:57:14,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:57:14,022 INFO L82 PathProgramCache]: Analyzing trace with hash 611743048, now seen corresponding path program 1 times [2018-12-09 12:57:14,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:57:14,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:57:14,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:14,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:57:14,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:14,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:57:14,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-09 12:57:14,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:57:14,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:57:14,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:57:14,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:57:14,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:57:14,111 INFO L87 Difference]: Start difference. First operand 6210 states and 13818 transitions. Second operand 6 states. [2018-12-09 12:57:14,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:57:14,213 INFO L93 Difference]: Finished difference Result 6536 states and 14293 transitions. [2018-12-09 12:57:14,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 12:57:14,213 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-09 12:57:14,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:57:14,217 INFO L225 Difference]: With dead ends: 6536 [2018-12-09 12:57:14,218 INFO L226 Difference]: Without dead ends: 6514 [2018-12-09 12:57:14,218 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-09 12:57:14,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6514 states. [2018-12-09 12:57:14,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6514 to 5548. [2018-12-09 12:57:14,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5548 states. [2018-12-09 12:57:14,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5548 states to 5548 states and 12250 transitions. [2018-12-09 12:57:14,259 INFO L78 Accepts]: Start accepts. Automaton has 5548 states and 12250 transitions. Word has length 96 [2018-12-09 12:57:14,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:57:14,259 INFO L480 AbstractCegarLoop]: Abstraction has 5548 states and 12250 transitions. [2018-12-09 12:57:14,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:57:14,259 INFO L276 IsEmpty]: Start isEmpty. Operand 5548 states and 12250 transitions. [2018-12-09 12:57:14,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 12:57:14,262 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:57:14,262 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:57:14,263 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:57:14,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:57:14,263 INFO L82 PathProgramCache]: Analyzing trace with hash -893987928, now seen corresponding path program 1 times [2018-12-09 12:57:14,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:57:14,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:57:14,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:14,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:57:14,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:14,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:57:14,394 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-09 12:57:14,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:57:14,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 12:57:14,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 12:57:14,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 12:57:14,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-09 12:57:14,394 INFO L87 Difference]: Start difference. First operand 5548 states and 12250 transitions. Second operand 9 states. [2018-12-09 12:57:14,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:57:14,712 INFO L93 Difference]: Finished difference Result 6597 states and 14375 transitions. [2018-12-09 12:57:14,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 12:57:14,712 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2018-12-09 12:57:14,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:57:14,716 INFO L225 Difference]: With dead ends: 6597 [2018-12-09 12:57:14,717 INFO L226 Difference]: Without dead ends: 6597 [2018-12-09 12:57:14,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2018-12-09 12:57:14,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6597 states. [2018-12-09 12:57:14,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6597 to 5852. [2018-12-09 12:57:14,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5852 states. [2018-12-09 12:57:14,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5852 states to 5852 states and 12874 transitions. [2018-12-09 12:57:14,759 INFO L78 Accepts]: Start accepts. Automaton has 5852 states and 12874 transitions. Word has length 96 [2018-12-09 12:57:14,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:57:14,759 INFO L480 AbstractCegarLoop]: Abstraction has 5852 states and 12874 transitions. [2018-12-09 12:57:14,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 12:57:14,759 INFO L276 IsEmpty]: Start isEmpty. Operand 5852 states and 12874 transitions. [2018-12-09 12:57:14,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 12:57:14,763 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:57:14,763 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:57:14,763 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:57:14,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:57:14,763 INFO L82 PathProgramCache]: Analyzing trace with hash 273485737, now seen corresponding path program 1 times [2018-12-09 12:57:14,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:57:14,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:57:14,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:14,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:57:14,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:14,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:57:14,814 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-09 12:57:14,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:57:14,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 12:57:14,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:57:14,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:57:14,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:57:14,815 INFO L87 Difference]: Start difference. First operand 5852 states and 12874 transitions. Second operand 7 states. [2018-12-09 12:57:15,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:57:15,012 INFO L93 Difference]: Finished difference Result 7331 states and 16051 transitions. [2018-12-09 12:57:15,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 12:57:15,012 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-09 12:57:15,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:57:15,016 INFO L225 Difference]: With dead ends: 7331 [2018-12-09 12:57:15,016 INFO L226 Difference]: Without dead ends: 7331 [2018-12-09 12:57:15,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-09 12:57:15,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7331 states. [2018-12-09 12:57:15,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7331 to 6796. [2018-12-09 12:57:15,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6796 states. [2018-12-09 12:57:15,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6796 states to 6796 states and 14856 transitions. [2018-12-09 12:57:15,063 INFO L78 Accepts]: Start accepts. Automaton has 6796 states and 14856 transitions. Word has length 96 [2018-12-09 12:57:15,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:57:15,063 INFO L480 AbstractCegarLoop]: Abstraction has 6796 states and 14856 transitions. [2018-12-09 12:57:15,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:57:15,064 INFO L276 IsEmpty]: Start isEmpty. Operand 6796 states and 14856 transitions. [2018-12-09 12:57:15,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 12:57:15,068 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:57:15,068 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:57:15,068 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:57:15,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:57:15,068 INFO L82 PathProgramCache]: Analyzing trace with hash -2033999799, now seen corresponding path program 1 times [2018-12-09 12:57:15,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:57:15,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:57:15,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:15,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:57:15,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:15,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:57:15,128 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-09 12:57:15,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:57:15,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 12:57:15,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:57:15,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:57:15,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:57:15,129 INFO L87 Difference]: Start difference. First operand 6796 states and 14856 transitions. Second operand 7 states. [2018-12-09 12:57:15,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:57:15,229 INFO L93 Difference]: Finished difference Result 8554 states and 18799 transitions. [2018-12-09 12:57:15,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 12:57:15,230 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-09 12:57:15,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:57:15,234 INFO L225 Difference]: With dead ends: 8554 [2018-12-09 12:57:15,234 INFO L226 Difference]: Without dead ends: 8554 [2018-12-09 12:57:15,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-09 12:57:15,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8554 states. [2018-12-09 12:57:15,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8554 to 6128. [2018-12-09 12:57:15,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6128 states. [2018-12-09 12:57:15,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6128 states to 6128 states and 13324 transitions. [2018-12-09 12:57:15,281 INFO L78 Accepts]: Start accepts. Automaton has 6128 states and 13324 transitions. Word has length 96 [2018-12-09 12:57:15,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:57:15,281 INFO L480 AbstractCegarLoop]: Abstraction has 6128 states and 13324 transitions. [2018-12-09 12:57:15,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:57:15,282 INFO L276 IsEmpty]: Start isEmpty. Operand 6128 states and 13324 transitions. [2018-12-09 12:57:15,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 12:57:15,285 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:57:15,286 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:57:15,286 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:57:15,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:57:15,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1340898102, now seen corresponding path program 1 times [2018-12-09 12:57:15,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:57:15,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:57:15,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:15,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:57:15,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:15,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:57:15,364 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-09 12:57:15,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:57:15,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 12:57:15,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:57:15,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:57:15,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:57:15,365 INFO L87 Difference]: Start difference. First operand 6128 states and 13324 transitions. Second operand 7 states. [2018-12-09 12:57:15,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:57:15,483 INFO L93 Difference]: Finished difference Result 6757 states and 14643 transitions. [2018-12-09 12:57:15,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 12:57:15,484 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-09 12:57:15,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:57:15,488 INFO L225 Difference]: With dead ends: 6757 [2018-12-09 12:57:15,488 INFO L226 Difference]: Without dead ends: 6757 [2018-12-09 12:57:15,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-12-09 12:57:15,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6757 states. [2018-12-09 12:57:15,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6757 to 5214. [2018-12-09 12:57:15,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5214 states. [2018-12-09 12:57:15,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5214 states to 5214 states and 11389 transitions. [2018-12-09 12:57:15,526 INFO L78 Accepts]: Start accepts. Automaton has 5214 states and 11389 transitions. Word has length 96 [2018-12-09 12:57:15,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:57:15,526 INFO L480 AbstractCegarLoop]: Abstraction has 5214 states and 11389 transitions. [2018-12-09 12:57:15,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:57:15,526 INFO L276 IsEmpty]: Start isEmpty. Operand 5214 states and 11389 transitions. [2018-12-09 12:57:15,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 12:57:15,530 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:57:15,530 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:57:15,530 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:57:15,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:57:15,530 INFO L82 PathProgramCache]: Analyzing trace with hash -453394421, now seen corresponding path program 1 times [2018-12-09 12:57:15,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:57:15,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:57:15,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:15,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:57:15,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:15,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:57:15,614 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-09 12:57:15,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:57:15,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 12:57:15,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 12:57:15,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 12:57:15,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-09 12:57:15,615 INFO L87 Difference]: Start difference. First operand 5214 states and 11389 transitions. Second operand 11 states. [2018-12-09 12:57:17,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:57:17,199 INFO L93 Difference]: Finished difference Result 9915 states and 21866 transitions. [2018-12-09 12:57:17,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 12:57:17,200 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-12-09 12:57:17,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:57:17,210 INFO L225 Difference]: With dead ends: 9915 [2018-12-09 12:57:17,210 INFO L226 Difference]: Without dead ends: 6171 [2018-12-09 12:57:17,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-09 12:57:17,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6171 states. [2018-12-09 12:57:17,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6171 to 4642. [2018-12-09 12:57:17,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4642 states. [2018-12-09 12:57:17,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4642 states to 4642 states and 10103 transitions. [2018-12-09 12:57:17,259 INFO L78 Accepts]: Start accepts. Automaton has 4642 states and 10103 transitions. Word has length 96 [2018-12-09 12:57:17,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:57:17,260 INFO L480 AbstractCegarLoop]: Abstraction has 4642 states and 10103 transitions. [2018-12-09 12:57:17,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 12:57:17,260 INFO L276 IsEmpty]: Start isEmpty. Operand 4642 states and 10103 transitions. [2018-12-09 12:57:17,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 12:57:17,262 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:57:17,262 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:57:17,263 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:57:17,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:57:17,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1711267723, now seen corresponding path program 2 times [2018-12-09 12:57:17,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:57:17,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:57:17,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:17,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:57:17,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:57:17,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:57:17,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:57:17,316 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 12:57:17,406 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 12:57:17,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 12:57:17 BasicIcfg [2018-12-09 12:57:17,407 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 12:57:17,408 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 12:57:17,408 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 12:57:17,408 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 12:57:17,408 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:56:51" (3/4) ... [2018-12-09 12:57:17,410 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 12:57:17,505 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_98b51391-6c0d-400f-b4b5-bcce3f75ea99/bin-2019/uautomizer/witness.graphml [2018-12-09 12:57:17,505 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 12:57:17,506 INFO L168 Benchmark]: Toolchain (without parser) took 27096.69 ms. Allocated memory was 1.0 GB in the beginning and 4.2 GB in the end (delta: 3.2 GB). Free memory was 951.8 MB in the beginning and 2.7 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2018-12-09 12:57:17,507 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 12:57:17,507 INFO L168 Benchmark]: CACSL2BoogieTranslator took 318.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 89.7 MB). Free memory was 951.8 MB in the beginning and 1.1 GB in the end (delta: -115.8 MB). Peak memory consumption was 35.1 MB. Max. memory is 11.5 GB. [2018-12-09 12:57:17,507 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 12:57:17,507 INFO L168 Benchmark]: Boogie Preprocessor took 19.45 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 12:57:17,507 INFO L168 Benchmark]: RCFGBuilder took 323.52 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 51.5 MB). Peak memory consumption was 51.5 MB. Max. memory is 11.5 GB. [2018-12-09 12:57:17,508 INFO L168 Benchmark]: TraceAbstraction took 26304.22 ms. Allocated memory was 1.1 GB in the beginning and 4.2 GB in the end (delta: 3.1 GB). Free memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-12-09 12:57:17,508 INFO L168 Benchmark]: Witness Printer took 97.94 ms. Allocated memory is still 4.2 GB. Free memory was 2.7 GB in the beginning and 2.7 GB in the end (delta: 61.0 MB). Peak memory consumption was 61.0 MB. Max. memory is 11.5 GB. [2018-12-09 12:57:17,509 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 979.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 318.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 89.7 MB). Free memory was 951.8 MB in the beginning and 1.1 GB in the end (delta: -115.8 MB). Peak memory consumption was 35.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.45 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 323.52 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 51.5 MB). Peak memory consumption was 51.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26304.22 ms. Allocated memory was 1.1 GB in the beginning and 4.2 GB in the end (delta: 3.1 GB). Free memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 97.94 ms. Allocated memory is still 4.2 GB. Free memory was 2.7 GB in the beginning and 2.7 GB in the end (delta: 61.0 MB). Peak memory consumption was 61.0 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_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L675] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L677] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L678] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L679] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L681] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L683] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L684] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L685] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L686] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L687] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L688] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L689] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L690] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L691] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L692] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L693] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L694] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L695] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L696] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L697] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L698] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L699] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] -1 pthread_t t315; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] FCALL, FORK -1 pthread_create(&t315, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L703] 0 y$w_buff1 = y$w_buff0 [L704] 0 y$w_buff0 = 1 [L705] 0 y$w_buff1_used = y$w_buff0_used [L706] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L777] -1 pthread_t t316; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L708] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L709] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L710] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L711] 0 y$r_buff0_thd1 = (_Bool)1 [L714] 0 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L717] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] FCALL, FORK -1 pthread_create(&t316, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L731] 1 x = 1 [L734] 1 __unbuffered_p1_EAX = x [L737] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L738] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L739] 1 y$flush_delayed = weak$$choice2 [L740] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L742] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L743] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L744] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L745] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L745] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L746] EXPR 1 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L746] 1 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L747] EXPR 1 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] 1 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L748] 1 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L749] 1 y = y$flush_delayed ? y$mem_tmp : y [L750] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L753] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L753] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L753] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L753] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L755] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L755] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L756] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L756] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L757] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L757] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L718] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L718] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L719] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L720] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L720] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L721] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L721] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L724] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L785] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L786] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L786] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L788] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L788] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L791] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 223 locations, 3 error locations. UNSAFE Result, 26.2s OverallTime, 35 OverallIterations, 1 TraceHistogramMax, 11.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9244 SDtfs, 10454 SDslu, 20380 SDs, 0 SdLazy, 8840 SolverSat, 470 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 329 GetRequests, 82 SyntacticMatches, 34 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74881occurred in iteration=6, 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: 10.6s AutomataMinimizationTime, 34 MinimizatonAttempts, 183635 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 2544 NumberOfCodeBlocks, 2544 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2414 ConstructedInterpolants, 0 QuantifiedInterpolants, 591046 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 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...