./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix056_tso.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_18b58fcb-d40e-4644-8a9d-1ac0e03ef43d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_18b58fcb-d40e-4644-8a9d-1ac0e03ef43d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_18b58fcb-d40e-4644-8a9d-1ac0e03ef43d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_18b58fcb-d40e-4644-8a9d-1ac0e03ef43d/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix056_tso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_18b58fcb-d40e-4644-8a9d-1ac0e03ef43d/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_18b58fcb-d40e-4644-8a9d-1ac0e03ef43d/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 bb399b49d562562005292857f055e3a5f2e4f47f ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-01 08:10:56,320 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 08:10:56,321 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 08:10:56,327 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 08:10:56,327 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 08:10:56,328 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 08:10:56,329 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 08:10:56,330 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 08:10:56,330 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 08:10:56,331 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 08:10:56,331 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 08:10:56,331 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 08:10:56,332 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 08:10:56,333 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 08:10:56,333 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 08:10:56,334 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 08:10:56,334 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 08:10:56,335 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 08:10:56,336 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 08:10:56,337 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 08:10:56,337 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 08:10:56,338 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 08:10:56,339 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 08:10:56,340 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 08:10:56,340 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 08:10:56,340 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 08:10:56,341 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 08:10:56,341 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 08:10:56,342 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 08:10:56,343 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 08:10:56,343 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 08:10:56,343 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 08:10:56,343 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 08:10:56,343 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 08:10:56,344 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 08:10:56,344 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 08:10:56,344 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_18b58fcb-d40e-4644-8a9d-1ac0e03ef43d/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-01 08:10:56,352 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 08:10:56,352 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 08:10:56,352 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-01 08:10:56,352 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-01 08:10:56,353 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 08:10:56,353 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 08:10:56,353 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 08:10:56,353 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 08:10:56,353 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 08:10:56,353 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 08:10:56,353 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 08:10:56,354 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 08:10:56,354 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-01 08:10:56,354 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 08:10:56,354 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-01 08:10:56,354 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 08:10:56,354 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 08:10:56,354 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 08:10:56,354 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-01 08:10:56,355 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 08:10:56,355 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 08:10:56,355 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 08:10:56,355 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-01 08:10:56,355 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-01 08:10:56,355 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 08:10:56,355 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 08:10:56,355 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-01 08:10:56,355 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 08:10:56,356 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 08:10:56,356 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-01 08:10:56,356 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_18b58fcb-d40e-4644-8a9d-1ac0e03ef43d/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 -> bb399b49d562562005292857f055e3a5f2e4f47f [2018-12-01 08:10:56,373 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 08:10:56,380 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 08:10:56,382 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 08:10:56,383 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 08:10:56,383 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 08:10:56,383 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_18b58fcb-d40e-4644-8a9d-1ac0e03ef43d/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix056_tso.opt_false-unreach-call.i [2018-12-01 08:10:56,416 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_18b58fcb-d40e-4644-8a9d-1ac0e03ef43d/bin-2019/uautomizer/data/896e45302/f9e3018966cc41a8a8970cde14055959/FLAGa779c14d1 [2018-12-01 08:10:56,913 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 08:10:56,913 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_18b58fcb-d40e-4644-8a9d-1ac0e03ef43d/sv-benchmarks/c/pthread-wmm/mix056_tso.opt_false-unreach-call.i [2018-12-01 08:10:56,920 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_18b58fcb-d40e-4644-8a9d-1ac0e03ef43d/bin-2019/uautomizer/data/896e45302/f9e3018966cc41a8a8970cde14055959/FLAGa779c14d1 [2018-12-01 08:10:56,929 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_18b58fcb-d40e-4644-8a9d-1ac0e03ef43d/bin-2019/uautomizer/data/896e45302/f9e3018966cc41a8a8970cde14055959 [2018-12-01 08:10:56,930 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 08:10:56,931 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 08:10:56,932 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 08:10:56,932 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 08:10:56,934 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 08:10:56,934 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 08:10:56" (1/1) ... [2018-12-01 08:10:56,936 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@201b218f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:10:56, skipping insertion in model container [2018-12-01 08:10:56,936 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 08:10:56" (1/1) ... [2018-12-01 08:10:56,940 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 08:10:56,960 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 08:10:57,138 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 08:10:57,146 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 08:10:57,220 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 08:10:57,251 INFO L195 MainTranslator]: Completed translation [2018-12-01 08:10:57,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:10:57 WrapperNode [2018-12-01 08:10:57,251 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 08:10:57,252 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 08:10:57,252 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 08:10:57,252 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 08:10:57,257 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:10:57" (1/1) ... [2018-12-01 08:10:57,267 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:10:57" (1/1) ... [2018-12-01 08:10:57,285 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 08:10:57,285 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 08:10:57,286 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 08:10:57,286 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 08:10:57,291 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:10:57" (1/1) ... [2018-12-01 08:10:57,292 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:10:57" (1/1) ... [2018-12-01 08:10:57,294 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:10:57" (1/1) ... [2018-12-01 08:10:57,294 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:10:57" (1/1) ... [2018-12-01 08:10:57,299 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:10:57" (1/1) ... [2018-12-01 08:10:57,301 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:10:57" (1/1) ... [2018-12-01 08:10:57,303 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:10:57" (1/1) ... [2018-12-01 08:10:57,305 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 08:10:57,305 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 08:10:57,305 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 08:10:57,305 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 08:10:57,306 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:10:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18b58fcb-d40e-4644-8a9d-1ac0e03ef43d/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-01 08:10:57,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 08:10:57,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-01 08:10:57,339 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-01 08:10:57,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-01 08:10:57,339 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-01 08:10:57,339 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-01 08:10:57,339 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-01 08:10:57,339 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-01 08:10:57,339 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-01 08:10:57,339 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-01 08:10:57,340 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-01 08:10:57,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 08:10:57,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 08:10:57,341 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-01 08:10:57,650 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 08:10:57,650 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-01 08:10:57,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 08:10:57 BoogieIcfgContainer [2018-12-01 08:10:57,651 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 08:10:57,651 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-01 08:10:57,651 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-01 08:10:57,653 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-01 08:10:57,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 08:10:56" (1/3) ... [2018-12-01 08:10:57,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e050f3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 08:10:57, skipping insertion in model container [2018-12-01 08:10:57,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:10:57" (2/3) ... [2018-12-01 08:10:57,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e050f3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 08:10:57, skipping insertion in model container [2018-12-01 08:10:57,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 08:10:57" (3/3) ... [2018-12-01 08:10:57,655 INFO L112 eAbstractionObserver]: Analyzing ICFG mix056_tso.opt_false-unreach-call.i [2018-12-01 08:10:57,678 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,678 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,678 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,678 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,678 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,678 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,678 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,679 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,679 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,679 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,679 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,679 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,679 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,679 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,679 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,679 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,679 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,680 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,680 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,680 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,680 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,680 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,680 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,680 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,680 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,680 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,680 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,681 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,681 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,681 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,681 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,681 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,681 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,681 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,681 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,681 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,681 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,681 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,682 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,682 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,682 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,682 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,682 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,682 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,682 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,682 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,682 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,682 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,683 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,683 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,683 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,683 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,683 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,683 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,683 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,683 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,683 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,683 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,684 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,684 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,684 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,684 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,684 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,684 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,684 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,684 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,684 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,684 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,684 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,685 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,685 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,685 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,685 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,685 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,685 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,685 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,685 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,685 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,685 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,685 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,686 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,686 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 08:10:57,690 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-01 08:10:57,690 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-01 08:10:57,695 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-01 08:10:57,705 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-01 08:10:57,719 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 08:10:57,719 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-01 08:10:57,719 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-01 08:10:57,719 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-01 08:10:57,720 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 08:10:57,720 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 08:10:57,720 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-01 08:10:57,720 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 08:10:57,720 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-01 08:10:57,726 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 155places, 192 transitions [2018-12-01 08:11:12,636 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 128912 states. [2018-12-01 08:11:12,638 INFO L276 IsEmpty]: Start isEmpty. Operand 128912 states. [2018-12-01 08:11:12,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-01 08:11:12,646 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 08:11:12,646 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-01 08:11:12,648 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 08:11:12,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:11:12,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1928541482, now seen corresponding path program 1 times [2018-12-01 08:11:12,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:11:12,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:11:12,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:12,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:11:12,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:12,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:11:12,802 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-01 08:11:12,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 08:11:12,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 08:11:12,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 08:11:12,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 08:11:12,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 08:11:12,816 INFO L87 Difference]: Start difference. First operand 128912 states. Second operand 4 states. [2018-12-01 08:11:14,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 08:11:14,112 INFO L93 Difference]: Finished difference Result 233472 states and 1098324 transitions. [2018-12-01 08:11:14,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 08:11:14,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-12-01 08:11:14,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 08:11:14,907 INFO L225 Difference]: With dead ends: 233472 [2018-12-01 08:11:14,907 INFO L226 Difference]: Without dead ends: 203722 [2018-12-01 08:11:14,908 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-01 08:11:17,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203722 states. [2018-12-01 08:11:19,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203722 to 118892. [2018-12-01 08:11:19,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118892 states. [2018-12-01 08:11:20,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118892 states to 118892 states and 559775 transitions. [2018-12-01 08:11:20,104 INFO L78 Accepts]: Start accepts. Automaton has 118892 states and 559775 transitions. Word has length 43 [2018-12-01 08:11:20,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 08:11:20,104 INFO L480 AbstractCegarLoop]: Abstraction has 118892 states and 559775 transitions. [2018-12-01 08:11:20,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 08:11:20,105 INFO L276 IsEmpty]: Start isEmpty. Operand 118892 states and 559775 transitions. [2018-12-01 08:11:20,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-01 08:11:20,111 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 08:11:20,111 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-01 08:11:20,112 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 08:11:20,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:11:20,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1195634893, now seen corresponding path program 1 times [2018-12-01 08:11:20,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:11:20,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:11:20,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:20,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:11:20,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:20,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:11:20,155 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-01 08:11:20,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 08:11:20,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 08:11:20,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 08:11:20,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 08:11:20,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 08:11:20,156 INFO L87 Difference]: Start difference. First operand 118892 states and 559775 transitions. Second operand 3 states. [2018-12-01 08:11:21,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 08:11:21,110 INFO L93 Difference]: Finished difference Result 118892 states and 557815 transitions. [2018-12-01 08:11:21,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 08:11:21,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-01 08:11:21,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 08:11:21,429 INFO L225 Difference]: With dead ends: 118892 [2018-12-01 08:11:21,429 INFO L226 Difference]: Without dead ends: 118892 [2018-12-01 08:11:21,430 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-01 08:11:22,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118892 states. [2018-12-01 08:11:23,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118892 to 118892. [2018-12-01 08:11:23,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118892 states. [2018-12-01 08:11:24,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118892 states to 118892 states and 557815 transitions. [2018-12-01 08:11:24,043 INFO L78 Accepts]: Start accepts. Automaton has 118892 states and 557815 transitions. Word has length 50 [2018-12-01 08:11:24,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 08:11:24,044 INFO L480 AbstractCegarLoop]: Abstraction has 118892 states and 557815 transitions. [2018-12-01 08:11:24,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 08:11:24,044 INFO L276 IsEmpty]: Start isEmpty. Operand 118892 states and 557815 transitions. [2018-12-01 08:11:24,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-01 08:11:24,047 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 08:11:24,047 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-01 08:11:24,048 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 08:11:24,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:11:24,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1302381044, now seen corresponding path program 1 times [2018-12-01 08:11:24,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:11:24,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:11:24,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:24,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:11:24,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:24,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:11:24,102 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-01 08:11:24,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 08:11:24,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 08:11:24,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 08:11:24,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 08:11:24,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 08:11:24,103 INFO L87 Difference]: Start difference. First operand 118892 states and 557815 transitions. Second operand 5 states. [2018-12-01 08:11:27,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 08:11:27,730 INFO L93 Difference]: Finished difference Result 325272 states and 1468249 transitions. [2018-12-01 08:11:27,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 08:11:27,731 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-12-01 08:11:27,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 08:11:28,599 INFO L225 Difference]: With dead ends: 325272 [2018-12-01 08:11:28,599 INFO L226 Difference]: Without dead ends: 324272 [2018-12-01 08:11:28,599 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-01 08:11:29,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324272 states. [2018-12-01 08:11:33,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324272 to 186422. [2018-12-01 08:11:33,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186422 states. [2018-12-01 08:11:33,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186422 states to 186422 states and 840914 transitions. [2018-12-01 08:11:33,717 INFO L78 Accepts]: Start accepts. Automaton has 186422 states and 840914 transitions. Word has length 50 [2018-12-01 08:11:33,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 08:11:33,718 INFO L480 AbstractCegarLoop]: Abstraction has 186422 states and 840914 transitions. [2018-12-01 08:11:33,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 08:11:33,718 INFO L276 IsEmpty]: Start isEmpty. Operand 186422 states and 840914 transitions. [2018-12-01 08:11:33,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-01 08:11:33,723 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 08:11:33,723 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 08:11:33,723 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 08:11:33,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:11:33,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1678185933, now seen corresponding path program 1 times [2018-12-01 08:11:33,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:11:33,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:11:33,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:33,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:11:33,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:33,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:11:33,768 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-01 08:11:33,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 08:11:33,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 08:11:33,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 08:11:33,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 08:11:33,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 08:11:33,769 INFO L87 Difference]: Start difference. First operand 186422 states and 840914 transitions. Second operand 4 states. [2018-12-01 08:11:34,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 08:11:34,506 INFO L93 Difference]: Finished difference Result 163598 states and 725472 transitions. [2018-12-01 08:11:34,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 08:11:34,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-12-01 08:11:34,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 08:11:34,895 INFO L225 Difference]: With dead ends: 163598 [2018-12-01 08:11:34,895 INFO L226 Difference]: Without dead ends: 160993 [2018-12-01 08:11:34,896 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-01 08:11:35,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160993 states. [2018-12-01 08:11:37,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160993 to 160993. [2018-12-01 08:11:37,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160993 states. [2018-12-01 08:11:38,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160993 states to 160993 states and 716800 transitions. [2018-12-01 08:11:38,303 INFO L78 Accepts]: Start accepts. Automaton has 160993 states and 716800 transitions. Word has length 51 [2018-12-01 08:11:38,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 08:11:38,304 INFO L480 AbstractCegarLoop]: Abstraction has 160993 states and 716800 transitions. [2018-12-01 08:11:38,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 08:11:38,304 INFO L276 IsEmpty]: Start isEmpty. Operand 160993 states and 716800 transitions. [2018-12-01 08:11:38,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-01 08:11:38,309 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 08:11:38,309 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 08:11:38,309 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 08:11:38,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:11:38,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1667665363, now seen corresponding path program 1 times [2018-12-01 08:11:38,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:11:38,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:11:38,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:38,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:11:38,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:38,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:11:38,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 08:11:38,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 08:11:38,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 08:11:38,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 08:11:38,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 08:11:38,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-01 08:11:38,355 INFO L87 Difference]: Start difference. First operand 160993 states and 716800 transitions. Second operand 5 states. [2018-12-01 08:11:40,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 08:11:40,104 INFO L93 Difference]: Finished difference Result 51405 states and 209121 transitions. [2018-12-01 08:11:40,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 08:11:40,104 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-12-01 08:11:40,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 08:11:40,196 INFO L225 Difference]: With dead ends: 51405 [2018-12-01 08:11:40,196 INFO L226 Difference]: Without dead ends: 49093 [2018-12-01 08:11:40,196 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-01 08:11:40,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49093 states. [2018-12-01 08:11:40,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49093 to 49093. [2018-12-01 08:11:40,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49093 states. [2018-12-01 08:11:40,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49093 states to 49093 states and 200467 transitions. [2018-12-01 08:11:40,883 INFO L78 Accepts]: Start accepts. Automaton has 49093 states and 200467 transitions. Word has length 52 [2018-12-01 08:11:40,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 08:11:40,883 INFO L480 AbstractCegarLoop]: Abstraction has 49093 states and 200467 transitions. [2018-12-01 08:11:40,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 08:11:40,883 INFO L276 IsEmpty]: Start isEmpty. Operand 49093 states and 200467 transitions. [2018-12-01 08:11:40,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-01 08:11:40,891 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 08:11:40,891 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-01 08:11:40,891 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 08:11:40,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:11:40,892 INFO L82 PathProgramCache]: Analyzing trace with hash 503624572, now seen corresponding path program 1 times [2018-12-01 08:11:40,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:11:40,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:11:40,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:40,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:11:40,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:11:40,942 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-01 08:11:40,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 08:11:40,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 08:11:40,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 08:11:40,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 08:11:40,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 08:11:40,943 INFO L87 Difference]: Start difference. First operand 49093 states and 200467 transitions. Second operand 4 states. [2018-12-01 08:11:41,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 08:11:41,288 INFO L93 Difference]: Finished difference Result 70361 states and 282256 transitions. [2018-12-01 08:11:41,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 08:11:41,288 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-01 08:11:41,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 08:11:41,422 INFO L225 Difference]: With dead ends: 70361 [2018-12-01 08:11:41,422 INFO L226 Difference]: Without dead ends: 70361 [2018-12-01 08:11:41,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-01 08:11:41,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70361 states. [2018-12-01 08:11:42,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70361 to 53657. [2018-12-01 08:11:42,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53657 states. [2018-12-01 08:11:42,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53657 states to 53657 states and 217408 transitions. [2018-12-01 08:11:42,531 INFO L78 Accepts]: Start accepts. Automaton has 53657 states and 217408 transitions. Word has length 65 [2018-12-01 08:11:42,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 08:11:42,532 INFO L480 AbstractCegarLoop]: Abstraction has 53657 states and 217408 transitions. [2018-12-01 08:11:42,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 08:11:42,532 INFO L276 IsEmpty]: Start isEmpty. Operand 53657 states and 217408 transitions. [2018-12-01 08:11:42,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-01 08:11:42,545 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 08:11:42,545 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-01 08:11:42,545 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 08:11:42,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:11:42,545 INFO L82 PathProgramCache]: Analyzing trace with hash -2048532389, now seen corresponding path program 1 times [2018-12-01 08:11:42,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:11:42,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:11:42,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:42,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:11:42,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:42,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:11:42,604 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-01 08:11:42,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 08:11:42,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 08:11:42,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 08:11:42,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 08:11:42,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-01 08:11:42,605 INFO L87 Difference]: Start difference. First operand 53657 states and 217408 transitions. Second operand 6 states. [2018-12-01 08:11:42,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 08:11:42,671 INFO L93 Difference]: Finished difference Result 11001 states and 37616 transitions. [2018-12-01 08:11:42,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 08:11:42,671 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-12-01 08:11:42,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 08:11:42,683 INFO L225 Difference]: With dead ends: 11001 [2018-12-01 08:11:42,683 INFO L226 Difference]: Without dead ends: 9289 [2018-12-01 08:11:42,683 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-01 08:11:42,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9289 states. [2018-12-01 08:11:42,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9289 to 8774. [2018-12-01 08:11:42,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8774 states. [2018-12-01 08:11:42,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8774 states to 8774 states and 29920 transitions. [2018-12-01 08:11:42,783 INFO L78 Accepts]: Start accepts. Automaton has 8774 states and 29920 transitions. Word has length 65 [2018-12-01 08:11:42,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 08:11:42,783 INFO L480 AbstractCegarLoop]: Abstraction has 8774 states and 29920 transitions. [2018-12-01 08:11:42,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 08:11:42,783 INFO L276 IsEmpty]: Start isEmpty. Operand 8774 states and 29920 transitions. [2018-12-01 08:11:42,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-01 08:11:42,792 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 08:11:42,793 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 08:11:42,793 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 08:11:42,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:11:42,793 INFO L82 PathProgramCache]: Analyzing trace with hash 877472604, now seen corresponding path program 1 times [2018-12-01 08:11:42,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:11:42,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:11:42,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:42,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:11:42,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:42,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:11:42,831 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-01 08:11:42,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 08:11:42,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 08:11:42,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 08:11:42,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 08:11:42,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 08:11:42,832 INFO L87 Difference]: Start difference. First operand 8774 states and 29920 transitions. Second operand 3 states. [2018-12-01 08:11:42,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 08:11:42,920 INFO L93 Difference]: Finished difference Result 9194 states and 31201 transitions. [2018-12-01 08:11:42,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 08:11:42,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2018-12-01 08:11:42,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 08:11:42,930 INFO L225 Difference]: With dead ends: 9194 [2018-12-01 08:11:42,931 INFO L226 Difference]: Without dead ends: 9194 [2018-12-01 08:11:42,931 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-01 08:11:42,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9194 states. [2018-12-01 08:11:43,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9194 to 8964. [2018-12-01 08:11:43,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8964 states. [2018-12-01 08:11:43,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8964 states to 8964 states and 30502 transitions. [2018-12-01 08:11:43,019 INFO L78 Accepts]: Start accepts. Automaton has 8964 states and 30502 transitions. Word has length 98 [2018-12-01 08:11:43,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 08:11:43,019 INFO L480 AbstractCegarLoop]: Abstraction has 8964 states and 30502 transitions. [2018-12-01 08:11:43,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 08:11:43,019 INFO L276 IsEmpty]: Start isEmpty. Operand 8964 states and 30502 transitions. [2018-12-01 08:11:43,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-01 08:11:43,028 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 08:11:43,029 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 08:11:43,029 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 08:11:43,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:11:43,029 INFO L82 PathProgramCache]: Analyzing trace with hash -255717989, now seen corresponding path program 1 times [2018-12-01 08:11:43,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:11:43,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:11:43,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:43,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:11:43,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:43,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:11:43,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 08:11:43,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 08:11:43,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 08:11:43,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 08:11:43,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 08:11:43,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 08:11:43,068 INFO L87 Difference]: Start difference. First operand 8964 states and 30502 transitions. Second operand 4 states. [2018-12-01 08:11:43,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 08:11:43,216 INFO L93 Difference]: Finished difference Result 13969 states and 47679 transitions. [2018-12-01 08:11:43,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 08:11:43,216 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-12-01 08:11:43,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 08:11:43,232 INFO L225 Difference]: With dead ends: 13969 [2018-12-01 08:11:43,232 INFO L226 Difference]: Without dead ends: 13969 [2018-12-01 08:11:43,232 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-01 08:11:43,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13969 states. [2018-12-01 08:11:43,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13969 to 9164. [2018-12-01 08:11:43,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9164 states. [2018-12-01 08:11:43,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9164 states to 9164 states and 31112 transitions. [2018-12-01 08:11:43,345 INFO L78 Accepts]: Start accepts. Automaton has 9164 states and 31112 transitions. Word has length 98 [2018-12-01 08:11:43,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 08:11:43,345 INFO L480 AbstractCegarLoop]: Abstraction has 9164 states and 31112 transitions. [2018-12-01 08:11:43,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 08:11:43,345 INFO L276 IsEmpty]: Start isEmpty. Operand 9164 states and 31112 transitions. [2018-12-01 08:11:43,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-01 08:11:43,355 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 08:11:43,355 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-01 08:11:43,355 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 08:11:43,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:11:43,355 INFO L82 PathProgramCache]: Analyzing trace with hash -436152029, now seen corresponding path program 2 times [2018-12-01 08:11:43,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:11:43,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:11:43,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:43,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:11:43,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:43,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:11:43,385 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-01 08:11:43,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 08:11:43,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 08:11:43,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 08:11:43,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 08:11:43,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-01 08:11:43,386 INFO L87 Difference]: Start difference. First operand 9164 states and 31112 transitions. Second operand 5 states. [2018-12-01 08:11:43,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 08:11:43,549 INFO L93 Difference]: Finished difference Result 13300 states and 44194 transitions. [2018-12-01 08:11:43,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 08:11:43,550 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2018-12-01 08:11:43,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 08:11:43,566 INFO L225 Difference]: With dead ends: 13300 [2018-12-01 08:11:43,566 INFO L226 Difference]: Without dead ends: 13300 [2018-12-01 08:11:43,566 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-01 08:11:43,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13300 states. [2018-12-01 08:11:43,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13300 to 9784. [2018-12-01 08:11:43,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9784 states. [2018-12-01 08:11:43,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9784 states to 9784 states and 33183 transitions. [2018-12-01 08:11:43,678 INFO L78 Accepts]: Start accepts. Automaton has 9784 states and 33183 transitions. Word has length 98 [2018-12-01 08:11:43,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 08:11:43,678 INFO L480 AbstractCegarLoop]: Abstraction has 9784 states and 33183 transitions. [2018-12-01 08:11:43,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 08:11:43,679 INFO L276 IsEmpty]: Start isEmpty. Operand 9784 states and 33183 transitions. [2018-12-01 08:11:43,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-01 08:11:43,689 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 08:11:43,689 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-01 08:11:43,690 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 08:11:43,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:11:43,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1460845950, now seen corresponding path program 1 times [2018-12-01 08:11:43,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:11:43,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:11:43,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:43,691 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 08:11:43,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:43,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:11:43,744 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-01 08:11:43,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 08:11:43,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 08:11:43,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 08:11:43,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 08:11:43,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-01 08:11:43,745 INFO L87 Difference]: Start difference. First operand 9784 states and 33183 transitions. Second operand 7 states. [2018-12-01 08:11:44,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 08:11:44,066 INFO L93 Difference]: Finished difference Result 12224 states and 40725 transitions. [2018-12-01 08:11:44,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 08:11:44,066 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2018-12-01 08:11:44,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 08:11:44,079 INFO L225 Difference]: With dead ends: 12224 [2018-12-01 08:11:44,079 INFO L226 Difference]: Without dead ends: 12179 [2018-12-01 08:11:44,080 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-01 08:11:44,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12179 states. [2018-12-01 08:11:44,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12179 to 11114. [2018-12-01 08:11:44,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11114 states. [2018-12-01 08:11:44,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11114 states to 11114 states and 37497 transitions. [2018-12-01 08:11:44,194 INFO L78 Accepts]: Start accepts. Automaton has 11114 states and 37497 transitions. Word has length 98 [2018-12-01 08:11:44,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 08:11:44,194 INFO L480 AbstractCegarLoop]: Abstraction has 11114 states and 37497 transitions. [2018-12-01 08:11:44,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 08:11:44,194 INFO L276 IsEmpty]: Start isEmpty. Operand 11114 states and 37497 transitions. [2018-12-01 08:11:44,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-01 08:11:44,206 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 08:11:44,206 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-01 08:11:44,206 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 08:11:44,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:11:44,206 INFO L82 PathProgramCache]: Analyzing trace with hash -813781119, now seen corresponding path program 3 times [2018-12-01 08:11:44,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:11:44,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:11:44,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:44,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:11:44,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:44,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:11:44,240 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-01 08:11:44,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 08:11:44,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 08:11:44,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 08:11:44,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 08:11:44,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-01 08:11:44,241 INFO L87 Difference]: Start difference. First operand 11114 states and 37497 transitions. Second operand 5 states. [2018-12-01 08:11:44,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 08:11:44,357 INFO L93 Difference]: Finished difference Result 12159 states and 40613 transitions. [2018-12-01 08:11:44,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 08:11:44,357 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2018-12-01 08:11:44,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 08:11:44,370 INFO L225 Difference]: With dead ends: 12159 [2018-12-01 08:11:44,370 INFO L226 Difference]: Without dead ends: 12159 [2018-12-01 08:11:44,370 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-01 08:11:44,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12159 states. [2018-12-01 08:11:44,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12159 to 11234. [2018-12-01 08:11:44,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11234 states. [2018-12-01 08:11:44,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11234 states to 11234 states and 37833 transitions. [2018-12-01 08:11:44,485 INFO L78 Accepts]: Start accepts. Automaton has 11234 states and 37833 transitions. Word has length 98 [2018-12-01 08:11:44,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 08:11:44,485 INFO L480 AbstractCegarLoop]: Abstraction has 11234 states and 37833 transitions. [2018-12-01 08:11:44,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 08:11:44,485 INFO L276 IsEmpty]: Start isEmpty. Operand 11234 states and 37833 transitions. [2018-12-01 08:11:44,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-01 08:11:44,496 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 08:11:44,496 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-01 08:11:44,496 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 08:11:44,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:11:44,496 INFO L82 PathProgramCache]: Analyzing trace with hash 510093507, now seen corresponding path program 1 times [2018-12-01 08:11:44,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:11:44,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:11:44,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:44,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 08:11:44,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:11:44,554 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-01 08:11:44,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 08:11:44,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 08:11:44,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 08:11:44,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 08:11:44,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 08:11:44,555 INFO L87 Difference]: Start difference. First operand 11234 states and 37833 transitions. Second operand 5 states. [2018-12-01 08:11:44,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 08:11:44,731 INFO L93 Difference]: Finished difference Result 15305 states and 50373 transitions. [2018-12-01 08:11:44,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 08:11:44,731 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2018-12-01 08:11:44,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 08:11:44,748 INFO L225 Difference]: With dead ends: 15305 [2018-12-01 08:11:44,748 INFO L226 Difference]: Without dead ends: 15165 [2018-12-01 08:11:44,748 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-01 08:11:44,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15165 states. [2018-12-01 08:11:44,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15165 to 11494. [2018-12-01 08:11:44,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11494 states. [2018-12-01 08:11:44,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11494 states to 11494 states and 38501 transitions. [2018-12-01 08:11:44,871 INFO L78 Accepts]: Start accepts. Automaton has 11494 states and 38501 transitions. Word has length 98 [2018-12-01 08:11:44,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 08:11:44,871 INFO L480 AbstractCegarLoop]: Abstraction has 11494 states and 38501 transitions. [2018-12-01 08:11:44,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 08:11:44,871 INFO L276 IsEmpty]: Start isEmpty. Operand 11494 states and 38501 transitions. [2018-12-01 08:11:44,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-01 08:11:44,880 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 08:11:44,880 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-01 08:11:44,880 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 08:11:44,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:11:44,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1564298, now seen corresponding path program 1 times [2018-12-01 08:11:44,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:11:44,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:11:44,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:44,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:11:44,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:44,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:11:44,905 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-01 08:11:44,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 08:11:44,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 08:11:44,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 08:11:44,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 08:11:44,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 08:11:44,906 INFO L87 Difference]: Start difference. First operand 11494 states and 38501 transitions. Second operand 4 states. [2018-12-01 08:11:45,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 08:11:45,026 INFO L93 Difference]: Finished difference Result 17920 states and 60397 transitions. [2018-12-01 08:11:45,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 08:11:45,027 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-01 08:11:45,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 08:11:45,046 INFO L225 Difference]: With dead ends: 17920 [2018-12-01 08:11:45,047 INFO L226 Difference]: Without dead ends: 17920 [2018-12-01 08:11:45,047 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-01 08:11:45,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17920 states. [2018-12-01 08:11:45,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17920 to 9819. [2018-12-01 08:11:45,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9819 states. [2018-12-01 08:11:45,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9819 states to 9819 states and 32796 transitions. [2018-12-01 08:11:45,178 INFO L78 Accepts]: Start accepts. Automaton has 9819 states and 32796 transitions. Word has length 100 [2018-12-01 08:11:45,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 08:11:45,179 INFO L480 AbstractCegarLoop]: Abstraction has 9819 states and 32796 transitions. [2018-12-01 08:11:45,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 08:11:45,179 INFO L276 IsEmpty]: Start isEmpty. Operand 9819 states and 32796 transitions. [2018-12-01 08:11:45,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-01 08:11:45,188 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 08:11:45,188 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-01 08:11:45,188 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 08:11:45,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:11:45,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1184911595, now seen corresponding path program 1 times [2018-12-01 08:11:45,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:11:45,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:11:45,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:45,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:11:45,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:45,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:11:45,255 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-01 08:11:45,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 08:11:45,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 08:11:45,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 08:11:45,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 08:11:45,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-01 08:11:45,256 INFO L87 Difference]: Start difference. First operand 9819 states and 32796 transitions. Second operand 6 states. [2018-12-01 08:11:45,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 08:11:45,482 INFO L93 Difference]: Finished difference Result 11694 states and 38496 transitions. [2018-12-01 08:11:45,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 08:11:45,482 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-01 08:11:45,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 08:11:45,493 INFO L225 Difference]: With dead ends: 11694 [2018-12-01 08:11:45,493 INFO L226 Difference]: Without dead ends: 11694 [2018-12-01 08:11:45,494 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-01 08:11:45,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11694 states. [2018-12-01 08:11:45,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11694 to 10164. [2018-12-01 08:11:45,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10164 states. [2018-12-01 08:11:45,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10164 states to 10164 states and 33907 transitions. [2018-12-01 08:11:45,602 INFO L78 Accepts]: Start accepts. Automaton has 10164 states and 33907 transitions. Word has length 100 [2018-12-01 08:11:45,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 08:11:45,602 INFO L480 AbstractCegarLoop]: Abstraction has 10164 states and 33907 transitions. [2018-12-01 08:11:45,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 08:11:45,602 INFO L276 IsEmpty]: Start isEmpty. Operand 10164 states and 33907 transitions. [2018-12-01 08:11:45,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-01 08:11:45,611 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 08:11:45,611 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-01 08:11:45,611 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 08:11:45,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:11:45,611 INFO L82 PathProgramCache]: Analyzing trace with hash -215330572, now seen corresponding path program 1 times [2018-12-01 08:11:45,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:11:45,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:11:45,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:45,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:11:45,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:45,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:11:45,668 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-01 08:11:45,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 08:11:45,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 08:11:45,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 08:11:45,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 08:11:45,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 08:11:45,668 INFO L87 Difference]: Start difference. First operand 10164 states and 33907 transitions. Second operand 6 states. [2018-12-01 08:11:45,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 08:11:45,826 INFO L93 Difference]: Finished difference Result 9333 states and 30729 transitions. [2018-12-01 08:11:45,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 08:11:45,826 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-01 08:11:45,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 08:11:45,836 INFO L225 Difference]: With dead ends: 9333 [2018-12-01 08:11:45,837 INFO L226 Difference]: Without dead ends: 9333 [2018-12-01 08:11:45,837 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-01 08:11:45,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9333 states. [2018-12-01 08:11:45,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9333 to 8974. [2018-12-01 08:11:45,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8974 states. [2018-12-01 08:11:45,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8974 states to 8974 states and 29675 transitions. [2018-12-01 08:11:45,936 INFO L78 Accepts]: Start accepts. Automaton has 8974 states and 29675 transitions. Word has length 100 [2018-12-01 08:11:45,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 08:11:45,937 INFO L480 AbstractCegarLoop]: Abstraction has 8974 states and 29675 transitions. [2018-12-01 08:11:45,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 08:11:45,937 INFO L276 IsEmpty]: Start isEmpty. Operand 8974 states and 29675 transitions. [2018-12-01 08:11:45,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-01 08:11:45,945 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 08:11:45,945 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-01 08:11:45,945 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 08:11:45,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:11:45,946 INFO L82 PathProgramCache]: Analyzing trace with hash -620129865, now seen corresponding path program 1 times [2018-12-01 08:11:45,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:11:45,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:11:45,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:45,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:11:45,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:45,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:11:45,988 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-01 08:11:45,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 08:11:45,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 08:11:45,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 08:11:45,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 08:11:45,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-01 08:11:45,988 INFO L87 Difference]: Start difference. First operand 8974 states and 29675 transitions. Second operand 6 states. [2018-12-01 08:11:46,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 08:11:46,196 INFO L93 Difference]: Finished difference Result 10194 states and 32931 transitions. [2018-12-01 08:11:46,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 08:11:46,197 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-01 08:11:46,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 08:11:46,206 INFO L225 Difference]: With dead ends: 10194 [2018-12-01 08:11:46,207 INFO L226 Difference]: Without dead ends: 9839 [2018-12-01 08:11:46,207 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-01 08:11:46,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9839 states. [2018-12-01 08:11:46,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9839 to 9154. [2018-12-01 08:11:46,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9154 states. [2018-12-01 08:11:46,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9154 states to 9154 states and 30059 transitions. [2018-12-01 08:11:46,295 INFO L78 Accepts]: Start accepts. Automaton has 9154 states and 30059 transitions. Word has length 100 [2018-12-01 08:11:46,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 08:11:46,295 INFO L480 AbstractCegarLoop]: Abstraction has 9154 states and 30059 transitions. [2018-12-01 08:11:46,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 08:11:46,296 INFO L276 IsEmpty]: Start isEmpty. Operand 9154 states and 30059 transitions. [2018-12-01 08:11:46,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-01 08:11:46,303 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 08:11:46,303 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-01 08:11:46,303 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 08:11:46,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:11:46,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1080610614, now seen corresponding path program 1 times [2018-12-01 08:11:46,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:11:46,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:11:46,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:46,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:11:46,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:46,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:11:46,354 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-01 08:11:46,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 08:11:46,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 08:11:46,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 08:11:46,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 08:11:46,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-01 08:11:46,355 INFO L87 Difference]: Start difference. First operand 9154 states and 30059 transitions. Second operand 7 states. [2018-12-01 08:11:46,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 08:11:46,583 INFO L93 Difference]: Finished difference Result 10117 states and 33155 transitions. [2018-12-01 08:11:46,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 08:11:46,583 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2018-12-01 08:11:46,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 08:11:46,594 INFO L225 Difference]: With dead ends: 10117 [2018-12-01 08:11:46,594 INFO L226 Difference]: Without dead ends: 10117 [2018-12-01 08:11:46,594 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-01 08:11:46,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10117 states. [2018-12-01 08:11:46,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10117 to 9069. [2018-12-01 08:11:46,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9069 states. [2018-12-01 08:11:46,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9069 states to 9069 states and 29811 transitions. [2018-12-01 08:11:46,680 INFO L78 Accepts]: Start accepts. Automaton has 9069 states and 29811 transitions. Word has length 100 [2018-12-01 08:11:46,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 08:11:46,681 INFO L480 AbstractCegarLoop]: Abstraction has 9069 states and 29811 transitions. [2018-12-01 08:11:46,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 08:11:46,681 INFO L276 IsEmpty]: Start isEmpty. Operand 9069 states and 29811 transitions. [2018-12-01 08:11:46,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-01 08:11:46,688 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 08:11:46,688 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-01 08:11:46,688 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 08:11:46,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:11:46,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1803477162, now seen corresponding path program 1 times [2018-12-01 08:11:46,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:11:46,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:11:46,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:46,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:11:46,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:46,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:11:46,772 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-01 08:11:46,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 08:11:46,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 08:11:46,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 08:11:46,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 08:11:46,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-01 08:11:46,773 INFO L87 Difference]: Start difference. First operand 9069 states and 29811 transitions. Second operand 5 states. [2018-12-01 08:11:46,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 08:11:46,859 INFO L93 Difference]: Finished difference Result 8217 states and 26961 transitions. [2018-12-01 08:11:46,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 08:11:46,859 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2018-12-01 08:11:46,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 08:11:46,868 INFO L225 Difference]: With dead ends: 8217 [2018-12-01 08:11:46,868 INFO L226 Difference]: Without dead ends: 8217 [2018-12-01 08:11:46,869 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-01 08:11:46,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8217 states. [2018-12-01 08:11:46,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8217 to 8032. [2018-12-01 08:11:46,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8032 states. [2018-12-01 08:11:46,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8032 states to 8032 states and 26443 transitions. [2018-12-01 08:11:46,940 INFO L78 Accepts]: Start accepts. Automaton has 8032 states and 26443 transitions. Word has length 100 [2018-12-01 08:11:46,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 08:11:46,941 INFO L480 AbstractCegarLoop]: Abstraction has 8032 states and 26443 transitions. [2018-12-01 08:11:46,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 08:11:46,941 INFO L276 IsEmpty]: Start isEmpty. Operand 8032 states and 26443 transitions. [2018-12-01 08:11:46,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-01 08:11:46,947 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 08:11:46,947 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-01 08:11:46,947 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 08:11:46,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:11:46,947 INFO L82 PathProgramCache]: Analyzing trace with hash 705286743, now seen corresponding path program 1 times [2018-12-01 08:11:46,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:11:46,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:11:46,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:46,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:11:46,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:46,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:11:46,990 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-01 08:11:46,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 08:11:46,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 08:11:46,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 08:11:46,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 08:11:46,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 08:11:46,991 INFO L87 Difference]: Start difference. First operand 8032 states and 26443 transitions. Second operand 4 states. [2018-12-01 08:11:47,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 08:11:47,103 INFO L93 Difference]: Finished difference Result 9376 states and 31131 transitions. [2018-12-01 08:11:47,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 08:11:47,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-01 08:11:47,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 08:11:47,113 INFO L225 Difference]: With dead ends: 9376 [2018-12-01 08:11:47,113 INFO L226 Difference]: Without dead ends: 9376 [2018-12-01 08:11:47,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 08:11:47,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9376 states. [2018-12-01 08:11:47,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9376 to 9248. [2018-12-01 08:11:47,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9248 states. [2018-12-01 08:11:47,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9248 states to 9248 states and 30715 transitions. [2018-12-01 08:11:47,199 INFO L78 Accepts]: Start accepts. Automaton has 9248 states and 30715 transitions. Word has length 100 [2018-12-01 08:11:47,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 08:11:47,199 INFO L480 AbstractCegarLoop]: Abstraction has 9248 states and 30715 transitions. [2018-12-01 08:11:47,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 08:11:47,199 INFO L276 IsEmpty]: Start isEmpty. Operand 9248 states and 30715 transitions. [2018-12-01 08:11:47,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-01 08:11:47,206 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 08:11:47,207 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-01 08:11:47,207 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 08:11:47,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:11:47,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1371922600, now seen corresponding path program 1 times [2018-12-01 08:11:47,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:11:47,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:11:47,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:47,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:11:47,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:47,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:11:47,273 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-01 08:11:47,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 08:11:47,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 08:11:47,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 08:11:47,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 08:11:47,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-01 08:11:47,274 INFO L87 Difference]: Start difference. First operand 9248 states and 30715 transitions. Second operand 6 states. [2018-12-01 08:11:47,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 08:11:47,344 INFO L93 Difference]: Finished difference Result 8096 states and 26267 transitions. [2018-12-01 08:11:47,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 08:11:47,344 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-01 08:11:47,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 08:11:47,352 INFO L225 Difference]: With dead ends: 8096 [2018-12-01 08:11:47,352 INFO L226 Difference]: Without dead ends: 8096 [2018-12-01 08:11:47,353 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-01 08:11:47,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8096 states. [2018-12-01 08:11:47,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8096 to 6671. [2018-12-01 08:11:47,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6671 states. [2018-12-01 08:11:47,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6671 states to 6671 states and 21861 transitions. [2018-12-01 08:11:47,421 INFO L78 Accepts]: Start accepts. Automaton has 6671 states and 21861 transitions. Word has length 100 [2018-12-01 08:11:47,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 08:11:47,421 INFO L480 AbstractCegarLoop]: Abstraction has 6671 states and 21861 transitions. [2018-12-01 08:11:47,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 08:11:47,422 INFO L276 IsEmpty]: Start isEmpty. Operand 6671 states and 21861 transitions. [2018-12-01 08:11:47,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-01 08:11:47,427 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 08:11:47,427 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 08:11:47,427 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 08:11:47,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:11:47,428 INFO L82 PathProgramCache]: Analyzing trace with hash -497599059, now seen corresponding path program 1 times [2018-12-01 08:11:47,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:11:47,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:11:47,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:47,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:11:47,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:47,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:11:47,474 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-01 08:11:47,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 08:11:47,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 08:11:47,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 08:11:47,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 08:11:47,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-01 08:11:47,475 INFO L87 Difference]: Start difference. First operand 6671 states and 21861 transitions. Second operand 7 states. [2018-12-01 08:11:47,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 08:11:47,775 INFO L93 Difference]: Finished difference Result 12218 states and 39640 transitions. [2018-12-01 08:11:47,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-01 08:11:47,775 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-01 08:11:47,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 08:11:47,787 INFO L225 Difference]: With dead ends: 12218 [2018-12-01 08:11:47,788 INFO L226 Difference]: Without dead ends: 12218 [2018-12-01 08:11:47,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-01 08:11:47,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12218 states. [2018-12-01 08:11:47,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12218 to 9653. [2018-12-01 08:11:47,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9653 states. [2018-12-01 08:11:47,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9653 states to 9653 states and 31719 transitions. [2018-12-01 08:11:47,893 INFO L78 Accepts]: Start accepts. Automaton has 9653 states and 31719 transitions. Word has length 102 [2018-12-01 08:11:47,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 08:11:47,893 INFO L480 AbstractCegarLoop]: Abstraction has 9653 states and 31719 transitions. [2018-12-01 08:11:47,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 08:11:47,894 INFO L276 IsEmpty]: Start isEmpty. Operand 9653 states and 31719 transitions. [2018-12-01 08:11:47,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-01 08:11:47,902 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 08:11:47,902 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-01 08:11:47,902 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 08:11:47,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:11:47,903 INFO L82 PathProgramCache]: Analyzing trace with hash 747165422, now seen corresponding path program 1 times [2018-12-01 08:11:47,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:11:47,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:11:47,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:47,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:11:47,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:47,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:11:47,975 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-01 08:11:47,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 08:11:47,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 08:11:47,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 08:11:47,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 08:11:47,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 08:11:47,976 INFO L87 Difference]: Start difference. First operand 9653 states and 31719 transitions. Second operand 6 states. [2018-12-01 08:11:48,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 08:11:48,058 INFO L93 Difference]: Finished difference Result 9843 states and 32066 transitions. [2018-12-01 08:11:48,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 08:11:48,058 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-12-01 08:11:48,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 08:11:48,068 INFO L225 Difference]: With dead ends: 9843 [2018-12-01 08:11:48,068 INFO L226 Difference]: Without dead ends: 9843 [2018-12-01 08:11:48,069 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-01 08:11:48,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9843 states. [2018-12-01 08:11:48,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9843 to 9578. [2018-12-01 08:11:48,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9578 states. [2018-12-01 08:11:48,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9578 states to 9578 states and 31339 transitions. [2018-12-01 08:11:48,157 INFO L78 Accepts]: Start accepts. Automaton has 9578 states and 31339 transitions. Word has length 102 [2018-12-01 08:11:48,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 08:11:48,157 INFO L480 AbstractCegarLoop]: Abstraction has 9578 states and 31339 transitions. [2018-12-01 08:11:48,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 08:11:48,157 INFO L276 IsEmpty]: Start isEmpty. Operand 9578 states and 31339 transitions. [2018-12-01 08:11:48,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-01 08:11:48,165 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 08:11:48,165 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-01 08:11:48,166 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 08:11:48,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:11:48,166 INFO L82 PathProgramCache]: Analyzing trace with hash -167833298, now seen corresponding path program 1 times [2018-12-01 08:11:48,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:11:48,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:11:48,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:48,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:11:48,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:48,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:11:48,250 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-01 08:11:48,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 08:11:48,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 08:11:48,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 08:11:48,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 08:11:48,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 08:11:48,251 INFO L87 Difference]: Start difference. First operand 9578 states and 31339 transitions. Second operand 6 states. [2018-12-01 08:11:48,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 08:11:48,417 INFO L93 Difference]: Finished difference Result 12122 states and 38989 transitions. [2018-12-01 08:11:48,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 08:11:48,417 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-12-01 08:11:48,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 08:11:48,429 INFO L225 Difference]: With dead ends: 12122 [2018-12-01 08:11:48,429 INFO L226 Difference]: Without dead ends: 12122 [2018-12-01 08:11:48,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-01 08:11:48,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12122 states. [2018-12-01 08:11:48,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12122 to 9828. [2018-12-01 08:11:48,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9828 states. [2018-12-01 08:11:48,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9828 states to 9828 states and 31959 transitions. [2018-12-01 08:11:48,549 INFO L78 Accepts]: Start accepts. Automaton has 9828 states and 31959 transitions. Word has length 102 [2018-12-01 08:11:48,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 08:11:48,549 INFO L480 AbstractCegarLoop]: Abstraction has 9828 states and 31959 transitions. [2018-12-01 08:11:48,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 08:11:48,549 INFO L276 IsEmpty]: Start isEmpty. Operand 9828 states and 31959 transitions. [2018-12-01 08:11:48,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-01 08:11:48,557 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 08:11:48,557 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-01 08:11:48,557 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 08:11:48,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:11:48,557 INFO L82 PathProgramCache]: Analyzing trace with hash -597334546, now seen corresponding path program 2 times [2018-12-01 08:11:48,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:11:48,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:11:48,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:48,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:11:48,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:48,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:11:48,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 08:11:48,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 08:11:48,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 08:11:48,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 08:11:48,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 08:11:48,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-01 08:11:48,615 INFO L87 Difference]: Start difference. First operand 9828 states and 31959 transitions. Second operand 7 states. [2018-12-01 08:11:48,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 08:11:48,795 INFO L93 Difference]: Finished difference Result 9928 states and 32214 transitions. [2018-12-01 08:11:48,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-01 08:11:48,796 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-01 08:11:48,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 08:11:48,805 INFO L225 Difference]: With dead ends: 9928 [2018-12-01 08:11:48,806 INFO L226 Difference]: Without dead ends: 9928 [2018-12-01 08:11:48,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-12-01 08:11:48,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9928 states. [2018-12-01 08:11:48,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9928 to 9828. [2018-12-01 08:11:48,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9828 states. [2018-12-01 08:11:48,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9828 states to 9828 states and 31944 transitions. [2018-12-01 08:11:48,895 INFO L78 Accepts]: Start accepts. Automaton has 9828 states and 31944 transitions. Word has length 102 [2018-12-01 08:11:48,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 08:11:48,895 INFO L480 AbstractCegarLoop]: Abstraction has 9828 states and 31944 transitions. [2018-12-01 08:11:48,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 08:11:48,895 INFO L276 IsEmpty]: Start isEmpty. Operand 9828 states and 31944 transitions. [2018-12-01 08:11:48,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-01 08:11:48,903 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 08:11:48,903 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-01 08:11:48,903 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 08:11:48,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:11:48,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1996892271, now seen corresponding path program 1 times [2018-12-01 08:11:48,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:11:48,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:11:48,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:48,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 08:11:48,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:48,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:11:48,956 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-01 08:11:48,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 08:11:48,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 08:11:48,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 08:11:48,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 08:11:48,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 08:11:48,957 INFO L87 Difference]: Start difference. First operand 9828 states and 31944 transitions. Second operand 5 states. [2018-12-01 08:11:49,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 08:11:49,073 INFO L93 Difference]: Finished difference Result 11108 states and 36104 transitions. [2018-12-01 08:11:49,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 08:11:49,074 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-12-01 08:11:49,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 08:11:49,085 INFO L225 Difference]: With dead ends: 11108 [2018-12-01 08:11:49,085 INFO L226 Difference]: Without dead ends: 11108 [2018-12-01 08:11:49,085 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-01 08:11:49,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11108 states. [2018-12-01 08:11:49,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11108 to 8660. [2018-12-01 08:11:49,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8660 states. [2018-12-01 08:11:49,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8660 states to 8660 states and 28255 transitions. [2018-12-01 08:11:49,173 INFO L78 Accepts]: Start accepts. Automaton has 8660 states and 28255 transitions. Word has length 102 [2018-12-01 08:11:49,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 08:11:49,173 INFO L480 AbstractCegarLoop]: Abstraction has 8660 states and 28255 transitions. [2018-12-01 08:11:49,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 08:11:49,173 INFO L276 IsEmpty]: Start isEmpty. Operand 8660 states and 28255 transitions. [2018-12-01 08:11:49,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-01 08:11:49,180 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 08:11:49,180 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-01 08:11:49,180 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 08:11:49,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:11:49,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1053310544, now seen corresponding path program 1 times [2018-12-01 08:11:49,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:11:49,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:11:49,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:49,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:11:49,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:49,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:11:49,281 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-01 08:11:49,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 08:11:49,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-01 08:11:49,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-01 08:11:49,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-01 08:11:49,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-01 08:11:49,282 INFO L87 Difference]: Start difference. First operand 8660 states and 28255 transitions. Second operand 10 states. [2018-12-01 08:11:49,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 08:11:49,580 INFO L93 Difference]: Finished difference Result 16320 states and 53652 transitions. [2018-12-01 08:11:49,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 08:11:49,581 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 102 [2018-12-01 08:11:49,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 08:11:49,589 INFO L225 Difference]: With dead ends: 16320 [2018-12-01 08:11:49,589 INFO L226 Difference]: Without dead ends: 8000 [2018-12-01 08:11:49,590 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-01 08:11:49,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8000 states. [2018-12-01 08:11:49,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8000 to 8000. [2018-12-01 08:11:49,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8000 states. [2018-12-01 08:11:49,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8000 states to 8000 states and 26319 transitions. [2018-12-01 08:11:49,663 INFO L78 Accepts]: Start accepts. Automaton has 8000 states and 26319 transitions. Word has length 102 [2018-12-01 08:11:49,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 08:11:49,663 INFO L480 AbstractCegarLoop]: Abstraction has 8000 states and 26319 transitions. [2018-12-01 08:11:49,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-01 08:11:49,663 INFO L276 IsEmpty]: Start isEmpty. Operand 8000 states and 26319 transitions. [2018-12-01 08:11:49,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-01 08:11:49,670 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 08:11:49,670 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-01 08:11:49,670 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 08:11:49,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:11:49,670 INFO L82 PathProgramCache]: Analyzing trace with hash -863716684, now seen corresponding path program 2 times [2018-12-01 08:11:49,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:11:49,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:11:49,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:49,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:11:49,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:49,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:11:49,743 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-01 08:11:49,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 08:11:49,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 08:11:49,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 08:11:49,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 08:11:49,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-01 08:11:49,744 INFO L87 Difference]: Start difference. First operand 8000 states and 26319 transitions. Second operand 7 states. [2018-12-01 08:11:49,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 08:11:49,929 INFO L93 Difference]: Finished difference Result 14610 states and 48898 transitions. [2018-12-01 08:11:49,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 08:11:49,929 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-01 08:11:49,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 08:11:49,937 INFO L225 Difference]: With dead ends: 14610 [2018-12-01 08:11:49,937 INFO L226 Difference]: Without dead ends: 6821 [2018-12-01 08:11:49,937 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-01 08:11:49,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6821 states. [2018-12-01 08:11:49,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6821 to 6821. [2018-12-01 08:11:49,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6821 states. [2018-12-01 08:11:50,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6821 states to 6821 states and 23131 transitions. [2018-12-01 08:11:50,003 INFO L78 Accepts]: Start accepts. Automaton has 6821 states and 23131 transitions. Word has length 102 [2018-12-01 08:11:50,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 08:11:50,003 INFO L480 AbstractCegarLoop]: Abstraction has 6821 states and 23131 transitions. [2018-12-01 08:11:50,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 08:11:50,003 INFO L276 IsEmpty]: Start isEmpty. Operand 6821 states and 23131 transitions. [2018-12-01 08:11:50,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-01 08:11:50,010 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 08:11:50,010 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-01 08:11:50,010 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 08:11:50,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:11:50,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1340703688, now seen corresponding path program 1 times [2018-12-01 08:11:50,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:11:50,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:11:50,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:50,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 08:11:50,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:50,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:11:50,079 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-01 08:11:50,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 08:11:50,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 08:11:50,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 08:11:50,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 08:11:50,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-01 08:11:50,080 INFO L87 Difference]: Start difference. First operand 6821 states and 23131 transitions. Second operand 7 states. [2018-12-01 08:11:50,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 08:11:50,316 INFO L93 Difference]: Finished difference Result 8957 states and 29585 transitions. [2018-12-01 08:11:50,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-01 08:11:50,316 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-01 08:11:50,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 08:11:50,326 INFO L225 Difference]: With dead ends: 8957 [2018-12-01 08:11:50,327 INFO L226 Difference]: Without dead ends: 8821 [2018-12-01 08:11:50,327 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-01 08:11:50,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8821 states. [2018-12-01 08:11:50,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8821 to 6805. [2018-12-01 08:11:50,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6805 states. [2018-12-01 08:11:50,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6805 states to 6805 states and 23039 transitions. [2018-12-01 08:11:50,404 INFO L78 Accepts]: Start accepts. Automaton has 6805 states and 23039 transitions. Word has length 102 [2018-12-01 08:11:50,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 08:11:50,404 INFO L480 AbstractCegarLoop]: Abstraction has 6805 states and 23039 transitions. [2018-12-01 08:11:50,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 08:11:50,404 INFO L276 IsEmpty]: Start isEmpty. Operand 6805 states and 23039 transitions. [2018-12-01 08:11:50,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-01 08:11:50,410 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 08:11:50,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, 1, 1, 1, 1] [2018-12-01 08:11:50,410 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 08:11:50,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:11:50,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1018603321, now seen corresponding path program 1 times [2018-12-01 08:11:50,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:11:50,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:11:50,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:50,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:11:50,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:50,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:11:50,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 08:11:50,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 08:11:50,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 08:11:50,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 08:11:50,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 08:11:50,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-01 08:11:50,474 INFO L87 Difference]: Start difference. First operand 6805 states and 23039 transitions. Second operand 7 states. [2018-12-01 08:11:50,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 08:11:50,706 INFO L93 Difference]: Finished difference Result 13593 states and 46438 transitions. [2018-12-01 08:11:50,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 08:11:50,706 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-01 08:11:50,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 08:11:50,722 INFO L225 Difference]: With dead ends: 13593 [2018-12-01 08:11:50,722 INFO L226 Difference]: Without dead ends: 13593 [2018-12-01 08:11:50,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-01 08:11:50,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13593 states. [2018-12-01 08:11:50,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13593 to 6965. [2018-12-01 08:11:50,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6965 states. [2018-12-01 08:11:50,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6965 states to 6965 states and 23455 transitions. [2018-12-01 08:11:50,815 INFO L78 Accepts]: Start accepts. Automaton has 6965 states and 23455 transitions. Word has length 102 [2018-12-01 08:11:50,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 08:11:50,815 INFO L480 AbstractCegarLoop]: Abstraction has 6965 states and 23455 transitions. [2018-12-01 08:11:50,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 08:11:50,815 INFO L276 IsEmpty]: Start isEmpty. Operand 6965 states and 23455 transitions. [2018-12-01 08:11:50,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-01 08:11:50,821 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 08:11:50,821 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-01 08:11:50,821 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 08:11:50,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:11:50,821 INFO L82 PathProgramCache]: Analyzing trace with hash -682137158, now seen corresponding path program 3 times [2018-12-01 08:11:50,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:11:50,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:11:50,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:50,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:11:50,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:50,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:11:50,908 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-01 08:11:50,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 08:11:50,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-01 08:11:50,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-01 08:11:50,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-01 08:11:50,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-01 08:11:50,909 INFO L87 Difference]: Start difference. First operand 6965 states and 23455 transitions. Second operand 12 states. [2018-12-01 08:11:51,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 08:11:51,257 INFO L93 Difference]: Finished difference Result 13529 states and 45706 transitions. [2018-12-01 08:11:51,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-01 08:11:51,257 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 102 [2018-12-01 08:11:51,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 08:11:51,267 INFO L225 Difference]: With dead ends: 13529 [2018-12-01 08:11:51,267 INFO L226 Difference]: Without dead ends: 9625 [2018-12-01 08:11:51,267 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-01 08:11:51,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9625 states. [2018-12-01 08:11:51,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9625 to 9017. [2018-12-01 08:11:51,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9017 states. [2018-12-01 08:11:51,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9017 states to 9017 states and 29626 transitions. [2018-12-01 08:11:51,355 INFO L78 Accepts]: Start accepts. Automaton has 9017 states and 29626 transitions. Word has length 102 [2018-12-01 08:11:51,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 08:11:51,355 INFO L480 AbstractCegarLoop]: Abstraction has 9017 states and 29626 transitions. [2018-12-01 08:11:51,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-01 08:11:51,355 INFO L276 IsEmpty]: Start isEmpty. Operand 9017 states and 29626 transitions. [2018-12-01 08:11:51,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-01 08:11:51,363 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 08:11:51,363 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-01 08:11:51,363 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 08:11:51,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:11:51,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1730295936, now seen corresponding path program 4 times [2018-12-01 08:11:51,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:11:51,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:11:51,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:51,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 08:11:51,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:11:51,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:11:51,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:11:51,402 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-01 08:11:51,476 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-01 08:11:51,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 08:11:51 BasicIcfg [2018-12-01 08:11:51,477 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-01 08:11:51,477 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 08:11:51,477 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 08:11:51,477 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 08:11:51,478 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 08:10:57" (3/4) ... [2018-12-01 08:11:51,479 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-01 08:11:51,552 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_18b58fcb-d40e-4644-8a9d-1ac0e03ef43d/bin-2019/uautomizer/witness.graphml [2018-12-01 08:11:51,552 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 08:11:51,553 INFO L168 Benchmark]: Toolchain (without parser) took 54622.32 ms. Allocated memory was 1.0 GB in the beginning and 6.3 GB in the end (delta: 5.2 GB). Free memory was 956.0 MB in the beginning and 3.4 GB in the end (delta: -2.4 GB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. [2018-12-01 08:11:51,554 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 08:11:51,554 INFO L168 Benchmark]: CACSL2BoogieTranslator took 319.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -152.2 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2018-12-01 08:11:51,554 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-01 08:11:51,554 INFO L168 Benchmark]: Boogie Preprocessor took 19.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 08:11:51,554 INFO L168 Benchmark]: RCFGBuilder took 345.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 47.2 MB). Peak memory consumption was 47.2 MB. Max. memory is 11.5 GB. [2018-12-01 08:11:51,555 INFO L168 Benchmark]: TraceAbstraction took 53825.84 ms. Allocated memory was 1.2 GB in the beginning and 6.3 GB in the end (delta: 5.1 GB). Free memory was 1.1 GB in the beginning and 3.4 GB in the end (delta: -2.4 GB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. [2018-12-01 08:11:51,555 INFO L168 Benchmark]: Witness Printer took 75.32 ms. Allocated memory is still 6.3 GB. Free memory was 3.4 GB in the beginning and 3.4 GB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2018-12-01 08:11:51,556 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 319.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -152.2 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 345.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 47.2 MB). Peak memory consumption was 47.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 53825.84 ms. Allocated memory was 1.2 GB in the beginning and 6.3 GB in the end (delta: 5.1 GB). Free memory was 1.1 GB in the beginning and 3.4 GB in the end (delta: -2.4 GB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. * Witness Printer took 75.32 ms. Allocated memory is still 6.3 GB. Free memory was 3.4 GB in the beginning and 3.4 GB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 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 t1512; 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(&t1512, ((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 t1513; 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(&t1513, ((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 t1514; 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(&t1514, ((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=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=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=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=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=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=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=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=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=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=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=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=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=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=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=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=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=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=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=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=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=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=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=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=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=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 198 locations, 3 error locations. UNSAFE Result, 53.7s OverallTime, 32 OverallIterations, 1 TraceHistogramMax, 16.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6787 SDtfs, 6677 SDslu, 15481 SDs, 0 SdLazy, 5811 SolverSat, 307 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 298 GetRequests, 90 SyntacticMatches, 21 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=186422occurred in iteration=3, 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: 20.5s AutomataMinimizationTime, 31 MinimizatonAttempts, 284496 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 2886 NumberOfCodeBlocks, 2886 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2753 ConstructedInterpolants, 0 QuantifiedInterpolants, 592552 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...