./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix012_pso.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_a0f4dd36-b5b1-41eb-b62d-4c6f05f47198/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a0f4dd36-b5b1-41eb-b62d-4c6f05f47198/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a0f4dd36-b5b1-41eb-b62d-4c6f05f47198/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a0f4dd36-b5b1-41eb-b62d-4c6f05f47198/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix012_pso.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a0f4dd36-b5b1-41eb-b62d-4c6f05f47198/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a0f4dd36-b5b1-41eb-b62d-4c6f05f47198/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 61ec1444beade6c173560e18fc764e1e87b48a40 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-08 09:43:51,782 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 09:43:51,783 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 09:43:51,789 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 09:43:51,789 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 09:43:51,789 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 09:43:51,790 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 09:43:51,791 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 09:43:51,792 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 09:43:51,792 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 09:43:51,792 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 09:43:51,793 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 09:43:51,793 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 09:43:51,794 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 09:43:51,794 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 09:43:51,794 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 09:43:51,795 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 09:43:51,796 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 09:43:51,797 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 09:43:51,797 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 09:43:51,798 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 09:43:51,798 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 09:43:51,800 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 09:43:51,800 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 09:43:51,800 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 09:43:51,800 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 09:43:51,801 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 09:43:51,801 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 09:43:51,802 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 09:43:51,802 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 09:43:51,802 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 09:43:51,803 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 09:43:51,803 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 09:43:51,803 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 09:43:51,803 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 09:43:51,804 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 09:43:51,804 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a0f4dd36-b5b1-41eb-b62d-4c6f05f47198/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-08 09:43:51,811 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 09:43:51,811 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 09:43:51,812 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 09:43:51,812 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 09:43:51,812 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 09:43:51,812 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 09:43:51,812 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 09:43:51,813 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 09:43:51,813 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 09:43:51,813 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 09:43:51,813 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 09:43:51,813 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 09:43:51,813 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 09:43:51,813 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 09:43:51,813 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 09:43:51,813 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 09:43:51,813 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 09:43:51,813 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 09:43:51,814 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 09:43:51,814 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 09:43:51,814 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 09:43:51,814 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 09:43:51,814 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 09:43:51,814 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 09:43:51,814 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 09:43:51,814 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 09:43:51,814 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 09:43:51,814 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 09:43:51,815 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 09:43:51,815 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 09:43:51,815 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_a0f4dd36-b5b1-41eb-b62d-4c6f05f47198/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 -> 61ec1444beade6c173560e18fc764e1e87b48a40 [2018-12-08 09:43:51,832 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 09:43:51,841 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 09:43:51,844 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 09:43:51,845 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 09:43:51,845 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 09:43:51,846 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a0f4dd36-b5b1-41eb-b62d-4c6f05f47198/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix012_pso.oepc_false-unreach-call.i [2018-12-08 09:43:51,890 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a0f4dd36-b5b1-41eb-b62d-4c6f05f47198/bin-2019/uautomizer/data/534d71239/0c86e69c6ff54b0d906022e0ac31c1bb/FLAGb74945a99 [2018-12-08 09:43:52,307 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 09:43:52,308 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a0f4dd36-b5b1-41eb-b62d-4c6f05f47198/sv-benchmarks/c/pthread-wmm/mix012_pso.oepc_false-unreach-call.i [2018-12-08 09:43:52,315 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a0f4dd36-b5b1-41eb-b62d-4c6f05f47198/bin-2019/uautomizer/data/534d71239/0c86e69c6ff54b0d906022e0ac31c1bb/FLAGb74945a99 [2018-12-08 09:43:52,323 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a0f4dd36-b5b1-41eb-b62d-4c6f05f47198/bin-2019/uautomizer/data/534d71239/0c86e69c6ff54b0d906022e0ac31c1bb [2018-12-08 09:43:52,325 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 09:43:52,325 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 09:43:52,326 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 09:43:52,326 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 09:43:52,328 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 09:43:52,329 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 09:43:52" (1/1) ... [2018-12-08 09:43:52,330 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab2707f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:43:52, skipping insertion in model container [2018-12-08 09:43:52,330 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 09:43:52" (1/1) ... [2018-12-08 09:43:52,334 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 09:43:52,356 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 09:43:52,530 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 09:43:52,537 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 09:43:52,608 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 09:43:52,637 INFO L195 MainTranslator]: Completed translation [2018-12-08 09:43:52,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:43:52 WrapperNode [2018-12-08 09:43:52,637 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 09:43:52,638 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 09:43:52,638 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 09:43:52,638 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 09:43:52,643 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:43:52" (1/1) ... [2018-12-08 09:43:52,653 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:43:52" (1/1) ... [2018-12-08 09:43:52,669 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 09:43:52,669 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 09:43:52,669 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 09:43:52,669 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 09:43:52,675 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:43:52" (1/1) ... [2018-12-08 09:43:52,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:43:52" (1/1) ... [2018-12-08 09:43:52,677 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:43:52" (1/1) ... [2018-12-08 09:43:52,677 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:43:52" (1/1) ... [2018-12-08 09:43:52,682 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:43:52" (1/1) ... [2018-12-08 09:43:52,684 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:43:52" (1/1) ... [2018-12-08 09:43:52,686 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:43:52" (1/1) ... [2018-12-08 09:43:52,688 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 09:43:52,688 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 09:43:52,688 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 09:43:52,688 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 09:43:52,689 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:43:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a0f4dd36-b5b1-41eb-b62d-4c6f05f47198/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-08 09:43:52,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 09:43:52,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 09:43:52,720 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-08 09:43:52,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 09:43:52,720 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-08 09:43:52,720 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-08 09:43:52,720 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-08 09:43:52,720 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-08 09:43:52,720 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-08 09:43:52,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 09:43:52,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 09:43:52,721 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-08 09:43:53,035 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 09:43:53,035 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-08 09:43:53,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 09:43:53 BoogieIcfgContainer [2018-12-08 09:43:53,036 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 09:43:53,036 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 09:43:53,037 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 09:43:53,039 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 09:43:53,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 09:43:52" (1/3) ... [2018-12-08 09:43:53,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd0e5ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 09:43:53, skipping insertion in model container [2018-12-08 09:43:53,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:43:52" (2/3) ... [2018-12-08 09:43:53,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd0e5ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 09:43:53, skipping insertion in model container [2018-12-08 09:43:53,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 09:43:53" (3/3) ... [2018-12-08 09:43:53,041 INFO L112 eAbstractionObserver]: Analyzing ICFG mix012_pso.oepc_false-unreach-call.i [2018-12-08 09:43:53,067 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,067 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,067 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,067 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,067 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,067 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,067 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,068 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,068 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,068 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,068 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,068 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,068 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,069 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,069 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,069 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,069 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,069 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,069 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,070 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,070 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,070 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,070 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,070 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,070 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,070 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,070 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,071 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,071 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,071 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,071 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,071 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,071 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,071 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,071 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,072 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,072 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,072 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,073 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,073 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,073 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,073 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,073 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,073 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,073 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,073 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,074 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,074 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,074 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,074 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,074 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,074 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,074 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,075 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,075 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,075 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,075 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,075 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,075 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,075 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,075 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,075 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,075 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,076 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,076 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,076 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,076 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,076 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,076 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,076 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,077 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,077 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,077 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,077 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,077 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,077 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,077 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,077 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,077 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,078 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,078 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,078 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,078 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,078 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,078 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,078 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,078 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,078 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,078 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,079 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,079 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,079 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,079 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,079 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,079 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,079 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,079 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,080 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,080 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,080 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,080 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,080 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,080 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,080 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,080 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,080 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,081 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,081 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,081 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,081 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,081 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,081 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,081 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,082 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,082 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,082 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,082 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,082 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,082 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,085 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,085 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,085 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,085 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,085 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,085 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,085 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,085 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,085 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,087 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,087 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:43:53,090 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-08 09:43:53,090 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 09:43:53,096 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-08 09:43:53,106 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-08 09:43:53,120 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 09:43:53,120 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 09:43:53,121 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 09:43:53,121 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 09:43:53,121 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 09:43:53,121 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 09:43:53,121 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 09:43:53,121 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 09:43:53,121 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 09:43:53,127 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2018-12-08 09:43:54,497 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34807 states. [2018-12-08 09:43:54,498 INFO L276 IsEmpty]: Start isEmpty. Operand 34807 states. [2018-12-08 09:43:54,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-08 09:43:54,502 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:43:54,503 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-08 09:43:54,504 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:43:54,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:43:54,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1782476305, now seen corresponding path program 1 times [2018-12-08 09:43:54,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:43:54,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:43:54,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:43:54,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:43:54,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:43:54,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:43:54,653 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-08 09:43:54,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:43:54,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 09:43:54,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 09:43:54,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 09:43:54,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 09:43:54,667 INFO L87 Difference]: Start difference. First operand 34807 states. Second operand 4 states. [2018-12-08 09:43:55,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:43:55,136 INFO L93 Difference]: Finished difference Result 60791 states and 234494 transitions. [2018-12-08 09:43:55,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 09:43:55,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-12-08 09:43:55,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:43:55,288 INFO L225 Difference]: With dead ends: 60791 [2018-12-08 09:43:55,288 INFO L226 Difference]: Without dead ends: 44271 [2018-12-08 09:43:55,289 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-08 09:43:55,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44271 states. [2018-12-08 09:43:55,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44271 to 27339. [2018-12-08 09:43:55,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27339 states. [2018-12-08 09:43:56,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27339 states to 27339 states and 105500 transitions. [2018-12-08 09:43:56,012 INFO L78 Accepts]: Start accepts. Automaton has 27339 states and 105500 transitions. Word has length 34 [2018-12-08 09:43:56,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:43:56,013 INFO L480 AbstractCegarLoop]: Abstraction has 27339 states and 105500 transitions. [2018-12-08 09:43:56,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 09:43:56,013 INFO L276 IsEmpty]: Start isEmpty. Operand 27339 states and 105500 transitions. [2018-12-08 09:43:56,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-08 09:43:56,017 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:43:56,017 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:43:56,017 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:43:56,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:43:56,018 INFO L82 PathProgramCache]: Analyzing trace with hash -983112731, now seen corresponding path program 1 times [2018-12-08 09:43:56,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:43:56,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:43:56,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:43:56,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:43:56,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:43:56,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:43:56,066 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-08 09:43:56,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:43:56,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 09:43:56,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 09:43:56,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 09:43:56,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 09:43:56,068 INFO L87 Difference]: Start difference. First operand 27339 states and 105500 transitions. Second operand 5 states. [2018-12-08 09:43:56,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:43:56,688 INFO L93 Difference]: Finished difference Result 64005 states and 235335 transitions. [2018-12-08 09:43:56,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 09:43:56,688 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-08 09:43:56,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:43:56,805 INFO L225 Difference]: With dead ends: 64005 [2018-12-08 09:43:56,805 INFO L226 Difference]: Without dead ends: 63453 [2018-12-08 09:43:56,806 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-08 09:43:56,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63453 states. [2018-12-08 09:43:57,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63453 to 41421. [2018-12-08 09:43:57,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41421 states. [2018-12-08 09:43:57,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41421 states to 41421 states and 152330 transitions. [2018-12-08 09:43:57,592 INFO L78 Accepts]: Start accepts. Automaton has 41421 states and 152330 transitions. Word has length 46 [2018-12-08 09:43:57,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:43:57,593 INFO L480 AbstractCegarLoop]: Abstraction has 41421 states and 152330 transitions. [2018-12-08 09:43:57,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 09:43:57,593 INFO L276 IsEmpty]: Start isEmpty. Operand 41421 states and 152330 transitions. [2018-12-08 09:43:57,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-08 09:43:57,596 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:43:57,597 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-08 09:43:57,597 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:43:57,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:43:57,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1484418599, now seen corresponding path program 1 times [2018-12-08 09:43:57,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:43:57,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:43:57,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:43:57,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:43:57,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:43:57,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:43:57,639 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-08 09:43:57,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:43:57,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 09:43:57,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 09:43:57,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 09:43:57,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 09:43:57,640 INFO L87 Difference]: Start difference. First operand 41421 states and 152330 transitions. Second operand 5 states. [2018-12-08 09:43:58,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:43:58,082 INFO L93 Difference]: Finished difference Result 81367 states and 298048 transitions. [2018-12-08 09:43:58,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 09:43:58,083 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-08 09:43:58,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:43:58,226 INFO L225 Difference]: With dead ends: 81367 [2018-12-08 09:43:58,226 INFO L226 Difference]: Without dead ends: 80855 [2018-12-08 09:43:58,227 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-08 09:43:58,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80855 states. [2018-12-08 09:43:59,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80855 to 45375. [2018-12-08 09:43:59,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45375 states. [2018-12-08 09:43:59,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45375 states to 45375 states and 166018 transitions. [2018-12-08 09:43:59,181 INFO L78 Accepts]: Start accepts. Automaton has 45375 states and 166018 transitions. Word has length 47 [2018-12-08 09:43:59,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:43:59,181 INFO L480 AbstractCegarLoop]: Abstraction has 45375 states and 166018 transitions. [2018-12-08 09:43:59,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 09:43:59,181 INFO L276 IsEmpty]: Start isEmpty. Operand 45375 states and 166018 transitions. [2018-12-08 09:43:59,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-08 09:43:59,186 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:43:59,186 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-08 09:43:59,186 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:43:59,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:43:59,186 INFO L82 PathProgramCache]: Analyzing trace with hash 375052511, now seen corresponding path program 1 times [2018-12-08 09:43:59,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:43:59,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:43:59,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:43:59,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:43:59,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:43:59,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:43:59,210 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-08 09:43:59,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:43:59,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 09:43:59,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 09:43:59,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 09:43:59,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 09:43:59,211 INFO L87 Difference]: Start difference. First operand 45375 states and 166018 transitions. Second operand 3 states. [2018-12-08 09:43:59,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:43:59,435 INFO L93 Difference]: Finished difference Result 65251 states and 235814 transitions. [2018-12-08 09:43:59,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 09:43:59,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-08 09:43:59,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:43:59,668 INFO L225 Difference]: With dead ends: 65251 [2018-12-08 09:43:59,668 INFO L226 Difference]: Without dead ends: 65251 [2018-12-08 09:43:59,668 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-08 09:43:59,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65251 states. [2018-12-08 09:44:00,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65251 to 50945. [2018-12-08 09:44:00,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50945 states. [2018-12-08 09:44:00,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50945 states to 50945 states and 184325 transitions. [2018-12-08 09:44:00,461 INFO L78 Accepts]: Start accepts. Automaton has 50945 states and 184325 transitions. Word has length 49 [2018-12-08 09:44:00,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:44:00,461 INFO L480 AbstractCegarLoop]: Abstraction has 50945 states and 184325 transitions. [2018-12-08 09:44:00,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 09:44:00,461 INFO L276 IsEmpty]: Start isEmpty. Operand 50945 states and 184325 transitions. [2018-12-08 09:44:00,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-08 09:44:00,469 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:44:00,469 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-08 09:44:00,469 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:44:00,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:44:00,469 INFO L82 PathProgramCache]: Analyzing trace with hash -559765890, now seen corresponding path program 1 times [2018-12-08 09:44:00,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:44:00,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:44:00,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:00,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:44:00,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:00,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:44:00,560 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-08 09:44:00,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:44:00,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 09:44:00,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 09:44:00,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 09:44:00,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 09:44:00,561 INFO L87 Difference]: Start difference. First operand 50945 states and 184325 transitions. Second operand 6 states. [2018-12-08 09:44:01,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:44:01,087 INFO L93 Difference]: Finished difference Result 67511 states and 242185 transitions. [2018-12-08 09:44:01,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 09:44:01,087 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-08 09:44:01,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:44:01,213 INFO L225 Difference]: With dead ends: 67511 [2018-12-08 09:44:01,213 INFO L226 Difference]: Without dead ends: 67511 [2018-12-08 09:44:01,213 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-08 09:44:01,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67511 states. [2018-12-08 09:44:02,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67511 to 63436. [2018-12-08 09:44:02,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63436 states. [2018-12-08 09:44:02,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63436 states to 63436 states and 227584 transitions. [2018-12-08 09:44:02,225 INFO L78 Accepts]: Start accepts. Automaton has 63436 states and 227584 transitions. Word has length 53 [2018-12-08 09:44:02,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:44:02,225 INFO L480 AbstractCegarLoop]: Abstraction has 63436 states and 227584 transitions. [2018-12-08 09:44:02,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 09:44:02,225 INFO L276 IsEmpty]: Start isEmpty. Operand 63436 states and 227584 transitions. [2018-12-08 09:44:02,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-08 09:44:02,234 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:44:02,235 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-08 09:44:02,235 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:44:02,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:44:02,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1938250047, now seen corresponding path program 1 times [2018-12-08 09:44:02,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:44:02,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:44:02,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:02,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:44:02,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:02,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:44:02,286 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-08 09:44:02,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:44:02,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 09:44:02,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 09:44:02,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 09:44:02,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 09:44:02,287 INFO L87 Difference]: Start difference. First operand 63436 states and 227584 transitions. Second operand 7 states. [2018-12-08 09:44:03,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:44:03,199 INFO L93 Difference]: Finished difference Result 88528 states and 306201 transitions. [2018-12-08 09:44:03,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 09:44:03,200 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-12-08 09:44:03,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:44:03,336 INFO L225 Difference]: With dead ends: 88528 [2018-12-08 09:44:03,336 INFO L226 Difference]: Without dead ends: 88528 [2018-12-08 09:44:03,336 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-08 09:44:03,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88528 states. [2018-12-08 09:44:04,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88528 to 74881. [2018-12-08 09:44:04,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74881 states. [2018-12-08 09:44:04,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74881 states to 74881 states and 262987 transitions. [2018-12-08 09:44:04,478 INFO L78 Accepts]: Start accepts. Automaton has 74881 states and 262987 transitions. Word has length 53 [2018-12-08 09:44:04,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:44:04,478 INFO L480 AbstractCegarLoop]: Abstraction has 74881 states and 262987 transitions. [2018-12-08 09:44:04,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 09:44:04,478 INFO L276 IsEmpty]: Start isEmpty. Operand 74881 states and 262987 transitions. [2018-12-08 09:44:04,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-08 09:44:04,487 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:44:04,487 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-08 09:44:04,487 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:44:04,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:44:04,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1469213568, now seen corresponding path program 1 times [2018-12-08 09:44:04,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:44:04,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:44:04,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:04,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:44:04,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:04,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:44:04,514 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-08 09:44:04,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:44:04,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 09:44:04,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 09:44:04,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 09:44:04,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 09:44:04,515 INFO L87 Difference]: Start difference. First operand 74881 states and 262987 transitions. Second operand 3 states. [2018-12-08 09:44:04,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:44:04,708 INFO L93 Difference]: Finished difference Result 57182 states and 199435 transitions. [2018-12-08 09:44:04,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 09:44:04,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2018-12-08 09:44:04,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:44:04,808 INFO L225 Difference]: With dead ends: 57182 [2018-12-08 09:44:04,808 INFO L226 Difference]: Without dead ends: 57182 [2018-12-08 09:44:04,809 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-08 09:44:05,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57182 states. [2018-12-08 09:44:05,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57182 to 56447. [2018-12-08 09:44:05,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56447 states. [2018-12-08 09:44:05,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56447 states to 56447 states and 197181 transitions. [2018-12-08 09:44:05,764 INFO L78 Accepts]: Start accepts. Automaton has 56447 states and 197181 transitions. Word has length 53 [2018-12-08 09:44:05,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:44:05,764 INFO L480 AbstractCegarLoop]: Abstraction has 56447 states and 197181 transitions. [2018-12-08 09:44:05,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 09:44:05,764 INFO L276 IsEmpty]: Start isEmpty. Operand 56447 states and 197181 transitions. [2018-12-08 09:44:05,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-08 09:44:05,771 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:44:05,771 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-08 09:44:05,771 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:44:05,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:44:05,772 INFO L82 PathProgramCache]: Analyzing trace with hash -211879190, now seen corresponding path program 1 times [2018-12-08 09:44:05,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:44:05,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:44:05,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:05,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:44:05,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:05,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:44:05,824 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-08 09:44:05,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:44:05,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 09:44:05,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 09:44:05,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 09:44:05,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 09:44:05,825 INFO L87 Difference]: Start difference. First operand 56447 states and 197181 transitions. Second operand 6 states. [2018-12-08 09:44:06,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:44:06,352 INFO L93 Difference]: Finished difference Result 97908 states and 340995 transitions. [2018-12-08 09:44:06,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 09:44:06,353 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-08 09:44:06,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:44:06,517 INFO L225 Difference]: With dead ends: 97908 [2018-12-08 09:44:06,517 INFO L226 Difference]: Without dead ends: 97332 [2018-12-08 09:44:06,517 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-08 09:44:06,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97332 states. [2018-12-08 09:44:07,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97332 to 56676. [2018-12-08 09:44:07,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56676 states. [2018-12-08 09:44:07,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56676 states to 56676 states and 198353 transitions. [2018-12-08 09:44:07,785 INFO L78 Accepts]: Start accepts. Automaton has 56676 states and 198353 transitions. Word has length 53 [2018-12-08 09:44:07,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:44:07,785 INFO L480 AbstractCegarLoop]: Abstraction has 56676 states and 198353 transitions. [2018-12-08 09:44:07,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 09:44:07,785 INFO L276 IsEmpty]: Start isEmpty. Operand 56676 states and 198353 transitions. [2018-12-08 09:44:07,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-08 09:44:07,792 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:44:07,792 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:44:07,792 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:44:07,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:44:07,792 INFO L82 PathProgramCache]: Analyzing trace with hash 2074481868, now seen corresponding path program 1 times [2018-12-08 09:44:07,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:44:07,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:44:07,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:07,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:44:07,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:07,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:44:07,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-08 09:44:07,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:44:07,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 09:44:07,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 09:44:07,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 09:44:07,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 09:44:07,826 INFO L87 Difference]: Start difference. First operand 56676 states and 198353 transitions. Second operand 4 states. [2018-12-08 09:44:07,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:44:07,866 INFO L93 Difference]: Finished difference Result 12705 states and 39586 transitions. [2018-12-08 09:44:07,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 09:44:07,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-12-08 09:44:07,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:44:07,878 INFO L225 Difference]: With dead ends: 12705 [2018-12-08 09:44:07,878 INFO L226 Difference]: Without dead ends: 10887 [2018-12-08 09:44:07,879 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-08 09:44:07,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10887 states. [2018-12-08 09:44:07,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10887 to 10839. [2018-12-08 09:44:07,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10839 states. [2018-12-08 09:44:07,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10839 states to 10839 states and 33402 transitions. [2018-12-08 09:44:07,987 INFO L78 Accepts]: Start accepts. Automaton has 10839 states and 33402 transitions. Word has length 54 [2018-12-08 09:44:07,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:44:07,987 INFO L480 AbstractCegarLoop]: Abstraction has 10839 states and 33402 transitions. [2018-12-08 09:44:07,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 09:44:07,987 INFO L276 IsEmpty]: Start isEmpty. Operand 10839 states and 33402 transitions. [2018-12-08 09:44:07,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-08 09:44:07,990 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:44: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-08 09:44:07,990 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:44:07,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:44:07,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1760614074, now seen corresponding path program 1 times [2018-12-08 09:44:07,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:44:07,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:44:07,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:07,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:44:07,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:07,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:44:08,028 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-08 09:44:08,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:44:08,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 09:44:08,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 09:44:08,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 09:44:08,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 09:44:08,029 INFO L87 Difference]: Start difference. First operand 10839 states and 33402 transitions. Second operand 4 states. [2018-12-08 09:44:08,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:44:08,100 INFO L93 Difference]: Finished difference Result 12386 states and 38231 transitions. [2018-12-08 09:44:08,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 09:44:08,100 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-12-08 09:44:08,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:44:08,113 INFO L225 Difference]: With dead ends: 12386 [2018-12-08 09:44:08,113 INFO L226 Difference]: Without dead ends: 12386 [2018-12-08 09:44:08,113 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-08 09:44:08,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12386 states. [2018-12-08 09:44:08,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12386 to 11359. [2018-12-08 09:44:08,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11359 states. [2018-12-08 09:44:08,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11359 states to 11359 states and 35015 transitions. [2018-12-08 09:44:08,228 INFO L78 Accepts]: Start accepts. Automaton has 11359 states and 35015 transitions. Word has length 61 [2018-12-08 09:44:08,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:44:08,228 INFO L480 AbstractCegarLoop]: Abstraction has 11359 states and 35015 transitions. [2018-12-08 09:44:08,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 09:44:08,228 INFO L276 IsEmpty]: Start isEmpty. Operand 11359 states and 35015 transitions. [2018-12-08 09:44:08,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-08 09:44:08,230 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:44:08,230 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-08 09:44:08,230 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:44:08,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:44:08,231 INFO L82 PathProgramCache]: Analyzing trace with hash -17803739, now seen corresponding path program 1 times [2018-12-08 09:44:08,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:44:08,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:44:08,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:08,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:44:08,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:08,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:44:08,271 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-08 09:44:08,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:44:08,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 09:44:08,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 09:44:08,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 09:44:08,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 09:44:08,272 INFO L87 Difference]: Start difference. First operand 11359 states and 35015 transitions. Second operand 6 states. [2018-12-08 09:44:08,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:44:08,520 INFO L93 Difference]: Finished difference Result 20935 states and 64448 transitions. [2018-12-08 09:44:08,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 09:44:08,520 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-12-08 09:44:08,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:44:08,542 INFO L225 Difference]: With dead ends: 20935 [2018-12-08 09:44:08,542 INFO L226 Difference]: Without dead ends: 20864 [2018-12-08 09:44:08,543 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-08 09:44:08,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20864 states. [2018-12-08 09:44:08,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20864 to 13298. [2018-12-08 09:44:08,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13298 states. [2018-12-08 09:44:08,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13298 states to 13298 states and 40712 transitions. [2018-12-08 09:44:08,718 INFO L78 Accepts]: Start accepts. Automaton has 13298 states and 40712 transitions. Word has length 61 [2018-12-08 09:44:08,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:44:08,718 INFO L480 AbstractCegarLoop]: Abstraction has 13298 states and 40712 transitions. [2018-12-08 09:44:08,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 09:44:08,718 INFO L276 IsEmpty]: Start isEmpty. Operand 13298 states and 40712 transitions. [2018-12-08 09:44:08,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-08 09:44:08,722 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:44:08,723 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-08 09:44:08,723 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:44:08,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:44:08,723 INFO L82 PathProgramCache]: Analyzing trace with hash 859851853, now seen corresponding path program 1 times [2018-12-08 09:44:08,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:44:08,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:44:08,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:08,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:44:08,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:08,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:44:08,748 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-08 09:44:08,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:44:08,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 09:44:08,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 09:44:08,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 09:44:08,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 09:44:08,749 INFO L87 Difference]: Start difference. First operand 13298 states and 40712 transitions. Second operand 3 states. [2018-12-08 09:44:08,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:44:08,867 INFO L93 Difference]: Finished difference Result 13930 states and 42364 transitions. [2018-12-08 09:44:08,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 09:44:08,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-08 09:44:08,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:44:08,882 INFO L225 Difference]: With dead ends: 13930 [2018-12-08 09:44:08,882 INFO L226 Difference]: Without dead ends: 13930 [2018-12-08 09:44:08,882 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-08 09:44:08,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13930 states. [2018-12-08 09:44:08,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13930 to 13614. [2018-12-08 09:44:08,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13614 states. [2018-12-08 09:44:09,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13614 states to 13614 states and 41538 transitions. [2018-12-08 09:44:09,018 INFO L78 Accepts]: Start accepts. Automaton has 13614 states and 41538 transitions. Word has length 67 [2018-12-08 09:44:09,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:44:09,018 INFO L480 AbstractCegarLoop]: Abstraction has 13614 states and 41538 transitions. [2018-12-08 09:44:09,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 09:44:09,019 INFO L276 IsEmpty]: Start isEmpty. Operand 13614 states and 41538 transitions. [2018-12-08 09:44:09,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-08 09:44:09,023 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:44:09,023 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-08 09:44:09,023 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:44:09,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:44:09,023 INFO L82 PathProgramCache]: Analyzing trace with hash -101762164, now seen corresponding path program 1 times [2018-12-08 09:44:09,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:44:09,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:44:09,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:09,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:44:09,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:09,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:44:09,062 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-08 09:44:09,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:44:09,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 09:44:09,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 09:44:09,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 09:44:09,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 09:44:09,063 INFO L87 Difference]: Start difference. First operand 13614 states and 41538 transitions. Second operand 4 states. [2018-12-08 09:44:09,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:44:09,219 INFO L93 Difference]: Finished difference Result 17463 states and 52743 transitions. [2018-12-08 09:44:09,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 09:44:09,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-08 09:44:09,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:44:09,237 INFO L225 Difference]: With dead ends: 17463 [2018-12-08 09:44:09,237 INFO L226 Difference]: Without dead ends: 17463 [2018-12-08 09:44:09,237 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-08 09:44:09,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17463 states. [2018-12-08 09:44:09,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17463 to 15244. [2018-12-08 09:44:09,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15244 states. [2018-12-08 09:44:09,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15244 states to 15244 states and 46198 transitions. [2018-12-08 09:44:09,388 INFO L78 Accepts]: Start accepts. Automaton has 15244 states and 46198 transitions. Word has length 67 [2018-12-08 09:44:09,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:44:09,389 INFO L480 AbstractCegarLoop]: Abstraction has 15244 states and 46198 transitions. [2018-12-08 09:44:09,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 09:44:09,389 INFO L276 IsEmpty]: Start isEmpty. Operand 15244 states and 46198 transitions. [2018-12-08 09:44:09,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-08 09:44:09,393 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:44:09,393 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-08 09:44:09,393 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:44:09,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:44:09,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1143002317, now seen corresponding path program 1 times [2018-12-08 09:44:09,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:44:09,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:44:09,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:09,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:44:09,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:09,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:44:09,449 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-08 09:44:09,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:44:09,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 09:44:09,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 09:44:09,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 09:44:09,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-08 09:44:09,450 INFO L87 Difference]: Start difference. First operand 15244 states and 46198 transitions. Second operand 6 states. [2018-12-08 09:44:09,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:44:09,919 INFO L93 Difference]: Finished difference Result 18862 states and 56126 transitions. [2018-12-08 09:44:09,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 09:44:09,919 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-08 09:44:09,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:44:09,938 INFO L225 Difference]: With dead ends: 18862 [2018-12-08 09:44:09,938 INFO L226 Difference]: Without dead ends: 18862 [2018-12-08 09:44:09,938 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-08 09:44:09,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18862 states. [2018-12-08 09:44:10,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18862 to 17720. [2018-12-08 09:44:10,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17720 states. [2018-12-08 09:44:10,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17720 states to 17720 states and 53178 transitions. [2018-12-08 09:44:10,115 INFO L78 Accepts]: Start accepts. Automaton has 17720 states and 53178 transitions. Word has length 67 [2018-12-08 09:44:10,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:44:10,116 INFO L480 AbstractCegarLoop]: Abstraction has 17720 states and 53178 transitions. [2018-12-08 09:44:10,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 09:44:10,116 INFO L276 IsEmpty]: Start isEmpty. Operand 17720 states and 53178 transitions. [2018-12-08 09:44:10,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-08 09:44:10,122 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:44:10,122 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-08 09:44:10,122 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:44:10,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:44:10,122 INFO L82 PathProgramCache]: Analyzing trace with hash -934207026, now seen corresponding path program 1 times [2018-12-08 09:44:10,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:44:10,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:44:10,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:10,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:44:10,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:44:10,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:44:10,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:44:10,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 09:44:10,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 09:44:10,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 09:44:10,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 09:44:10,183 INFO L87 Difference]: Start difference. First operand 17720 states and 53178 transitions. Second operand 6 states. [2018-12-08 09:44:10,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:44:10,446 INFO L93 Difference]: Finished difference Result 20389 states and 59240 transitions. [2018-12-08 09:44:10,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 09:44:10,446 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-08 09:44:10,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:44:10,466 INFO L225 Difference]: With dead ends: 20389 [2018-12-08 09:44:10,466 INFO L226 Difference]: Without dead ends: 20389 [2018-12-08 09:44:10,466 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-08 09:44:10,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20389 states. [2018-12-08 09:44:10,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20389 to 18002. [2018-12-08 09:44:10,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18002 states. [2018-12-08 09:44:10,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18002 states to 18002 states and 53189 transitions. [2018-12-08 09:44:10,660 INFO L78 Accepts]: Start accepts. Automaton has 18002 states and 53189 transitions. Word has length 67 [2018-12-08 09:44:10,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:44:10,660 INFO L480 AbstractCegarLoop]: Abstraction has 18002 states and 53189 transitions. [2018-12-08 09:44:10,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 09:44:10,660 INFO L276 IsEmpty]: Start isEmpty. Operand 18002 states and 53189 transitions. [2018-12-08 09:44:10,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-08 09:44:10,668 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:44:10,668 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-08 09:44:10,668 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:44:10,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:44:10,669 INFO L82 PathProgramCache]: Analyzing trace with hash -722856113, now seen corresponding path program 1 times [2018-12-08 09:44:10,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:44:10,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:44:10,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:10,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:44:10,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:10,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:44:10,723 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-08 09:44:10,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:44:10,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 09:44:10,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 09:44:10,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 09:44:10,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 09:44:10,724 INFO L87 Difference]: Start difference. First operand 18002 states and 53189 transitions. Second operand 5 states. [2018-12-08 09:44:10,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:44:10,943 INFO L93 Difference]: Finished difference Result 23413 states and 68682 transitions. [2018-12-08 09:44:10,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 09:44:10,944 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-08 09:44:10,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:44:10,966 INFO L225 Difference]: With dead ends: 23413 [2018-12-08 09:44:10,966 INFO L226 Difference]: Without dead ends: 23413 [2018-12-08 09:44:10,967 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-08 09:44:10,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23413 states. [2018-12-08 09:44:11,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23413 to 21350. [2018-12-08 09:44:11,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21350 states. [2018-12-08 09:44:11,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21350 states to 21350 states and 62593 transitions. [2018-12-08 09:44:11,204 INFO L78 Accepts]: Start accepts. Automaton has 21350 states and 62593 transitions. Word has length 67 [2018-12-08 09:44:11,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:44:11,204 INFO L480 AbstractCegarLoop]: Abstraction has 21350 states and 62593 transitions. [2018-12-08 09:44:11,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 09:44:11,204 INFO L276 IsEmpty]: Start isEmpty. Operand 21350 states and 62593 transitions. [2018-12-08 09:44:11,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-08 09:44:11,211 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:44:11,211 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-08 09:44:11,211 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:44:11,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:44:11,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1233390290, now seen corresponding path program 1 times [2018-12-08 09:44:11,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:44:11,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:44:11,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:11,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:44:11,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:11,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:44:11,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-08 09:44:11,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:44:11,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 09:44:11,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 09:44:11,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 09:44:11,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 09:44:11,257 INFO L87 Difference]: Start difference. First operand 21350 states and 62593 transitions. Second operand 4 states. [2018-12-08 09:44:11,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:44:11,569 INFO L93 Difference]: Finished difference Result 26758 states and 78553 transitions. [2018-12-08 09:44:11,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 09:44:11,570 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-08 09:44:11,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:44:11,598 INFO L225 Difference]: With dead ends: 26758 [2018-12-08 09:44:11,598 INFO L226 Difference]: Without dead ends: 26462 [2018-12-08 09:44:11,598 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-08 09:44:11,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26462 states. [2018-12-08 09:44:11,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26462 to 25142. [2018-12-08 09:44:11,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25142 states. [2018-12-08 09:44:11,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25142 states to 25142 states and 73709 transitions. [2018-12-08 09:44:11,869 INFO L78 Accepts]: Start accepts. Automaton has 25142 states and 73709 transitions. Word has length 67 [2018-12-08 09:44:11,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:44:11,869 INFO L480 AbstractCegarLoop]: Abstraction has 25142 states and 73709 transitions. [2018-12-08 09:44:11,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 09:44:11,869 INFO L276 IsEmpty]: Start isEmpty. Operand 25142 states and 73709 transitions. [2018-12-08 09:44:11,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-08 09:44:11,876 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:44:11,876 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-08 09:44:11,876 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:44:11,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:44:11,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1264625647, now seen corresponding path program 1 times [2018-12-08 09:44:11,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:44:11,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:44:11,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:11,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:44:11,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:11,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:44:11,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:44:11,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:44:11,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 09:44:11,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 09:44:11,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 09:44:11,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-08 09:44:11,948 INFO L87 Difference]: Start difference. First operand 25142 states and 73709 transitions. Second operand 7 states. [2018-12-08 09:44:12,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:44:12,266 INFO L93 Difference]: Finished difference Result 29924 states and 85982 transitions. [2018-12-08 09:44:12,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 09:44:12,267 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2018-12-08 09:44:12,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:44:12,297 INFO L225 Difference]: With dead ends: 29924 [2018-12-08 09:44:12,297 INFO L226 Difference]: Without dead ends: 29924 [2018-12-08 09:44:12,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-12-08 09:44:12,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29924 states. [2018-12-08 09:44:12,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29924 to 24925. [2018-12-08 09:44:12,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24925 states. [2018-12-08 09:44:12,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24925 states to 24925 states and 71597 transitions. [2018-12-08 09:44:12,573 INFO L78 Accepts]: Start accepts. Automaton has 24925 states and 71597 transitions. Word has length 67 [2018-12-08 09:44:12,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:44:12,573 INFO L480 AbstractCegarLoop]: Abstraction has 24925 states and 71597 transitions. [2018-12-08 09:44:12,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 09:44:12,573 INFO L276 IsEmpty]: Start isEmpty. Operand 24925 states and 71597 transitions. [2018-12-08 09:44:12,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-08 09:44:12,579 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:44:12,579 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:44:12,580 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:44:12,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:44:12,580 INFO L82 PathProgramCache]: Analyzing trace with hash -2142837968, now seen corresponding path program 1 times [2018-12-08 09:44:12,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:44:12,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:44:12,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:12,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:44:12,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:12,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:44:12,611 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-08 09:44:12,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:44:12,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 09:44:12,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 09:44:12,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 09:44:12,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 09:44:12,612 INFO L87 Difference]: Start difference. First operand 24925 states and 71597 transitions. Second operand 5 states. [2018-12-08 09:44:12,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:44:12,639 INFO L93 Difference]: Finished difference Result 7461 states and 17979 transitions. [2018-12-08 09:44:12,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 09:44:12,639 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-08 09:44:12,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:44:12,643 INFO L225 Difference]: With dead ends: 7461 [2018-12-08 09:44:12,643 INFO L226 Difference]: Without dead ends: 6136 [2018-12-08 09:44:12,644 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-08 09:44:12,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6136 states. [2018-12-08 09:44:12,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6136 to 5530. [2018-12-08 09:44:12,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5530 states. [2018-12-08 09:44:12,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5530 states to 5530 states and 12868 transitions. [2018-12-08 09:44:12,682 INFO L78 Accepts]: Start accepts. Automaton has 5530 states and 12868 transitions. Word has length 67 [2018-12-08 09:44:12,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:44:12,682 INFO L480 AbstractCegarLoop]: Abstraction has 5530 states and 12868 transitions. [2018-12-08 09:44:12,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 09:44:12,682 INFO L276 IsEmpty]: Start isEmpty. Operand 5530 states and 12868 transitions. [2018-12-08 09:44:12,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-08 09:44:12,685 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:44:12,685 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-08 09:44:12,685 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:44:12,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:44:12,686 INFO L82 PathProgramCache]: Analyzing trace with hash 288361846, now seen corresponding path program 1 times [2018-12-08 09:44:12,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:44:12,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:44:12,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:12,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:44:12,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:12,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:44:12,707 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-08 09:44:12,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:44:12,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 09:44:12,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 09:44:12,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 09:44:12,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 09:44:12,708 INFO L87 Difference]: Start difference. First operand 5530 states and 12868 transitions. Second operand 3 states. [2018-12-08 09:44:12,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:44:12,730 INFO L93 Difference]: Finished difference Result 7166 states and 16474 transitions. [2018-12-08 09:44:12,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 09:44:12,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-08 09:44:12,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:44:12,737 INFO L225 Difference]: With dead ends: 7166 [2018-12-08 09:44:12,737 INFO L226 Difference]: Without dead ends: 7166 [2018-12-08 09:44:12,737 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-08 09:44:12,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7166 states. [2018-12-08 09:44:12,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7166 to 5469. [2018-12-08 09:44:12,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5469 states. [2018-12-08 09:44:12,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5469 states to 5469 states and 12408 transitions. [2018-12-08 09:44:12,783 INFO L78 Accepts]: Start accepts. Automaton has 5469 states and 12408 transitions. Word has length 67 [2018-12-08 09:44:12,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:44:12,783 INFO L480 AbstractCegarLoop]: Abstraction has 5469 states and 12408 transitions. [2018-12-08 09:44:12,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 09:44:12,783 INFO L276 IsEmpty]: Start isEmpty. Operand 5469 states and 12408 transitions. [2018-12-08 09:44:12,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-08 09:44:12,786 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:44:12,787 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-08 09:44:12,787 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:44:12,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:44:12,787 INFO L82 PathProgramCache]: Analyzing trace with hash -211461463, now seen corresponding path program 1 times [2018-12-08 09:44:12,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:44:12,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:44:12,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:12,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:44:12,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:12,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:44:12,824 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-08 09:44:12,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:44:12,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 09:44:12,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 09:44:12,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 09:44:12,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 09:44:12,825 INFO L87 Difference]: Start difference. First operand 5469 states and 12408 transitions. Second operand 5 states. [2018-12-08 09:44:12,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:44:12,925 INFO L93 Difference]: Finished difference Result 6623 states and 15013 transitions. [2018-12-08 09:44:12,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 09:44:12,926 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-12-08 09:44:12,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:44:12,930 INFO L225 Difference]: With dead ends: 6623 [2018-12-08 09:44:12,930 INFO L226 Difference]: Without dead ends: 6623 [2018-12-08 09:44:12,930 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-08 09:44:12,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6623 states. [2018-12-08 09:44:12,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6623 to 5913. [2018-12-08 09:44:12,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5913 states. [2018-12-08 09:44:12,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5913 states to 5913 states and 13412 transitions. [2018-12-08 09:44:12,970 INFO L78 Accepts]: Start accepts. Automaton has 5913 states and 13412 transitions. Word has length 73 [2018-12-08 09:44:12,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:44:12,970 INFO L480 AbstractCegarLoop]: Abstraction has 5913 states and 13412 transitions. [2018-12-08 09:44:12,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 09:44:12,970 INFO L276 IsEmpty]: Start isEmpty. Operand 5913 states and 13412 transitions. [2018-12-08 09:44:12,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-08 09:44:12,974 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:44:12,974 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-08 09:44:12,974 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:44:12,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:44:12,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1531348872, now seen corresponding path program 1 times [2018-12-08 09:44:12,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:44:12,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:44:12,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:12,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:44:12,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:12,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:44:13,031 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-08 09:44:13,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:44:13,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 09:44:13,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 09:44:13,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 09:44:13,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 09:44:13,031 INFO L87 Difference]: Start difference. First operand 5913 states and 13412 transitions. Second operand 7 states. [2018-12-08 09:44:13,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:44:13,268 INFO L93 Difference]: Finished difference Result 6840 states and 15340 transitions. [2018-12-08 09:44:13,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 09:44:13,269 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2018-12-08 09:44:13,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:44:13,273 INFO L225 Difference]: With dead ends: 6840 [2018-12-08 09:44:13,273 INFO L226 Difference]: Without dead ends: 6738 [2018-12-08 09:44:13,273 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-08 09:44:13,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6738 states. [2018-12-08 09:44:13,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6738 to 6010. [2018-12-08 09:44:13,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6010 states. [2018-12-08 09:44:13,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6010 states to 6010 states and 13505 transitions. [2018-12-08 09:44:13,318 INFO L78 Accepts]: Start accepts. Automaton has 6010 states and 13505 transitions. Word has length 73 [2018-12-08 09:44:13,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:44:13,318 INFO L480 AbstractCegarLoop]: Abstraction has 6010 states and 13505 transitions. [2018-12-08 09:44:13,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 09:44:13,318 INFO L276 IsEmpty]: Start isEmpty. Operand 6010 states and 13505 transitions. [2018-12-08 09:44:13,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-08 09:44:13,322 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:44:13,322 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-08 09:44:13,322 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:44:13,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:44:13,322 INFO L82 PathProgramCache]: Analyzing trace with hash 309466785, now seen corresponding path program 1 times [2018-12-08 09:44:13,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:44:13,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:44:13,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:13,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:44:13,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:13,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:44:13,355 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-08 09:44:13,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:44:13,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 09:44:13,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 09:44:13,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 09:44:13,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 09:44:13,356 INFO L87 Difference]: Start difference. First operand 6010 states and 13505 transitions. Second operand 5 states. [2018-12-08 09:44:13,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:44:13,566 INFO L93 Difference]: Finished difference Result 5566 states and 12374 transitions. [2018-12-08 09:44:13,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 09:44:13,567 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-08 09:44:13,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:44:13,570 INFO L225 Difference]: With dead ends: 5566 [2018-12-08 09:44:13,570 INFO L226 Difference]: Without dead ends: 5566 [2018-12-08 09:44:13,571 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-08 09:44:13,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5566 states. [2018-12-08 09:44:13,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5566 to 5169. [2018-12-08 09:44:13,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5169 states. [2018-12-08 09:44:13,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5169 states to 5169 states and 11472 transitions. [2018-12-08 09:44:13,605 INFO L78 Accepts]: Start accepts. Automaton has 5169 states and 11472 transitions. Word has length 94 [2018-12-08 09:44:13,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:44:13,606 INFO L480 AbstractCegarLoop]: Abstraction has 5169 states and 11472 transitions. [2018-12-08 09:44:13,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 09:44:13,606 INFO L276 IsEmpty]: Start isEmpty. Operand 5169 states and 11472 transitions. [2018-12-08 09:44:13,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-08 09:44:13,609 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:44:13,610 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-08 09:44:13,610 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:44:13,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:44:13,610 INFO L82 PathProgramCache]: Analyzing trace with hash 656110170, now seen corresponding path program 1 times [2018-12-08 09:44:13,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:44:13,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:44:13,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:13,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:44:13,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:13,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:44:13,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-08 09:44:13,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:44:13,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 09:44:13,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 09:44:13,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 09:44:13,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 09:44:13,637 INFO L87 Difference]: Start difference. First operand 5169 states and 11472 transitions. Second operand 4 states. [2018-12-08 09:44:13,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:44:13,699 INFO L93 Difference]: Finished difference Result 6340 states and 14007 transitions. [2018-12-08 09:44:13,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 09:44:13,700 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-08 09:44:13,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:44:13,705 INFO L225 Difference]: With dead ends: 6340 [2018-12-08 09:44:13,706 INFO L226 Difference]: Without dead ends: 6340 [2018-12-08 09:44:13,706 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-08 09:44:13,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6340 states. [2018-12-08 09:44:13,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6340 to 5570. [2018-12-08 09:44:13,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5570 states. [2018-12-08 09:44:13,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5570 states to 5570 states and 12361 transitions. [2018-12-08 09:44:13,757 INFO L78 Accepts]: Start accepts. Automaton has 5570 states and 12361 transitions. Word has length 94 [2018-12-08 09:44:13,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:44:13,758 INFO L480 AbstractCegarLoop]: Abstraction has 5570 states and 12361 transitions. [2018-12-08 09:44:13,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 09:44:13,758 INFO L276 IsEmpty]: Start isEmpty. Operand 5570 states and 12361 transitions. [2018-12-08 09:44:13,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-08 09:44:13,762 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:44:13,762 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-08 09:44:13,762 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:44:13,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:44:13,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1484364217, now seen corresponding path program 1 times [2018-12-08 09:44:13,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:44:13,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:44:13,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:13,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:44:13,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:13,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:44:13,812 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-08 09:44:13,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:44:13,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 09:44:13,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 09:44:13,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 09:44:13,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-08 09:44:13,813 INFO L87 Difference]: Start difference. First operand 5570 states and 12361 transitions. Second operand 7 states. [2018-12-08 09:44:14,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:44:14,429 INFO L93 Difference]: Finished difference Result 9677 states and 21583 transitions. [2018-12-08 09:44:14,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-08 09:44:14,429 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-08 09:44:14,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:44:14,435 INFO L225 Difference]: With dead ends: 9677 [2018-12-08 09:44:14,435 INFO L226 Difference]: Without dead ends: 9577 [2018-12-08 09:44:14,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2018-12-08 09:44:14,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9577 states. [2018-12-08 09:44:14,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9577 to 7352. [2018-12-08 09:44:14,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7352 states. [2018-12-08 09:44:14,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7352 states to 7352 states and 16455 transitions. [2018-12-08 09:44:14,494 INFO L78 Accepts]: Start accepts. Automaton has 7352 states and 16455 transitions. Word has length 96 [2018-12-08 09:44:14,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:44:14,494 INFO L480 AbstractCegarLoop]: Abstraction has 7352 states and 16455 transitions. [2018-12-08 09:44:14,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 09:44:14,494 INFO L276 IsEmpty]: Start isEmpty. Operand 7352 states and 16455 transitions. [2018-12-08 09:44:14,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-08 09:44:14,499 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:44:14,499 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-08 09:44:14,500 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:44:14,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:44:14,500 INFO L82 PathProgramCache]: Analyzing trace with hash 733393736, now seen corresponding path program 1 times [2018-12-08 09:44:14,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:44:14,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:44:14,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:14,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:44:14,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:14,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:44:14,550 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-08 09:44:14,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:44:14,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 09:44:14,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 09:44:14,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 09:44:14,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-08 09:44:14,551 INFO L87 Difference]: Start difference. First operand 7352 states and 16455 transitions. Second operand 6 states. [2018-12-08 09:44:14,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:44:14,660 INFO L93 Difference]: Finished difference Result 6602 states and 14504 transitions. [2018-12-08 09:44:14,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 09:44:14,660 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-08 09:44:14,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:44:14,664 INFO L225 Difference]: With dead ends: 6602 [2018-12-08 09:44:14,664 INFO L226 Difference]: Without dead ends: 6562 [2018-12-08 09:44:14,665 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-08 09:44:14,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6562 states. [2018-12-08 09:44:14,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6562 to 5606. [2018-12-08 09:44:14,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5606 states. [2018-12-08 09:44:14,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5606 states to 5606 states and 12414 transitions. [2018-12-08 09:44:14,707 INFO L78 Accepts]: Start accepts. Automaton has 5606 states and 12414 transitions. Word has length 96 [2018-12-08 09:44:14,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:44:14,707 INFO L480 AbstractCegarLoop]: Abstraction has 5606 states and 12414 transitions. [2018-12-08 09:44:14,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 09:44:14,707 INFO L276 IsEmpty]: Start isEmpty. Operand 5606 states and 12414 transitions. [2018-12-08 09:44:14,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-08 09:44:14,711 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:44:14,711 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-08 09:44:14,711 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:44:14,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:44:14,711 INFO L82 PathProgramCache]: Analyzing trace with hash 606338407, now seen corresponding path program 1 times [2018-12-08 09:44:14,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:44:14,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:44:14,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:14,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:44:14,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:14,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:44:14,760 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-08 09:44:14,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:44:14,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 09:44:14,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 09:44:14,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 09:44:14,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 09:44:14,761 INFO L87 Difference]: Start difference. First operand 5606 states and 12414 transitions. Second operand 5 states. [2018-12-08 09:44:14,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:44:14,925 INFO L93 Difference]: Finished difference Result 6745 states and 14844 transitions. [2018-12-08 09:44:14,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 09:44:14,926 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-08 09:44:14,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:44:14,930 INFO L225 Difference]: With dead ends: 6745 [2018-12-08 09:44:14,930 INFO L226 Difference]: Without dead ends: 6678 [2018-12-08 09:44:14,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-08 09:44:14,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6678 states. [2018-12-08 09:44:14,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6678 to 6224. [2018-12-08 09:44:14,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6224 states. [2018-12-08 09:44:14,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6224 states to 6224 states and 13733 transitions. [2018-12-08 09:44:14,975 INFO L78 Accepts]: Start accepts. Automaton has 6224 states and 13733 transitions. Word has length 96 [2018-12-08 09:44:14,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:44:14,975 INFO L480 AbstractCegarLoop]: Abstraction has 6224 states and 13733 transitions. [2018-12-08 09:44:14,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 09:44:14,975 INFO L276 IsEmpty]: Start isEmpty. Operand 6224 states and 13733 transitions. [2018-12-08 09:44:14,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-08 09:44:14,980 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:44:14,980 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-08 09:44:14,980 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:44:14,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:44:14,980 INFO L82 PathProgramCache]: Analyzing trace with hash 91749576, now seen corresponding path program 1 times [2018-12-08 09:44:14,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:44:14,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:44:14,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:14,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:44:14,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:14,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:44:15,025 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-08 09:44:15,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:44:15,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 09:44:15,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 09:44:15,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 09:44:15,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 09:44:15,026 INFO L87 Difference]: Start difference. First operand 6224 states and 13733 transitions. Second operand 5 states. [2018-12-08 09:44:15,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:44:15,164 INFO L93 Difference]: Finished difference Result 7101 states and 15619 transitions. [2018-12-08 09:44:15,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 09:44:15,164 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-08 09:44:15,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:44:15,169 INFO L225 Difference]: With dead ends: 7101 [2018-12-08 09:44:15,169 INFO L226 Difference]: Without dead ends: 7026 [2018-12-08 09:44:15,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-08 09:44:15,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7026 states. [2018-12-08 09:44:15,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7026 to 5798. [2018-12-08 09:44:15,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5798 states. [2018-12-08 09:44:15,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5798 states to 5798 states and 12867 transitions. [2018-12-08 09:44:15,214 INFO L78 Accepts]: Start accepts. Automaton has 5798 states and 12867 transitions. Word has length 96 [2018-12-08 09:44:15,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:44:15,214 INFO L480 AbstractCegarLoop]: Abstraction has 5798 states and 12867 transitions. [2018-12-08 09:44:15,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 09:44:15,214 INFO L276 IsEmpty]: Start isEmpty. Operand 5798 states and 12867 transitions. [2018-12-08 09:44:15,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-08 09:44:15,218 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:44:15,218 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-08 09:44:15,218 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:44:15,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:44:15,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1970478536, now seen corresponding path program 2 times [2018-12-08 09:44:15,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:44:15,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:44:15,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:15,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:44:15,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:15,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:44:15,299 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-08 09:44:15,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:44:15,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 09:44:15,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 09:44:15,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 09:44:15,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-08 09:44:15,299 INFO L87 Difference]: Start difference. First operand 5798 states and 12867 transitions. Second operand 9 states. [2018-12-08 09:44:15,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:44:15,875 INFO L93 Difference]: Finished difference Result 7378 states and 16207 transitions. [2018-12-08 09:44:15,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 09:44:15,875 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2018-12-08 09:44:15,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:44:15,880 INFO L225 Difference]: With dead ends: 7378 [2018-12-08 09:44:15,880 INFO L226 Difference]: Without dead ends: 7371 [2018-12-08 09:44:15,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-12-08 09:44:15,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7371 states. [2018-12-08 09:44:15,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7371 to 6500. [2018-12-08 09:44:15,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6500 states. [2018-12-08 09:44:15,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6500 states to 6500 states and 14408 transitions. [2018-12-08 09:44:15,930 INFO L78 Accepts]: Start accepts. Automaton has 6500 states and 14408 transitions. Word has length 96 [2018-12-08 09:44:15,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:44:15,931 INFO L480 AbstractCegarLoop]: Abstraction has 6500 states and 14408 transitions. [2018-12-08 09:44:15,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 09:44:15,931 INFO L276 IsEmpty]: Start isEmpty. Operand 6500 states and 14408 transitions. [2018-12-08 09:44:15,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-08 09:44:15,935 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:44:15,935 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-08 09:44:15,935 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:44:15,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:44:15,935 INFO L82 PathProgramCache]: Analyzing trace with hash -2113137847, now seen corresponding path program 1 times [2018-12-08 09:44:15,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:44:15,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:44:15,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:15,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:44:15,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:15,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:44:15,992 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-08 09:44:15,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:44:15,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 09:44:15,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 09:44:15,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 09:44:15,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 09:44:15,993 INFO L87 Difference]: Start difference. First operand 6500 states and 14408 transitions. Second operand 6 states. [2018-12-08 09:44:16,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:44:16,116 INFO L93 Difference]: Finished difference Result 5938 states and 13125 transitions. [2018-12-08 09:44:16,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 09:44:16,116 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-08 09:44:16,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:44:16,119 INFO L225 Difference]: With dead ends: 5938 [2018-12-08 09:44:16,119 INFO L226 Difference]: Without dead ends: 5938 [2018-12-08 09:44:16,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-08 09:44:16,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5938 states. [2018-12-08 09:44:16,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5938 to 5709. [2018-12-08 09:44:16,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5709 states. [2018-12-08 09:44:16,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5709 states to 5709 states and 12651 transitions. [2018-12-08 09:44:16,155 INFO L78 Accepts]: Start accepts. Automaton has 5709 states and 12651 transitions. Word has length 96 [2018-12-08 09:44:16,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:44:16,156 INFO L480 AbstractCegarLoop]: Abstraction has 5709 states and 12651 transitions. [2018-12-08 09:44:16,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 09:44:16,156 INFO L276 IsEmpty]: Start isEmpty. Operand 5709 states and 12651 transitions. [2018-12-08 09:44:16,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-08 09:44:16,159 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:44:16,159 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-08 09:44:16,159 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:44:16,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:44:16,160 INFO L82 PathProgramCache]: Analyzing trace with hash 863626665, now seen corresponding path program 1 times [2018-12-08 09:44:16,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:44:16,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:44:16,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:16,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:44:16,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:16,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:44:16,210 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-08 09:44:16,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:44:16,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 09:44:16,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 09:44:16,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 09:44:16,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 09:44:16,211 INFO L87 Difference]: Start difference. First operand 5709 states and 12651 transitions. Second operand 6 states. [2018-12-08 09:44:16,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:44:16,378 INFO L93 Difference]: Finished difference Result 7105 states and 15741 transitions. [2018-12-08 09:44:16,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 09:44:16,378 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-08 09:44:16,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:44:16,382 INFO L225 Difference]: With dead ends: 7105 [2018-12-08 09:44:16,382 INFO L226 Difference]: Without dead ends: 7105 [2018-12-08 09:44:16,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-08 09:44:16,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7105 states. [2018-12-08 09:44:16,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7105 to 5591. [2018-12-08 09:44:16,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5591 states. [2018-12-08 09:44:16,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5591 states to 5591 states and 12355 transitions. [2018-12-08 09:44:16,424 INFO L78 Accepts]: Start accepts. Automaton has 5591 states and 12355 transitions. Word has length 96 [2018-12-08 09:44:16,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:44:16,424 INFO L480 AbstractCegarLoop]: Abstraction has 5591 states and 12355 transitions. [2018-12-08 09:44:16,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 09:44:16,424 INFO L276 IsEmpty]: Start isEmpty. Operand 5591 states and 12355 transitions. [2018-12-08 09:44:16,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-08 09:44:16,427 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:44:16,427 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-08 09:44:16,427 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:44:16,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:44:16,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1202266551, now seen corresponding path program 1 times [2018-12-08 09:44:16,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:44:16,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:44:16,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:16,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:44:16,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:16,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:44:16,515 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-08 09:44:16,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:44:16,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 09:44:16,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 09:44:16,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 09:44:16,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-08 09:44:16,516 INFO L87 Difference]: Start difference. First operand 5591 states and 12355 transitions. Second operand 8 states. [2018-12-08 09:44:16,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:44:16,700 INFO L93 Difference]: Finished difference Result 6185 states and 13482 transitions. [2018-12-08 09:44:16,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 09:44:16,700 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2018-12-08 09:44:16,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:44:16,704 INFO L225 Difference]: With dead ends: 6185 [2018-12-08 09:44:16,704 INFO L226 Difference]: Without dead ends: 6185 [2018-12-08 09:44:16,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-12-08 09:44:16,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6185 states. [2018-12-08 09:44:16,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6185 to 5396. [2018-12-08 09:44:16,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5396 states. [2018-12-08 09:44:16,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5396 states to 5396 states and 11874 transitions. [2018-12-08 09:44:16,739 INFO L78 Accepts]: Start accepts. Automaton has 5396 states and 11874 transitions. Word has length 96 [2018-12-08 09:44:16,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:44:16,739 INFO L480 AbstractCegarLoop]: Abstraction has 5396 states and 11874 transitions. [2018-12-08 09:44:16,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 09:44:16,739 INFO L276 IsEmpty]: Start isEmpty. Operand 5396 states and 11874 transitions. [2018-12-08 09:44:16,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-08 09:44:16,743 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:44:16,743 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-08 09:44:16,743 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:44:16,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:44:16,743 INFO L82 PathProgramCache]: Analyzing trace with hash -990915638, now seen corresponding path program 1 times [2018-12-08 09:44:16,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:44:16,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:44:16,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:16,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:44:16,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:16,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:44:16,787 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-08 09:44:16,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:44:16,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 09:44:16,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 09:44:16,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 09:44:16,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 09:44:16,788 INFO L87 Difference]: Start difference. First operand 5396 states and 11874 transitions. Second operand 5 states. [2018-12-08 09:44:16,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:44:16,813 INFO L93 Difference]: Finished difference Result 5396 states and 11858 transitions. [2018-12-08 09:44:16,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 09:44:16,814 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-08 09:44:16,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:44:16,817 INFO L225 Difference]: With dead ends: 5396 [2018-12-08 09:44:16,817 INFO L226 Difference]: Without dead ends: 5396 [2018-12-08 09:44:16,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-08 09:44:16,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5396 states. [2018-12-08 09:44:16,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5396 to 5087. [2018-12-08 09:44:16,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5087 states. [2018-12-08 09:44:16,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5087 states to 5087 states and 11126 transitions. [2018-12-08 09:44:16,849 INFO L78 Accepts]: Start accepts. Automaton has 5087 states and 11126 transitions. Word has length 96 [2018-12-08 09:44:16,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:44:16,850 INFO L480 AbstractCegarLoop]: Abstraction has 5087 states and 11126 transitions. [2018-12-08 09:44:16,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 09:44:16,850 INFO L276 IsEmpty]: Start isEmpty. Operand 5087 states and 11126 transitions. [2018-12-08 09:44:16,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-08 09:44:16,853 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:44:16,853 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-08 09:44:16,853 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:44:16,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:44:16,853 INFO L82 PathProgramCache]: Analyzing trace with hash -103411957, now seen corresponding path program 1 times [2018-12-08 09:44:16,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:44:16,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:44:16,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:16,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:44:16,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:16,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:44:16,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:44:16,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:44:16,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-08 09:44:16,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 09:44:16,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 09:44:16,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-08 09:44:16,949 INFO L87 Difference]: Start difference. First operand 5087 states and 11126 transitions. Second operand 11 states. [2018-12-08 09:44:17,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:44:17,850 INFO L93 Difference]: Finished difference Result 9358 states and 20677 transitions. [2018-12-08 09:44:17,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-08 09:44:17,850 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-12-08 09:44:17,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:44:17,859 INFO L225 Difference]: With dead ends: 9358 [2018-12-08 09:44:17,860 INFO L226 Difference]: Without dead ends: 6168 [2018-12-08 09:44:17,860 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-08 09:44:17,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6168 states. [2018-12-08 09:44:17,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6168 to 4843. [2018-12-08 09:44:17,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4843 states. [2018-12-08 09:44:17,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4843 states to 4843 states and 10499 transitions. [2018-12-08 09:44:17,907 INFO L78 Accepts]: Start accepts. Automaton has 4843 states and 10499 transitions. Word has length 96 [2018-12-08 09:44:17,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:44:17,907 INFO L480 AbstractCegarLoop]: Abstraction has 4843 states and 10499 transitions. [2018-12-08 09:44:17,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 09:44:17,907 INFO L276 IsEmpty]: Start isEmpty. Operand 4843 states and 10499 transitions. [2018-12-08 09:44:17,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-08 09:44:17,910 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:44:17,910 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-08 09:44:17,910 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:44:17,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:44:17,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1588342739, now seen corresponding path program 1 times [2018-12-08 09:44:17,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:44:17,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:44:17,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:17,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:44:17,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:17,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:44:18,000 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-08 09:44:18,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:44:18,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 09:44:18,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 09:44:18,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 09:44:18,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-08 09:44:18,000 INFO L87 Difference]: Start difference. First operand 4843 states and 10499 transitions. Second operand 7 states. [2018-12-08 09:44:18,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:44:18,155 INFO L93 Difference]: Finished difference Result 6339 states and 13683 transitions. [2018-12-08 09:44:18,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 09:44:18,155 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-08 09:44:18,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:44:18,159 INFO L225 Difference]: With dead ends: 6339 [2018-12-08 09:44:18,159 INFO L226 Difference]: Without dead ends: 6315 [2018-12-08 09:44:18,159 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-08 09:44:18,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6315 states. [2018-12-08 09:44:18,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6315 to 5158. [2018-12-08 09:44:18,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5158 states. [2018-12-08 09:44:18,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5158 states to 5158 states and 11195 transitions. [2018-12-08 09:44:18,200 INFO L78 Accepts]: Start accepts. Automaton has 5158 states and 11195 transitions. Word has length 96 [2018-12-08 09:44:18,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:44:18,200 INFO L480 AbstractCegarLoop]: Abstraction has 5158 states and 11195 transitions. [2018-12-08 09:44:18,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 09:44:18,200 INFO L276 IsEmpty]: Start isEmpty. Operand 5158 states and 11195 transitions. [2018-12-08 09:44:18,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-08 09:44:18,203 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:44:18,203 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-08 09:44:18,203 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:44:18,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:44:18,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1073753908, now seen corresponding path program 1 times [2018-12-08 09:44:18,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:44:18,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:44:18,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:18,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:44:18,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:44:18,245 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-08 09:44:18,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:44:18,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 09:44:18,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 09:44:18,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 09:44:18,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 09:44:18,246 INFO L87 Difference]: Start difference. First operand 5158 states and 11195 transitions. Second operand 6 states. [2018-12-08 09:44:18,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:44:18,424 INFO L93 Difference]: Finished difference Result 6018 states and 13109 transitions. [2018-12-08 09:44:18,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 09:44:18,424 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-08 09:44:18,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:44:18,428 INFO L225 Difference]: With dead ends: 6018 [2018-12-08 09:44:18,428 INFO L226 Difference]: Without dead ends: 6018 [2018-12-08 09:44:18,428 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-08 09:44:18,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6018 states. [2018-12-08 09:44:18,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6018 to 5331. [2018-12-08 09:44:18,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5331 states. [2018-12-08 09:44:18,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5331 states to 5331 states and 11574 transitions. [2018-12-08 09:44:18,463 INFO L78 Accepts]: Start accepts. Automaton has 5331 states and 11574 transitions. Word has length 96 [2018-12-08 09:44:18,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:44:18,463 INFO L480 AbstractCegarLoop]: Abstraction has 5331 states and 11574 transitions. [2018-12-08 09:44:18,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 09:44:18,464 INFO L276 IsEmpty]: Start isEmpty. Operand 5331 states and 11574 transitions. [2018-12-08 09:44:18,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-08 09:44:18,467 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:44:18,467 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-08 09:44:18,467 INFO L423 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:44:18,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:44:18,467 INFO L82 PathProgramCache]: Analyzing trace with hash 723124211, now seen corresponding path program 1 times [2018-12-08 09:44:18,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:44:18,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:44:18,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:18,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:44:18,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:18,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:44:18,599 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-08 09:44:18,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:44:18,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 09:44:18,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 09:44:18,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 09:44:18,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-08 09:44:18,600 INFO L87 Difference]: Start difference. First operand 5331 states and 11574 transitions. Second operand 9 states. [2018-12-08 09:44:18,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:44:18,852 INFO L93 Difference]: Finished difference Result 6341 states and 13638 transitions. [2018-12-08 09:44:18,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 09:44:18,852 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2018-12-08 09:44:18,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:44:18,856 INFO L225 Difference]: With dead ends: 6341 [2018-12-08 09:44:18,856 INFO L226 Difference]: Without dead ends: 6341 [2018-12-08 09:44:18,856 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-08 09:44:18,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6341 states. [2018-12-08 09:44:18,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6341 to 5641. [2018-12-08 09:44:18,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5641 states. [2018-12-08 09:44:18,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5641 states to 5641 states and 12207 transitions. [2018-12-08 09:44:18,895 INFO L78 Accepts]: Start accepts. Automaton has 5641 states and 12207 transitions. Word has length 96 [2018-12-08 09:44:18,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:44:18,895 INFO L480 AbstractCegarLoop]: Abstraction has 5641 states and 12207 transitions. [2018-12-08 09:44:18,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 09:44:18,895 INFO L276 IsEmpty]: Start isEmpty. Operand 5641 states and 12207 transitions. [2018-12-08 09:44:18,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-08 09:44:18,899 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:44:18,899 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-08 09:44:18,899 INFO L423 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:44:18,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:44:18,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1890597876, now seen corresponding path program 1 times [2018-12-08 09:44:18,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:44:18,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:44:18,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:18,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:44:18,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:18,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:44:18,961 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-08 09:44:18,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:44:18,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 09:44:18,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 09:44:18,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 09:44:18,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 09:44:18,962 INFO L87 Difference]: Start difference. First operand 5641 states and 12207 transitions. Second operand 7 states. [2018-12-08 09:44:19,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:44:19,048 INFO L93 Difference]: Finished difference Result 6833 states and 14827 transitions. [2018-12-08 09:44:19,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 09:44:19,049 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-08 09:44:19,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:44:19,053 INFO L225 Difference]: With dead ends: 6833 [2018-12-08 09:44:19,053 INFO L226 Difference]: Without dead ends: 6833 [2018-12-08 09:44:19,053 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-08 09:44:19,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6833 states. [2018-12-08 09:44:19,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6833 to 4840. [2018-12-08 09:44:19,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4840 states. [2018-12-08 09:44:19,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4840 states to 4840 states and 10471 transitions. [2018-12-08 09:44:19,089 INFO L78 Accepts]: Start accepts. Automaton has 4840 states and 10471 transitions. Word has length 96 [2018-12-08 09:44:19,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:44:19,089 INFO L480 AbstractCegarLoop]: Abstraction has 4840 states and 10471 transitions. [2018-12-08 09:44:19,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 09:44:19,089 INFO L276 IsEmpty]: Start isEmpty. Operand 4840 states and 10471 transitions. [2018-12-08 09:44:19,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-08 09:44:19,092 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:44:19,093 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-08 09:44:19,093 INFO L423 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:44:19,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:44:19,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1711267723, now seen corresponding path program 2 times [2018-12-08 09:44:19,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:44:19,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:44:19,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:19,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:44:19,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:19,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:44:19,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:44:19,128 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-08 09:44:19,196 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-08 09:44:19,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 09:44:19 BasicIcfg [2018-12-08 09:44:19,197 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 09:44:19,198 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 09:44:19,198 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 09:44:19,198 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 09:44:19,198 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 09:43:53" (3/4) ... [2018-12-08 09:44:19,200 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-08 09:44:19,271 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a0f4dd36-b5b1-41eb-b62d-4c6f05f47198/bin-2019/uautomizer/witness.graphml [2018-12-08 09:44:19,271 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 09:44:19,272 INFO L168 Benchmark]: Toolchain (without parser) took 26947.12 ms. Allocated memory was 1.0 GB in the beginning and 4.2 GB in the end (delta: 3.2 GB). Free memory was 956.0 MB in the beginning and 2.1 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2018-12-08 09:44:19,273 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 09:44:19,273 INFO L168 Benchmark]: CACSL2BoogieTranslator took 311.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -151.0 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. [2018-12-08 09:44:19,274 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-08 09:44:19,274 INFO L168 Benchmark]: Boogie Preprocessor took 19.13 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 09:44:19,274 INFO L168 Benchmark]: RCFGBuilder took 347.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 47.6 MB). Peak memory consumption was 47.6 MB. Max. memory is 11.5 GB. [2018-12-08 09:44:19,274 INFO L168 Benchmark]: TraceAbstraction took 26161.09 ms. Allocated memory was 1.2 GB in the beginning and 4.2 GB in the end (delta: 3.1 GB). Free memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2018-12-08 09:44:19,275 INFO L168 Benchmark]: Witness Printer took 73.71 ms. Allocated memory is still 4.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 57.9 MB). Peak memory consumption was 57.9 MB. Max. memory is 11.5 GB. [2018-12-08 09:44:19,276 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 311.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -151.0 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.13 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 347.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 47.6 MB). Peak memory consumption was 47.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26161.09 ms. Allocated memory was 1.2 GB in the beginning and 4.2 GB in the end (delta: 3.1 GB). Free memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. * Witness Printer took 73.71 ms. Allocated memory is still 4.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 57.9 MB). Peak memory consumption was 57.9 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 t311; 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(&t311, ((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 t312; 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(&t312, ((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.0s OverallTime, 39 OverallIterations, 1 TraceHistogramMax, 11.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10606 SDtfs, 12612 SDslu, 24684 SDs, 0 SdLazy, 10839 SolverSat, 589 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 383 GetRequests, 91 SyntacticMatches, 44 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 1.9s 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.2s AutomataMinimizationTime, 38 MinimizatonAttempts, 190295 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 2941 NumberOfCodeBlocks, 2941 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 2807 ConstructedInterpolants, 0 QuantifiedInterpolants, 708355 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 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...