./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe030_pso.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8f8306ff-b85d-44b4-8804-c28ab45422dd/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8f8306ff-b85d-44b4-8804-c28ab45422dd/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8f8306ff-b85d-44b4-8804-c28ab45422dd/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8f8306ff-b85d-44b4-8804-c28ab45422dd/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe030_pso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_8f8306ff-b85d-44b4-8804-c28ab45422dd/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8f8306ff-b85d-44b4-8804-c28ab45422dd/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 278d8bd7c1a97e577a985a40cd86e40d2394589b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-0cd3be1 [2018-11-28 12:42:25,671 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 12:42:25,672 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 12:42:25,680 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 12:42:25,680 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 12:42:25,681 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 12:42:25,682 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 12:42:25,683 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 12:42:25,684 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 12:42:25,685 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 12:42:25,685 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 12:42:25,685 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 12:42:25,686 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 12:42:25,686 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 12:42:25,687 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 12:42:25,688 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 12:42:25,688 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 12:42:25,689 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 12:42:25,691 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 12:42:25,692 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 12:42:25,692 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 12:42:25,693 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 12:42:25,695 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 12:42:25,695 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 12:42:25,695 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 12:42:25,696 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 12:42:25,696 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 12:42:25,697 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 12:42:25,697 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 12:42:25,698 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 12:42:25,698 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 12:42:25,699 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 12:42:25,699 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 12:42:25,699 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 12:42:25,700 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 12:42:25,700 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 12:42:25,700 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8f8306ff-b85d-44b4-8804-c28ab45422dd/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 12:42:25,710 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 12:42:25,710 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 12:42:25,711 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 12:42:25,711 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 12:42:25,711 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 12:42:25,711 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 12:42:25,711 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 12:42:25,712 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 12:42:25,712 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 12:42:25,712 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 12:42:25,712 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 12:42:25,712 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 12:42:25,712 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 12:42:25,712 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 12:42:25,712 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 12:42:25,712 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 12:42:25,712 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 12:42:25,713 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 12:42:25,713 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 12:42:25,713 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 12:42:25,713 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 12:42:25,713 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 12:42:25,713 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 12:42:25,713 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 12:42:25,713 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 12:42:25,714 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 12:42:25,714 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 12:42:25,714 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 12:42:25,714 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 12:42:25,714 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 12:42:25,714 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_8f8306ff-b85d-44b4-8804-c28ab45422dd/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 -> 278d8bd7c1a97e577a985a40cd86e40d2394589b [2018-11-28 12:42:25,736 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 12:42:25,743 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 12:42:25,745 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 12:42:25,746 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 12:42:25,746 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 12:42:25,747 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8f8306ff-b85d-44b4-8804-c28ab45422dd/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe030_pso.opt_false-unreach-call.i [2018-11-28 12:42:25,782 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8f8306ff-b85d-44b4-8804-c28ab45422dd/bin-2019/uautomizer/data/bae18e972/a4d5f9929b714e15aaddda47381fff77/FLAGdf43a9eea [2018-11-28 12:42:26,228 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 12:42:26,228 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8f8306ff-b85d-44b4-8804-c28ab45422dd/sv-benchmarks/c/pthread-wmm/safe030_pso.opt_false-unreach-call.i [2018-11-28 12:42:26,235 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8f8306ff-b85d-44b4-8804-c28ab45422dd/bin-2019/uautomizer/data/bae18e972/a4d5f9929b714e15aaddda47381fff77/FLAGdf43a9eea [2018-11-28 12:42:26,244 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8f8306ff-b85d-44b4-8804-c28ab45422dd/bin-2019/uautomizer/data/bae18e972/a4d5f9929b714e15aaddda47381fff77 [2018-11-28 12:42:26,246 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 12:42:26,246 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 12:42:26,247 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 12:42:26,247 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 12:42:26,250 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 12:42:26,250 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:42:26" (1/1) ... [2018-11-28 12:42:26,252 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e115a3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:42:26, skipping insertion in model container [2018-11-28 12:42:26,253 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:42:26" (1/1) ... [2018-11-28 12:42:26,259 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 12:42:26,290 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 12:42:26,540 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:42:26,550 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 12:42:26,637 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:42:26,669 INFO L195 MainTranslator]: Completed translation [2018-11-28 12:42:26,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:42:26 WrapperNode [2018-11-28 12:42:26,670 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 12:42:26,670 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 12:42:26,670 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 12:42:26,671 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 12:42:26,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:42:26" (1/1) ... [2018-11-28 12:42:26,690 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:42:26" (1/1) ... [2018-11-28 12:42:26,711 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 12:42:26,711 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 12:42:26,711 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 12:42:26,711 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 12:42:26,718 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:42:26" (1/1) ... [2018-11-28 12:42:26,718 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:42:26" (1/1) ... [2018-11-28 12:42:26,722 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:42:26" (1/1) ... [2018-11-28 12:42:26,722 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:42:26" (1/1) ... [2018-11-28 12:42:26,730 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:42:26" (1/1) ... [2018-11-28 12:42:26,733 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:42:26" (1/1) ... [2018-11-28 12:42:26,736 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:42:26" (1/1) ... [2018-11-28 12:42:26,739 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 12:42:26,739 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 12:42:26,740 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 12:42:26,740 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 12:42:26,740 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:42:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8f8306ff-b85d-44b4-8804-c28ab45422dd/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-11-28 12:42:26,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 12:42:26,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 12:42:26,782 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-11-28 12:42:26,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 12:42:26,782 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-11-28 12:42:26,782 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-11-28 12:42:26,782 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-11-28 12:42:26,783 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-11-28 12:42:26,783 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-11-28 12:42:26,783 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-11-28 12:42:26,783 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-11-28 12:42:26,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 12:42:26,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 12:42:26,784 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-11-28 12:42:27,212 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 12:42:27,212 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 12:42:27,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:42:27 BoogieIcfgContainer [2018-11-28 12:42:27,213 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 12:42:27,213 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 12:42:27,213 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 12:42:27,216 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 12:42:27,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:42:26" (1/3) ... [2018-11-28 12:42:27,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@156398d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:42:27, skipping insertion in model container [2018-11-28 12:42:27,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:42:26" (2/3) ... [2018-11-28 12:42:27,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@156398d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:42:27, skipping insertion in model container [2018-11-28 12:42:27,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:42:27" (3/3) ... [2018-11-28 12:42:27,218 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_pso.opt_false-unreach-call.i [2018-11-28 12:42:27,242 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,242 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,242 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,242 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,243 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,243 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,243 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,243 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,243 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,243 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,244 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,244 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,244 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,244 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,244 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,245 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,245 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,245 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,245 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,245 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,245 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,246 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,246 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,246 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,246 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,246 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,246 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,246 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,247 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,247 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,247 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,247 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,247 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,247 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,247 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,248 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,248 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,248 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,248 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,248 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,248 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,248 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,249 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,249 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,252 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,252 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,253 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,253 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,253 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,253 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,253 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,253 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,253 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,254 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,254 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,254 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,254 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,254 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,254 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,255 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,255 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,255 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,255 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,255 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,255 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,255 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,256 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,256 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,256 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,256 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,256 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,256 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,257 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,257 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,257 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,257 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,257 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,257 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,257 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,257 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,258 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,258 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:42:27,278 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-11-28 12:42:27,278 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 12:42:27,285 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-28 12:42:27,298 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-28 12:42:27,318 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 12:42:27,319 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 12:42:27,319 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 12:42:27,319 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 12:42:27,319 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 12:42:27,319 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 12:42:27,319 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 12:42:27,320 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 12:42:27,320 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 12:42:27,329 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 154places, 191 transitions [2018-11-28 12:42:43,697 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 128911 states. [2018-11-28 12:42:43,698 INFO L276 IsEmpty]: Start isEmpty. Operand 128911 states. [2018-11-28 12:42:43,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-28 12:42:43,705 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:42:43,706 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] [2018-11-28 12:42:43,707 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:42:43,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:42:43,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1836791117, now seen corresponding path program 1 times [2018-11-28 12:42:43,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:42:43,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:42:43,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:42:43,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:42:43,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:42:43,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:42:43,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:42:43,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:42:43,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:42:43,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:42:43,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:42:43,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:42:43,912 INFO L87 Difference]: Start difference. First operand 128911 states. Second operand 4 states. [2018-11-28 12:42:45,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:42:45,541 INFO L93 Difference]: Finished difference Result 233471 states and 1098323 transitions. [2018-11-28 12:42:45,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:42:45,542 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2018-11-28 12:42:45,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:42:49,569 INFO L225 Difference]: With dead ends: 233471 [2018-11-28 12:42:49,569 INFO L226 Difference]: Without dead ends: 203721 [2018-11-28 12:42:49,570 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-11-28 12:42:50,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203721 states. [2018-11-28 12:42:52,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203721 to 118891. [2018-11-28 12:42:52,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118891 states. [2018-11-28 12:42:53,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118891 states to 118891 states and 559774 transitions. [2018-11-28 12:42:53,214 INFO L78 Accepts]: Start accepts. Automaton has 118891 states and 559774 transitions. Word has length 42 [2018-11-28 12:42:53,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:42:53,215 INFO L480 AbstractCegarLoop]: Abstraction has 118891 states and 559774 transitions. [2018-11-28 12:42:53,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:42:53,215 INFO L276 IsEmpty]: Start isEmpty. Operand 118891 states and 559774 transitions. [2018-11-28 12:42:53,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-28 12:42:53,225 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:42:53,225 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-11-28 12:42:53,226 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:42:53,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:42:53,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1696589112, now seen corresponding path program 1 times [2018-11-28 12:42:53,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:42:53,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:42:53,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:42:53,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:42:53,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:42:53,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:42:53,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:42:53,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:42:53,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:42:53,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:42:53,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:42:53,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:42:53,281 INFO L87 Difference]: Start difference. First operand 118891 states and 559774 transitions. Second operand 3 states. [2018-11-28 12:42:53,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:42:53,950 INFO L93 Difference]: Finished difference Result 118891 states and 559659 transitions. [2018-11-28 12:42:53,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:42:53,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-11-28 12:42:53,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:42:54,310 INFO L225 Difference]: With dead ends: 118891 [2018-11-28 12:42:54,310 INFO L226 Difference]: Without dead ends: 118891 [2018-11-28 12:42:54,311 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-11-28 12:42:55,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118891 states. [2018-11-28 12:42:57,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118891 to 118891. [2018-11-28 12:42:57,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118891 states. [2018-11-28 12:42:57,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118891 states to 118891 states and 559659 transitions. [2018-11-28 12:42:57,353 INFO L78 Accepts]: Start accepts. Automaton has 118891 states and 559659 transitions. Word has length 49 [2018-11-28 12:42:57,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:42:57,353 INFO L480 AbstractCegarLoop]: Abstraction has 118891 states and 559659 transitions. [2018-11-28 12:42:57,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:42:57,353 INFO L276 IsEmpty]: Start isEmpty. Operand 118891 states and 559659 transitions. [2018-11-28 12:42:57,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-28 12:42:57,357 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:42:57,357 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-11-28 12:42:57,358 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:42:57,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:42:57,358 INFO L82 PathProgramCache]: Analyzing trace with hash 46221223, now seen corresponding path program 1 times [2018-11-28 12:42:57,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:42:57,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:42:57,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:42:57,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:42:57,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:42:57,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:42:57,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:42:57,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:42:57,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:42:57,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:42:57,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:42:57,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:42:57,440 INFO L87 Difference]: Start difference. First operand 118891 states and 559659 transitions. Second operand 5 states. [2018-11-28 12:42:59,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:42:59,635 INFO L93 Difference]: Finished difference Result 325271 states and 1470363 transitions. [2018-11-28 12:42:59,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 12:42:59,636 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-11-28 12:42:59,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:43:00,494 INFO L225 Difference]: With dead ends: 325271 [2018-11-28 12:43:00,494 INFO L226 Difference]: Without dead ends: 324271 [2018-11-28 12:43:00,494 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-11-28 12:43:01,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324271 states. [2018-11-28 12:43:09,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324271 to 186421. [2018-11-28 12:43:09,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186421 states. [2018-11-28 12:43:09,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186421 states to 186421 states and 842758 transitions. [2018-11-28 12:43:09,834 INFO L78 Accepts]: Start accepts. Automaton has 186421 states and 842758 transitions. Word has length 49 [2018-11-28 12:43:09,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:43:09,835 INFO L480 AbstractCegarLoop]: Abstraction has 186421 states and 842758 transitions. [2018-11-28 12:43:09,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:43:09,835 INFO L276 IsEmpty]: Start isEmpty. Operand 186421 states and 842758 transitions. [2018-11-28 12:43:09,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-28 12:43:09,840 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:43:09,840 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] [2018-11-28 12:43:09,840 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:43:09,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:43:09,840 INFO L82 PathProgramCache]: Analyzing trace with hash 764594298, now seen corresponding path program 1 times [2018-11-28 12:43:09,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:43:09,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:43:09,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:43:09,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:43:09,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:43:09,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:43:09,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:43:09,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:43:09,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:43:09,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:43:09,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:43:09,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:43:09,892 INFO L87 Difference]: Start difference. First operand 186421 states and 842758 transitions. Second operand 4 states. [2018-11-28 12:43:11,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:43:11,212 INFO L93 Difference]: Finished difference Result 163597 states and 726959 transitions. [2018-11-28 12:43:11,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:43:11,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-11-28 12:43:11,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:43:11,605 INFO L225 Difference]: With dead ends: 163597 [2018-11-28 12:43:11,605 INFO L226 Difference]: Without dead ends: 160992 [2018-11-28 12:43:11,605 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-11-28 12:43:12,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160992 states. [2018-11-28 12:43:14,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160992 to 160992. [2018-11-28 12:43:14,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160992 states. [2018-11-28 12:43:15,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160992 states to 160992 states and 718277 transitions. [2018-11-28 12:43:15,149 INFO L78 Accepts]: Start accepts. Automaton has 160992 states and 718277 transitions. Word has length 50 [2018-11-28 12:43:15,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:43:15,149 INFO L480 AbstractCegarLoop]: Abstraction has 160992 states and 718277 transitions. [2018-11-28 12:43:15,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:43:15,149 INFO L276 IsEmpty]: Start isEmpty. Operand 160992 states and 718277 transitions. [2018-11-28 12:43:15,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-28 12:43:15,155 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:43:15,156 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] [2018-11-28 12:43:15,156 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:43:15,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:43:15,156 INFO L82 PathProgramCache]: Analyzing trace with hash 315183364, now seen corresponding path program 1 times [2018-11-28 12:43:15,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:43:15,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:43:15,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:43:15,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:43:15,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:43:15,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:43:15,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:43:15,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:43:15,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:43:15,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:43:15,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:43:15,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:43:15,213 INFO L87 Difference]: Start difference. First operand 160992 states and 718277 transitions. Second operand 5 states. [2018-11-28 12:43:20,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:43:20,477 INFO L93 Difference]: Finished difference Result 289848 states and 1287330 transitions. [2018-11-28 12:43:20,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 12:43:20,477 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2018-11-28 12:43:20,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:43:21,189 INFO L225 Difference]: With dead ends: 289848 [2018-11-28 12:43:21,190 INFO L226 Difference]: Without dead ends: 289008 [2018-11-28 12:43:21,190 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-11-28 12:43:22,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289008 states. [2018-11-28 12:43:25,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289008 to 169612. [2018-11-28 12:43:25,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169612 states. [2018-11-28 12:43:25,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169612 states to 169612 states and 753930 transitions. [2018-11-28 12:43:25,689 INFO L78 Accepts]: Start accepts. Automaton has 169612 states and 753930 transitions. Word has length 51 [2018-11-28 12:43:25,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:43:25,690 INFO L480 AbstractCegarLoop]: Abstraction has 169612 states and 753930 transitions. [2018-11-28 12:43:25,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:43:25,690 INFO L276 IsEmpty]: Start isEmpty. Operand 169612 states and 753930 transitions. [2018-11-28 12:43:25,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-28 12:43:25,709 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:43:25,709 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] [2018-11-28 12:43:25,710 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:43:25,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:43:25,710 INFO L82 PathProgramCache]: Analyzing trace with hash 336759908, now seen corresponding path program 1 times [2018-11-28 12:43:25,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:43:25,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:43:25,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:43:25,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:43:25,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:43:25,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:43:25,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-11-28 12:43:25,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:43:25,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 12:43:25,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:43:25,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:43:25,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:43:25,788 INFO L87 Difference]: Start difference. First operand 169612 states and 753930 transitions. Second operand 6 states. [2018-11-28 12:43:27,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:43:27,976 INFO L93 Difference]: Finished difference Result 292568 states and 1275883 transitions. [2018-11-28 12:43:27,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 12:43:27,977 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-11-28 12:43:27,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:43:28,707 INFO L225 Difference]: With dead ends: 292568 [2018-11-28 12:43:28,707 INFO L226 Difference]: Without dead ends: 291728 [2018-11-28 12:43:28,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2018-11-28 12:43:30,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291728 states. [2018-11-28 12:43:37,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291728 to 164644. [2018-11-28 12:43:37,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164644 states. [2018-11-28 12:43:38,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164644 states to 164644 states and 731936 transitions. [2018-11-28 12:43:38,121 INFO L78 Accepts]: Start accepts. Automaton has 164644 states and 731936 transitions. Word has length 58 [2018-11-28 12:43:38,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:43:38,121 INFO L480 AbstractCegarLoop]: Abstraction has 164644 states and 731936 transitions. [2018-11-28 12:43:38,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:43:38,122 INFO L276 IsEmpty]: Start isEmpty. Operand 164644 states and 731936 transitions. [2018-11-28 12:43:38,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-28 12:43:38,190 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:43:38,190 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] [2018-11-28 12:43:38,191 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:43:38,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:43:38,191 INFO L82 PathProgramCache]: Analyzing trace with hash 655738884, now seen corresponding path program 1 times [2018-11-28 12:43:38,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:43:38,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:43:38,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:43:38,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:43:38,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:43:38,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:43:38,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:43:38,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:43:38,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:43:38,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:43:38,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:43:38,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:43:38,248 INFO L87 Difference]: Start difference. First operand 164644 states and 731936 transitions. Second operand 4 states. [2018-11-28 12:43:40,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:43:40,104 INFO L93 Difference]: Finished difference Result 264420 states and 1161188 transitions. [2018-11-28 12:43:40,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:43:40,105 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-11-28 12:43:40,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:43:40,784 INFO L225 Difference]: With dead ends: 264420 [2018-11-28 12:43:40,784 INFO L226 Difference]: Without dead ends: 263060 [2018-11-28 12:43:40,784 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-11-28 12:43:41,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263060 states. [2018-11-28 12:43:45,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263060 to 220276. [2018-11-28 12:43:45,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220276 states. [2018-11-28 12:43:46,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220276 states to 220276 states and 976572 transitions. [2018-11-28 12:43:46,013 INFO L78 Accepts]: Start accepts. Automaton has 220276 states and 976572 transitions. Word has length 65 [2018-11-28 12:43:46,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:43:46,013 INFO L480 AbstractCegarLoop]: Abstraction has 220276 states and 976572 transitions. [2018-11-28 12:43:46,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:43:46,013 INFO L276 IsEmpty]: Start isEmpty. Operand 220276 states and 976572 transitions. [2018-11-28 12:43:46,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-28 12:43:46,097 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:43:46,097 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] [2018-11-28 12:43:46,097 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:43:46,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:43:46,097 INFO L82 PathProgramCache]: Analyzing trace with hash 2009048581, now seen corresponding path program 1 times [2018-11-28 12:43:46,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:43:46,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:43:46,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:43:46,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:43:46,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:43:46,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:43:46,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:43:46,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:43:46,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:43:46,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:43:46,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:43:46,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:43:46,155 INFO L87 Difference]: Start difference. First operand 220276 states and 976572 transitions. Second operand 5 states. [2018-11-28 12:43:47,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:43:47,104 INFO L93 Difference]: Finished difference Result 78044 states and 314282 transitions. [2018-11-28 12:43:47,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:43:47,105 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-11-28 12:43:47,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:43:47,249 INFO L225 Difference]: With dead ends: 78044 [2018-11-28 12:43:47,249 INFO L226 Difference]: Without dead ends: 75732 [2018-11-28 12:43:47,250 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-11-28 12:43:47,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75732 states. [2018-11-28 12:43:48,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75732 to 75732. [2018-11-28 12:43:48,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75732 states. [2018-11-28 12:43:48,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75732 states to 75732 states and 305620 transitions. [2018-11-28 12:43:48,278 INFO L78 Accepts]: Start accepts. Automaton has 75732 states and 305620 transitions. Word has length 65 [2018-11-28 12:43:48,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:43:48,278 INFO L480 AbstractCegarLoop]: Abstraction has 75732 states and 305620 transitions. [2018-11-28 12:43:48,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:43:48,279 INFO L276 IsEmpty]: Start isEmpty. Operand 75732 states and 305620 transitions. [2018-11-28 12:43:48,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-28 12:43:48,335 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:43:48,335 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] [2018-11-28 12:43:48,335 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:43:48,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:43:48,336 INFO L82 PathProgramCache]: Analyzing trace with hash 493391520, now seen corresponding path program 1 times [2018-11-28 12:43:48,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:43:48,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:43:48,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:43:48,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:43:48,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:43:48,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:43:48,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:43:48,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:43:48,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:43:48,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:43:48,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:43:48,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:43:48,407 INFO L87 Difference]: Start difference. First operand 75732 states and 305620 transitions. Second operand 4 states. [2018-11-28 12:43:51,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:43:51,136 INFO L93 Difference]: Finished difference Result 105528 states and 420009 transitions. [2018-11-28 12:43:51,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:43:51,137 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-11-28 12:43:51,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:43:51,337 INFO L225 Difference]: With dead ends: 105528 [2018-11-28 12:43:51,337 INFO L226 Difference]: Without dead ends: 105528 [2018-11-28 12:43:51,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-11-28 12:43:51,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105528 states. [2018-11-28 12:43:52,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105528 to 81080. [2018-11-28 12:43:52,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81080 states. [2018-11-28 12:43:52,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81080 states to 81080 states and 325641 transitions. [2018-11-28 12:43:52,559 INFO L78 Accepts]: Start accepts. Automaton has 81080 states and 325641 transitions. Word has length 78 [2018-11-28 12:43:52,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:43:52,559 INFO L480 AbstractCegarLoop]: Abstraction has 81080 states and 325641 transitions. [2018-11-28 12:43:52,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:43:52,559 INFO L276 IsEmpty]: Start isEmpty. Operand 81080 states and 325641 transitions. [2018-11-28 12:43:52,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-28 12:43:52,614 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:43:52,614 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] [2018-11-28 12:43:52,614 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:43:52,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:43:52,614 INFO L82 PathProgramCache]: Analyzing trace with hash -191355072, now seen corresponding path program 1 times [2018-11-28 12:43:52,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:43:52,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:43:52,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:43:52,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:43:52,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:43:52,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:43:52,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:43:52,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:43:52,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:43:52,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:43:52,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:43:52,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:43:52,667 INFO L87 Difference]: Start difference. First operand 81080 states and 325641 transitions. Second operand 4 states. [2018-11-28 12:43:53,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:43:53,704 INFO L93 Difference]: Finished difference Result 113667 states and 450915 transitions. [2018-11-28 12:43:53,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:43:53,705 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-11-28 12:43:53,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:43:53,929 INFO L225 Difference]: With dead ends: 113667 [2018-11-28 12:43:53,929 INFO L226 Difference]: Without dead ends: 113667 [2018-11-28 12:43:53,930 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-11-28 12:43:54,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113667 states. [2018-11-28 12:43:55,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113667 to 102372. [2018-11-28 12:43:55,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102372 states. [2018-11-28 12:43:55,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102372 states to 102372 states and 408718 transitions. [2018-11-28 12:43:55,995 INFO L78 Accepts]: Start accepts. Automaton has 102372 states and 408718 transitions. Word has length 78 [2018-11-28 12:43:55,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:43:55,995 INFO L480 AbstractCegarLoop]: Abstraction has 102372 states and 408718 transitions. [2018-11-28 12:43:55,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:43:55,995 INFO L276 IsEmpty]: Start isEmpty. Operand 102372 states and 408718 transitions. [2018-11-28 12:43:56,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-28 12:43:56,064 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:43:56,064 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] [2018-11-28 12:43:56,064 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:43:56,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:43:56,065 INFO L82 PathProgramCache]: Analyzing trace with hash 159444865, now seen corresponding path program 1 times [2018-11-28 12:43:56,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:43:56,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:43:56,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:43:56,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:43:56,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:43:56,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:43:56,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:43:56,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:43:56,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 12:43:56,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 12:43:56,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 12:43:56,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-28 12:43:56,187 INFO L87 Difference]: Start difference. First operand 102372 states and 408718 transitions. Second operand 8 states. [2018-11-28 12:43:57,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:43:57,322 INFO L93 Difference]: Finished difference Result 155234 states and 603182 transitions. [2018-11-28 12:43:57,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 12:43:57,323 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2018-11-28 12:43:57,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:43:57,633 INFO L225 Difference]: With dead ends: 155234 [2018-11-28 12:43:57,633 INFO L226 Difference]: Without dead ends: 154210 [2018-11-28 12:43:57,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-11-28 12:43:57,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154210 states. [2018-11-28 12:43:59,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154210 to 113269. [2018-11-28 12:43:59,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113269 states. [2018-11-28 12:43:59,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113269 states to 113269 states and 449340 transitions. [2018-11-28 12:43:59,956 INFO L78 Accepts]: Start accepts. Automaton has 113269 states and 449340 transitions. Word has length 78 [2018-11-28 12:43:59,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:43:59,956 INFO L480 AbstractCegarLoop]: Abstraction has 113269 states and 449340 transitions. [2018-11-28 12:43:59,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 12:43:59,957 INFO L276 IsEmpty]: Start isEmpty. Operand 113269 states and 449340 transitions. [2018-11-28 12:44:00,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-28 12:44:00,039 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:44:00,039 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] [2018-11-28 12:44:00,039 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:44:00,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:44:00,040 INFO L82 PathProgramCache]: Analyzing trace with hash -133958142, now seen corresponding path program 1 times [2018-11-28 12:44:00,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:44:00,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:44:00,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:00,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:44:00,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:00,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:44:00,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:44:00,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:44:00,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 12:44:00,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:44:00,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:44:00,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:44:00,134 INFO L87 Difference]: Start difference. First operand 113269 states and 449340 transitions. Second operand 6 states. [2018-11-28 12:44:01,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:44:01,135 INFO L93 Difference]: Finished difference Result 124463 states and 488873 transitions. [2018-11-28 12:44:01,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 12:44:01,135 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-11-28 12:44:01,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:44:01,377 INFO L225 Difference]: With dead ends: 124463 [2018-11-28 12:44:01,377 INFO L226 Difference]: Without dead ends: 124463 [2018-11-28 12:44:01,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-28 12:44:01,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124463 states. [2018-11-28 12:44:02,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124463 to 116556. [2018-11-28 12:44:02,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116556 states. [2018-11-28 12:44:03,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116556 states to 116556 states and 460918 transitions. [2018-11-28 12:44:03,041 INFO L78 Accepts]: Start accepts. Automaton has 116556 states and 460918 transitions. Word has length 78 [2018-11-28 12:44:03,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:44:03,042 INFO L480 AbstractCegarLoop]: Abstraction has 116556 states and 460918 transitions. [2018-11-28 12:44:03,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:44:03,042 INFO L276 IsEmpty]: Start isEmpty. Operand 116556 states and 460918 transitions. [2018-11-28 12:44:03,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-28 12:44:03,595 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:44:03,595 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] [2018-11-28 12:44:03,595 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:44:03,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:44:03,596 INFO L82 PathProgramCache]: Analyzing trace with hash 827655875, now seen corresponding path program 1 times [2018-11-28 12:44:03,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:44:03,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:44:03,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:03,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:44:03,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:03,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:44:03,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:44:03,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:44:03,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 12:44:03,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:44:03,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:44:03,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:44:03,663 INFO L87 Difference]: Start difference. First operand 116556 states and 460918 transitions. Second operand 6 states. [2018-11-28 12:44:03,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:44:03,775 INFO L93 Difference]: Finished difference Result 20396 states and 68134 transitions. [2018-11-28 12:44:03,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 12:44:03,776 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-11-28 12:44:03,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:44:03,806 INFO L225 Difference]: With dead ends: 20396 [2018-11-28 12:44:03,806 INFO L226 Difference]: Without dead ends: 17062 [2018-11-28 12:44:03,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-11-28 12:44:03,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17062 states. [2018-11-28 12:44:03,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17062 to 15577. [2018-11-28 12:44:03,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15577 states. [2018-11-28 12:44:04,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15577 states to 15577 states and 52276 transitions. [2018-11-28 12:44:04,010 INFO L78 Accepts]: Start accepts. Automaton has 15577 states and 52276 transitions. Word has length 78 [2018-11-28 12:44:04,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:44:04,010 INFO L480 AbstractCegarLoop]: Abstraction has 15577 states and 52276 transitions. [2018-11-28 12:44:04,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:44:04,010 INFO L276 IsEmpty]: Start isEmpty. Operand 15577 states and 52276 transitions. [2018-11-28 12:44:04,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-28 12:44:04,024 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:44:04,024 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:44:04,024 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:44:04,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:44:04,025 INFO L82 PathProgramCache]: Analyzing trace with hash -2014372351, now seen corresponding path program 1 times [2018-11-28 12:44:04,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:44:04,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:44:04,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:04,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:44:04,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:04,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:44:04,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:44:04,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:44:04,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:44:04,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:44:04,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:44:04,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:44:04,068 INFO L87 Difference]: Start difference. First operand 15577 states and 52276 transitions. Second operand 5 states. [2018-11-28 12:44:04,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:44:04,203 INFO L93 Difference]: Finished difference Result 17227 states and 57291 transitions. [2018-11-28 12:44:04,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:44:04,204 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2018-11-28 12:44:04,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:44:04,223 INFO L225 Difference]: With dead ends: 17227 [2018-11-28 12:44:04,223 INFO L226 Difference]: Without dead ends: 17227 [2018-11-28 12:44:04,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:44:04,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17227 states. [2018-11-28 12:44:04,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17227 to 15767. [2018-11-28 12:44:04,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15767 states. [2018-11-28 12:44:04,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15767 states to 15767 states and 52948 transitions. [2018-11-28 12:44:04,388 INFO L78 Accepts]: Start accepts. Automaton has 15767 states and 52948 transitions. Word has length 97 [2018-11-28 12:44:04,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:44:04,388 INFO L480 AbstractCegarLoop]: Abstraction has 15767 states and 52948 transitions. [2018-11-28 12:44:04,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:44:04,388 INFO L276 IsEmpty]: Start isEmpty. Operand 15767 states and 52948 transitions. [2018-11-28 12:44:04,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-28 12:44:04,403 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:44:04,403 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, 1] [2018-11-28 12:44:04,403 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:44:04,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:44:04,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1097247648, now seen corresponding path program 1 times [2018-11-28 12:44:04,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:44:04,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:44:04,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:04,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:44:04,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:04,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:44:04,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:44:04,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:44:04,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 12:44:04,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:44:04,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:44:04,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:44:04,472 INFO L87 Difference]: Start difference. First operand 15767 states and 52948 transitions. Second operand 6 states. [2018-11-28 12:44:04,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:44:04,752 INFO L93 Difference]: Finished difference Result 18487 states and 61234 transitions. [2018-11-28 12:44:04,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 12:44:04,752 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2018-11-28 12:44:04,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:44:04,775 INFO L225 Difference]: With dead ends: 18487 [2018-11-28 12:44:04,775 INFO L226 Difference]: Without dead ends: 18127 [2018-11-28 12:44:04,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:44:04,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18127 states. [2018-11-28 12:44:04,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18127 to 17597. [2018-11-28 12:44:04,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17597 states. [2018-11-28 12:44:04,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17597 states to 17597 states and 58832 transitions. [2018-11-28 12:44:04,964 INFO L78 Accepts]: Start accepts. Automaton has 17597 states and 58832 transitions. Word has length 97 [2018-11-28 12:44:04,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:44:04,965 INFO L480 AbstractCegarLoop]: Abstraction has 17597 states and 58832 transitions. [2018-11-28 12:44:04,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:44:04,965 INFO L276 IsEmpty]: Start isEmpty. Operand 17597 states and 58832 transitions. [2018-11-28 12:44:04,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-28 12:44:04,981 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:44:04,981 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, 1] [2018-11-28 12:44:04,981 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:44:04,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:44:04,981 INFO L82 PathProgramCache]: Analyzing trace with hash -800534339, now seen corresponding path program 2 times [2018-11-28 12:44:04,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:44:04,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:44:04,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:04,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:44:04,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:04,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:44:05,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:44:05,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:44:05,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:44:05,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:44:05,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:44:05,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:44:05,023 INFO L87 Difference]: Start difference. First operand 17597 states and 58832 transitions. Second operand 5 states. [2018-11-28 12:44:05,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:44:05,187 INFO L93 Difference]: Finished difference Result 23304 states and 76607 transitions. [2018-11-28 12:44:05,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:44:05,187 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2018-11-28 12:44:05,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:44:05,212 INFO L225 Difference]: With dead ends: 23304 [2018-11-28 12:44:05,213 INFO L226 Difference]: Without dead ends: 23144 [2018-11-28 12:44:05,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:44:05,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23144 states. [2018-11-28 12:44:05,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23144 to 19330. [2018-11-28 12:44:05,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19330 states. [2018-11-28 12:44:05,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19330 states to 19330 states and 64347 transitions. [2018-11-28 12:44:05,422 INFO L78 Accepts]: Start accepts. Automaton has 19330 states and 64347 transitions. Word has length 97 [2018-11-28 12:44:05,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:44:05,422 INFO L480 AbstractCegarLoop]: Abstraction has 19330 states and 64347 transitions. [2018-11-28 12:44:05,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:44:05,422 INFO L276 IsEmpty]: Start isEmpty. Operand 19330 states and 64347 transitions. [2018-11-28 12:44:05,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-28 12:44:05,438 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:44:05,438 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, 1] [2018-11-28 12:44:05,439 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:44:05,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:44:05,439 INFO L82 PathProgramCache]: Analyzing trace with hash -124487781, now seen corresponding path program 3 times [2018-11-28 12:44:05,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:44:05,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:44:05,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:05,440 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:44:05,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:05,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:44:05,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:44:05,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:44:05,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 12:44:05,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 12:44:05,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 12:44:05,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:44:05,517 INFO L87 Difference]: Start difference. First operand 19330 states and 64347 transitions. Second operand 7 states. [2018-11-28 12:44:05,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:44:05,779 INFO L93 Difference]: Finished difference Result 23210 states and 76033 transitions. [2018-11-28 12:44:05,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 12:44:05,780 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2018-11-28 12:44:05,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:44:05,805 INFO L225 Difference]: With dead ends: 23210 [2018-11-28 12:44:05,805 INFO L226 Difference]: Without dead ends: 22835 [2018-11-28 12:44:05,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-11-28 12:44:05,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22835 states. [2018-11-28 12:44:05,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22835 to 19315. [2018-11-28 12:44:05,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19315 states. [2018-11-28 12:44:06,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19315 states to 19315 states and 64230 transitions. [2018-11-28 12:44:06,013 INFO L78 Accepts]: Start accepts. Automaton has 19315 states and 64230 transitions. Word has length 97 [2018-11-28 12:44:06,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:44:06,013 INFO L480 AbstractCegarLoop]: Abstraction has 19315 states and 64230 transitions. [2018-11-28 12:44:06,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 12:44:06,013 INFO L276 IsEmpty]: Start isEmpty. Operand 19315 states and 64230 transitions. [2018-11-28 12:44:06,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-28 12:44:06,029 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:44:06,029 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, 1] [2018-11-28 12:44:06,029 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:44:06,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:44:06,030 INFO L82 PathProgramCache]: Analyzing trace with hash 2066828671, now seen corresponding path program 1 times [2018-11-28 12:44:06,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:44:06,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:44:06,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:06,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:44:06,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:06,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:44:06,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:44:06,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:44:06,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 12:44:06,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:44:06,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:44:06,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:44:06,107 INFO L87 Difference]: Start difference. First operand 19315 states and 64230 transitions. Second operand 6 states. [2018-11-28 12:44:06,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:44:06,337 INFO L93 Difference]: Finished difference Result 22820 states and 73489 transitions. [2018-11-28 12:44:06,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 12:44:06,337 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2018-11-28 12:44:06,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:44:06,359 INFO L225 Difference]: With dead ends: 22820 [2018-11-28 12:44:06,360 INFO L226 Difference]: Without dead ends: 22745 [2018-11-28 12:44:06,360 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-11-28 12:44:06,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22745 states. [2018-11-28 12:44:06,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22745 to 20185. [2018-11-28 12:44:06,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20185 states. [2018-11-28 12:44:06,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20185 states to 20185 states and 66021 transitions. [2018-11-28 12:44:06,558 INFO L78 Accepts]: Start accepts. Automaton has 20185 states and 66021 transitions. Word has length 97 [2018-11-28 12:44:06,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:44:06,558 INFO L480 AbstractCegarLoop]: Abstraction has 20185 states and 66021 transitions. [2018-11-28 12:44:06,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:44:06,558 INFO L276 IsEmpty]: Start isEmpty. Operand 20185 states and 66021 transitions. [2018-11-28 12:44:06,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-28 12:44:06,574 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:44:06,574 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, 1] [2018-11-28 12:44:06,574 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:44:06,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:44:06,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1042134750, now seen corresponding path program 1 times [2018-11-28 12:44:06,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:44:06,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:44:06,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:06,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:44:06,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:06,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:44:06,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:44:06,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:44:06,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:44:06,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:44:06,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:44:06,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:44:06,626 INFO L87 Difference]: Start difference. First operand 20185 states and 66021 transitions. Second operand 5 states. [2018-11-28 12:44:06,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:44:06,791 INFO L93 Difference]: Finished difference Result 25977 states and 83364 transitions. [2018-11-28 12:44:06,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 12:44:06,792 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2018-11-28 12:44:06,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:44:06,820 INFO L225 Difference]: With dead ends: 25977 [2018-11-28 12:44:06,820 INFO L226 Difference]: Without dead ends: 25442 [2018-11-28 12:44:06,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 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-11-28 12:44:06,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25442 states. [2018-11-28 12:44:07,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25442 to 20955. [2018-11-28 12:44:07,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20955 states. [2018-11-28 12:44:07,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20955 states to 20955 states and 68022 transitions. [2018-11-28 12:44:07,046 INFO L78 Accepts]: Start accepts. Automaton has 20955 states and 68022 transitions. Word has length 97 [2018-11-28 12:44:07,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:44:07,046 INFO L480 AbstractCegarLoop]: Abstraction has 20955 states and 68022 transitions. [2018-11-28 12:44:07,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:44:07,046 INFO L276 IsEmpty]: Start isEmpty. Operand 20955 states and 68022 transitions. [2018-11-28 12:44:07,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-28 12:44:07,063 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:44:07,063 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-28 12:44:07,063 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:44:07,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:44:07,063 INFO L82 PathProgramCache]: Analyzing trace with hash -2038420724, now seen corresponding path program 1 times [2018-11-28 12:44:07,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:44:07,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:44:07,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:07,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:44:07,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:07,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:44:07,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:44:07,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:44:07,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 12:44:07,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 12:44:07,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 12:44:07,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-28 12:44:07,159 INFO L87 Difference]: Start difference. First operand 20955 states and 68022 transitions. Second operand 9 states. [2018-11-28 12:44:07,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:44:07,897 INFO L93 Difference]: Finished difference Result 35170 states and 112670 transitions. [2018-11-28 12:44:07,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-28 12:44:07,897 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2018-11-28 12:44:07,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:44:07,950 INFO L225 Difference]: With dead ends: 35170 [2018-11-28 12:44:07,951 INFO L226 Difference]: Without dead ends: 35042 [2018-11-28 12:44:07,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2018-11-28 12:44:08,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35042 states. [2018-11-28 12:44:08,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35042 to 23768. [2018-11-28 12:44:08,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23768 states. [2018-11-28 12:44:08,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23768 states to 23768 states and 77120 transitions. [2018-11-28 12:44:08,275 INFO L78 Accepts]: Start accepts. Automaton has 23768 states and 77120 transitions. Word has length 99 [2018-11-28 12:44:08,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:44:08,276 INFO L480 AbstractCegarLoop]: Abstraction has 23768 states and 77120 transitions. [2018-11-28 12:44:08,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 12:44:08,276 INFO L276 IsEmpty]: Start isEmpty. Operand 23768 states and 77120 transitions. [2018-11-28 12:44:08,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-28 12:44:08,298 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:44:08,298 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, 1, 1, 1] [2018-11-28 12:44:08,298 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:44:08,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:44:08,298 INFO L82 PathProgramCache]: Analyzing trace with hash -793656243, now seen corresponding path program 1 times [2018-11-28 12:44:08,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:44:08,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:44:08,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:08,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:44:08,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:08,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:44:08,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:44:08,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:44:08,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 12:44:08,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 12:44:08,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 12:44:08,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:44:08,432 INFO L87 Difference]: Start difference. First operand 23768 states and 77120 transitions. Second operand 7 states. [2018-11-28 12:44:08,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:44:08,887 INFO L93 Difference]: Finished difference Result 37316 states and 120409 transitions. [2018-11-28 12:44:08,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 12:44:08,888 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2018-11-28 12:44:08,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:44:08,931 INFO L225 Difference]: With dead ends: 37316 [2018-11-28 12:44:08,931 INFO L226 Difference]: Without dead ends: 36421 [2018-11-28 12:44:08,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-11-28 12:44:08,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36421 states. [2018-11-28 12:44:09,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36421 to 23258. [2018-11-28 12:44:09,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23258 states. [2018-11-28 12:44:09,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23258 states to 23258 states and 75202 transitions. [2018-11-28 12:44:09,234 INFO L78 Accepts]: Start accepts. Automaton has 23258 states and 75202 transitions. Word has length 99 [2018-11-28 12:44:09,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:44:09,235 INFO L480 AbstractCegarLoop]: Abstraction has 23258 states and 75202 transitions. [2018-11-28 12:44:09,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 12:44:09,235 INFO L276 IsEmpty]: Start isEmpty. Operand 23258 states and 75202 transitions. [2018-11-28 12:44:09,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-28 12:44:09,255 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:44:09,256 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, 1, 1, 1] [2018-11-28 12:44:09,256 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:44:09,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:44:09,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1963977170, now seen corresponding path program 1 times [2018-11-28 12:44:09,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:44:09,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:44:09,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:09,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:44:09,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:09,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:44:09,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:44:09,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:44:09,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 12:44:09,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:44:09,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:44:09,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:44:09,343 INFO L87 Difference]: Start difference. First operand 23258 states and 75202 transitions. Second operand 6 states. [2018-11-28 12:44:09,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:44:09,490 INFO L93 Difference]: Finished difference Result 18999 states and 61501 transitions. [2018-11-28 12:44:09,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 12:44:09,490 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2018-11-28 12:44:09,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:44:09,514 INFO L225 Difference]: With dead ends: 18999 [2018-11-28 12:44:09,514 INFO L226 Difference]: Without dead ends: 18999 [2018-11-28 12:44:09,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-28 12:44:09,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18999 states. [2018-11-28 12:44:09,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18999 to 17499. [2018-11-28 12:44:09,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17499 states. [2018-11-28 12:44:09,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17499 states to 17499 states and 57066 transitions. [2018-11-28 12:44:09,778 INFO L78 Accepts]: Start accepts. Automaton has 17499 states and 57066 transitions. Word has length 99 [2018-11-28 12:44:09,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:44:09,778 INFO L480 AbstractCegarLoop]: Abstraction has 17499 states and 57066 transitions. [2018-11-28 12:44:09,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:44:09,778 INFO L276 IsEmpty]: Start isEmpty. Operand 17499 states and 57066 transitions. [2018-11-28 12:44:09,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-28 12:44:09,793 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:44:09,793 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, 1, 1, 1] [2018-11-28 12:44:09,793 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:44:09,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:44:09,794 INFO L82 PathProgramCache]: Analyzing trace with hash -456422671, now seen corresponding path program 1 times [2018-11-28 12:44:09,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:44:09,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:44:09,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:09,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:44:09,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:09,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:44:09,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:44:09,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:44:09,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 12:44:09,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 12:44:09,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 12:44:09,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:44:09,860 INFO L87 Difference]: Start difference. First operand 17499 states and 57066 transitions. Second operand 7 states. [2018-11-28 12:44:10,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:44:10,135 INFO L93 Difference]: Finished difference Result 19038 states and 61795 transitions. [2018-11-28 12:44:10,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 12:44:10,136 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2018-11-28 12:44:10,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:44:10,158 INFO L225 Difference]: With dead ends: 19038 [2018-11-28 12:44:10,158 INFO L226 Difference]: Without dead ends: 19038 [2018-11-28 12:44:10,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:44:10,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19038 states. [2018-11-28 12:44:10,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19038 to 17409. [2018-11-28 12:44:10,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17409 states. [2018-11-28 12:44:10,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17409 states to 17409 states and 56814 transitions. [2018-11-28 12:44:10,336 INFO L78 Accepts]: Start accepts. Automaton has 17409 states and 56814 transitions. Word has length 99 [2018-11-28 12:44:10,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:44:10,336 INFO L480 AbstractCegarLoop]: Abstraction has 17409 states and 56814 transitions. [2018-11-28 12:44:10,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 12:44:10,337 INFO L276 IsEmpty]: Start isEmpty. Operand 17409 states and 56814 transitions. [2018-11-28 12:44:10,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-28 12:44:10,352 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:44:10,353 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, 1, 1, 1] [2018-11-28 12:44:10,353 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:44:10,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:44:10,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1639769968, now seen corresponding path program 1 times [2018-11-28 12:44:10,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:44:10,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:44:10,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:10,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:44:10,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:10,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:44:10,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:44:10,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:44:10,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 12:44:10,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 12:44:10,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 12:44:10,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-28 12:44:10,431 INFO L87 Difference]: Start difference. First operand 17409 states and 56814 transitions. Second operand 8 states. [2018-11-28 12:44:10,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:44:10,722 INFO L93 Difference]: Finished difference Result 22228 states and 71934 transitions. [2018-11-28 12:44:10,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 12:44:10,723 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 99 [2018-11-28 12:44:10,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:44:10,748 INFO L225 Difference]: With dead ends: 22228 [2018-11-28 12:44:10,748 INFO L226 Difference]: Without dead ends: 22100 [2018-11-28 12:44:10,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-11-28 12:44:10,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22100 states. [2018-11-28 12:44:10,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22100 to 17738. [2018-11-28 12:44:10,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17738 states. [2018-11-28 12:44:10,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17738 states to 17738 states and 57613 transitions. [2018-11-28 12:44:10,958 INFO L78 Accepts]: Start accepts. Automaton has 17738 states and 57613 transitions. Word has length 99 [2018-11-28 12:44:10,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:44:10,958 INFO L480 AbstractCegarLoop]: Abstraction has 17738 states and 57613 transitions. [2018-11-28 12:44:10,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 12:44:10,958 INFO L276 IsEmpty]: Start isEmpty. Operand 17738 states and 57613 transitions. [2018-11-28 12:44:10,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-28 12:44:10,974 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:44:10,975 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, 1, 1, 1] [2018-11-28 12:44:10,975 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:44:10,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:44:10,975 INFO L82 PathProgramCache]: Analyzing trace with hash -678155951, now seen corresponding path program 1 times [2018-11-28 12:44:10,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:44:10,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:44:10,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:10,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:44:10,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:10,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:44:11,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:44:11,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:44:11,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 12:44:11,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 12:44:11,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 12:44:11,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:44:11,036 INFO L87 Difference]: Start difference. First operand 17738 states and 57613 transitions. Second operand 7 states. [2018-11-28 12:44:11,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:44:11,352 INFO L93 Difference]: Finished difference Result 23099 states and 74558 transitions. [2018-11-28 12:44:11,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 12:44:11,353 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2018-11-28 12:44:11,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:44:11,379 INFO L225 Difference]: With dead ends: 23099 [2018-11-28 12:44:11,379 INFO L226 Difference]: Without dead ends: 23099 [2018-11-28 12:44:11,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-11-28 12:44:11,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23099 states. [2018-11-28 12:44:11,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23099 to 19145. [2018-11-28 12:44:11,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19145 states. [2018-11-28 12:44:11,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19145 states to 19145 states and 62246 transitions. [2018-11-28 12:44:11,590 INFO L78 Accepts]: Start accepts. Automaton has 19145 states and 62246 transitions. Word has length 99 [2018-11-28 12:44:11,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:44:11,590 INFO L480 AbstractCegarLoop]: Abstraction has 19145 states and 62246 transitions. [2018-11-28 12:44:11,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 12:44:11,591 INFO L276 IsEmpty]: Start isEmpty. Operand 19145 states and 62246 transitions. [2018-11-28 12:44:11,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-28 12:44:11,607 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:44:11,607 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, 1, 1, 1] [2018-11-28 12:44:11,607 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:44:11,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:44:11,608 INFO L82 PathProgramCache]: Analyzing trace with hash 566608530, now seen corresponding path program 1 times [2018-11-28 12:44:11,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:44:11,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:44:11,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:11,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:44:11,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:11,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:44:11,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:44:11,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:44:11,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:44:11,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:44:11,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:44:11,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:44:11,678 INFO L87 Difference]: Start difference. First operand 19145 states and 62246 transitions. Second operand 5 states. [2018-11-28 12:44:11,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:44:11,761 INFO L93 Difference]: Finished difference Result 28269 states and 93441 transitions. [2018-11-28 12:44:11,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:44:11,762 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2018-11-28 12:44:11,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:44:11,802 INFO L225 Difference]: With dead ends: 28269 [2018-11-28 12:44:11,803 INFO L226 Difference]: Without dead ends: 28269 [2018-11-28 12:44:11,803 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-11-28 12:44:11,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28269 states. [2018-11-28 12:44:11,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28269 to 17378. [2018-11-28 12:44:11,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17378 states. [2018-11-28 12:44:12,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17378 states to 17378 states and 56135 transitions. [2018-11-28 12:44:12,020 INFO L78 Accepts]: Start accepts. Automaton has 17378 states and 56135 transitions. Word has length 99 [2018-11-28 12:44:12,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:44:12,020 INFO L480 AbstractCegarLoop]: Abstraction has 17378 states and 56135 transitions. [2018-11-28 12:44:12,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:44:12,020 INFO L276 IsEmpty]: Start isEmpty. Operand 17378 states and 56135 transitions. [2018-11-28 12:44:12,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-28 12:44:12,034 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:44:12,034 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, 1, 1, 1] [2018-11-28 12:44:12,035 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:44:12,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:44:12,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1047324946, now seen corresponding path program 1 times [2018-11-28 12:44:12,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:44:12,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:44:12,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:12,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:44:12,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:12,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:44:12,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:44:12,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:44:12,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 12:44:12,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:44:12,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:44:12,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:44:12,131 INFO L87 Difference]: Start difference. First operand 17378 states and 56135 transitions. Second operand 6 states. [2018-11-28 12:44:12,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:44:12,255 INFO L93 Difference]: Finished difference Result 15906 states and 50519 transitions. [2018-11-28 12:44:12,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 12:44:12,255 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2018-11-28 12:44:12,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:44:12,271 INFO L225 Difference]: With dead ends: 15906 [2018-11-28 12:44:12,271 INFO L226 Difference]: Without dead ends: 15906 [2018-11-28 12:44:12,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-28 12:44:12,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15906 states. [2018-11-28 12:44:12,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15906 to 12495. [2018-11-28 12:44:12,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12495 states. [2018-11-28 12:44:12,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12495 states to 12495 states and 40503 transitions. [2018-11-28 12:44:12,408 INFO L78 Accepts]: Start accepts. Automaton has 12495 states and 40503 transitions. Word has length 99 [2018-11-28 12:44:12,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:44:12,408 INFO L480 AbstractCegarLoop]: Abstraction has 12495 states and 40503 transitions. [2018-11-28 12:44:12,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:44:12,408 INFO L276 IsEmpty]: Start isEmpty. Operand 12495 states and 40503 transitions. [2018-11-28 12:44:12,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-28 12:44:12,418 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:44:12,418 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, 1, 1, 1, 1, 1] [2018-11-28 12:44:12,418 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:44:12,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:44:12,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1543607272, now seen corresponding path program 1 times [2018-11-28 12:44:12,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:44:12,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:44:12,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:12,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:44:12,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:12,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:44:12,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:44:12,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:44:12,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:44:12,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:44:12,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:44:12,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:44:12,470 INFO L87 Difference]: Start difference. First operand 12495 states and 40503 transitions. Second operand 5 states. [2018-11-28 12:44:12,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:44:12,584 INFO L93 Difference]: Finished difference Result 13903 states and 45015 transitions. [2018-11-28 12:44:12,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 12:44:12,585 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2018-11-28 12:44:12,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:44:12,599 INFO L225 Difference]: With dead ends: 13903 [2018-11-28 12:44:12,599 INFO L226 Difference]: Without dead ends: 13775 [2018-11-28 12:44:12,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:44:12,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13775 states. [2018-11-28 12:44:12,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13775 to 11719. [2018-11-28 12:44:12,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11719 states. [2018-11-28 12:44:12,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11719 states to 11719 states and 38008 transitions. [2018-11-28 12:44:12,720 INFO L78 Accepts]: Start accepts. Automaton has 11719 states and 38008 transitions. Word has length 101 [2018-11-28 12:44:12,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:44:12,720 INFO L480 AbstractCegarLoop]: Abstraction has 11719 states and 38008 transitions. [2018-11-28 12:44:12,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:44:12,720 INFO L276 IsEmpty]: Start isEmpty. Operand 11719 states and 38008 transitions. [2018-11-28 12:44:12,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-28 12:44:12,730 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:44:12,730 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, 1, 1, 1, 1, 1] [2018-11-28 12:44:12,730 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:44:12,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:44:12,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1506595543, now seen corresponding path program 1 times [2018-11-28 12:44:12,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:44:12,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:44:12,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:12,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:44:12,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:44:12,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:44:12,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:44:12,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 12:44:12,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 12:44:12,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 12:44:12,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:44:12,816 INFO L87 Difference]: Start difference. First operand 11719 states and 38008 transitions. Second operand 7 states. [2018-11-28 12:44:13,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:44:13,025 INFO L93 Difference]: Finished difference Result 22183 states and 72336 transitions. [2018-11-28 12:44:13,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 12:44:13,025 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 101 [2018-11-28 12:44:13,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:44:13,037 INFO L225 Difference]: With dead ends: 22183 [2018-11-28 12:44:13,038 INFO L226 Difference]: Without dead ends: 11319 [2018-11-28 12:44:13,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-11-28 12:44:13,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11319 states. [2018-11-28 12:44:13,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11319 to 11059. [2018-11-28 12:44:13,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11059 states. [2018-11-28 12:44:13,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11059 states to 11059 states and 36088 transitions. [2018-11-28 12:44:13,144 INFO L78 Accepts]: Start accepts. Automaton has 11059 states and 36088 transitions. Word has length 101 [2018-11-28 12:44:13,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:44:13,144 INFO L480 AbstractCegarLoop]: Abstraction has 11059 states and 36088 transitions. [2018-11-28 12:44:13,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 12:44:13,144 INFO L276 IsEmpty]: Start isEmpty. Operand 11059 states and 36088 transitions. [2018-11-28 12:44:13,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-28 12:44:13,157 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:44:13,158 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, 1, 1, 1, 1, 1] [2018-11-28 12:44:13,158 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:44:13,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:44:13,158 INFO L82 PathProgramCache]: Analyzing trace with hash -321724473, now seen corresponding path program 2 times [2018-11-28 12:44:13,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:44:13,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:44:13,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:13,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:44:13,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:13,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:44:13,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:44:13,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:44:13,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 12:44:13,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 12:44:13,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 12:44:13,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:44:13,245 INFO L87 Difference]: Start difference. First operand 11059 states and 36088 transitions. Second operand 7 states. [2018-11-28 12:44:13,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:44:13,479 INFO L93 Difference]: Finished difference Result 18635 states and 61462 transitions. [2018-11-28 12:44:13,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 12:44:13,479 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 101 [2018-11-28 12:44:13,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:44:13,488 INFO L225 Difference]: With dead ends: 18635 [2018-11-28 12:44:13,488 INFO L226 Difference]: Without dead ends: 7616 [2018-11-28 12:44:13,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-11-28 12:44:13,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7616 states. [2018-11-28 12:44:13,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7616 to 7616. [2018-11-28 12:44:13,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7616 states. [2018-11-28 12:44:13,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7616 states to 7616 states and 25482 transitions. [2018-11-28 12:44:13,566 INFO L78 Accepts]: Start accepts. Automaton has 7616 states and 25482 transitions. Word has length 101 [2018-11-28 12:44:13,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:44:13,566 INFO L480 AbstractCegarLoop]: Abstraction has 7616 states and 25482 transitions. [2018-11-28 12:44:13,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 12:44:13,566 INFO L276 IsEmpty]: Start isEmpty. Operand 7616 states and 25482 transitions. [2018-11-28 12:44:13,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-28 12:44:13,573 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:44:13,573 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, 1, 1, 1, 1, 1] [2018-11-28 12:44:13,573 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:44:13,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:44:13,573 INFO L82 PathProgramCache]: Analyzing trace with hash 773161459, now seen corresponding path program 3 times [2018-11-28 12:44:13,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:44:13,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:44:13,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:13,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:44:13,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:13,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:44:13,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:44:13,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:44:13,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-28 12:44:13,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 12:44:13,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 12:44:13,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-28 12:44:13,666 INFO L87 Difference]: Start difference. First operand 7616 states and 25482 transitions. Second operand 12 states. [2018-11-28 12:44:14,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:44:14,028 INFO L93 Difference]: Finished difference Result 14444 states and 48675 transitions. [2018-11-28 12:44:14,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-28 12:44:14,028 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 101 [2018-11-28 12:44:14,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:44:14,040 INFO L225 Difference]: With dead ends: 14444 [2018-11-28 12:44:14,040 INFO L226 Difference]: Without dead ends: 10540 [2018-11-28 12:44:14,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-11-28 12:44:14,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10540 states. [2018-11-28 12:44:14,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10540 to 9860. [2018-11-28 12:44:14,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9860 states. [2018-11-28 12:44:14,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9860 states to 9860 states and 32373 transitions. [2018-11-28 12:44:14,137 INFO L78 Accepts]: Start accepts. Automaton has 9860 states and 32373 transitions. Word has length 101 [2018-11-28 12:44:14,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:44:14,138 INFO L480 AbstractCegarLoop]: Abstraction has 9860 states and 32373 transitions. [2018-11-28 12:44:14,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 12:44:14,138 INFO L276 IsEmpty]: Start isEmpty. Operand 9860 states and 32373 transitions. [2018-11-28 12:44:14,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-28 12:44:14,146 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:44:14,147 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, 1, 1, 1, 1, 1] [2018-11-28 12:44:14,147 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:44:14,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:44:14,147 INFO L82 PathProgramCache]: Analyzing trace with hash -350606857, now seen corresponding path program 4 times [2018-11-28 12:44:14,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:44:14,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:44:14,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:14,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:44:14,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:14,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:44:14,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:44:14,192 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 12:44:14,286 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-11-28 12:44:14,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:44:14 BasicIcfg [2018-11-28 12:44:14,288 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 12:44:14,289 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 12:44:14,289 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 12:44:14,289 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 12:44:14,289 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:42:27" (3/4) ... [2018-11-28 12:44:14,291 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 12:44:14,378 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8f8306ff-b85d-44b4-8804-c28ab45422dd/bin-2019/uautomizer/witness.graphml [2018-11-28 12:44:14,378 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 12:44:14,379 INFO L168 Benchmark]: Toolchain (without parser) took 108132.72 ms. Allocated memory was 1.0 GB in the beginning and 7.2 GB in the end (delta: 6.2 GB). Free memory was 951.7 MB in the beginning and 4.1 GB in the end (delta: -3.1 GB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. [2018-11-28 12:44:14,380 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:44:14,380 INFO L168 Benchmark]: CACSL2BoogieTranslator took 423.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -162.0 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. [2018-11-28 12:44:14,380 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.74 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-28 12:44:14,380 INFO L168 Benchmark]: Boogie Preprocessor took 27.81 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-28 12:44:14,380 INFO L168 Benchmark]: RCFGBuilder took 473.36 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: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. [2018-11-28 12:44:14,381 INFO L168 Benchmark]: TraceAbstraction took 107075.03 ms. Allocated memory was 1.2 GB in the beginning and 7.2 GB in the end (delta: 6.1 GB). Free memory was 1.1 GB in the beginning and 4.1 GB in the end (delta: -3.1 GB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. [2018-11-28 12:44:14,381 INFO L168 Benchmark]: Witness Printer took 89.54 ms. Allocated memory is still 7.2 GB. Free memory was 4.1 GB in the beginning and 4.1 GB in the end (delta: 42.8 MB). Peak memory consumption was 42.8 MB. Max. memory is 11.5 GB. [2018-11-28 12:44:14,382 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 423.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -162.0 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.74 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.81 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 473.36 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: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 107075.03 ms. Allocated memory was 1.2 GB in the beginning and 7.2 GB in the end (delta: 6.1 GB). Free memory was 1.1 GB in the beginning and 4.1 GB in the end (delta: -3.1 GB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. * Witness Printer took 89.54 ms. Allocated memory is still 7.2 GB. Free memory was 4.1 GB in the beginning and 4.1 GB in the end (delta: 42.8 MB). Peak memory consumption was 42.8 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: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L674] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L676] -1 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L678] -1 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L679] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L680] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L681] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=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] [L682] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=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] [L683] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=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] [L684] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=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_buff0_thd3=0] [L685] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=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_buff0_thd3=0, y$r_buff1_thd0=0] [L686] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L687] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L688] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L689] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L690] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L691] -1 int y$w_buff0; VAL [__unbuffered_cnt=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L692] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L693] -1 int y$w_buff1; VAL [__unbuffered_cnt=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L694] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L696] -1 int z = 0; VAL [__unbuffered_cnt=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L697] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L698] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L774] -1 pthread_t t2500; VAL [__unbuffered_cnt=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L775] FCALL, FORK -1 pthread_create(&t2500, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L776] -1 pthread_t t2501; VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L777] FCALL, FORK -1 pthread_create(&t2501, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L778] -1 pthread_t t2502; VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] FCALL, FORK -1 pthread_create(&t2502, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L737] 0 y$w_buff1 = y$w_buff0 [L738] 0 y$w_buff0 = 2 [L739] 0 y$w_buff1_used = y$w_buff0_used [L740] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L742] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L743] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L744] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L745] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L746] 0 y$r_buff0_thd3 = (_Bool)1 [L749] 0 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L702] 1 z = 2 [L705] 1 x = 1 [L710] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L752] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L717] 2 x = 2 [L720] 2 y = 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L752] 0 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L753] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L754] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L754] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L755] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L755] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L756] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L756] 0 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L759] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L723] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L723] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2, z=2] [L723] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2, z=2] [L723] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L724] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L724] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L725] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_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, z=2] [L725] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L726] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L726] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L727] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_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, z=2] [L727] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L730] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L781] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L785] 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=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L785] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L785] 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=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L785] -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) [L786] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L786] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L787] 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=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L787] -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 [L788] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L788] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L789] 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=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L789] -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 [L792] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L793] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L794] -1 y$flush_delayed = weak$$choice2 [L795] -1 y$mem_tmp = y VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L796] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L796] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L797] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L797] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L798] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L798] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L799] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L799] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L800] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L800] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L801] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L801] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L802] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L802] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] -1 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L804] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L804] -1 y = y$flush_delayed ? y$mem_tmp : y [L805] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 197 locations, 3 error locations. UNSAFE Result, 106.9s OverallTime, 32 OverallIterations, 1 TraceHistogramMax, 36.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8069 SDtfs, 8149 SDslu, 19998 SDs, 0 SdLazy, 8064 SolverSat, 485 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 352 GetRequests, 106 SyntacticMatches, 21 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=220276occurred in iteration=7, 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: 50.6s AutomataMinimizationTime, 31 MinimizatonAttempts, 667571 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 2698 NumberOfCodeBlocks, 2698 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2566 ConstructedInterpolants, 0 QuantifiedInterpolants, 587955 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...