./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix056_power.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4de0d6bb-8594-4cb9-9a9f-22514adf67f0/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4de0d6bb-8594-4cb9-9a9f-22514adf67f0/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4de0d6bb-8594-4cb9-9a9f-22514adf67f0/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4de0d6bb-8594-4cb9-9a9f-22514adf67f0/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix056_power.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4de0d6bb-8594-4cb9-9a9f-22514adf67f0/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4de0d6bb-8594-4cb9-9a9f-22514adf67f0/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 11fa2b8d910d21555da4623eb76d0ce1a4371d15 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 09:41:54,675 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 09:41:54,676 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 09:41:54,684 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 09:41:54,684 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 09:41:54,685 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 09:41:54,685 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 09:41:54,687 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 09:41:54,688 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 09:41:54,688 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 09:41:54,689 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 09:41:54,689 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 09:41:54,690 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 09:41:54,690 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 09:41:54,691 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 09:41:54,691 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 09:41:54,692 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 09:41:54,692 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 09:41:54,694 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 09:41:54,695 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 09:41:54,696 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 09:41:54,697 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 09:41:54,698 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 09:41:54,698 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 09:41:54,699 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 09:41:54,699 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 09:41:54,700 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 09:41:54,700 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 09:41:54,701 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 09:41:54,701 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 09:41:54,702 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 09:41:54,702 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 09:41:54,702 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 09:41:54,702 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 09:41:54,703 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 09:41:54,703 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 09:41:54,704 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4de0d6bb-8594-4cb9-9a9f-22514adf67f0/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-08 09:41:54,714 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 09:41:54,714 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 09:41:54,715 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 09:41:54,715 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 09:41:54,715 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 09:41:54,715 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 09:41:54,716 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 09:41:54,716 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 09:41:54,716 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 09:41:54,716 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 09:41:54,716 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 09:41:54,716 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 09:41:54,717 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 09:41:54,717 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 09:41:54,717 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 09:41:54,717 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 09:41:54,717 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 09:41:54,717 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 09:41:54,717 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 09:41:54,718 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 09:41:54,718 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 09:41:54,718 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 09:41:54,718 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 09:41:54,718 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 09:41:54,718 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 09:41:54,719 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 09:41:54,719 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 09:41:54,719 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 09:41:54,719 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 09:41:54,719 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 09:41:54,719 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_4de0d6bb-8594-4cb9-9a9f-22514adf67f0/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 -> 11fa2b8d910d21555da4623eb76d0ce1a4371d15 [2018-12-08 09:41:54,743 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 09:41:54,752 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 09:41:54,754 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 09:41:54,755 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 09:41:54,756 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 09:41:54,756 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4de0d6bb-8594-4cb9-9a9f-22514adf67f0/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix056_power.opt_false-unreach-call.i [2018-12-08 09:41:54,798 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4de0d6bb-8594-4cb9-9a9f-22514adf67f0/bin-2019/uautomizer/data/851b64468/db7d370d976f4f91bef2ab232d12e2a9/FLAGdcea582c2 [2018-12-08 09:41:55,259 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 09:41:55,260 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4de0d6bb-8594-4cb9-9a9f-22514adf67f0/sv-benchmarks/c/pthread-wmm/mix056_power.opt_false-unreach-call.i [2018-12-08 09:41:55,269 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4de0d6bb-8594-4cb9-9a9f-22514adf67f0/bin-2019/uautomizer/data/851b64468/db7d370d976f4f91bef2ab232d12e2a9/FLAGdcea582c2 [2018-12-08 09:41:55,777 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4de0d6bb-8594-4cb9-9a9f-22514adf67f0/bin-2019/uautomizer/data/851b64468/db7d370d976f4f91bef2ab232d12e2a9 [2018-12-08 09:41:55,780 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 09:41:55,780 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 09:41:55,781 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 09:41:55,781 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 09:41:55,784 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 09:41:55,785 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 09:41:55" (1/1) ... [2018-12-08 09:41:55,787 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68cabf0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:41:55, skipping insertion in model container [2018-12-08 09:41:55,787 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 09:41:55" (1/1) ... [2018-12-08 09:41:55,793 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 09:41:55,819 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 09:41:56,024 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 09:41:56,031 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 09:41:56,109 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 09:41:56,138 INFO L195 MainTranslator]: Completed translation [2018-12-08 09:41:56,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:41:56 WrapperNode [2018-12-08 09:41:56,139 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 09:41:56,139 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 09:41:56,139 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 09:41:56,139 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 09:41:56,144 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:41:56" (1/1) ... [2018-12-08 09:41:56,155 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:41:56" (1/1) ... [2018-12-08 09:41:56,172 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 09:41:56,172 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 09:41:56,172 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 09:41:56,172 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 09:41:56,178 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:41:56" (1/1) ... [2018-12-08 09:41:56,178 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:41:56" (1/1) ... [2018-12-08 09:41:56,181 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:41:56" (1/1) ... [2018-12-08 09:41:56,181 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:41:56" (1/1) ... [2018-12-08 09:41:56,186 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:41:56" (1/1) ... [2018-12-08 09:41:56,188 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:41:56" (1/1) ... [2018-12-08 09:41:56,190 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:41:56" (1/1) ... [2018-12-08 09:41:56,192 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 09:41:56,192 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 09:41:56,192 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 09:41:56,192 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 09:41:56,193 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:41:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4de0d6bb-8594-4cb9-9a9f-22514adf67f0/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 09:41:56,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 09:41:56,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 09:41:56,225 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-08 09:41:56,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 09:41:56,225 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-08 09:41:56,225 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-08 09:41:56,225 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-08 09:41:56,225 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-08 09:41:56,225 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-08 09:41:56,225 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-08 09:41:56,225 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-08 09:41:56,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 09:41:56,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 09:41:56,226 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-08 09:41:56,518 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 09:41:56,518 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-08 09:41:56,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 09:41:56 BoogieIcfgContainer [2018-12-08 09:41:56,519 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 09:41:56,519 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 09:41:56,519 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 09:41:56,521 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 09:41:56,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 09:41:55" (1/3) ... [2018-12-08 09:41:56,521 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@347bc3fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 09:41:56, skipping insertion in model container [2018-12-08 09:41:56,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:41:56" (2/3) ... [2018-12-08 09:41:56,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@347bc3fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 09:41:56, skipping insertion in model container [2018-12-08 09:41:56,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 09:41:56" (3/3) ... [2018-12-08 09:41:56,523 INFO L112 eAbstractionObserver]: Analyzing ICFG mix056_power.opt_false-unreach-call.i [2018-12-08 09:41:56,545 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,545 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,545 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,545 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,546 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,546 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,546 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,546 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,546 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,546 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,546 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,546 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,546 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,546 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,547 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,547 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,547 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,547 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,547 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,547 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,547 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,547 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,547 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,547 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,547 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,548 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,548 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,548 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,548 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,548 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,548 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,548 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,548 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,548 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,548 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,549 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,549 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,549 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,549 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,549 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,549 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,549 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,549 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,549 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,550 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,550 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,550 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,550 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,550 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,550 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,550 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,550 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,550 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,550 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,550 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,551 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,551 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,551 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,551 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,551 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,551 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,551 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,551 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,551 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,551 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,551 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,552 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,552 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,552 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,552 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,552 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,552 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,552 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,552 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,552 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,552 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,553 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,553 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,553 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,553 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,553 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,553 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:41:56,557 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-08 09:41:56,557 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 09:41:56,562 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-08 09:41:56,571 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-08 09:41:56,585 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 09:41:56,586 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 09:41:56,586 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 09:41:56,586 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 09:41:56,586 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 09:41:56,586 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 09:41:56,586 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 09:41:56,586 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 09:41:56,586 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 09:41:56,593 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 155places, 192 transitions [2018-12-08 09:42:11,377 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 128912 states. [2018-12-08 09:42:11,378 INFO L276 IsEmpty]: Start isEmpty. Operand 128912 states. [2018-12-08 09:42:11,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-08 09:42:11,385 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:42:11,385 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:42:11,387 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:42:11,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:42:11,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1928541482, now seen corresponding path program 1 times [2018-12-08 09:42:11,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:42:11,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:42:11,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:42:11,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:42:11,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:42:11,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:42:11,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:42:11,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:42:11,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 09:42:11,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 09:42:11,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 09:42:11,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 09:42:11,554 INFO L87 Difference]: Start difference. First operand 128912 states. Second operand 4 states. [2018-12-08 09:42:14,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:42:14,435 INFO L93 Difference]: Finished difference Result 233472 states and 1098324 transitions. [2018-12-08 09:42:14,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 09:42:14,436 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-12-08 09:42:14,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:42:15,152 INFO L225 Difference]: With dead ends: 233472 [2018-12-08 09:42:15,152 INFO L226 Difference]: Without dead ends: 203722 [2018-12-08 09:42:15,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 09:42:16,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203722 states. [2018-12-08 09:42:18,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203722 to 118892. [2018-12-08 09:42:18,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118892 states. [2018-12-08 09:42:18,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118892 states to 118892 states and 559775 transitions. [2018-12-08 09:42:18,524 INFO L78 Accepts]: Start accepts. Automaton has 118892 states and 559775 transitions. Word has length 43 [2018-12-08 09:42:18,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:42:18,525 INFO L480 AbstractCegarLoop]: Abstraction has 118892 states and 559775 transitions. [2018-12-08 09:42:18,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 09:42:18,525 INFO L276 IsEmpty]: Start isEmpty. Operand 118892 states and 559775 transitions. [2018-12-08 09:42:18,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-08 09:42:18,534 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:42:18,535 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-12-08 09:42:18,535 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:42:18,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:42:18,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1195634893, now seen corresponding path program 1 times [2018-12-08 09:42:18,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:42:18,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:42:18,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:42:18,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:42:18,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:42:18,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:42:18,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:42:18,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:42:18,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 09:42:18,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 09:42:18,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 09:42:18,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 09:42:18,592 INFO L87 Difference]: Start difference. First operand 118892 states and 559775 transitions. Second operand 3 states. [2018-12-08 09:42:19,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:42:19,516 INFO L93 Difference]: Finished difference Result 118892 states and 557815 transitions. [2018-12-08 09:42:19,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 09:42:19,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-08 09:42:19,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:42:19,835 INFO L225 Difference]: With dead ends: 118892 [2018-12-08 09:42:19,835 INFO L226 Difference]: Without dead ends: 118892 [2018-12-08 09:42:19,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 09:42:20,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118892 states. [2018-12-08 09:42:23,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118892 to 118892. [2018-12-08 09:42:23,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118892 states. [2018-12-08 09:42:23,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118892 states to 118892 states and 557815 transitions. [2018-12-08 09:42:23,926 INFO L78 Accepts]: Start accepts. Automaton has 118892 states and 557815 transitions. Word has length 50 [2018-12-08 09:42:23,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:42:23,927 INFO L480 AbstractCegarLoop]: Abstraction has 118892 states and 557815 transitions. [2018-12-08 09:42:23,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 09:42:23,927 INFO L276 IsEmpty]: Start isEmpty. Operand 118892 states and 557815 transitions. [2018-12-08 09:42:23,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-08 09:42:23,930 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:42:23,930 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-12-08 09:42:23,930 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:42:23,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:42:23,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1302381044, now seen corresponding path program 1 times [2018-12-08 09:42:23,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:42:23,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:42:23,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:42:23,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:42:23,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:42:23,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:42:23,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:42:23,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:42:23,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 09:42:23,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 09:42:23,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 09:42:23,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 09:42:23,981 INFO L87 Difference]: Start difference. First operand 118892 states and 557815 transitions. Second operand 5 states. [2018-12-08 09:42:25,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:42:25,559 INFO L93 Difference]: Finished difference Result 325272 states and 1468249 transitions. [2018-12-08 09:42:25,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 09:42:25,560 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-12-08 09:42:25,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:42:26,953 INFO L225 Difference]: With dead ends: 325272 [2018-12-08 09:42:26,953 INFO L226 Difference]: Without dead ends: 324272 [2018-12-08 09:42:26,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-08 09:42:28,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324272 states. [2018-12-08 09:42:33,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324272 to 186422. [2018-12-08 09:42:33,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186422 states. [2018-12-08 09:42:33,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186422 states to 186422 states and 840914 transitions. [2018-12-08 09:42:33,919 INFO L78 Accepts]: Start accepts. Automaton has 186422 states and 840914 transitions. Word has length 50 [2018-12-08 09:42:33,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:42:33,920 INFO L480 AbstractCegarLoop]: Abstraction has 186422 states and 840914 transitions. [2018-12-08 09:42:33,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 09:42:33,920 INFO L276 IsEmpty]: Start isEmpty. Operand 186422 states and 840914 transitions. [2018-12-08 09:42:33,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-08 09:42:33,925 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:42:33,925 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-12-08 09:42:33,925 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:42:33,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:42:33,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1678185933, now seen corresponding path program 1 times [2018-12-08 09:42:33,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:42:33,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:42:33,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:42:33,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:42:33,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:42:33,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:42:33,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:42:33,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:42:33,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 09:42:33,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 09:42:33,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 09:42:33,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 09:42:33,968 INFO L87 Difference]: Start difference. First operand 186422 states and 840914 transitions. Second operand 5 states. [2018-12-08 09:42:36,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:42:36,112 INFO L93 Difference]: Finished difference Result 334052 states and 1500993 transitions. [2018-12-08 09:42:36,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 09:42:36,113 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2018-12-08 09:42:36,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:42:36,991 INFO L225 Difference]: With dead ends: 334052 [2018-12-08 09:42:36,992 INFO L226 Difference]: Without dead ends: 333002 [2018-12-08 09:42:36,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-08 09:42:38,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333002 states. [2018-12-08 09:42:44,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333002 to 194882. [2018-12-08 09:42:44,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194882 states. [2018-12-08 09:42:44,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194882 states to 194882 states and 876472 transitions. [2018-12-08 09:42:44,666 INFO L78 Accepts]: Start accepts. Automaton has 194882 states and 876472 transitions. Word has length 51 [2018-12-08 09:42:44,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:42:44,666 INFO L480 AbstractCegarLoop]: Abstraction has 194882 states and 876472 transitions. [2018-12-08 09:42:44,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 09:42:44,666 INFO L276 IsEmpty]: Start isEmpty. Operand 194882 states and 876472 transitions. [2018-12-08 09:42:44,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-08 09:42:44,690 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:42:44,691 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-12-08 09:42:44,691 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:42:44,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:42:44,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1402455913, now seen corresponding path program 1 times [2018-12-08 09:42:44,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:42:44,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:42:44,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:42:44,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:42:44,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:42:44,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:42:44,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:42:44,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:42:44,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 09:42:44,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 09:42:44,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 09:42:44,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 09:42:44,740 INFO L87 Difference]: Start difference. First operand 194882 states and 876472 transitions. Second operand 6 states. [2018-12-08 09:42:46,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:42:46,879 INFO L93 Difference]: Finished difference Result 342292 states and 1509975 transitions. [2018-12-08 09:42:46,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 09:42:46,880 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-12-08 09:42:46,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:42:47,776 INFO L225 Difference]: With dead ends: 342292 [2018-12-08 09:42:47,776 INFO L226 Difference]: Without dead ends: 341292 [2018-12-08 09:42:47,777 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-12-08 09:42:49,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341292 states. [2018-12-08 09:42:52,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341292 to 189132. [2018-12-08 09:42:52,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189132 states. [2018-12-08 09:42:53,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189132 states to 189132 states and 850672 transitions. [2018-12-08 09:42:53,375 INFO L78 Accepts]: Start accepts. Automaton has 189132 states and 850672 transitions. Word has length 58 [2018-12-08 09:42:53,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:42:53,375 INFO L480 AbstractCegarLoop]: Abstraction has 189132 states and 850672 transitions. [2018-12-08 09:42:53,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 09:42:53,375 INFO L276 IsEmpty]: Start isEmpty. Operand 189132 states and 850672 transitions. [2018-12-08 09:42:53,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-08 09:42:53,442 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:42:53,442 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-12-08 09:42:53,443 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:42:53,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:42:53,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1292775433, now seen corresponding path program 1 times [2018-12-08 09:42:53,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:42:53,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:42:53,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:42:53,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:42:53,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:42:53,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:42:53,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:42:53,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:42:53,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 09:42:53,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 09:42:53,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 09:42:53,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 09:42:53,503 INFO L87 Difference]: Start difference. First operand 189132 states and 850672 transitions. Second operand 5 states. [2018-12-08 09:42:57,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:42:57,014 INFO L93 Difference]: Finished difference Result 312432 states and 1393397 transitions. [2018-12-08 09:42:57,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 09:42:57,015 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-12-08 09:42:57,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:42:57,851 INFO L225 Difference]: With dead ends: 312432 [2018-12-08 09:42:57,851 INFO L226 Difference]: Without dead ends: 311792 [2018-12-08 09:42:57,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-08 09:42:59,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311792 states. [2018-12-08 09:43:02,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311792 to 298522. [2018-12-08 09:43:02,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298522 states. [2018-12-08 09:43:03,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298522 states to 298522 states and 1334099 transitions. [2018-12-08 09:43:03,693 INFO L78 Accepts]: Start accepts. Automaton has 298522 states and 1334099 transitions. Word has length 65 [2018-12-08 09:43:03,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:43:03,693 INFO L480 AbstractCegarLoop]: Abstraction has 298522 states and 1334099 transitions. [2018-12-08 09:43:03,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 09:43:03,693 INFO L276 IsEmpty]: Start isEmpty. Operand 298522 states and 1334099 transitions. [2018-12-08 09:43:04,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-08 09:43:04,194 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:43:04,194 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-12-08 09:43:04,195 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:43:04,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:43:04,195 INFO L82 PathProgramCache]: Analyzing trace with hash 2024042264, now seen corresponding path program 1 times [2018-12-08 09:43:04,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:43:04,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:43:04,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:43:04,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:43:04,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:43:04,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:43:04,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:43:04,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:43:04,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 09:43:04,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 09:43:04,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 09:43:04,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 09:43:04,239 INFO L87 Difference]: Start difference. First operand 298522 states and 1334099 transitions. Second operand 6 states. [2018-12-08 09:43:07,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:43:07,789 INFO L93 Difference]: Finished difference Result 617312 states and 2720261 transitions. [2018-12-08 09:43:07,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 09:43:07,790 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-12-08 09:43:07,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:43:13,708 INFO L225 Difference]: With dead ends: 617312 [2018-12-08 09:43:13,708 INFO L226 Difference]: Without dead ends: 615712 [2018-12-08 09:43:13,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-08 09:43:15,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615712 states. [2018-12-08 09:43:21,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615712 to 353817. [2018-12-08 09:43:21,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353817 states. [2018-12-08 09:43:22,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353817 states to 353817 states and 1566315 transitions. [2018-12-08 09:43:22,467 INFO L78 Accepts]: Start accepts. Automaton has 353817 states and 1566315 transitions. Word has length 65 [2018-12-08 09:43:22,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:43:22,467 INFO L480 AbstractCegarLoop]: Abstraction has 353817 states and 1566315 transitions. [2018-12-08 09:43:22,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 09:43:22,468 INFO L276 IsEmpty]: Start isEmpty. Operand 353817 states and 1566315 transitions. [2018-12-08 09:43:23,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-08 09:43:23,099 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:43:23,099 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:43:23,099 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:43:23,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:43:23,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1275093964, now seen corresponding path program 1 times [2018-12-08 09:43:23,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:43:23,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:43:23,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:43:23,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:43:23,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:43:23,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:43:23,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:43:23,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:43:23,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 09:43:23,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 09:43:23,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 09:43:23,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 09:43:23,121 INFO L87 Difference]: Start difference. First operand 353817 states and 1566315 transitions. Second operand 3 states. [2018-12-08 09:43:25,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:43:25,735 INFO L93 Difference]: Finished difference Result 438907 states and 1917857 transitions. [2018-12-08 09:43:25,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 09:43:25,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-08 09:43:25,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:43:26,936 INFO L225 Difference]: With dead ends: 438907 [2018-12-08 09:43:26,936 INFO L226 Difference]: Without dead ends: 438907 [2018-12-08 09:43:26,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 09:43:28,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438907 states. [2018-12-08 09:43:37,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438907 to 375852. [2018-12-08 09:43:37,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375852 states. [2018-12-08 09:43:38,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375852 states to 375852 states and 1658793 transitions. [2018-12-08 09:43:38,724 INFO L78 Accepts]: Start accepts. Automaton has 375852 states and 1658793 transitions. Word has length 67 [2018-12-08 09:43:38,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:43:38,725 INFO L480 AbstractCegarLoop]: Abstraction has 375852 states and 1658793 transitions. [2018-12-08 09:43:38,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 09:43:38,725 INFO L276 IsEmpty]: Start isEmpty. Operand 375852 states and 1658793 transitions. [2018-12-08 09:43:38,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-08 09:43:38,989 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:43:38,989 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] [2018-12-08 09:43:38,989 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:43:38,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:43:38,990 INFO L82 PathProgramCache]: Analyzing trace with hash -567092309, now seen corresponding path program 1 times [2018-12-08 09:43:38,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:43:38,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:43:38,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:43:38,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:43:38,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:43:38,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:43:39,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:43:39,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:43:39,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 09:43:39,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 09:43:39,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 09:43:39,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 09:43:39,045 INFO L87 Difference]: Start difference. First operand 375852 states and 1658793 transitions. Second operand 7 states. [2018-12-08 09:43:43,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:43:43,549 INFO L93 Difference]: Finished difference Result 675132 states and 2945642 transitions. [2018-12-08 09:43:43,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-08 09:43:43,550 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2018-12-08 09:43:43,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:43:45,940 INFO L225 Difference]: With dead ends: 675132 [2018-12-08 09:43:45,940 INFO L226 Difference]: Without dead ends: 673532 [2018-12-08 09:43:45,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2018-12-08 09:43:47,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673532 states. [2018-12-08 09:43:59,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673532 to 385502. [2018-12-08 09:43:59,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385502 states. [2018-12-08 09:44:01,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385502 states to 385502 states and 1698383 transitions. [2018-12-08 09:44:01,338 INFO L78 Accepts]: Start accepts. Automaton has 385502 states and 1698383 transitions. Word has length 71 [2018-12-08 09:44:01,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:44:01,338 INFO L480 AbstractCegarLoop]: Abstraction has 385502 states and 1698383 transitions. [2018-12-08 09:44:01,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 09:44:01,338 INFO L276 IsEmpty]: Start isEmpty. Operand 385502 states and 1698383 transitions. [2018-12-08 09:44:01,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-08 09:44:01,633 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:44:01,634 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:44:01,634 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:44:01,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:44:01,634 INFO L82 PathProgramCache]: Analyzing trace with hash 243525730, now seen corresponding path program 1 times [2018-12-08 09:44:01,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:44:01,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:44:01,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:01,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:44:01,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:01,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:44:01,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:44:01,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:44:01,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 09:44:01,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 09:44:01,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 09:44:01,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 09:44:01,685 INFO L87 Difference]: Start difference. First operand 385502 states and 1698383 transitions. Second operand 7 states. [2018-12-08 09:44:05,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:44:05,043 INFO L93 Difference]: Finished difference Result 515737 states and 2256101 transitions. [2018-12-08 09:44:05,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-08 09:44:05,044 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2018-12-08 09:44:05,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:44:06,869 INFO L225 Difference]: With dead ends: 515737 [2018-12-08 09:44:06,869 INFO L226 Difference]: Without dead ends: 514387 [2018-12-08 09:44:06,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2018-12-08 09:44:08,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514387 states. [2018-12-08 09:44:14,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514387 to 389347. [2018-12-08 09:44:14,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389347 states. [2018-12-08 09:44:16,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389347 states to 389347 states and 1713924 transitions. [2018-12-08 09:44:16,276 INFO L78 Accepts]: Start accepts. Automaton has 389347 states and 1713924 transitions. Word has length 72 [2018-12-08 09:44:16,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:44:16,277 INFO L480 AbstractCegarLoop]: Abstraction has 389347 states and 1713924 transitions. [2018-12-08 09:44:16,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 09:44:16,277 INFO L276 IsEmpty]: Start isEmpty. Operand 389347 states and 1713924 transitions. [2018-12-08 09:44:16,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-08 09:44:16,620 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:44:16,620 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:44:16,620 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:44:16,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:44:16,620 INFO L82 PathProgramCache]: Analyzing trace with hash 146003645, now seen corresponding path program 1 times [2018-12-08 09:44:16,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:44:16,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:44:16,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:16,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:44:16,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:16,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:44:16,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:44:16,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:44:16,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 09:44:16,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 09:44:16,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 09:44:16,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 09:44:16,679 INFO L87 Difference]: Start difference. First operand 389347 states and 1713924 transitions. Second operand 6 states. [2018-12-08 09:44:24,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:44:24,039 INFO L93 Difference]: Finished difference Result 508422 states and 2226794 transitions. [2018-12-08 09:44:24,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 09:44:24,040 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2018-12-08 09:44:24,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:44:25,462 INFO L225 Difference]: With dead ends: 508422 [2018-12-08 09:44:25,462 INFO L226 Difference]: Without dead ends: 502462 [2018-12-08 09:44:25,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-08 09:44:27,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502462 states. [2018-12-08 09:44:33,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502462 to 439622. [2018-12-08 09:44:33,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439622 states. [2018-12-08 09:44:34,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439622 states to 439622 states and 1937949 transitions. [2018-12-08 09:44:34,826 INFO L78 Accepts]: Start accepts. Automaton has 439622 states and 1937949 transitions. Word has length 74 [2018-12-08 09:44:34,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:44:34,827 INFO L480 AbstractCegarLoop]: Abstraction has 439622 states and 1937949 transitions. [2018-12-08 09:44:34,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 09:44:34,827 INFO L276 IsEmpty]: Start isEmpty. Operand 439622 states and 1937949 transitions. [2018-12-08 09:44:35,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-08 09:44:35,244 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:44:35,244 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] [2018-12-08 09:44:35,244 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:44:35,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:44:35,244 INFO L82 PathProgramCache]: Analyzing trace with hash -137146819, now seen corresponding path program 1 times [2018-12-08 09:44:35,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:44:35,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:44:35,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:35,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:44:35,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:35,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:44:35,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:44:35,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:44:35,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 09:44:35,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 09:44:35,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 09:44:35,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 09:44:35,319 INFO L87 Difference]: Start difference. First operand 439622 states and 1937949 transitions. Second operand 7 states. [2018-12-08 09:44:39,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:44:39,202 INFO L93 Difference]: Finished difference Result 590157 states and 2550697 transitions. [2018-12-08 09:44:39,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 09:44:39,203 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-12-08 09:44:39,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:44:40,852 INFO L225 Difference]: With dead ends: 590157 [2018-12-08 09:44:40,853 INFO L226 Difference]: Without dead ends: 590157 [2018-12-08 09:44:40,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-08 09:44:43,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590157 states. [2018-12-08 09:44:55,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590157 to 542807. [2018-12-08 09:44:55,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542807 states. [2018-12-08 09:44:57,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542807 states to 542807 states and 2362207 transitions. [2018-12-08 09:44:57,474 INFO L78 Accepts]: Start accepts. Automaton has 542807 states and 2362207 transitions. Word has length 74 [2018-12-08 09:44:57,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:44:57,474 INFO L480 AbstractCegarLoop]: Abstraction has 542807 states and 2362207 transitions. [2018-12-08 09:44:57,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 09:44:57,475 INFO L276 IsEmpty]: Start isEmpty. Operand 542807 states and 2362207 transitions. [2018-12-08 09:44:58,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-08 09:44:58,006 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:44:58,006 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] [2018-12-08 09:44:58,006 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:44:58,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:44:58,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1107617662, now seen corresponding path program 1 times [2018-12-08 09:44:58,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:44:58,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:44:58,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:58,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:44:58,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:44:58,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:44:58,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:44:58,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:44:58,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 09:44:58,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 09:44:58,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 09:44:58,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 09:44:58,045 INFO L87 Difference]: Start difference. First operand 542807 states and 2362207 transitions. Second operand 4 states. [2018-12-08 09:45:01,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:45:01,130 INFO L93 Difference]: Finished difference Result 469758 states and 2015930 transitions. [2018-12-08 09:45:01,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 09:45:01,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2018-12-08 09:45:01,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:45:02,415 INFO L225 Difference]: With dead ends: 469758 [2018-12-08 09:45:02,415 INFO L226 Difference]: Without dead ends: 467053 [2018-12-08 09:45:02,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 09:45:09,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467053 states. [2018-12-08 09:45:14,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467053 to 467053. [2018-12-08 09:45:14,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467053 states. [2018-12-08 09:45:16,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467053 states to 467053 states and 2006968 transitions. [2018-12-08 09:45:16,345 INFO L78 Accepts]: Start accepts. Automaton has 467053 states and 2006968 transitions. Word has length 74 [2018-12-08 09:45:16,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:45:16,345 INFO L480 AbstractCegarLoop]: Abstraction has 467053 states and 2006968 transitions. [2018-12-08 09:45:16,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 09:45:16,345 INFO L276 IsEmpty]: Start isEmpty. Operand 467053 states and 2006968 transitions. [2018-12-08 09:45:16,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-08 09:45:16,810 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:45:16,810 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] [2018-12-08 09:45:16,811 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:45:16,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:45:16,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1793024226, now seen corresponding path program 1 times [2018-12-08 09:45:16,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:45:16,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:45:16,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:16,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:45:16,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:16,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:45:16,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:45:16,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:45:16,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 09:45:16,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 09:45:16,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 09:45:16,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 09:45:16,844 INFO L87 Difference]: Start difference. First operand 467053 states and 2006968 transitions. Second operand 5 states. [2018-12-08 09:45:17,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:45:17,389 INFO L93 Difference]: Finished difference Result 137697 states and 546963 transitions. [2018-12-08 09:45:17,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 09:45:17,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2018-12-08 09:45:17,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:45:17,698 INFO L225 Difference]: With dead ends: 137697 [2018-12-08 09:45:17,698 INFO L226 Difference]: Without dead ends: 135305 [2018-12-08 09:45:17,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-08 09:45:17,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135305 states. [2018-12-08 09:45:19,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135305 to 135245. [2018-12-08 09:45:19,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135245 states. [2018-12-08 09:45:19,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135245 states to 135245 states and 537799 transitions. [2018-12-08 09:45:19,918 INFO L78 Accepts]: Start accepts. Automaton has 135245 states and 537799 transitions. Word has length 75 [2018-12-08 09:45:19,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:45:19,919 INFO L480 AbstractCegarLoop]: Abstraction has 135245 states and 537799 transitions. [2018-12-08 09:45:19,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 09:45:19,919 INFO L276 IsEmpty]: Start isEmpty. Operand 135245 states and 537799 transitions. [2018-12-08 09:45:20,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-08 09:45:20,044 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:45:20,044 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] [2018-12-08 09:45:20,045 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:45:20,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:45:20,045 INFO L82 PathProgramCache]: Analyzing trace with hash -405984454, now seen corresponding path program 1 times [2018-12-08 09:45:20,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:45:20,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:45:20,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:20,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:45:20,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:20,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:45:20,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:45:20,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:45:20,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 09:45:20,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 09:45:20,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 09:45:20,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 09:45:20,086 INFO L87 Difference]: Start difference. First operand 135245 states and 537799 transitions. Second operand 4 states. [2018-12-08 09:45:21,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:45:21,006 INFO L93 Difference]: Finished difference Result 169525 states and 668412 transitions. [2018-12-08 09:45:21,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 09:45:21,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2018-12-08 09:45:21,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:45:21,375 INFO L225 Difference]: With dead ends: 169525 [2018-12-08 09:45:21,375 INFO L226 Difference]: Without dead ends: 169525 [2018-12-08 09:45:21,375 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-12-08 09:45:21,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169525 states. [2018-12-08 09:45:23,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169525 to 140469. [2018-12-08 09:45:23,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140469 states. [2018-12-08 09:45:23,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140469 states to 140469 states and 557228 transitions. [2018-12-08 09:45:23,725 INFO L78 Accepts]: Start accepts. Automaton has 140469 states and 557228 transitions. Word has length 85 [2018-12-08 09:45:23,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:45:23,725 INFO L480 AbstractCegarLoop]: Abstraction has 140469 states and 557228 transitions. [2018-12-08 09:45:23,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 09:45:23,725 INFO L276 IsEmpty]: Start isEmpty. Operand 140469 states and 557228 transitions. [2018-12-08 09:45:23,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-08 09:45:23,861 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:45:23,861 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] [2018-12-08 09:45:23,862 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:45:23,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:45:23,862 INFO L82 PathProgramCache]: Analyzing trace with hash -660720999, now seen corresponding path program 1 times [2018-12-08 09:45:23,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:45:23,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:45:23,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:23,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:45:23,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:23,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:45:23,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:45:23,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:45:23,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 09:45:23,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 09:45:23,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 09:45:23,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-08 09:45:23,911 INFO L87 Difference]: Start difference. First operand 140469 states and 557228 transitions. Second operand 6 states. [2018-12-08 09:45:24,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:45:24,010 INFO L93 Difference]: Finished difference Result 20597 states and 70892 transitions. [2018-12-08 09:45:24,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 09:45:24,010 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2018-12-08 09:45:24,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:45:24,033 INFO L225 Difference]: With dead ends: 20597 [2018-12-08 09:45:24,033 INFO L226 Difference]: Without dead ends: 18885 [2018-12-08 09:45:24,034 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-12-08 09:45:24,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18885 states. [2018-12-08 09:45:24,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18885 to 18370. [2018-12-08 09:45:24,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18370 states. [2018-12-08 09:45:24,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18370 states to 18370 states and 63196 transitions. [2018-12-08 09:45:24,492 INFO L78 Accepts]: Start accepts. Automaton has 18370 states and 63196 transitions. Word has length 85 [2018-12-08 09:45:24,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:45:24,492 INFO L480 AbstractCegarLoop]: Abstraction has 18370 states and 63196 transitions. [2018-12-08 09:45:24,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 09:45:24,492 INFO L276 IsEmpty]: Start isEmpty. Operand 18370 states and 63196 transitions. [2018-12-08 09:45:24,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-08 09:45:24,507 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:45:24,507 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] [2018-12-08 09:45:24,507 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:45:24,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:45:24,507 INFO L82 PathProgramCache]: Analyzing trace with hash 45027742, now seen corresponding path program 1 times [2018-12-08 09:45:24,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:45:24,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:45:24,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:24,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:45:24,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:24,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:45:24,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:45:24,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:45:24,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 09:45:24,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 09:45:24,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 09:45:24,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 09:45:24,533 INFO L87 Difference]: Start difference. First operand 18370 states and 63196 transitions. Second operand 3 states. [2018-12-08 09:45:24,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:45:24,639 INFO L93 Difference]: Finished difference Result 18790 states and 64462 transitions. [2018-12-08 09:45:24,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 09:45:24,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2018-12-08 09:45:24,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:45:24,662 INFO L225 Difference]: With dead ends: 18790 [2018-12-08 09:45:24,662 INFO L226 Difference]: Without dead ends: 18790 [2018-12-08 09:45:24,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 09:45:24,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18790 states. [2018-12-08 09:45:24,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18790 to 18560. [2018-12-08 09:45:24,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18560 states. [2018-12-08 09:45:24,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18560 states to 18560 states and 63768 transitions. [2018-12-08 09:45:24,851 INFO L78 Accepts]: Start accepts. Automaton has 18560 states and 63768 transitions. Word has length 98 [2018-12-08 09:45:24,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:45:24,851 INFO L480 AbstractCegarLoop]: Abstraction has 18560 states and 63768 transitions. [2018-12-08 09:45:24,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 09:45:24,851 INFO L276 IsEmpty]: Start isEmpty. Operand 18560 states and 63768 transitions. [2018-12-08 09:45:24,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-08 09:45:24,866 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:45:24,866 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] [2018-12-08 09:45:24,866 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:45:24,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:45:24,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1088162851, now seen corresponding path program 1 times [2018-12-08 09:45:24,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:45:24,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:45:24,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:24,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:45:24,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:24,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:45:24,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-12-08 09:45:24,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:45:24,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 09:45:24,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 09:45:24,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 09:45:24,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 09:45:24,892 INFO L87 Difference]: Start difference. First operand 18560 states and 63768 transitions. Second operand 4 states. [2018-12-08 09:45:25,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:45:25,060 INFO L93 Difference]: Finished difference Result 25169 states and 86632 transitions. [2018-12-08 09:45:25,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 09:45:25,060 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-12-08 09:45:25,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:45:25,092 INFO L225 Difference]: With dead ends: 25169 [2018-12-08 09:45:25,093 INFO L226 Difference]: Without dead ends: 25169 [2018-12-08 09:45:25,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 09:45:25,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25169 states. [2018-12-08 09:45:25,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25169 to 18760. [2018-12-08 09:45:25,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18760 states. [2018-12-08 09:45:25,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18760 states to 18760 states and 64368 transitions. [2018-12-08 09:45:25,313 INFO L78 Accepts]: Start accepts. Automaton has 18760 states and 64368 transitions. Word has length 98 [2018-12-08 09:45:25,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:45:25,314 INFO L480 AbstractCegarLoop]: Abstraction has 18760 states and 64368 transitions. [2018-12-08 09:45:25,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 09:45:25,314 INFO L276 IsEmpty]: Start isEmpty. Operand 18760 states and 64368 transitions. [2018-12-08 09:45:25,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-08 09:45:25,329 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:45:25,329 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] [2018-12-08 09:45:25,329 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:45:25,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:45:25,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1268596891, now seen corresponding path program 2 times [2018-12-08 09:45:25,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:45:25,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:45:25,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:25,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:45:25,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:25,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:45:25,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:45:25,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:45:25,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 09:45:25,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 09:45:25,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 09:45:25,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 09:45:25,368 INFO L87 Difference]: Start difference. First operand 18760 states and 64368 transitions. Second operand 5 states. [2018-12-08 09:45:25,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:45:25,524 INFO L93 Difference]: Finished difference Result 22960 states and 77638 transitions. [2018-12-08 09:45:25,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 09:45:25,524 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2018-12-08 09:45:25,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:45:25,551 INFO L225 Difference]: With dead ends: 22960 [2018-12-08 09:45:25,551 INFO L226 Difference]: Without dead ends: 22960 [2018-12-08 09:45:25,551 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-12-08 09:45:25,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22960 states. [2018-12-08 09:45:25,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22960 to 20686. [2018-12-08 09:45:25,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20686 states. [2018-12-08 09:45:25,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20686 states to 20686 states and 70572 transitions. [2018-12-08 09:45:25,770 INFO L78 Accepts]: Start accepts. Automaton has 20686 states and 70572 transitions. Word has length 98 [2018-12-08 09:45:25,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:45:25,770 INFO L480 AbstractCegarLoop]: Abstraction has 20686 states and 70572 transitions. [2018-12-08 09:45:25,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 09:45:25,770 INFO L276 IsEmpty]: Start isEmpty. Operand 20686 states and 70572 transitions. [2018-12-08 09:45:25,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-08 09:45:25,787 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:45:25,787 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:45:25,787 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:45:25,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:45:25,787 INFO L82 PathProgramCache]: Analyzing trace with hash 2001676484, now seen corresponding path program 1 times [2018-12-08 09:45:25,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:45:25,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:45:25,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:25,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:45:25,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:25,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:45:25,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:45:25,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:45:25,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 09:45:25,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 09:45:25,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 09:45:25,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-08 09:45:25,853 INFO L87 Difference]: Start difference. First operand 20686 states and 70572 transitions. Second operand 7 states. [2018-12-08 09:45:26,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:45:26,112 INFO L93 Difference]: Finished difference Result 23106 states and 78008 transitions. [2018-12-08 09:45:26,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 09:45:26,113 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2018-12-08 09:45:26,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:45:26,139 INFO L225 Difference]: With dead ends: 23106 [2018-12-08 09:45:26,139 INFO L226 Difference]: Without dead ends: 23041 [2018-12-08 09:45:26,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-08 09:45:26,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23041 states. [2018-12-08 09:45:26,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23041 to 21986. [2018-12-08 09:45:26,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21986 states. [2018-12-08 09:45:26,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21986 states to 21986 states and 74777 transitions. [2018-12-08 09:45:26,393 INFO L78 Accepts]: Start accepts. Automaton has 21986 states and 74777 transitions. Word has length 98 [2018-12-08 09:45:26,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:45:26,393 INFO L480 AbstractCegarLoop]: Abstraction has 21986 states and 74777 transitions. [2018-12-08 09:45:26,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 09:45:26,393 INFO L276 IsEmpty]: Start isEmpty. Operand 21986 states and 74777 transitions. [2018-12-08 09:45:26,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-08 09:45:26,410 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:45:26,410 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] [2018-12-08 09:45:26,410 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:45:26,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:45:26,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1646225981, now seen corresponding path program 3 times [2018-12-08 09:45:26,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:45:26,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:45:26,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:26,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:45:26,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:26,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:45:26,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:45:26,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:45:26,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 09:45:26,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 09:45:26,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 09:45:26,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-08 09:45:26,441 INFO L87 Difference]: Start difference. First operand 21986 states and 74777 transitions. Second operand 5 states. [2018-12-08 09:45:26,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:45:26,620 INFO L93 Difference]: Finished difference Result 23031 states and 77893 transitions. [2018-12-08 09:45:26,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 09:45:26,621 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2018-12-08 09:45:26,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:45:26,657 INFO L225 Difference]: With dead ends: 23031 [2018-12-08 09:45:26,657 INFO L226 Difference]: Without dead ends: 23031 [2018-12-08 09:45:26,657 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-12-08 09:45:26,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23031 states. [2018-12-08 09:45:26,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23031 to 22106. [2018-12-08 09:45:26,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22106 states. [2018-12-08 09:45:26,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22106 states to 22106 states and 75113 transitions. [2018-12-08 09:45:26,879 INFO L78 Accepts]: Start accepts. Automaton has 22106 states and 75113 transitions. Word has length 98 [2018-12-08 09:45:26,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:45:26,879 INFO L480 AbstractCegarLoop]: Abstraction has 22106 states and 75113 transitions. [2018-12-08 09:45:26,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 09:45:26,879 INFO L276 IsEmpty]: Start isEmpty. Operand 22106 states and 75113 transitions. [2018-12-08 09:45:26,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-08 09:45:26,896 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:45:26,896 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] [2018-12-08 09:45:26,896 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:45:26,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:45:26,897 INFO L82 PathProgramCache]: Analyzing trace with hash -322351355, now seen corresponding path program 1 times [2018-12-08 09:45:26,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:45:26,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:45:26,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:26,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:45:26,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:26,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:45:26,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:45:26,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:45:26,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 09:45:26,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 09:45:26,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 09:45:26,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 09:45:26,936 INFO L87 Difference]: Start difference. First operand 22106 states and 75113 transitions. Second operand 5 states. [2018-12-08 09:45:27,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:45:27,153 INFO L93 Difference]: Finished difference Result 26192 states and 87700 transitions. [2018-12-08 09:45:27,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 09:45:27,153 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2018-12-08 09:45:27,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:45:27,185 INFO L225 Difference]: With dead ends: 26192 [2018-12-08 09:45:27,185 INFO L226 Difference]: Without dead ends: 26052 [2018-12-08 09:45:27,185 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-12-08 09:45:27,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26052 states. [2018-12-08 09:45:27,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26052 to 22601. [2018-12-08 09:45:27,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22601 states. [2018-12-08 09:45:27,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22601 states to 22601 states and 76539 transitions. [2018-12-08 09:45:27,420 INFO L78 Accepts]: Start accepts. Automaton has 22601 states and 76539 transitions. Word has length 98 [2018-12-08 09:45:27,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:45:27,420 INFO L480 AbstractCegarLoop]: Abstraction has 22601 states and 76539 transitions. [2018-12-08 09:45:27,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 09:45:27,420 INFO L276 IsEmpty]: Start isEmpty. Operand 22601 states and 76539 transitions. [2018-12-08 09:45:27,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-08 09:45:27,438 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:45:27,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, 1, 1, 1] [2018-12-08 09:45:27,439 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:45:27,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:45:27,439 INFO L82 PathProgramCache]: Analyzing trace with hash -834009160, now seen corresponding path program 1 times [2018-12-08 09:45:27,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:45:27,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:45:27,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:27,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:45:27,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:27,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:45:27,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:45:27,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:45:27,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 09:45:27,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 09:45:27,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 09:45:27,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 09:45:27,466 INFO L87 Difference]: Start difference. First operand 22601 states and 76539 transitions. Second operand 4 states. [2018-12-08 09:45:27,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:45:27,647 INFO L93 Difference]: Finished difference Result 37324 states and 127010 transitions. [2018-12-08 09:45:27,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 09:45:27,647 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-08 09:45:27,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:45:27,694 INFO L225 Difference]: With dead ends: 37324 [2018-12-08 09:45:27,694 INFO L226 Difference]: Without dead ends: 37324 [2018-12-08 09:45:27,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 09:45:27,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37324 states. [2018-12-08 09:45:27,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37324 to 20901. [2018-12-08 09:45:27,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20901 states. [2018-12-08 09:45:27,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20901 states to 20901 states and 70774 transitions. [2018-12-08 09:45:27,973 INFO L78 Accepts]: Start accepts. Automaton has 20901 states and 70774 transitions. Word has length 100 [2018-12-08 09:45:27,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:45:27,973 INFO L480 AbstractCegarLoop]: Abstraction has 20901 states and 70774 transitions. [2018-12-08 09:45:27,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 09:45:27,973 INFO L276 IsEmpty]: Start isEmpty. Operand 20901 states and 70774 transitions. [2018-12-08 09:45:27,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-08 09:45:27,991 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:45:27,991 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] [2018-12-08 09:45:27,991 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:45:27,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:45:27,991 INFO L82 PathProgramCache]: Analyzing trace with hash -2017356457, now seen corresponding path program 1 times [2018-12-08 09:45:27,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:45:27,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:45:27,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:27,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:45:27,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:27,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:45:28,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:45:28,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:45:28,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 09:45:28,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 09:45:28,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 09:45:28,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-08 09:45:28,045 INFO L87 Difference]: Start difference. First operand 20901 states and 70774 transitions. Second operand 6 states. [2018-12-08 09:45:28,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:45:28,313 INFO L93 Difference]: Finished difference Result 22736 states and 76237 transitions. [2018-12-08 09:45:28,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 09:45:28,314 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-08 09:45:28,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:45:28,339 INFO L225 Difference]: With dead ends: 22736 [2018-12-08 09:45:28,339 INFO L226 Difference]: Without dead ends: 22736 [2018-12-08 09:45:28,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-08 09:45:28,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22736 states. [2018-12-08 09:45:28,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22736 to 21246. [2018-12-08 09:45:28,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21246 states. [2018-12-08 09:45:28,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21246 states to 21246 states and 71835 transitions. [2018-12-08 09:45:28,555 INFO L78 Accepts]: Start accepts. Automaton has 21246 states and 71835 transitions. Word has length 100 [2018-12-08 09:45:28,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:45:28,555 INFO L480 AbstractCegarLoop]: Abstraction has 21246 states and 71835 transitions. [2018-12-08 09:45:28,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 09:45:28,555 INFO L276 IsEmpty]: Start isEmpty. Operand 21246 states and 71835 transitions. [2018-12-08 09:45:28,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-08 09:45:28,574 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:45:28,575 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:45:28,575 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:45:28,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:45:28,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1047775434, now seen corresponding path program 1 times [2018-12-08 09:45:28,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:45:28,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:45:28,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:28,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:45:28,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:28,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:45:28,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:45:28,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:45:28,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 09:45:28,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 09:45:28,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 09:45:28,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 09:45:28,623 INFO L87 Difference]: Start difference. First operand 21246 states and 71835 transitions. Second operand 6 states. [2018-12-08 09:45:28,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:45:28,866 INFO L93 Difference]: Finished difference Result 20395 states and 68701 transitions. [2018-12-08 09:45:28,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 09:45:28,867 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-08 09:45:28,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:45:28,902 INFO L225 Difference]: With dead ends: 20395 [2018-12-08 09:45:28,902 INFO L226 Difference]: Without dead ends: 20395 [2018-12-08 09:45:28,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-08 09:45:28,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20395 states. [2018-12-08 09:45:29,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20395 to 20006. [2018-12-08 09:45:29,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20006 states. [2018-12-08 09:45:29,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20006 states to 20006 states and 67563 transitions. [2018-12-08 09:45:29,107 INFO L78 Accepts]: Start accepts. Automaton has 20006 states and 67563 transitions. Word has length 100 [2018-12-08 09:45:29,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:45:29,107 INFO L480 AbstractCegarLoop]: Abstraction has 20006 states and 67563 transitions. [2018-12-08 09:45:29,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 09:45:29,107 INFO L276 IsEmpty]: Start isEmpty. Operand 20006 states and 67563 transitions. [2018-12-08 09:45:29,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-08 09:45:29,123 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:45:29,123 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] [2018-12-08 09:45:29,124 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:45:29,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:45:29,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1452574727, now seen corresponding path program 1 times [2018-12-08 09:45:29,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:45:29,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:45:29,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:29,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:45:29,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:29,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:45:29,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:45:29,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:45:29,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 09:45:29,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 09:45:29,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 09:45:29,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-08 09:45:29,168 INFO L87 Difference]: Start difference. First operand 20006 states and 67563 transitions. Second operand 6 states. [2018-12-08 09:45:29,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:45:29,391 INFO L93 Difference]: Finished difference Result 21421 states and 71270 transitions. [2018-12-08 09:45:29,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 09:45:29,391 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-08 09:45:29,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:45:29,415 INFO L225 Difference]: With dead ends: 21421 [2018-12-08 09:45:29,415 INFO L226 Difference]: Without dead ends: 20871 [2018-12-08 09:45:29,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-08 09:45:29,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20871 states. [2018-12-08 09:45:29,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20871 to 20186. [2018-12-08 09:45:29,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20186 states. [2018-12-08 09:45:29,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20186 states to 20186 states and 67922 transitions. [2018-12-08 09:45:29,620 INFO L78 Accepts]: Start accepts. Automaton has 20186 states and 67922 transitions. Word has length 100 [2018-12-08 09:45:29,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:45:29,621 INFO L480 AbstractCegarLoop]: Abstraction has 20186 states and 67922 transitions. [2018-12-08 09:45:29,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 09:45:29,621 INFO L276 IsEmpty]: Start isEmpty. Operand 20186 states and 67922 transitions. [2018-12-08 09:45:29,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-08 09:45:29,636 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:45:29,637 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] [2018-12-08 09:45:29,637 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:45:29,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:45:29,637 INFO L82 PathProgramCache]: Analyzing trace with hash 248165752, now seen corresponding path program 1 times [2018-12-08 09:45:29,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:45:29,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:45:29,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:29,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:45:29,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:29,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:45:29,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:45:29,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:45:29,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 09:45:29,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 09:45:29,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 09:45:29,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-08 09:45:29,695 INFO L87 Difference]: Start difference. First operand 20186 states and 67922 transitions. Second operand 7 states. [2018-12-08 09:45:29,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:45:29,863 INFO L93 Difference]: Finished difference Result 21139 states and 70990 transitions. [2018-12-08 09:45:29,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 09:45:29,863 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2018-12-08 09:45:29,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:45:29,888 INFO L225 Difference]: With dead ends: 21139 [2018-12-08 09:45:29,888 INFO L226 Difference]: Without dead ends: 21139 [2018-12-08 09:45:29,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-08 09:45:29,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21139 states. [2018-12-08 09:45:30,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21139 to 20091. [2018-12-08 09:45:30,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20091 states. [2018-12-08 09:45:30,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20091 states to 20091 states and 67646 transitions. [2018-12-08 09:45:30,085 INFO L78 Accepts]: Start accepts. Automaton has 20091 states and 67646 transitions. Word has length 100 [2018-12-08 09:45:30,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:45:30,086 INFO L480 AbstractCegarLoop]: Abstraction has 20091 states and 67646 transitions. [2018-12-08 09:45:30,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 09:45:30,086 INFO L276 IsEmpty]: Start isEmpty. Operand 20091 states and 67646 transitions. [2018-12-08 09:45:30,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-08 09:45:30,102 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:45:30,102 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:45:30,102 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:45:30,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:45:30,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1659045272, now seen corresponding path program 1 times [2018-12-08 09:45:30,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:45:30,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:45:30,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:30,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:45:30,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:30,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:45:30,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-12-08 09:45:30,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:45:30,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 09:45:30,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 09:45:30,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 09:45:30,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 09:45:30,245 INFO L87 Difference]: Start difference. First operand 20091 states and 67646 transitions. Second operand 5 states. [2018-12-08 09:45:30,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:45:30,375 INFO L93 Difference]: Finished difference Result 18687 states and 63075 transitions. [2018-12-08 09:45:30,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 09:45:30,375 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2018-12-08 09:45:30,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:45:30,398 INFO L225 Difference]: With dead ends: 18687 [2018-12-08 09:45:30,398 INFO L226 Difference]: Without dead ends: 18687 [2018-12-08 09:45:30,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-08 09:45:30,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18687 states. [2018-12-08 09:45:30,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18687 to 18502. [2018-12-08 09:45:30,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18502 states. [2018-12-08 09:45:30,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18502 states to 18502 states and 62557 transitions. [2018-12-08 09:45:30,585 INFO L78 Accepts]: Start accepts. Automaton has 18502 states and 62557 transitions. Word has length 100 [2018-12-08 09:45:30,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:45:30,585 INFO L480 AbstractCegarLoop]: Abstraction has 18502 states and 62557 transitions. [2018-12-08 09:45:30,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 09:45:30,586 INFO L276 IsEmpty]: Start isEmpty. Operand 18502 states and 62557 transitions. [2018-12-08 09:45:30,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-08 09:45:30,600 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:45:30,600 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] [2018-12-08 09:45:30,600 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:45:30,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:45:30,600 INFO L82 PathProgramCache]: Analyzing trace with hash -127158119, now seen corresponding path program 1 times [2018-12-08 09:45:30,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:45:30,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:45:30,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:30,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:45:30,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:30,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:45:30,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:45:30,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:45:30,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 09:45:30,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 09:45:30,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 09:45:30,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-08 09:45:30,682 INFO L87 Difference]: Start difference. First operand 18502 states and 62557 transitions. Second operand 6 states. [2018-12-08 09:45:30,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:45:30,802 INFO L93 Difference]: Finished difference Result 12422 states and 40685 transitions. [2018-12-08 09:45:30,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 09:45:30,802 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-08 09:45:30,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:45:30,815 INFO L225 Difference]: With dead ends: 12422 [2018-12-08 09:45:30,816 INFO L226 Difference]: Without dead ends: 12422 [2018-12-08 09:45:30,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-08 09:45:30,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12422 states. [2018-12-08 09:45:30,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12422 to 10933. [2018-12-08 09:45:30,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10933 states. [2018-12-08 09:45:30,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10933 states to 10933 states and 36071 transitions. [2018-12-08 09:45:30,925 INFO L78 Accepts]: Start accepts. Automaton has 10933 states and 36071 transitions. Word has length 100 [2018-12-08 09:45:30,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:45:30,925 INFO L480 AbstractCegarLoop]: Abstraction has 10933 states and 36071 transitions. [2018-12-08 09:45:30,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 09:45:30,925 INFO L276 IsEmpty]: Start isEmpty. Operand 10933 states and 36071 transitions. [2018-12-08 09:45:30,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-08 09:45:30,934 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:45:30,934 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, 1] [2018-12-08 09:45:30,934 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:45:30,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:45:30,934 INFO L82 PathProgramCache]: Analyzing trace with hash -497599059, now seen corresponding path program 1 times [2018-12-08 09:45:30,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:45:30,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:45:30,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:30,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:45:30,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:30,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:45:30,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:45:30,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:45:30,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 09:45:30,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 09:45:30,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 09:45:30,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 09:45:30,970 INFO L87 Difference]: Start difference. First operand 10933 states and 36071 transitions. Second operand 7 states. [2018-12-08 09:45:31,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:45:31,286 INFO L93 Difference]: Finished difference Result 17605 states and 56946 transitions. [2018-12-08 09:45:31,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-08 09:45:31,287 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-08 09:45:31,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:45:31,305 INFO L225 Difference]: With dead ends: 17605 [2018-12-08 09:45:31,305 INFO L226 Difference]: Without dead ends: 17477 [2018-12-08 09:45:31,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-08 09:45:31,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17477 states. [2018-12-08 09:45:31,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17477 to 13761. [2018-12-08 09:45:31,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13761 states. [2018-12-08 09:45:31,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13761 states to 13761 states and 45019 transitions. [2018-12-08 09:45:31,460 INFO L78 Accepts]: Start accepts. Automaton has 13761 states and 45019 transitions. Word has length 102 [2018-12-08 09:45:31,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:45:31,460 INFO L480 AbstractCegarLoop]: Abstraction has 13761 states and 45019 transitions. [2018-12-08 09:45:31,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 09:45:31,460 INFO L276 IsEmpty]: Start isEmpty. Operand 13761 states and 45019 transitions. [2018-12-08 09:45:31,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-08 09:45:31,471 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:45:31,471 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, 1] [2018-12-08 09:45:31,472 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:45:31,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:45:31,472 INFO L82 PathProgramCache]: Analyzing trace with hash 747165422, now seen corresponding path program 1 times [2018-12-08 09:45:31,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:45:31,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:45:31,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:31,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:45:31,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:31,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:45:31,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:45:31,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:45:31,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 09:45:31,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 09:45:31,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 09:45:31,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 09:45:31,523 INFO L87 Difference]: Start difference. First operand 13761 states and 45019 transitions. Second operand 6 states. [2018-12-08 09:45:31,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:45:31,649 INFO L93 Difference]: Finished difference Result 14001 states and 45411 transitions. [2018-12-08 09:45:31,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 09:45:31,650 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-12-08 09:45:31,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:45:31,665 INFO L225 Difference]: With dead ends: 14001 [2018-12-08 09:45:31,665 INFO L226 Difference]: Without dead ends: 14001 [2018-12-08 09:45:31,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-08 09:45:31,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14001 states. [2018-12-08 09:45:31,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14001 to 13611. [2018-12-08 09:45:31,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13611 states. [2018-12-08 09:45:31,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13611 states to 13611 states and 44349 transitions. [2018-12-08 09:45:31,799 INFO L78 Accepts]: Start accepts. Automaton has 13611 states and 44349 transitions. Word has length 102 [2018-12-08 09:45:31,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:45:31,799 INFO L480 AbstractCegarLoop]: Abstraction has 13611 states and 44349 transitions. [2018-12-08 09:45:31,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 09:45:31,799 INFO L276 IsEmpty]: Start isEmpty. Operand 13611 states and 44349 transitions. [2018-12-08 09:45:31,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-08 09:45:31,810 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:45:31,810 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, 1] [2018-12-08 09:45:31,810 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:45:31,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:45:31,810 INFO L82 PathProgramCache]: Analyzing trace with hash -167833298, now seen corresponding path program 1 times [2018-12-08 09:45:31,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:45:31,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:45:31,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:31,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:45:31,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:31,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:45:31,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:45:31,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:45:31,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 09:45:31,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 09:45:31,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 09:45:31,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 09:45:31,870 INFO L87 Difference]: Start difference. First operand 13611 states and 44349 transitions. Second operand 6 states. [2018-12-08 09:45:31,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:45:31,993 INFO L93 Difference]: Finished difference Result 22583 states and 74515 transitions. [2018-12-08 09:45:31,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 09:45:31,993 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-12-08 09:45:31,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:45:32,020 INFO L225 Difference]: With dead ends: 22583 [2018-12-08 09:45:32,020 INFO L226 Difference]: Without dead ends: 22583 [2018-12-08 09:45:32,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-08 09:45:32,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22583 states. [2018-12-08 09:45:32,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22583 to 13931. [2018-12-08 09:45:32,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13931 states. [2018-12-08 09:45:32,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13931 states to 13931 states and 45215 transitions. [2018-12-08 09:45:32,197 INFO L78 Accepts]: Start accepts. Automaton has 13931 states and 45215 transitions. Word has length 102 [2018-12-08 09:45:32,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:45:32,197 INFO L480 AbstractCegarLoop]: Abstraction has 13931 states and 45215 transitions. [2018-12-08 09:45:32,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 09:45:32,197 INFO L276 IsEmpty]: Start isEmpty. Operand 13931 states and 45215 transitions. [2018-12-08 09:45:32,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-08 09:45:32,208 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:45:32,208 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, 1] [2018-12-08 09:45:32,209 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:45:32,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:45:32,209 INFO L82 PathProgramCache]: Analyzing trace with hash -2093366609, now seen corresponding path program 1 times [2018-12-08 09:45:32,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:45:32,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:45:32,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:32,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:45:32,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:32,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:45:32,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:45:32,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:45:32,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 09:45:32,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 09:45:32,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 09:45:32,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 09:45:32,248 INFO L87 Difference]: Start difference. First operand 13931 states and 45215 transitions. Second operand 5 states. [2018-12-08 09:45:32,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:45:32,423 INFO L93 Difference]: Finished difference Result 15723 states and 50975 transitions. [2018-12-08 09:45:32,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 09:45:32,423 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-12-08 09:45:32,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:45:32,438 INFO L225 Difference]: With dead ends: 15723 [2018-12-08 09:45:32,438 INFO L226 Difference]: Without dead ends: 15595 [2018-12-08 09:45:32,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 09:45:32,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15595 states. [2018-12-08 09:45:32,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15595 to 11630. [2018-12-08 09:45:32,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11630 states. [2018-12-08 09:45:32,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11630 states to 11630 states and 37935 transitions. [2018-12-08 09:45:32,560 INFO L78 Accepts]: Start accepts. Automaton has 11630 states and 37935 transitions. Word has length 102 [2018-12-08 09:45:32,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:45:32,561 INFO L480 AbstractCegarLoop]: Abstraction has 11630 states and 37935 transitions. [2018-12-08 09:45:32,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 09:45:32,561 INFO L276 IsEmpty]: Start isEmpty. Operand 11630 states and 37935 transitions. [2018-12-08 09:45:32,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-08 09:45:32,570 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:45:32,570 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, 1] [2018-12-08 09:45:32,570 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:45:32,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:45:32,570 INFO L82 PathProgramCache]: Analyzing trace with hash -848602128, now seen corresponding path program 1 times [2018-12-08 09:45:32,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:45:32,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:45:32,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:32,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:45:32,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:32,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:45:32,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:45:32,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:45:32,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-08 09:45:32,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 09:45:32,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 09:45:32,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-08 09:45:32,654 INFO L87 Difference]: Start difference. First operand 11630 states and 37935 transitions. Second operand 10 states. [2018-12-08 09:45:32,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:45:32,982 INFO L93 Difference]: Finished difference Result 22106 states and 72536 transitions. [2018-12-08 09:45:32,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 09:45:32,982 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 102 [2018-12-08 09:45:32,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:45:32,994 INFO L225 Difference]: With dead ends: 22106 [2018-12-08 09:45:32,994 INFO L226 Difference]: Without dead ends: 10938 [2018-12-08 09:45:32,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-12-08 09:45:33,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10938 states. [2018-12-08 09:45:33,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10938 to 10938. [2018-12-08 09:45:33,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10938 states. [2018-12-08 09:45:33,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10938 states to 10938 states and 35895 transitions. [2018-12-08 09:45:33,094 INFO L78 Accepts]: Start accepts. Automaton has 10938 states and 35895 transitions. Word has length 102 [2018-12-08 09:45:33,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:45:33,094 INFO L480 AbstractCegarLoop]: Abstraction has 10938 states and 35895 transitions. [2018-12-08 09:45:33,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 09:45:33,094 INFO L276 IsEmpty]: Start isEmpty. Operand 10938 states and 35895 transitions. [2018-12-08 09:45:33,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-08 09:45:33,102 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:45:33,102 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:45:33,102 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:45:33,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:45:33,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1501379030, now seen corresponding path program 2 times [2018-12-08 09:45:33,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:45:33,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:45:33,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:33,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:45:33,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:33,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:45:33,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:45:33,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:45:33,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 09:45:33,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 09:45:33,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 09:45:33,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 09:45:33,166 INFO L87 Difference]: Start difference. First operand 10938 states and 35895 transitions. Second operand 7 states. [2018-12-08 09:45:33,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:45:33,354 INFO L93 Difference]: Finished difference Result 18188 states and 60554 transitions. [2018-12-08 09:45:33,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 09:45:33,355 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-08 09:45:33,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:45:33,364 INFO L225 Difference]: With dead ends: 18188 [2018-12-08 09:45:33,364 INFO L226 Difference]: Without dead ends: 7461 [2018-12-08 09:45:33,364 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-12-08 09:45:33,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7461 states. [2018-12-08 09:45:33,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7461 to 7461. [2018-12-08 09:45:33,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7461 states. [2018-12-08 09:45:33,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7461 states to 7461 states and 25211 transitions. [2018-12-08 09:45:33,440 INFO L78 Accepts]: Start accepts. Automaton has 7461 states and 25211 transitions. Word has length 102 [2018-12-08 09:45:33,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:45:33,440 INFO L480 AbstractCegarLoop]: Abstraction has 7461 states and 25211 transitions. [2018-12-08 09:45:33,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 09:45:33,440 INFO L276 IsEmpty]: Start isEmpty. Operand 7461 states and 25211 transitions. [2018-12-08 09:45:33,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-08 09:45:33,446 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:45:33,446 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, 1] [2018-12-08 09:45:33,446 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:45:33,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:45:33,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1340703688, now seen corresponding path program 1 times [2018-12-08 09:45:33,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:45:33,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:45:33,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:33,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:45:33,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:33,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:45:33,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:45:33,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:45:33,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 09:45:33,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 09:45:33,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 09:45:33,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-08 09:45:33,534 INFO L87 Difference]: Start difference. First operand 7461 states and 25211 transitions. Second operand 7 states. [2018-12-08 09:45:33,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:45:33,754 INFO L93 Difference]: Finished difference Result 9597 states and 31665 transitions. [2018-12-08 09:45:33,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 09:45:33,755 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-08 09:45:33,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:45:33,765 INFO L225 Difference]: With dead ends: 9597 [2018-12-08 09:45:33,765 INFO L226 Difference]: Without dead ends: 9461 [2018-12-08 09:45:33,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-08 09:45:33,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9461 states. [2018-12-08 09:45:33,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9461 to 7445. [2018-12-08 09:45:33,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7445 states. [2018-12-08 09:45:33,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7445 states to 7445 states and 25119 transitions. [2018-12-08 09:45:33,841 INFO L78 Accepts]: Start accepts. Automaton has 7445 states and 25119 transitions. Word has length 102 [2018-12-08 09:45:33,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:45:33,841 INFO L480 AbstractCegarLoop]: Abstraction has 7445 states and 25119 transitions. [2018-12-08 09:45:33,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 09:45:33,841 INFO L276 IsEmpty]: Start isEmpty. Operand 7445 states and 25119 transitions. [2018-12-08 09:45:33,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-08 09:45:33,847 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:45:33,847 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, 1] [2018-12-08 09:45:33,847 INFO L423 AbstractCegarLoop]: === Iteration 37 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:45:33,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:45:33,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1018603321, now seen corresponding path program 1 times [2018-12-08 09:45:33,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:45:33,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:45:33,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:33,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:45:33,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:33,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:45:33,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:45:33,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:45:33,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 09:45:33,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 09:45:33,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 09:45:33,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 09:45:33,900 INFO L87 Difference]: Start difference. First operand 7445 states and 25119 transitions. Second operand 5 states. [2018-12-08 09:45:33,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:45:33,932 INFO L93 Difference]: Finished difference Result 7445 states and 25051 transitions. [2018-12-08 09:45:33,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 09:45:33,933 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-12-08 09:45:33,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:45:33,942 INFO L225 Difference]: With dead ends: 7445 [2018-12-08 09:45:33,942 INFO L226 Difference]: Without dead ends: 7445 [2018-12-08 09:45:33,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-08 09:45:33,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7445 states. [2018-12-08 09:45:34,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7445 to 7429. [2018-12-08 09:45:34,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7429 states. [2018-12-08 09:45:34,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7429 states to 7429 states and 25007 transitions. [2018-12-08 09:45:34,014 INFO L78 Accepts]: Start accepts. Automaton has 7429 states and 25007 transitions. Word has length 102 [2018-12-08 09:45:34,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:45:34,014 INFO L480 AbstractCegarLoop]: Abstraction has 7429 states and 25007 transitions. [2018-12-08 09:45:34,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 09:45:34,014 INFO L276 IsEmpty]: Start isEmpty. Operand 7429 states and 25007 transitions. [2018-12-08 09:45:34,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-08 09:45:34,020 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:45:34,020 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, 1] [2018-12-08 09:45:34,020 INFO L423 AbstractCegarLoop]: === Iteration 38 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:45:34,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:45:34,020 INFO L82 PathProgramCache]: Analyzing trace with hash -682137158, now seen corresponding path program 3 times [2018-12-08 09:45:34,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:45:34,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:45:34,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:34,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:45:34,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:34,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:45:34,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:45:34,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:45:34,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-08 09:45:34,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 09:45:34,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 09:45:34,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-08 09:45:34,093 INFO L87 Difference]: Start difference. First operand 7429 states and 25007 transitions. Second operand 12 states. [2018-12-08 09:45:34,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:45:34,417 INFO L93 Difference]: Finished difference Result 14457 states and 48810 transitions. [2018-12-08 09:45:34,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-08 09:45:34,418 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 102 [2018-12-08 09:45:34,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:45:34,429 INFO L225 Difference]: With dead ends: 14457 [2018-12-08 09:45:34,429 INFO L226 Difference]: Without dead ends: 9913 [2018-12-08 09:45:34,429 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-12-08 09:45:34,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9913 states. [2018-12-08 09:45:34,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9913 to 9305. [2018-12-08 09:45:34,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9305 states. [2018-12-08 09:45:34,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9305 states to 9305 states and 30650 transitions. [2018-12-08 09:45:34,517 INFO L78 Accepts]: Start accepts. Automaton has 9305 states and 30650 transitions. Word has length 102 [2018-12-08 09:45:34,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:45:34,518 INFO L480 AbstractCegarLoop]: Abstraction has 9305 states and 30650 transitions. [2018-12-08 09:45:34,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 09:45:34,518 INFO L276 IsEmpty]: Start isEmpty. Operand 9305 states and 30650 transitions. [2018-12-08 09:45:34,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-08 09:45:34,525 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:45:34,525 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, 1] [2018-12-08 09:45:34,526 INFO L423 AbstractCegarLoop]: === Iteration 39 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:45:34,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:45:34,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1730295936, now seen corresponding path program 4 times [2018-12-08 09:45:34,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:45:34,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:45:34,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:34,527 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:45:34,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:34,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:45:34,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:45:34,563 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-08 09:45:34,629 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-08 09:45:34,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 09:45:34 BasicIcfg [2018-12-08 09:45:34,630 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 09:45:34,630 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 09:45:34,630 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 09:45:34,630 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 09:45:34,631 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 09:41:56" (3/4) ... [2018-12-08 09:45:34,633 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-08 09:45:34,706 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4de0d6bb-8594-4cb9-9a9f-22514adf67f0/bin-2019/uautomizer/witness.graphml [2018-12-08 09:45:34,706 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 09:45:34,707 INFO L168 Benchmark]: Toolchain (without parser) took 218927.29 ms. Allocated memory was 1.0 GB in the beginning and 11.4 GB in the end (delta: 10.4 GB). Free memory was 950.6 MB in the beginning and 3.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 8.3 GB. Max. memory is 11.5 GB. [2018-12-08 09:45:34,708 INFO L168 Benchmark]: CDTParser took 0.14 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-12-08 09:45:34,708 INFO L168 Benchmark]: CACSL2BoogieTranslator took 357.89 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -135.8 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. [2018-12-08 09:45:34,708 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.06 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-08 09:45:34,709 INFO L168 Benchmark]: Boogie Preprocessor took 19.73 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-08 09:45:34,709 INFO L168 Benchmark]: RCFGBuilder took 326.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 11.5 GB. [2018-12-08 09:45:34,709 INFO L168 Benchmark]: TraceAbstraction took 218110.96 ms. Allocated memory was 1.1 GB in the beginning and 11.4 GB in the end (delta: 10.3 GB). Free memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 8.2 GB. Max. memory is 11.5 GB. [2018-12-08 09:45:34,709 INFO L168 Benchmark]: Witness Printer took 76.26 ms. Allocated memory is still 11.4 GB. Free memory was 3.1 GB in the beginning and 3.1 GB in the end (delta: 59.8 MB). Peak memory consumption was 59.8 MB. Max. memory is 11.5 GB. [2018-12-08 09:45:34,711 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 357.89 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -135.8 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.06 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.73 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 326.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 218110.96 ms. Allocated memory was 1.1 GB in the beginning and 11.4 GB in the end (delta: 10.3 GB). Free memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 8.2 GB. Max. memory is 11.5 GB. * Witness Printer took 76.26 ms. Allocated memory is still 11.4 GB. Free memory was 3.1 GB in the beginning and 3.1 GB in the end (delta: 59.8 MB). Peak memory consumption was 59.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] [L674] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L675] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L676] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L678] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L680] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L681] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L682] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L683] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L684] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L685] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L686] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L687] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L688] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L689] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L690] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L691] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L692] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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}] [L693] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L694] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L695] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L696] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L698] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L699] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L700] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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 t1494; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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(&t1494, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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 t1495; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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(&t1495, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L780] -1 pthread_t t1496; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L781] FCALL, FORK -1 pthread_create(&t1496, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L739] 0 y$w_buff1 = y$w_buff0 [L740] 0 y$w_buff0 = 2 [L741] 0 y$w_buff1_used = y$w_buff0_used [L742] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L744] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L745] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L746] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L747] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L748] 0 y$r_buff0_thd3 = (_Bool)1 [L751] 0 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=0] [L704] 1 z = 1 [L707] 1 x = 1 [L712] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=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=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=1] [L754] 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, __unbuffered_p2_EAX=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=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=1] [L719] 2 x = 2 [L722] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, 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=1] [L725] 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=1, __unbuffered_p2_EAX=0, 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=1] [L725] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, 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, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=1] [L725] 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=1, __unbuffered_p2_EAX=0, 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_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=1] [L725] 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) [L726] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, 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_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L726] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L727] 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=1, __unbuffered_p2_EAX=0, 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_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=1] [L727] 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 [L728] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, 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_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 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) [L728] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L729] 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=1, __unbuffered_p2_EAX=0, 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_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=1] [L729] 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 [L732] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, 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=1] [L755] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, 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=1] [L755] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L756] 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=2, __unbuffered_p2_EAX=0, 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=1] [L756] 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 [L757] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, 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=1] [L757] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L758] 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=2, __unbuffered_p2_EAX=0, 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=1] [L758] 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 [L761] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, 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=1] [L783] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, 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=1] [L787] 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, __unbuffered_p2_EAX=0, 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=1] [L787] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, 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=1] [L787] 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, __unbuffered_p2_EAX=0, 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=1] [L787] -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) [L788] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, 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=1] [L788] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L789] 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, __unbuffered_p2_EAX=0, 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=1] [L789] -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 [L790] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, 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=1] [L790] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L791] 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, __unbuffered_p2_EAX=0, 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=1] [L791] -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 [L794] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L795] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L796] -1 y$flush_delayed = weak$$choice2 [L797] -1 y$mem_tmp = y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=1] [L798] 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, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=1] [L798] -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) [L799] 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, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=1] [L799] -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)) [L800] 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, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=1] [L800] -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)) [L801] 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, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=1] [L801] -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)) [L802] 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, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=1] [L802] -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)) [L803] 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, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=1] [L803] -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)) [L804] 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, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=1] [L804] -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)) [L805] -1 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=1] [L806] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=1] [L806] -1 y = y$flush_delayed ? y$mem_tmp : y [L807] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 198 locations, 3 error locations. UNSAFE Result, 218.0s OverallTime, 39 OverallIterations, 1 TraceHistogramMax, 69.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9635 SDtfs, 10592 SDslu, 22895 SDs, 0 SdLazy, 8482 SolverSat, 576 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 392 GetRequests, 114 SyntacticMatches, 19 SemanticMatches, 259 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=542807occurred in iteration=12, 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: 127.5s AutomataMinimizationTime, 38 MinimizatonAttempts, 1459487 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 3367 NumberOfCodeBlocks, 3367 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 3227 ConstructedInterpolants, 0 QuantifiedInterpolants, 654123 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...