./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix000_pso.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_57036ee8-43af-44da-8b61-f8078ef52e10/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_57036ee8-43af-44da-8b61-f8078ef52e10/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_57036ee8-43af-44da-8b61-f8078ef52e10/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_57036ee8-43af-44da-8b61-f8078ef52e10/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix000_pso.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_57036ee8-43af-44da-8b61-f8078ef52e10/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_57036ee8-43af-44da-8b61-f8078ef52e10/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 6be5e1249e528c312f23b1d0d2e38ea13190aebb ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 05:37:32,539 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 05:37:32,540 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 05:37:32,546 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 05:37:32,547 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 05:37:32,547 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 05:37:32,548 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 05:37:32,550 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 05:37:32,551 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 05:37:32,551 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 05:37:32,552 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 05:37:32,552 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 05:37:32,553 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 05:37:32,554 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 05:37:32,555 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 05:37:32,555 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 05:37:32,556 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 05:37:32,557 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 05:37:32,558 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 05:37:32,559 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 05:37:32,560 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 05:37:32,561 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 05:37:32,562 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 05:37:32,563 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 05:37:32,563 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 05:37:32,563 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 05:37:32,564 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 05:37:32,565 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 05:37:32,565 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 05:37:32,565 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 05:37:32,566 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 05:37:32,566 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 05:37:32,566 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 05:37:32,566 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 05:37:32,566 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 05:37:32,567 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 05:37:32,567 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_57036ee8-43af-44da-8b61-f8078ef52e10/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-09 05:37:32,574 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 05:37:32,574 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 05:37:32,574 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 05:37:32,575 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 05:37:32,575 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 05:37:32,575 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 05:37:32,575 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 05:37:32,575 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 05:37:32,575 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 05:37:32,575 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 05:37:32,576 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 05:37:32,576 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 05:37:32,576 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 05:37:32,576 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 05:37:32,576 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 05:37:32,576 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 05:37:32,576 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 05:37:32,576 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 05:37:32,576 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 05:37:32,576 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 05:37:32,576 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 05:37:32,577 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 05:37:32,577 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 05:37:32,577 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 05:37:32,577 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 05:37:32,577 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 05:37:32,577 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 05:37:32,577 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 05:37:32,577 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 05:37:32,577 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 05:37:32,577 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_57036ee8-43af-44da-8b61-f8078ef52e10/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 -> 6be5e1249e528c312f23b1d0d2e38ea13190aebb [2018-12-09 05:37:32,595 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 05:37:32,604 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 05:37:32,607 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 05:37:32,608 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 05:37:32,608 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 05:37:32,609 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_57036ee8-43af-44da-8b61-f8078ef52e10/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix000_pso.oepc_false-unreach-call.i [2018-12-09 05:37:32,645 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_57036ee8-43af-44da-8b61-f8078ef52e10/bin-2019/uautomizer/data/fc023665d/decfa25aba8549558ba7c14a2afe48eb/FLAG545254493 [2018-12-09 05:37:33,034 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 05:37:33,035 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_57036ee8-43af-44da-8b61-f8078ef52e10/sv-benchmarks/c/pthread-wmm/mix000_pso.oepc_false-unreach-call.i [2018-12-09 05:37:33,042 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_57036ee8-43af-44da-8b61-f8078ef52e10/bin-2019/uautomizer/data/fc023665d/decfa25aba8549558ba7c14a2afe48eb/FLAG545254493 [2018-12-09 05:37:33,384 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_57036ee8-43af-44da-8b61-f8078ef52e10/bin-2019/uautomizer/data/fc023665d/decfa25aba8549558ba7c14a2afe48eb [2018-12-09 05:37:33,386 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 05:37:33,387 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 05:37:33,387 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 05:37:33,387 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 05:37:33,390 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 05:37:33,391 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:37:33" (1/1) ... [2018-12-09 05:37:33,393 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51e31f4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:37:33, skipping insertion in model container [2018-12-09 05:37:33,393 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:37:33" (1/1) ... [2018-12-09 05:37:33,397 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 05:37:33,422 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 05:37:33,604 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 05:37:33,612 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 05:37:33,695 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 05:37:33,725 INFO L195 MainTranslator]: Completed translation [2018-12-09 05:37:33,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:37:33 WrapperNode [2018-12-09 05:37:33,725 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 05:37:33,726 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 05:37:33,726 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 05:37:33,726 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 05:37:33,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:37:33" (1/1) ... [2018-12-09 05:37:33,743 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:37:33" (1/1) ... [2018-12-09 05:37:33,760 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 05:37:33,760 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 05:37:33,760 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 05:37:33,760 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 05:37:33,766 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:37:33" (1/1) ... [2018-12-09 05:37:33,767 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:37:33" (1/1) ... [2018-12-09 05:37:33,769 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:37:33" (1/1) ... [2018-12-09 05:37:33,770 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:37:33" (1/1) ... [2018-12-09 05:37:33,775 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:37:33" (1/1) ... [2018-12-09 05:37:33,778 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:37:33" (1/1) ... [2018-12-09 05:37:33,779 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:37:33" (1/1) ... [2018-12-09 05:37:33,782 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 05:37:33,782 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 05:37:33,782 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 05:37:33,782 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 05:37:33,783 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:37:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57036ee8-43af-44da-8b61-f8078ef52e10/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 05:37:33,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 05:37:33,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 05:37:33,816 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 05:37:33,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 05:37:33,816 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 05:37:33,817 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 05:37:33,817 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 05:37:33,817 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 05:37:33,817 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 05:37:33,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 05:37:33,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 05:37:33,818 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-09 05:37:34,199 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 05:37:34,199 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 05:37:34,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:37:34 BoogieIcfgContainer [2018-12-09 05:37:34,200 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 05:37:34,201 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 05:37:34,201 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 05:37:34,203 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 05:37:34,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 05:37:33" (1/3) ... [2018-12-09 05:37:34,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6315948 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:37:34, skipping insertion in model container [2018-12-09 05:37:34,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:37:33" (2/3) ... [2018-12-09 05:37:34,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6315948 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:37:34, skipping insertion in model container [2018-12-09 05:37:34,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:37:34" (3/3) ... [2018-12-09 05:37:34,206 INFO L112 eAbstractionObserver]: Analyzing ICFG mix000_pso.oepc_false-unreach-call.i [2018-12-09 05:37:34,242 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,242 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,242 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,242 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,242 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,242 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,243 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,243 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,243 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,243 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,243 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,243 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,244 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,244 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,244 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,244 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,244 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,244 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,245 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,245 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,245 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,245 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,245 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,245 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,245 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,246 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,246 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,246 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,246 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,246 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,247 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,247 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,247 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,247 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,247 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,247 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,248 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,248 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,248 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,248 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,248 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,248 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,249 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,249 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,249 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,249 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,249 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,249 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,250 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,250 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,250 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,250 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,250 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,251 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,251 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,251 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,251 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,251 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,251 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,252 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,252 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,252 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,252 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,252 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,253 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,253 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,253 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,253 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,253 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,253 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,254 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,254 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,254 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,254 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,254 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,254 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,255 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,255 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,255 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,255 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,255 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,255 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,256 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,256 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,256 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,256 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,256 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,257 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,257 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,257 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,257 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,257 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,257 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,258 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,258 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,258 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,258 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,258 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,258 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,259 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,259 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,259 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,259 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,259 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,259 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,260 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,260 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,260 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,260 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,260 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,261 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,261 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,261 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,261 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,262 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,262 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,262 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,262 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,262 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,262 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,263 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,263 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,263 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,263 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,263 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,263 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,264 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,264 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,264 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,265 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,265 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,265 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,265 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,265 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,265 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,265 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,266 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,266 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,266 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,266 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,266 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,266 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,266 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,266 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,267 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,267 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,267 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,267 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,267 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,267 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,267 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,268 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,268 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,268 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,268 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,268 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,268 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,268 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,269 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,269 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,269 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,269 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,269 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,269 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,269 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,269 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,270 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,270 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,270 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,270 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,270 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,270 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,270 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,270 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,271 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,271 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,271 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,271 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,271 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,271 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,271 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,271 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,272 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,272 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,272 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,272 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,272 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,272 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,272 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,273 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,273 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,273 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,273 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,273 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,273 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,273 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,274 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,274 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,274 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,274 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,274 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,274 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,274 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,275 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,275 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,275 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,275 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,275 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,275 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,275 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,275 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,276 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,276 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,276 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,276 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,276 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,276 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,276 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,276 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,277 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,277 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,277 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,277 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,277 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,277 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,277 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,277 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,277 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,278 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,278 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,278 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,278 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,278 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,278 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,278 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,278 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,279 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,279 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,279 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,279 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,279 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,279 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,279 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,279 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,280 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,280 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,280 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,280 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:37:34,285 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 05:37:34,286 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 05:37:34,291 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 05:37:34,299 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 05:37:34,313 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 05:37:34,314 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 05:37:34,314 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 05:37:34,314 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 05:37:34,314 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 05:37:34,314 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 05:37:34,314 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 05:37:34,314 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 05:37:34,314 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 05:37:34,321 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 186places, 245 transitions [2018-12-09 05:37:42,127 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 104360 states. [2018-12-09 05:37:42,128 INFO L276 IsEmpty]: Start isEmpty. Operand 104360 states. [2018-12-09 05:37:42,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 05:37:42,133 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:37:42,133 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] [2018-12-09 05:37:42,135 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:37:42,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:37:42,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1413658612, now seen corresponding path program 1 times [2018-12-09 05:37:42,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:37:42,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:37:42,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:37:42,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:37:42,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:37:42,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:37:42,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:37:42,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:37:42,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:37:42,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:37:42,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:37:42,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:37:42,303 INFO L87 Difference]: Start difference. First operand 104360 states. Second operand 4 states. [2018-12-09 05:37:43,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:37:43,505 INFO L93 Difference]: Finished difference Result 192000 states and 772893 transitions. [2018-12-09 05:37:43,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:37:43,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-12-09 05:37:43,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:37:43,931 INFO L225 Difference]: With dead ends: 192000 [2018-12-09 05:37:43,931 INFO L226 Difference]: Without dead ends: 135832 [2018-12-09 05:37:43,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:37:45,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135832 states. [2018-12-09 05:37:46,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135832 to 77068. [2018-12-09 05:37:46,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77068 states. [2018-12-09 05:37:46,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77068 states to 77068 states and 313611 transitions. [2018-12-09 05:37:46,783 INFO L78 Accepts]: Start accepts. Automaton has 77068 states and 313611 transitions. Word has length 35 [2018-12-09 05:37:46,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:37:46,783 INFO L480 AbstractCegarLoop]: Abstraction has 77068 states and 313611 transitions. [2018-12-09 05:37:46,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:37:46,784 INFO L276 IsEmpty]: Start isEmpty. Operand 77068 states and 313611 transitions. [2018-12-09 05:37:46,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 05:37:46,790 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:37:46,791 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:37:46,791 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:37:46,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:37:46,791 INFO L82 PathProgramCache]: Analyzing trace with hash 512759921, now seen corresponding path program 1 times [2018-12-09 05:37:46,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:37:46,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:37:46,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:37:46,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:37:46,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:37:46,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:37:46,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:37:46,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:37:46,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 05:37:46,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 05:37:46,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 05:37:46,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:37:46,849 INFO L87 Difference]: Start difference. First operand 77068 states and 313611 transitions. Second operand 5 states. [2018-12-09 05:37:49,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:37:49,261 INFO L93 Difference]: Finished difference Result 195844 states and 748303 transitions. [2018-12-09 05:37:49,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 05:37:49,262 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-09 05:37:49,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:37:49,667 INFO L225 Difference]: With dead ends: 195844 [2018-12-09 05:37:49,667 INFO L226 Difference]: Without dead ends: 195292 [2018-12-09 05:37:49,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 05:37:51,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195292 states. [2018-12-09 05:37:52,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195292 to 123067. [2018-12-09 05:37:52,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123067 states. [2018-12-09 05:37:53,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123067 states to 123067 states and 470493 transitions. [2018-12-09 05:37:53,132 INFO L78 Accepts]: Start accepts. Automaton has 123067 states and 470493 transitions. Word has length 47 [2018-12-09 05:37:53,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:37:53,133 INFO L480 AbstractCegarLoop]: Abstraction has 123067 states and 470493 transitions. [2018-12-09 05:37:53,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 05:37:53,133 INFO L276 IsEmpty]: Start isEmpty. Operand 123067 states and 470493 transitions. [2018-12-09 05:37:53,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 05:37:53,136 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:37:53,136 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] [2018-12-09 05:37:53,136 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:37:53,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:37:53,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1044252158, now seen corresponding path program 1 times [2018-12-09 05:37:53,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:37:53,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:37:53,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:37:53,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:37:53,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:37:53,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:37:53,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:37:53,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:37:53,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 05:37:53,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 05:37:53,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 05:37:53,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:37:53,182 INFO L87 Difference]: Start difference. First operand 123067 states and 470493 transitions. Second operand 5 states. [2018-12-09 05:37:54,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:37:54,672 INFO L93 Difference]: Finished difference Result 253868 states and 961457 transitions. [2018-12-09 05:37:54,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 05:37:54,673 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-12-09 05:37:54,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:37:55,230 INFO L225 Difference]: With dead ends: 253868 [2018-12-09 05:37:55,230 INFO L226 Difference]: Without dead ends: 253356 [2018-12-09 05:37:55,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 05:37:57,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253356 states. [2018-12-09 05:37:59,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253356 to 135934. [2018-12-09 05:37:59,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135934 states. [2018-12-09 05:37:59,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135934 states to 135934 states and 515687 transitions. [2018-12-09 05:37:59,656 INFO L78 Accepts]: Start accepts. Automaton has 135934 states and 515687 transitions. Word has length 48 [2018-12-09 05:37:59,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:37:59,656 INFO L480 AbstractCegarLoop]: Abstraction has 135934 states and 515687 transitions. [2018-12-09 05:37:59,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 05:37:59,656 INFO L276 IsEmpty]: Start isEmpty. Operand 135934 states and 515687 transitions. [2018-12-09 05:37:59,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 05:37:59,661 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:37:59,661 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-09 05:37:59,662 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:37:59,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:37:59,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1766694552, now seen corresponding path program 1 times [2018-12-09 05:37:59,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:37:59,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:37:59,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:37:59,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:37:59,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:37:59,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:37:59,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:37:59,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:37:59,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:37:59,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:37:59,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:37:59,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:37:59,686 INFO L87 Difference]: Start difference. First operand 135934 states and 515687 transitions. Second operand 3 states. [2018-12-09 05:38:00,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:38:00,608 INFO L93 Difference]: Finished difference Result 234162 states and 866041 transitions. [2018-12-09 05:38:00,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:38:00,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-09 05:38:00,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:38:01,499 INFO L225 Difference]: With dead ends: 234162 [2018-12-09 05:38:01,499 INFO L226 Difference]: Without dead ends: 234162 [2018-12-09 05:38:01,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:38:03,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234162 states. [2018-12-09 05:38:07,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234162 to 207903. [2018-12-09 05:38:07,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207903 states. [2018-12-09 05:38:08,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207903 states to 207903 states and 772292 transitions. [2018-12-09 05:38:08,367 INFO L78 Accepts]: Start accepts. Automaton has 207903 states and 772292 transitions. Word has length 50 [2018-12-09 05:38:08,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:38:08,367 INFO L480 AbstractCegarLoop]: Abstraction has 207903 states and 772292 transitions. [2018-12-09 05:38:08,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:38:08,367 INFO L276 IsEmpty]: Start isEmpty. Operand 207903 states and 772292 transitions. [2018-12-09 05:38:08,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 05:38:08,383 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:38:08,383 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:38:08,383 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:38:08,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:38:08,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1751055411, now seen corresponding path program 1 times [2018-12-09 05:38:08,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:38:08,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:38:08,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:38:08,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:38:08,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:38:08,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:38:08,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:38:08,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:38:08,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 05:38:08,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 05:38:08,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 05:38:08,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 05:38:08,437 INFO L87 Difference]: Start difference. First operand 207903 states and 772292 transitions. Second operand 6 states. [2018-12-09 05:38:10,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:38:10,457 INFO L93 Difference]: Finished difference Result 402833 states and 1473119 transitions. [2018-12-09 05:38:10,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 05:38:10,457 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-12-09 05:38:10,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:38:11,760 INFO L225 Difference]: With dead ends: 402833 [2018-12-09 05:38:11,760 INFO L226 Difference]: Without dead ends: 402257 [2018-12-09 05:38:11,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-09 05:38:14,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402257 states. [2018-12-09 05:38:20,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402257 to 208069. [2018-12-09 05:38:20,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208069 states. [2018-12-09 05:38:21,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208069 states to 208069 states and 773298 transitions. [2018-12-09 05:38:21,062 INFO L78 Accepts]: Start accepts. Automaton has 208069 states and 773298 transitions. Word has length 54 [2018-12-09 05:38:21,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:38:21,062 INFO L480 AbstractCegarLoop]: Abstraction has 208069 states and 773298 transitions. [2018-12-09 05:38:21,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 05:38:21,062 INFO L276 IsEmpty]: Start isEmpty. Operand 208069 states and 773298 transitions. [2018-12-09 05:38:21,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 05:38:21,077 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:38:21,077 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:38:21,077 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:38:21,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:38:21,078 INFO L82 PathProgramCache]: Analyzing trace with hash 8397738, now seen corresponding path program 1 times [2018-12-09 05:38:21,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:38:21,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:38:21,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:38:21,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:38:21,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:38:21,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:38:21,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:38:21,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:38:21,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 05:38:21,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 05:38:21,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 05:38:21,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 05:38:21,151 INFO L87 Difference]: Start difference. First operand 208069 states and 773298 transitions. Second operand 7 states. [2018-12-09 05:38:23,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:38:23,239 INFO L93 Difference]: Finished difference Result 325852 states and 1170129 transitions. [2018-12-09 05:38:23,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 05:38:23,239 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2018-12-09 05:38:23,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:38:23,923 INFO L225 Difference]: With dead ends: 325852 [2018-12-09 05:38:23,924 INFO L226 Difference]: Without dead ends: 325852 [2018-12-09 05:38:23,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-09 05:38:26,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325852 states. [2018-12-09 05:38:32,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325852 to 256642. [2018-12-09 05:38:32,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256642 states. [2018-12-09 05:38:32,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256642 states to 256642 states and 939283 transitions. [2018-12-09 05:38:32,748 INFO L78 Accepts]: Start accepts. Automaton has 256642 states and 939283 transitions. Word has length 54 [2018-12-09 05:38:32,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:38:32,749 INFO L480 AbstractCegarLoop]: Abstraction has 256642 states and 939283 transitions. [2018-12-09 05:38:32,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 05:38:32,749 INFO L276 IsEmpty]: Start isEmpty. Operand 256642 states and 939283 transitions. [2018-12-09 05:38:32,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 05:38:32,766 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:38:32,766 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:38:32,766 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:38:32,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:38:32,766 INFO L82 PathProgramCache]: Analyzing trace with hash 895901419, now seen corresponding path program 1 times [2018-12-09 05:38:32,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:38:32,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:38:32,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:38:32,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:38:32,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:38:32,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:38:32,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:38:32,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:38:32,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:38:32,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:38:32,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:38:32,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:38:32,799 INFO L87 Difference]: Start difference. First operand 256642 states and 939283 transitions. Second operand 4 states. [2018-12-09 05:38:32,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:38:32,904 INFO L93 Difference]: Finished difference Result 40004 states and 128000 transitions. [2018-12-09 05:38:32,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 05:38:32,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-12-09 05:38:32,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:38:32,947 INFO L225 Difference]: With dead ends: 40004 [2018-12-09 05:38:32,947 INFO L226 Difference]: Without dead ends: 32121 [2018-12-09 05:38:32,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:38:33,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32121 states. [2018-12-09 05:38:33,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32121 to 31856. [2018-12-09 05:38:33,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31856 states. [2018-12-09 05:38:33,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31856 states to 31856 states and 99339 transitions. [2018-12-09 05:38:33,305 INFO L78 Accepts]: Start accepts. Automaton has 31856 states and 99339 transitions. Word has length 54 [2018-12-09 05:38:33,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:38:33,305 INFO L480 AbstractCegarLoop]: Abstraction has 31856 states and 99339 transitions. [2018-12-09 05:38:33,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:38:33,305 INFO L276 IsEmpty]: Start isEmpty. Operand 31856 states and 99339 transitions. [2018-12-09 05:38:33,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-09 05:38:33,309 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:38:33,309 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:38:33,309 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:38:33,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:38:33,309 INFO L82 PathProgramCache]: Analyzing trace with hash 642841615, now seen corresponding path program 1 times [2018-12-09 05:38:33,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:38:33,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:38:33,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:38:33,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:38:33,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:38:33,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:38:33,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:38:33,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:38:33,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:38:33,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:38:33,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:38:33,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:38:33,341 INFO L87 Difference]: Start difference. First operand 31856 states and 99339 transitions. Second operand 4 states. [2018-12-09 05:38:33,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:38:33,535 INFO L93 Difference]: Finished difference Result 37101 states and 115387 transitions. [2018-12-09 05:38:33,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 05:38:33,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2018-12-09 05:38:33,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:38:33,580 INFO L225 Difference]: With dead ends: 37101 [2018-12-09 05:38:33,580 INFO L226 Difference]: Without dead ends: 37101 [2018-12-09 05:38:33,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:38:33,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37101 states. [2018-12-09 05:38:34,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37101 to 36125. [2018-12-09 05:38:34,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36125 states. [2018-12-09 05:38:34,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36125 states to 36125 states and 112472 transitions. [2018-12-09 05:38:34,259 INFO L78 Accepts]: Start accepts. Automaton has 36125 states and 112472 transitions. Word has length 62 [2018-12-09 05:38:34,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:38:34,259 INFO L480 AbstractCegarLoop]: Abstraction has 36125 states and 112472 transitions. [2018-12-09 05:38:34,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:38:34,260 INFO L276 IsEmpty]: Start isEmpty. Operand 36125 states and 112472 transitions. [2018-12-09 05:38:34,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-09 05:38:34,264 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:38:34,264 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] [2018-12-09 05:38:34,264 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:38:34,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:38:34,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1909315346, now seen corresponding path program 1 times [2018-12-09 05:38:34,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:38:34,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:38:34,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:38:34,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:38:34,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:38:34,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:38:34,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:38:34,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:38:34,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 05:38:34,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 05:38:34,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 05:38:34,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 05:38:34,311 INFO L87 Difference]: Start difference. First operand 36125 states and 112472 transitions. Second operand 6 states. [2018-12-09 05:38:34,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:38:34,835 INFO L93 Difference]: Finished difference Result 74227 states and 229198 transitions. [2018-12-09 05:38:34,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 05:38:34,836 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2018-12-09 05:38:34,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:38:34,933 INFO L225 Difference]: With dead ends: 74227 [2018-12-09 05:38:34,933 INFO L226 Difference]: Without dead ends: 74156 [2018-12-09 05:38:34,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-09 05:38:35,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74156 states. [2018-12-09 05:38:35,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74156 to 44213. [2018-12-09 05:38:35,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44213 states. [2018-12-09 05:38:35,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44213 states to 44213 states and 135208 transitions. [2018-12-09 05:38:35,573 INFO L78 Accepts]: Start accepts. Automaton has 44213 states and 135208 transitions. Word has length 62 [2018-12-09 05:38:35,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:38:35,573 INFO L480 AbstractCegarLoop]: Abstraction has 44213 states and 135208 transitions. [2018-12-09 05:38:35,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 05:38:35,573 INFO L276 IsEmpty]: Start isEmpty. Operand 44213 states and 135208 transitions. [2018-12-09 05:38:35,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 05:38:35,580 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:38:35,580 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] [2018-12-09 05:38:35,580 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:38:35,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:38:35,580 INFO L82 PathProgramCache]: Analyzing trace with hash -941424289, now seen corresponding path program 1 times [2018-12-09 05:38:35,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:38:35,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:38:35,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:38:35,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:38:35,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:38:35,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:38:35,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:38:35,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:38:35,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:38:35,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:38:35,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:38:35,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:38:35,608 INFO L87 Difference]: Start difference. First operand 44213 states and 135208 transitions. Second operand 3 states. [2018-12-09 05:38:35,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:38:35,786 INFO L93 Difference]: Finished difference Result 55070 states and 166417 transitions. [2018-12-09 05:38:35,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:38:35,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-12-09 05:38:35,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:38:35,857 INFO L225 Difference]: With dead ends: 55070 [2018-12-09 05:38:35,857 INFO L226 Difference]: Without dead ends: 55070 [2018-12-09 05:38:35,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:38:35,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55070 states. [2018-12-09 05:38:36,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55070 to 45329. [2018-12-09 05:38:36,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45329 states. [2018-12-09 05:38:36,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45329 states to 45329 states and 135858 transitions. [2018-12-09 05:38:36,681 INFO L78 Accepts]: Start accepts. Automaton has 45329 states and 135858 transitions. Word has length 68 [2018-12-09 05:38:36,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:38:36,681 INFO L480 AbstractCegarLoop]: Abstraction has 45329 states and 135858 transitions. [2018-12-09 05:38:36,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:38:36,681 INFO L276 IsEmpty]: Start isEmpty. Operand 45329 states and 135858 transitions. [2018-12-09 05:38:36,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-09 05:38:36,691 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:38:36,691 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:38:36,691 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:38:36,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:38:36,692 INFO L82 PathProgramCache]: Analyzing trace with hash 53745586, now seen corresponding path program 1 times [2018-12-09 05:38:36,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:38:36,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:38:36,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:38:36,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:38:36,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:38:36,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:38:36,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:38:36,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:38:36,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 05:38:36,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 05:38:36,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 05:38:36,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:38:36,739 INFO L87 Difference]: Start difference. First operand 45329 states and 135858 transitions. Second operand 5 states. [2018-12-09 05:38:37,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:38:37,031 INFO L93 Difference]: Finished difference Result 51158 states and 153082 transitions. [2018-12-09 05:38:37,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 05:38:37,032 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2018-12-09 05:38:37,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:38:37,094 INFO L225 Difference]: With dead ends: 51158 [2018-12-09 05:38:37,095 INFO L226 Difference]: Without dead ends: 51158 [2018-12-09 05:38:37,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-09 05:38:37,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51158 states. [2018-12-09 05:38:37,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51158 to 45794. [2018-12-09 05:38:37,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45794 states. [2018-12-09 05:38:37,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45794 states to 45794 states and 137141 transitions. [2018-12-09 05:38:37,606 INFO L78 Accepts]: Start accepts. Automaton has 45794 states and 137141 transitions. Word has length 74 [2018-12-09 05:38:37,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:38:37,606 INFO L480 AbstractCegarLoop]: Abstraction has 45794 states and 137141 transitions. [2018-12-09 05:38:37,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 05:38:37,606 INFO L276 IsEmpty]: Start isEmpty. Operand 45794 states and 137141 transitions. [2018-12-09 05:38:37,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-09 05:38:37,616 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:38:37,616 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:38:37,617 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:38:37,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:38:37,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1796555921, now seen corresponding path program 1 times [2018-12-09 05:38:37,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:38:37,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:38:37,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:38:37,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:38:37,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:38:37,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:38:37,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:38:37,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:38:37,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 05:38:37,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 05:38:37,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 05:38:37,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 05:38:37,659 INFO L87 Difference]: Start difference. First operand 45794 states and 137141 transitions. Second operand 7 states. [2018-12-09 05:38:38,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:38:38,265 INFO L93 Difference]: Finished difference Result 54436 states and 163097 transitions. [2018-12-09 05:38:38,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 05:38:38,265 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-12-09 05:38:38,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:38:38,332 INFO L225 Difference]: With dead ends: 54436 [2018-12-09 05:38:38,332 INFO L226 Difference]: Without dead ends: 54349 [2018-12-09 05:38:38,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-12-09 05:38:38,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54349 states. [2018-12-09 05:38:38,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54349 to 42854. [2018-12-09 05:38:38,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42854 states. [2018-12-09 05:38:38,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42854 states to 42854 states and 129588 transitions. [2018-12-09 05:38:38,916 INFO L78 Accepts]: Start accepts. Automaton has 42854 states and 129588 transitions. Word has length 74 [2018-12-09 05:38:38,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:38:38,917 INFO L480 AbstractCegarLoop]: Abstraction has 42854 states and 129588 transitions. [2018-12-09 05:38:38,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 05:38:38,917 INFO L276 IsEmpty]: Start isEmpty. Operand 42854 states and 129588 transitions. [2018-12-09 05:38:38,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-09 05:38:38,926 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:38:38,926 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] [2018-12-09 05:38:38,926 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:38:38,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:38:38,926 INFO L82 PathProgramCache]: Analyzing trace with hash -744614695, now seen corresponding path program 1 times [2018-12-09 05:38:38,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:38:38,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:38:38,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:38:38,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:38:38,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:38:38,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:38:38,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:38:38,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:38:38,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:38:38,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:38:38,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:38:38,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:38:38,970 INFO L87 Difference]: Start difference. First operand 42854 states and 129588 transitions. Second operand 4 states. [2018-12-09 05:38:39,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:38:39,442 INFO L93 Difference]: Finished difference Result 56907 states and 168235 transitions. [2018-12-09 05:38:39,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 05:38:39,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2018-12-09 05:38:39,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:38:39,515 INFO L225 Difference]: With dead ends: 56907 [2018-12-09 05:38:39,515 INFO L226 Difference]: Without dead ends: 56907 [2018-12-09 05:38:39,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:38:39,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56907 states. [2018-12-09 05:38:40,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56907 to 51423. [2018-12-09 05:38:40,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51423 states. [2018-12-09 05:38:40,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51423 states to 51423 states and 153222 transitions. [2018-12-09 05:38:40,146 INFO L78 Accepts]: Start accepts. Automaton has 51423 states and 153222 transitions. Word has length 76 [2018-12-09 05:38:40,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:38:40,147 INFO L480 AbstractCegarLoop]: Abstraction has 51423 states and 153222 transitions. [2018-12-09 05:38:40,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:38:40,147 INFO L276 IsEmpty]: Start isEmpty. Operand 51423 states and 153222 transitions. [2018-12-09 05:38:40,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-09 05:38:40,159 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:38:40,160 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] [2018-12-09 05:38:40,160 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:38:40,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:38:40,160 INFO L82 PathProgramCache]: Analyzing trace with hash 608695002, now seen corresponding path program 1 times [2018-12-09 05:38:40,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:38:40,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:38:40,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:38:40,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:38:40,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:38:40,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:38:40,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:38:40,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:38:40,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 05:38:40,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 05:38:40,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 05:38:40,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 05:38:40,221 INFO L87 Difference]: Start difference. First operand 51423 states and 153222 transitions. Second operand 7 states. [2018-12-09 05:38:41,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:38:41,153 INFO L93 Difference]: Finished difference Result 106618 states and 315348 transitions. [2018-12-09 05:38:41,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 05:38:41,154 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2018-12-09 05:38:41,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:38:41,288 INFO L225 Difference]: With dead ends: 106618 [2018-12-09 05:38:41,289 INFO L226 Difference]: Without dead ends: 106554 [2018-12-09 05:38:41,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2018-12-09 05:38:41,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106554 states. [2018-12-09 05:38:42,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106554 to 56647. [2018-12-09 05:38:42,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56647 states. [2018-12-09 05:38:42,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56647 states to 56647 states and 166937 transitions. [2018-12-09 05:38:42,161 INFO L78 Accepts]: Start accepts. Automaton has 56647 states and 166937 transitions. Word has length 76 [2018-12-09 05:38:42,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:38:42,161 INFO L480 AbstractCegarLoop]: Abstraction has 56647 states and 166937 transitions. [2018-12-09 05:38:42,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 05:38:42,161 INFO L276 IsEmpty]: Start isEmpty. Operand 56647 states and 166937 transitions. [2018-12-09 05:38:42,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 05:38:42,185 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:38:42,185 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] [2018-12-09 05:38:42,185 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:38:42,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:38:42,185 INFO L82 PathProgramCache]: Analyzing trace with hash 153257945, now seen corresponding path program 1 times [2018-12-09 05:38:42,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:38:42,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:38:42,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:38:42,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:38:42,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:38:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:38:42,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:38:42,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:38:42,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:38:42,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:38:42,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:38:42,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:38:42,215 INFO L87 Difference]: Start difference. First operand 56647 states and 166937 transitions. Second operand 4 states. [2018-12-09 05:38:42,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:38:42,510 INFO L93 Difference]: Finished difference Result 62874 states and 184413 transitions. [2018-12-09 05:38:42,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:38:42,511 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-12-09 05:38:42,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:38:42,585 INFO L225 Difference]: With dead ends: 62874 [2018-12-09 05:38:42,585 INFO L226 Difference]: Without dead ends: 62874 [2018-12-09 05:38:42,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:38:42,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62874 states. [2018-12-09 05:38:43,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62874 to 61596. [2018-12-09 05:38:43,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61596 states. [2018-12-09 05:38:43,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61596 states to 61596 states and 180682 transitions. [2018-12-09 05:38:43,314 INFO L78 Accepts]: Start accepts. Automaton has 61596 states and 180682 transitions. Word has length 82 [2018-12-09 05:38:43,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:38:43,314 INFO L480 AbstractCegarLoop]: Abstraction has 61596 states and 180682 transitions. [2018-12-09 05:38:43,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:38:43,314 INFO L276 IsEmpty]: Start isEmpty. Operand 61596 states and 180682 transitions. [2018-12-09 05:38:43,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 05:38:43,339 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:38:43,339 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] [2018-12-09 05:38:43,339 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:38:43,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:38:43,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1923951398, now seen corresponding path program 1 times [2018-12-09 05:38:43,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:38:43,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:38:43,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:38:43,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:38:43,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:38:43,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:38:43,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:38:43,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:38:43,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:38:43,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:38:43,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:38:43,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:38:43,364 INFO L87 Difference]: Start difference. First operand 61596 states and 180682 transitions. Second operand 3 states. [2018-12-09 05:38:43,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:38:43,685 INFO L93 Difference]: Finished difference Result 73882 states and 212774 transitions. [2018-12-09 05:38:43,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:38:43,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2018-12-09 05:38:43,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:38:43,778 INFO L225 Difference]: With dead ends: 73882 [2018-12-09 05:38:43,778 INFO L226 Difference]: Without dead ends: 73882 [2018-12-09 05:38:43,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:38:43,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73882 states. [2018-12-09 05:38:44,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73882 to 69194. [2018-12-09 05:38:44,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69194 states. [2018-12-09 05:38:44,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69194 states to 69194 states and 200395 transitions. [2018-12-09 05:38:44,584 INFO L78 Accepts]: Start accepts. Automaton has 69194 states and 200395 transitions. Word has length 82 [2018-12-09 05:38:44,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:38:44,585 INFO L480 AbstractCegarLoop]: Abstraction has 69194 states and 200395 transitions. [2018-12-09 05:38:44,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:38:44,585 INFO L276 IsEmpty]: Start isEmpty. Operand 69194 states and 200395 transitions. [2018-12-09 05:38:44,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-09 05:38:44,612 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:38:44,612 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] [2018-12-09 05:38:44,613 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:38:44,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:38:44,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1319576706, now seen corresponding path program 1 times [2018-12-09 05:38:44,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:38:44,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:38:44,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:38:44,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:38:44,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:38:44,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:38:44,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:38:44,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:38:44,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:38:44,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:38:44,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:38:44,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:38:44,659 INFO L87 Difference]: Start difference. First operand 69194 states and 200395 transitions. Second operand 4 states. [2018-12-09 05:38:44,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:38:44,889 INFO L93 Difference]: Finished difference Result 75677 states and 216537 transitions. [2018-12-09 05:38:44,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:38:44,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-12-09 05:38:44,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:38:45,074 INFO L225 Difference]: With dead ends: 75677 [2018-12-09 05:38:45,074 INFO L226 Difference]: Without dead ends: 75677 [2018-12-09 05:38:45,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:38:45,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75677 states. [2018-12-09 05:38:45,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75677 to 70724. [2018-12-09 05:38:45,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70724 states. [2018-12-09 05:38:45,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70724 states to 70724 states and 202400 transitions. [2018-12-09 05:38:45,798 INFO L78 Accepts]: Start accepts. Automaton has 70724 states and 202400 transitions. Word has length 83 [2018-12-09 05:38:45,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:38:45,798 INFO L480 AbstractCegarLoop]: Abstraction has 70724 states and 202400 transitions. [2018-12-09 05:38:45,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:38:45,798 INFO L276 IsEmpty]: Start isEmpty. Operand 70724 states and 202400 transitions. [2018-12-09 05:38:45,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-09 05:38:45,824 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:38:45,824 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] [2018-12-09 05:38:45,824 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:38:45,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:38:45,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1201211927, now seen corresponding path program 1 times [2018-12-09 05:38:45,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:38:45,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:38:45,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:38:45,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:38:45,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:38:45,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:38:45,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:38:45,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:38:45,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:38:45,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:38:45,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:38:45,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:38:45,858 INFO L87 Difference]: Start difference. First operand 70724 states and 202400 transitions. Second operand 4 states. [2018-12-09 05:38:46,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:38:46,077 INFO L93 Difference]: Finished difference Result 76557 states and 218374 transitions. [2018-12-09 05:38:46,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 05:38:46,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-12-09 05:38:46,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:38:46,172 INFO L225 Difference]: With dead ends: 76557 [2018-12-09 05:38:46,172 INFO L226 Difference]: Without dead ends: 76557 [2018-12-09 05:38:46,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:38:46,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76557 states. [2018-12-09 05:38:47,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76557 to 71702. [2018-12-09 05:38:47,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71702 states. [2018-12-09 05:38:47,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71702 states to 71702 states and 205099 transitions. [2018-12-09 05:38:47,113 INFO L78 Accepts]: Start accepts. Automaton has 71702 states and 205099 transitions. Word has length 83 [2018-12-09 05:38:47,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:38:47,113 INFO L480 AbstractCegarLoop]: Abstraction has 71702 states and 205099 transitions. [2018-12-09 05:38:47,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:38:47,113 INFO L276 IsEmpty]: Start isEmpty. Operand 71702 states and 205099 transitions. [2018-12-09 05:38:47,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-09 05:38:47,137 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:38:47,138 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] [2018-12-09 05:38:47,138 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:38:47,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:38:47,138 INFO L82 PathProgramCache]: Analyzing trace with hash -2103727433, now seen corresponding path program 1 times [2018-12-09 05:38:47,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:38:47,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:38:47,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:38:47,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:38:47,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:38:47,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:38:47,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:38:47,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:38:47,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 05:38:47,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 05:38:47,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 05:38:47,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 05:38:47,209 INFO L87 Difference]: Start difference. First operand 71702 states and 205099 transitions. Second operand 8 states. [2018-12-09 05:38:48,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:38:48,971 INFO L93 Difference]: Finished difference Result 164487 states and 482593 transitions. [2018-12-09 05:38:48,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-09 05:38:48,972 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 83 [2018-12-09 05:38:48,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:38:49,198 INFO L225 Difference]: With dead ends: 164487 [2018-12-09 05:38:49,198 INFO L226 Difference]: Without dead ends: 164487 [2018-12-09 05:38:49,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=183, Invalid=629, Unknown=0, NotChecked=0, Total=812 [2018-12-09 05:38:49,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164487 states. [2018-12-09 05:38:50,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164487 to 99573. [2018-12-09 05:38:50,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99573 states. [2018-12-09 05:38:50,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99573 states to 99573 states and 291954 transitions. [2018-12-09 05:38:50,822 INFO L78 Accepts]: Start accepts. Automaton has 99573 states and 291954 transitions. Word has length 83 [2018-12-09 05:38:50,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:38:50,823 INFO L480 AbstractCegarLoop]: Abstraction has 99573 states and 291954 transitions. [2018-12-09 05:38:50,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 05:38:50,823 INFO L276 IsEmpty]: Start isEmpty. Operand 99573 states and 291954 transitions. [2018-12-09 05:38:50,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-09 05:38:50,859 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:38:50,859 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:38:50,859 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:38:50,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:38:50,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1216223752, now seen corresponding path program 1 times [2018-12-09 05:38:50,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:38:50,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:38:50,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:38:50,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:38:50,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:38:50,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:38:50,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:38:50,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:38:50,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 05:38:50,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 05:38:50,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 05:38:50,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:38:50,900 INFO L87 Difference]: Start difference. First operand 99573 states and 291954 transitions. Second operand 5 states. [2018-12-09 05:38:50,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:38:50,993 INFO L93 Difference]: Finished difference Result 35805 states and 86792 transitions. [2018-12-09 05:38:50,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 05:38:50,994 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2018-12-09 05:38:50,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:38:51,019 INFO L225 Difference]: With dead ends: 35805 [2018-12-09 05:38:51,019 INFO L226 Difference]: Without dead ends: 31165 [2018-12-09 05:38:51,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 05:38:51,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31165 states. [2018-12-09 05:38:51,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31165 to 26658. [2018-12-09 05:38:51,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26658 states. [2018-12-09 05:38:51,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26658 states to 26658 states and 63590 transitions. [2018-12-09 05:38:51,291 INFO L78 Accepts]: Start accepts. Automaton has 26658 states and 63590 transitions. Word has length 83 [2018-12-09 05:38:51,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:38:51,291 INFO L480 AbstractCegarLoop]: Abstraction has 26658 states and 63590 transitions. [2018-12-09 05:38:51,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 05:38:51,291 INFO L276 IsEmpty]: Start isEmpty. Operand 26658 states and 63590 transitions. [2018-12-09 05:38:51,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 05:38:51,311 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:38:51,312 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:38:51,312 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:38:51,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:38:51,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1193214669, now seen corresponding path program 1 times [2018-12-09 05:38:51,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:38:51,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:38:51,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:38:51,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:38:51,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:38:51,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:38:51,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:38:51,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:38:51,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 05:38:51,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 05:38:51,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 05:38:51,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:38:51,361 INFO L87 Difference]: Start difference. First operand 26658 states and 63590 transitions. Second operand 5 states. [2018-12-09 05:38:51,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:38:51,475 INFO L93 Difference]: Finished difference Result 30725 states and 72487 transitions. [2018-12-09 05:38:51,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 05:38:51,475 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2018-12-09 05:38:51,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:38:51,500 INFO L225 Difference]: With dead ends: 30725 [2018-12-09 05:38:51,500 INFO L226 Difference]: Without dead ends: 30725 [2018-12-09 05:38:51,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 05:38:51,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30725 states. [2018-12-09 05:38:51,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30725 to 24444. [2018-12-09 05:38:51,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24444 states. [2018-12-09 05:38:51,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24444 states to 24444 states and 57727 transitions. [2018-12-09 05:38:51,735 INFO L78 Accepts]: Start accepts. Automaton has 24444 states and 57727 transitions. Word has length 111 [2018-12-09 05:38:51,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:38:51,735 INFO L480 AbstractCegarLoop]: Abstraction has 24444 states and 57727 transitions. [2018-12-09 05:38:51,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 05:38:51,735 INFO L276 IsEmpty]: Start isEmpty. Operand 24444 states and 57727 transitions. [2018-12-09 05:38:51,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 05:38:51,755 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:38:51,755 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:38:51,755 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:38:51,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:38:51,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1752092247, now seen corresponding path program 1 times [2018-12-09 05:38:51,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:38:51,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:38:51,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:38:51,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:38:51,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:38:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:38:51,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:38:51,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:38:51,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 05:38:51,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 05:38:51,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 05:38:51,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:38:51,811 INFO L87 Difference]: Start difference. First operand 24444 states and 57727 transitions. Second operand 5 states. [2018-12-09 05:38:52,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:38:52,311 INFO L93 Difference]: Finished difference Result 47080 states and 111201 transitions. [2018-12-09 05:38:52,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 05:38:52,312 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2018-12-09 05:38:52,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:38:52,347 INFO L225 Difference]: With dead ends: 47080 [2018-12-09 05:38:52,347 INFO L226 Difference]: Without dead ends: 47046 [2018-12-09 05:38:52,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 05:38:52,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47046 states. [2018-12-09 05:38:52,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47046 to 31533. [2018-12-09 05:38:52,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31533 states. [2018-12-09 05:38:52,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31533 states to 31533 states and 75074 transitions. [2018-12-09 05:38:52,711 INFO L78 Accepts]: Start accepts. Automaton has 31533 states and 75074 transitions. Word has length 111 [2018-12-09 05:38:52,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:38:52,711 INFO L480 AbstractCegarLoop]: Abstraction has 31533 states and 75074 transitions. [2018-12-09 05:38:52,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 05:38:52,711 INFO L276 IsEmpty]: Start isEmpty. Operand 31533 states and 75074 transitions. [2018-12-09 05:38:52,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 05:38:52,735 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:38:52,735 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:38:52,735 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:38:52,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:38:52,735 INFO L82 PathProgramCache]: Analyzing trace with hash -487123411, now seen corresponding path program 1 times [2018-12-09 05:38:52,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:38:52,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:38:52,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:38:52,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:38:52,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:38:52,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:38:52,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:38:52,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:38:52,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 05:38:52,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 05:38:52,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 05:38:52,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-09 05:38:52,818 INFO L87 Difference]: Start difference. First operand 31533 states and 75074 transitions. Second operand 8 states. [2018-12-09 05:38:53,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:38:53,360 INFO L93 Difference]: Finished difference Result 43744 states and 102348 transitions. [2018-12-09 05:38:53,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 05:38:53,361 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 111 [2018-12-09 05:38:53,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:38:53,394 INFO L225 Difference]: With dead ends: 43744 [2018-12-09 05:38:53,395 INFO L226 Difference]: Without dead ends: 43630 [2018-12-09 05:38:53,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2018-12-09 05:38:53,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43630 states. [2018-12-09 05:38:53,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43630 to 35834. [2018-12-09 05:38:53,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35834 states. [2018-12-09 05:38:53,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35834 states to 35834 states and 84760 transitions. [2018-12-09 05:38:53,754 INFO L78 Accepts]: Start accepts. Automaton has 35834 states and 84760 transitions. Word has length 111 [2018-12-09 05:38:53,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:38:53,754 INFO L480 AbstractCegarLoop]: Abstraction has 35834 states and 84760 transitions. [2018-12-09 05:38:53,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 05:38:53,754 INFO L276 IsEmpty]: Start isEmpty. Operand 35834 states and 84760 transitions. [2018-12-09 05:38:53,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 05:38:53,781 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:38:53,781 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:38:53,781 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:38:53,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:38:53,782 INFO L82 PathProgramCache]: Analyzing trace with hash -741859956, now seen corresponding path program 1 times [2018-12-09 05:38:53,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:38:53,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:38:53,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:38:53,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:38:53,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:38:53,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:38:53,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:38:53,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:38:53,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 05:38:53,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 05:38:53,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 05:38:53,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 05:38:53,849 INFO L87 Difference]: Start difference. First operand 35834 states and 84760 transitions. Second operand 7 states. [2018-12-09 05:38:54,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:38:54,401 INFO L93 Difference]: Finished difference Result 48625 states and 113563 transitions. [2018-12-09 05:38:54,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 05:38:54,402 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 111 [2018-12-09 05:38:54,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:38:54,439 INFO L225 Difference]: With dead ends: 48625 [2018-12-09 05:38:54,439 INFO L226 Difference]: Without dead ends: 48625 [2018-12-09 05:38:54,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-12-09 05:38:54,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48625 states. [2018-12-09 05:38:54,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48625 to 40609. [2018-12-09 05:38:54,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40609 states. [2018-12-09 05:38:54,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40609 states to 40609 states and 95200 transitions. [2018-12-09 05:38:54,850 INFO L78 Accepts]: Start accepts. Automaton has 40609 states and 95200 transitions. Word has length 111 [2018-12-09 05:38:54,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:38:54,851 INFO L480 AbstractCegarLoop]: Abstraction has 40609 states and 95200 transitions. [2018-12-09 05:38:54,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 05:38:54,851 INFO L276 IsEmpty]: Start isEmpty. Operand 40609 states and 95200 transitions. [2018-12-09 05:38:54,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 05:38:54,881 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:38:54,882 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:38:54,882 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:38:54,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:38:54,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1491337810, now seen corresponding path program 2 times [2018-12-09 05:38:54,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:38:54,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:38:54,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:38:54,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:38:54,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:38:54,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:38:54,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:38:54,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:38:54,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 05:38:54,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 05:38:54,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 05:38:54,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:38:54,924 INFO L87 Difference]: Start difference. First operand 40609 states and 95200 transitions. Second operand 5 states. [2018-12-09 05:38:55,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:38:55,147 INFO L93 Difference]: Finished difference Result 41358 states and 96869 transitions. [2018-12-09 05:38:55,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 05:38:55,147 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2018-12-09 05:38:55,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:38:55,179 INFO L225 Difference]: With dead ends: 41358 [2018-12-09 05:38:55,180 INFO L226 Difference]: Without dead ends: 41358 [2018-12-09 05:38:55,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 05:38:55,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41358 states. [2018-12-09 05:38:55,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41358 to 41003. [2018-12-09 05:38:55,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41003 states. [2018-12-09 05:38:55,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41003 states to 41003 states and 96095 transitions. [2018-12-09 05:38:55,564 INFO L78 Accepts]: Start accepts. Automaton has 41003 states and 96095 transitions. Word has length 111 [2018-12-09 05:38:55,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:38:55,564 INFO L480 AbstractCegarLoop]: Abstraction has 41003 states and 96095 transitions. [2018-12-09 05:38:55,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 05:38:55,564 INFO L276 IsEmpty]: Start isEmpty. Operand 41003 states and 96095 transitions. [2018-12-09 05:38:55,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 05:38:55,595 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:38:55,595 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:38:55,595 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:38:55,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:38:55,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1009887957, now seen corresponding path program 1 times [2018-12-09 05:38:55,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:38:55,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:38:55,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:38:55,597 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 05:38:55,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:38:55,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:38:55,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-09 05:38:55,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:38:55,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 05:38:55,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 05:38:55,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 05:38:55,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 05:38:55,670 INFO L87 Difference]: Start difference. First operand 41003 states and 96095 transitions. Second operand 7 states. [2018-12-09 05:38:56,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:38:56,190 INFO L93 Difference]: Finished difference Result 49932 states and 117212 transitions. [2018-12-09 05:38:56,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 05:38:56,191 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2018-12-09 05:38:56,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:38:56,233 INFO L225 Difference]: With dead ends: 49932 [2018-12-09 05:38:56,233 INFO L226 Difference]: Without dead ends: 49932 [2018-12-09 05:38:56,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-12-09 05:38:56,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49932 states. [2018-12-09 05:38:56,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49932 to 42979. [2018-12-09 05:38:56,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42979 states. [2018-12-09 05:38:56,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42979 states to 42979 states and 101022 transitions. [2018-12-09 05:38:56,676 INFO L78 Accepts]: Start accepts. Automaton has 42979 states and 101022 transitions. Word has length 113 [2018-12-09 05:38:56,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:38:56,676 INFO L480 AbstractCegarLoop]: Abstraction has 42979 states and 101022 transitions. [2018-12-09 05:38:56,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 05:38:56,677 INFO L276 IsEmpty]: Start isEmpty. Operand 42979 states and 101022 transitions. [2018-12-09 05:38:56,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 05:38:56,708 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:38:56,709 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:38:56,709 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:38:56,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:38:56,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1971910951, now seen corresponding path program 1 times [2018-12-09 05:38:56,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:38:56,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:38:56,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:38:56,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:38:56,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:38:56,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:38:56,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:38:56,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:38:56,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 05:38:56,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 05:38:56,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 05:38:56,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 05:38:56,804 INFO L87 Difference]: Start difference. First operand 42979 states and 101022 transitions. Second operand 7 states. [2018-12-09 05:38:57,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:38:57,092 INFO L93 Difference]: Finished difference Result 55831 states and 129811 transitions. [2018-12-09 05:38:57,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 05:38:57,093 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2018-12-09 05:38:57,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:38:57,138 INFO L225 Difference]: With dead ends: 55831 [2018-12-09 05:38:57,139 INFO L226 Difference]: Without dead ends: 55831 [2018-12-09 05:38:57,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-12-09 05:38:57,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55831 states. [2018-12-09 05:38:57,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55831 to 46159. [2018-12-09 05:38:57,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46159 states. [2018-12-09 05:38:57,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46159 states to 46159 states and 108204 transitions. [2018-12-09 05:38:57,624 INFO L78 Accepts]: Start accepts. Automaton has 46159 states and 108204 transitions. Word has length 113 [2018-12-09 05:38:57,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:38:57,624 INFO L480 AbstractCegarLoop]: Abstraction has 46159 states and 108204 transitions. [2018-12-09 05:38:57,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 05:38:57,624 INFO L276 IsEmpty]: Start isEmpty. Operand 46159 states and 108204 transitions. [2018-12-09 05:38:57,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 05:38:57,658 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:38:57,658 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:38:57,659 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:38:57,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:38:57,659 INFO L82 PathProgramCache]: Analyzing trace with hash 245847002, now seen corresponding path program 1 times [2018-12-09 05:38:57,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:38:57,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:38:57,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:38:57,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:38:57,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:38:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:38:57,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:38:57,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:38:57,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:38:57,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:38:57,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:38:57,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:38:57,697 INFO L87 Difference]: Start difference. First operand 46159 states and 108204 transitions. Second operand 3 states. [2018-12-09 05:38:57,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:38:57,783 INFO L93 Difference]: Finished difference Result 45999 states and 107676 transitions. [2018-12-09 05:38:57,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:38:57,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2018-12-09 05:38:57,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:38:57,815 INFO L225 Difference]: With dead ends: 45999 [2018-12-09 05:38:57,815 INFO L226 Difference]: Without dead ends: 45999 [2018-12-09 05:38:57,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:38:57,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45999 states. [2018-12-09 05:38:58,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45999 to 38946. [2018-12-09 05:38:58,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38946 states. [2018-12-09 05:38:58,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38946 states to 38946 states and 91669 transitions. [2018-12-09 05:38:58,231 INFO L78 Accepts]: Start accepts. Automaton has 38946 states and 91669 transitions. Word has length 113 [2018-12-09 05:38:58,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:38:58,231 INFO L480 AbstractCegarLoop]: Abstraction has 38946 states and 91669 transitions. [2018-12-09 05:38:58,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:38:58,231 INFO L276 IsEmpty]: Start isEmpty. Operand 38946 states and 91669 transitions. [2018-12-09 05:38:58,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 05:38:58,261 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:38:58,261 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:38:58,261 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:38:58,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:38:58,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1950153343, now seen corresponding path program 1 times [2018-12-09 05:38:58,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:38:58,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:38:58,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:38:58,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:38:58,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:38:58,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:38:58,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:38:58,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:38:58,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 05:38:58,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 05:38:58,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 05:38:58,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-12-09 05:38:58,418 INFO L87 Difference]: Start difference. First operand 38946 states and 91669 transitions. Second operand 10 states. [2018-12-09 05:38:59,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:38:59,103 INFO L93 Difference]: Finished difference Result 49998 states and 115495 transitions. [2018-12-09 05:38:59,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 05:38:59,103 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 113 [2018-12-09 05:38:59,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:38:59,143 INFO L225 Difference]: With dead ends: 49998 [2018-12-09 05:38:59,143 INFO L226 Difference]: Without dead ends: 49998 [2018-12-09 05:38:59,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2018-12-09 05:38:59,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49998 states. [2018-12-09 05:38:59,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49998 to 42128. [2018-12-09 05:38:59,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42128 states. [2018-12-09 05:38:59,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42128 states to 42128 states and 98260 transitions. [2018-12-09 05:38:59,576 INFO L78 Accepts]: Start accepts. Automaton has 42128 states and 98260 transitions. Word has length 113 [2018-12-09 05:38:59,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:38:59,577 INFO L480 AbstractCegarLoop]: Abstraction has 42128 states and 98260 transitions. [2018-12-09 05:38:59,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 05:38:59,577 INFO L276 IsEmpty]: Start isEmpty. Operand 42128 states and 98260 transitions. [2018-12-09 05:38:59,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 05:38:59,608 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:38:59,608 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:38:59,609 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:38:59,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:38:59,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1068991400, now seen corresponding path program 1 times [2018-12-09 05:38:59,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:38:59,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:38:59,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:38:59,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:38:59,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:38:59,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:38:59,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:38:59,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:38:59,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 05:38:59,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 05:38:59,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 05:38:59,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 05:38:59,668 INFO L87 Difference]: Start difference. First operand 42128 states and 98260 transitions. Second operand 6 states. [2018-12-09 05:38:59,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:38:59,991 INFO L93 Difference]: Finished difference Result 46480 states and 107771 transitions. [2018-12-09 05:38:59,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 05:38:59,991 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2018-12-09 05:38:59,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:39:00,026 INFO L225 Difference]: With dead ends: 46480 [2018-12-09 05:39:00,026 INFO L226 Difference]: Without dead ends: 46480 [2018-12-09 05:39:00,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-09 05:39:00,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46480 states. [2018-12-09 05:39:00,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46480 to 42003. [2018-12-09 05:39:00,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42003 states. [2018-12-09 05:39:00,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42003 states to 42003 states and 97979 transitions. [2018-12-09 05:39:00,437 INFO L78 Accepts]: Start accepts. Automaton has 42003 states and 97979 transitions. Word has length 113 [2018-12-09 05:39:00,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:39:00,437 INFO L480 AbstractCegarLoop]: Abstraction has 42003 states and 97979 transitions. [2018-12-09 05:39:00,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 05:39:00,437 INFO L276 IsEmpty]: Start isEmpty. Operand 42003 states and 97979 transitions. [2018-12-09 05:39:00,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-09 05:39:00,469 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:39:00,469 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:39:00,469 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:39:00,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:39:00,469 INFO L82 PathProgramCache]: Analyzing trace with hash 303190561, now seen corresponding path program 1 times [2018-12-09 05:39:00,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:39:00,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:39:00,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:39:00,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:39:00,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:39:00,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:39:00,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:39:00,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:39:00,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 05:39:00,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 05:39:00,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 05:39:00,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 05:39:00,562 INFO L87 Difference]: Start difference. First operand 42003 states and 97979 transitions. Second operand 7 states. [2018-12-09 05:39:00,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:39:00,892 INFO L93 Difference]: Finished difference Result 50533 states and 115747 transitions. [2018-12-09 05:39:00,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 05:39:00,892 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2018-12-09 05:39:00,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:39:00,933 INFO L225 Difference]: With dead ends: 50533 [2018-12-09 05:39:00,933 INFO L226 Difference]: Without dead ends: 50490 [2018-12-09 05:39:00,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-09 05:39:00,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50490 states. [2018-12-09 05:39:01,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50490 to 41752. [2018-12-09 05:39:01,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41752 states. [2018-12-09 05:39:01,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41752 states to 41752 states and 96428 transitions. [2018-12-09 05:39:01,387 INFO L78 Accepts]: Start accepts. Automaton has 41752 states and 96428 transitions. Word has length 115 [2018-12-09 05:39:01,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:39:01,387 INFO L480 AbstractCegarLoop]: Abstraction has 41752 states and 96428 transitions. [2018-12-09 05:39:01,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 05:39:01,388 INFO L276 IsEmpty]: Start isEmpty. Operand 41752 states and 96428 transitions. [2018-12-09 05:39:01,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-09 05:39:01,418 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:39:01,418 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:39:01,419 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:39:01,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:39:01,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1774018782, now seen corresponding path program 1 times [2018-12-09 05:39:01,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:39:01,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:39:01,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:39:01,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:39:01,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:39:01,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:39:01,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:39:01,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:39:01,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 05:39:01,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 05:39:01,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 05:39:01,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 05:39:01,484 INFO L87 Difference]: Start difference. First operand 41752 states and 96428 transitions. Second operand 8 states. [2018-12-09 05:39:02,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:39:02,402 INFO L93 Difference]: Finished difference Result 49181 states and 112757 transitions. [2018-12-09 05:39:02,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-09 05:39:02,402 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 115 [2018-12-09 05:39:02,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:39:02,443 INFO L225 Difference]: With dead ends: 49181 [2018-12-09 05:39:02,443 INFO L226 Difference]: Without dead ends: 49162 [2018-12-09 05:39:02,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2018-12-09 05:39:02,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49162 states. [2018-12-09 05:39:02,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49162 to 45413. [2018-12-09 05:39:02,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45413 states. [2018-12-09 05:39:02,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45413 states to 45413 states and 104834 transitions. [2018-12-09 05:39:02,903 INFO L78 Accepts]: Start accepts. Automaton has 45413 states and 104834 transitions. Word has length 115 [2018-12-09 05:39:02,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:39:02,903 INFO L480 AbstractCegarLoop]: Abstraction has 45413 states and 104834 transitions. [2018-12-09 05:39:02,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 05:39:02,903 INFO L276 IsEmpty]: Start isEmpty. Operand 45413 states and 104834 transitions. [2018-12-09 05:39:02,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-09 05:39:02,938 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:39:02,938 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:39:02,938 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:39:02,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:39:02,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1562667869, now seen corresponding path program 1 times [2018-12-09 05:39:02,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:39:02,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:39:02,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:39:02,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:39:02,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:39:02,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:39:03,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:39:03,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:39:03,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 05:39:03,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 05:39:03,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 05:39:03,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 05:39:03,007 INFO L87 Difference]: Start difference. First operand 45413 states and 104834 transitions. Second operand 7 states. [2018-12-09 05:39:03,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:39:03,186 INFO L93 Difference]: Finished difference Result 49592 states and 113665 transitions. [2018-12-09 05:39:03,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 05:39:03,187 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2018-12-09 05:39:03,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:39:03,227 INFO L225 Difference]: With dead ends: 49592 [2018-12-09 05:39:03,227 INFO L226 Difference]: Without dead ends: 49592 [2018-12-09 05:39:03,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-09 05:39:03,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49592 states. [2018-12-09 05:39:03,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49592 to 41522. [2018-12-09 05:39:03,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41522 states. [2018-12-09 05:39:03,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41522 states to 41522 states and 95994 transitions. [2018-12-09 05:39:03,642 INFO L78 Accepts]: Start accepts. Automaton has 41522 states and 95994 transitions. Word has length 115 [2018-12-09 05:39:03,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:39:03,642 INFO L480 AbstractCegarLoop]: Abstraction has 41522 states and 95994 transitions. [2018-12-09 05:39:03,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 05:39:03,642 INFO L276 IsEmpty]: Start isEmpty. Operand 41522 states and 95994 transitions. [2018-12-09 05:39:03,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-09 05:39:03,673 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:39:03,673 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:39:03,673 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:39:03,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:39:03,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1762702655, now seen corresponding path program 1 times [2018-12-09 05:39:03,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:39:03,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:39:03,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:39:03,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:39:03,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:39:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:39:03,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:39:03,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:39:03,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 05:39:03,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 05:39:03,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 05:39:03,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 05:39:03,734 INFO L87 Difference]: Start difference. First operand 41522 states and 95994 transitions. Second operand 7 states. [2018-12-09 05:39:04,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:39:04,141 INFO L93 Difference]: Finished difference Result 48527 states and 110644 transitions. [2018-12-09 05:39:04,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 05:39:04,141 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2018-12-09 05:39:04,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:39:04,172 INFO L225 Difference]: With dead ends: 48527 [2018-12-09 05:39:04,172 INFO L226 Difference]: Without dead ends: 48501 [2018-12-09 05:39:04,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-12-09 05:39:04,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48501 states. [2018-12-09 05:39:04,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48501 to 43085. [2018-12-09 05:39:04,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43085 states. [2018-12-09 05:39:04,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43085 states to 43085 states and 98844 transitions. [2018-12-09 05:39:04,573 INFO L78 Accepts]: Start accepts. Automaton has 43085 states and 98844 transitions. Word has length 115 [2018-12-09 05:39:04,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:39:04,573 INFO L480 AbstractCegarLoop]: Abstraction has 43085 states and 98844 transitions. [2018-12-09 05:39:04,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 05:39:04,574 INFO L276 IsEmpty]: Start isEmpty. Operand 43085 states and 98844 transitions. [2018-12-09 05:39:04,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-09 05:39:04,605 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:39:04,605 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:39:04,606 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:39:04,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:39:04,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1551351742, now seen corresponding path program 1 times [2018-12-09 05:39:04,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:39:04,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:39:04,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:39:04,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:39:04,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:39:04,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:39:04,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:39:04,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:39:04,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 05:39:04,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 05:39:04,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 05:39:04,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 05:39:04,686 INFO L87 Difference]: Start difference. First operand 43085 states and 98844 transitions. Second operand 7 states. [2018-12-09 05:39:04,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:39:04,907 INFO L93 Difference]: Finished difference Result 44209 states and 101241 transitions. [2018-12-09 05:39:04,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 05:39:04,908 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2018-12-09 05:39:04,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:39:04,940 INFO L225 Difference]: With dead ends: 44209 [2018-12-09 05:39:04,940 INFO L226 Difference]: Without dead ends: 44209 [2018-12-09 05:39:04,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-12-09 05:39:04,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44209 states. [2018-12-09 05:39:05,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44209 to 43546. [2018-12-09 05:39:05,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43546 states. [2018-12-09 05:39:05,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43546 states to 43546 states and 99892 transitions. [2018-12-09 05:39:05,332 INFO L78 Accepts]: Start accepts. Automaton has 43546 states and 99892 transitions. Word has length 115 [2018-12-09 05:39:05,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:39:05,332 INFO L480 AbstractCegarLoop]: Abstraction has 43546 states and 99892 transitions. [2018-12-09 05:39:05,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 05:39:05,332 INFO L276 IsEmpty]: Start isEmpty. Operand 43546 states and 99892 transitions. [2018-12-09 05:39:05,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-09 05:39:05,370 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:39:05,371 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:39:05,371 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:39:05,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:39:05,371 INFO L82 PathProgramCache]: Analyzing trace with hash -663848061, now seen corresponding path program 1 times [2018-12-09 05:39:05,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:39:05,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:39:05,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:39:05,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:39:05,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:39:05,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:39:05,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:39:05,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:39:05,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:39:05,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:39:05,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:39:05,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:39:05,393 INFO L87 Difference]: Start difference. First operand 43546 states and 99892 transitions. Second operand 3 states. [2018-12-09 05:39:05,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:39:05,493 INFO L93 Difference]: Finished difference Result 53963 states and 122431 transitions. [2018-12-09 05:39:05,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:39:05,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2018-12-09 05:39:05,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:39:05,537 INFO L225 Difference]: With dead ends: 53963 [2018-12-09 05:39:05,537 INFO L226 Difference]: Without dead ends: 53963 [2018-12-09 05:39:05,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:39:05,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53963 states. [2018-12-09 05:39:05,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53963 to 53466. [2018-12-09 05:39:05,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53466 states. [2018-12-09 05:39:06,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53466 states to 53466 states and 121350 transitions. [2018-12-09 05:39:06,030 INFO L78 Accepts]: Start accepts. Automaton has 53466 states and 121350 transitions. Word has length 115 [2018-12-09 05:39:06,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:39:06,030 INFO L480 AbstractCegarLoop]: Abstraction has 53466 states and 121350 transitions. [2018-12-09 05:39:06,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:39:06,030 INFO L276 IsEmpty]: Start isEmpty. Operand 53466 states and 121350 transitions. [2018-12-09 05:39:06,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-09 05:39:06,074 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:39:06,074 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:39:06,074 INFO L423 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:39:06,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:39:06,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1061632836, now seen corresponding path program 1 times [2018-12-09 05:39:06,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:39:06,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:39:06,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:39:06,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:39:06,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:39:06,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:39:06,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:39:06,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:39:06,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-09 05:39:06,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 05:39:06,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 05:39:06,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-12-09 05:39:06,176 INFO L87 Difference]: Start difference. First operand 53466 states and 121350 transitions. Second operand 13 states. [2018-12-09 05:39:06,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:39:06,675 INFO L93 Difference]: Finished difference Result 87362 states and 198327 transitions. [2018-12-09 05:39:06,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 05:39:06,675 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 115 [2018-12-09 05:39:06,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:39:06,732 INFO L225 Difference]: With dead ends: 87362 [2018-12-09 05:39:06,732 INFO L226 Difference]: Without dead ends: 73563 [2018-12-09 05:39:06,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2018-12-09 05:39:06,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73563 states. [2018-12-09 05:39:07,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73563 to 60644. [2018-12-09 05:39:07,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60644 states. [2018-12-09 05:39:07,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60644 states to 60644 states and 136900 transitions. [2018-12-09 05:39:07,356 INFO L78 Accepts]: Start accepts. Automaton has 60644 states and 136900 transitions. Word has length 115 [2018-12-09 05:39:07,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:39:07,356 INFO L480 AbstractCegarLoop]: Abstraction has 60644 states and 136900 transitions. [2018-12-09 05:39:07,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 05:39:07,356 INFO L276 IsEmpty]: Start isEmpty. Operand 60644 states and 136900 transitions. [2018-12-09 05:39:07,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-09 05:39:07,406 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:39:07,406 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:39:07,406 INFO L423 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:39:07,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:39:07,406 INFO L82 PathProgramCache]: Analyzing trace with hash 2085529924, now seen corresponding path program 2 times [2018-12-09 05:39:07,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:39:07,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:39:07,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:39:07,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:39:07,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:39:07,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:39:07,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:39:07,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:39:07,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-09 05:39:07,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 05:39:07,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 05:39:07,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-12-09 05:39:07,516 INFO L87 Difference]: Start difference. First operand 60644 states and 136900 transitions. Second operand 14 states. [2018-12-09 05:39:08,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:39:08,293 INFO L93 Difference]: Finished difference Result 125980 states and 285314 transitions. [2018-12-09 05:39:08,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-09 05:39:08,293 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 115 [2018-12-09 05:39:08,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:39:08,373 INFO L225 Difference]: With dead ends: 125980 [2018-12-09 05:39:08,373 INFO L226 Difference]: Without dead ends: 96810 [2018-12-09 05:39:08,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=246, Invalid=1086, Unknown=0, NotChecked=0, Total=1332 [2018-12-09 05:39:08,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96810 states. [2018-12-09 05:39:09,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96810 to 70023. [2018-12-09 05:39:09,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70023 states. [2018-12-09 05:39:09,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70023 states to 70023 states and 155897 transitions. [2018-12-09 05:39:09,179 INFO L78 Accepts]: Start accepts. Automaton has 70023 states and 155897 transitions. Word has length 115 [2018-12-09 05:39:09,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:39:09,179 INFO L480 AbstractCegarLoop]: Abstraction has 70023 states and 155897 transitions. [2018-12-09 05:39:09,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 05:39:09,179 INFO L276 IsEmpty]: Start isEmpty. Operand 70023 states and 155897 transitions. [2018-12-09 05:39:09,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-09 05:39:09,253 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:39:09,253 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:39:09,253 INFO L423 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:39:09,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:39:09,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1646550112, now seen corresponding path program 3 times [2018-12-09 05:39:09,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:39:09,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:39:09,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:39:09,255 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 05:39:09,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:39:09,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:39:09,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:39:09,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:39:09,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-12-09 05:39:09,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-09 05:39:09,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-09 05:39:09,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-12-09 05:39:09,372 INFO L87 Difference]: Start difference. First operand 70023 states and 155897 transitions. Second operand 15 states. [2018-12-09 05:39:10,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:39:10,354 INFO L93 Difference]: Finished difference Result 96196 states and 215402 transitions. [2018-12-09 05:39:10,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-09 05:39:10,355 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 115 [2018-12-09 05:39:10,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:39:10,414 INFO L225 Difference]: With dead ends: 96196 [2018-12-09 05:39:10,414 INFO L226 Difference]: Without dead ends: 84859 [2018-12-09 05:39:10,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=316, Invalid=1406, Unknown=0, NotChecked=0, Total=1722 [2018-12-09 05:39:10,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84859 states. [2018-12-09 05:39:11,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84859 to 70706. [2018-12-09 05:39:11,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70706 states. [2018-12-09 05:39:11,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70706 states to 70706 states and 157513 transitions. [2018-12-09 05:39:11,130 INFO L78 Accepts]: Start accepts. Automaton has 70706 states and 157513 transitions. Word has length 115 [2018-12-09 05:39:11,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:39:11,130 INFO L480 AbstractCegarLoop]: Abstraction has 70706 states and 157513 transitions. [2018-12-09 05:39:11,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-09 05:39:11,131 INFO L276 IsEmpty]: Start isEmpty. Operand 70706 states and 157513 transitions. [2018-12-09 05:39:11,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-09 05:39:11,189 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:39:11,189 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:39:11,189 INFO L423 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:39:11,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:39:11,190 INFO L82 PathProgramCache]: Analyzing trace with hash 861923247, now seen corresponding path program 1 times [2018-12-09 05:39:11,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:39:11,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:39:11,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:39:11,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 05:39:11,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:39:11,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:39:11,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:39:11,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:39:11,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-12-09 05:39:11,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-09 05:39:11,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-09 05:39:11,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2018-12-09 05:39:11,332 INFO L87 Difference]: Start difference. First operand 70706 states and 157513 transitions. Second operand 18 states. [2018-12-09 05:39:12,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:39:12,136 INFO L93 Difference]: Finished difference Result 94326 states and 212210 transitions. [2018-12-09 05:39:12,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-09 05:39:12,136 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 115 [2018-12-09 05:39:12,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:39:12,208 INFO L225 Difference]: With dead ends: 94326 [2018-12-09 05:39:12,208 INFO L226 Difference]: Without dead ends: 87908 [2018-12-09 05:39:12,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=268, Invalid=1454, Unknown=0, NotChecked=0, Total=1722 [2018-12-09 05:39:12,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87908 states. [2018-12-09 05:39:12,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87908 to 74952. [2018-12-09 05:39:12,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74952 states. [2018-12-09 05:39:12,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74952 states to 74952 states and 167231 transitions. [2018-12-09 05:39:12,994 INFO L78 Accepts]: Start accepts. Automaton has 74952 states and 167231 transitions. Word has length 115 [2018-12-09 05:39:12,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:39:12,994 INFO L480 AbstractCegarLoop]: Abstraction has 74952 states and 167231 transitions. [2018-12-09 05:39:12,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-09 05:39:12,994 INFO L276 IsEmpty]: Start isEmpty. Operand 74952 states and 167231 transitions. [2018-12-09 05:39:13,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-09 05:39:13,058 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:39:13,059 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:39:13,059 INFO L423 AbstractCegarLoop]: === Iteration 41 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:39:13,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:39:13,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1369109039, now seen corresponding path program 2 times [2018-12-09 05:39:13,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:39:13,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:39:13,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:39:13,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:39:13,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:39:13,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:39:13,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:39:13,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:39:13,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-09 05:39:13,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 05:39:13,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 05:39:13,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-12-09 05:39:13,273 INFO L87 Difference]: Start difference. First operand 74952 states and 167231 transitions. Second operand 16 states. [2018-12-09 05:39:14,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:39:14,058 INFO L93 Difference]: Finished difference Result 90476 states and 202214 transitions. [2018-12-09 05:39:14,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-09 05:39:14,058 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 115 [2018-12-09 05:39:14,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:39:14,125 INFO L225 Difference]: With dead ends: 90476 [2018-12-09 05:39:14,125 INFO L226 Difference]: Without dead ends: 84977 [2018-12-09 05:39:14,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=228, Invalid=1104, Unknown=0, NotChecked=0, Total=1332 [2018-12-09 05:39:14,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84977 states. [2018-12-09 05:39:14,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84977 to 67970. [2018-12-09 05:39:14,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67970 states. [2018-12-09 05:39:14,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67970 states to 67970 states and 151672 transitions. [2018-12-09 05:39:14,863 INFO L78 Accepts]: Start accepts. Automaton has 67970 states and 151672 transitions. Word has length 115 [2018-12-09 05:39:14,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:39:14,863 INFO L480 AbstractCegarLoop]: Abstraction has 67970 states and 151672 transitions. [2018-12-09 05:39:14,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 05:39:14,863 INFO L276 IsEmpty]: Start isEmpty. Operand 67970 states and 151672 transitions. [2018-12-09 05:39:14,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-09 05:39:14,919 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:39:14,919 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:39:14,919 INFO L423 AbstractCegarLoop]: === Iteration 42 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:39:14,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:39:14,919 INFO L82 PathProgramCache]: Analyzing trace with hash -312631492, now seen corresponding path program 1 times [2018-12-09 05:39:14,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:39:14,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:39:14,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:39:14,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 05:39:14,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:39:14,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:39:15,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:39:15,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:39:15,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 05:39:15,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 05:39:15,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 05:39:15,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-09 05:39:15,005 INFO L87 Difference]: Start difference. First operand 67970 states and 151672 transitions. Second operand 10 states. [2018-12-09 05:39:15,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:39:15,436 INFO L93 Difference]: Finished difference Result 77149 states and 172035 transitions. [2018-12-09 05:39:15,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 05:39:15,436 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 115 [2018-12-09 05:39:15,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:39:15,441 INFO L225 Difference]: With dead ends: 77149 [2018-12-09 05:39:15,441 INFO L226 Difference]: Without dead ends: 7850 [2018-12-09 05:39:15,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2018-12-09 05:39:15,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7850 states. [2018-12-09 05:39:15,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7850 to 7850. [2018-12-09 05:39:15,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7850 states. [2018-12-09 05:39:15,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7850 states to 7850 states and 18314 transitions. [2018-12-09 05:39:15,494 INFO L78 Accepts]: Start accepts. Automaton has 7850 states and 18314 transitions. Word has length 115 [2018-12-09 05:39:15,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:39:15,494 INFO L480 AbstractCegarLoop]: Abstraction has 7850 states and 18314 transitions. [2018-12-09 05:39:15,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 05:39:15,494 INFO L276 IsEmpty]: Start isEmpty. Operand 7850 states and 18314 transitions. [2018-12-09 05:39:15,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-09 05:39:15,499 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:39:15,499 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:39:15,499 INFO L423 AbstractCegarLoop]: === Iteration 43 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:39:15,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:39:15,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1293718377, now seen corresponding path program 2 times [2018-12-09 05:39:15,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:39:15,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:39:15,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:39:15,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:39:15,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:39:15,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 05:39:15,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 05:39:15,539 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 05:39:15,618 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 05:39:15,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 05:39:15 BasicIcfg [2018-12-09 05:39:15,619 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 05:39:15,619 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 05:39:15,619 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 05:39:15,620 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 05:39:15,620 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:37:34" (3/4) ... [2018-12-09 05:39:15,622 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 05:39:15,706 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_57036ee8-43af-44da-8b61-f8078ef52e10/bin-2019/uautomizer/witness.graphml [2018-12-09 05:39:15,706 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 05:39:15,707 INFO L168 Benchmark]: Toolchain (without parser) took 102320.76 ms. Allocated memory was 1.0 GB in the beginning and 7.3 GB in the end (delta: 6.3 GB). Free memory was 954.9 MB in the beginning and 3.0 GB in the end (delta: -2.1 GB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. [2018-12-09 05:39:15,708 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 05:39:15,708 INFO L168 Benchmark]: CACSL2BoogieTranslator took 338.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -150.1 MB). Peak memory consumption was 37.0 MB. Max. memory is 11.5 GB. [2018-12-09 05:39:15,708 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.22 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-09 05:39:15,708 INFO L168 Benchmark]: Boogie Preprocessor took 21.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-09 05:39:15,709 INFO L168 Benchmark]: RCFGBuilder took 417.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. [2018-12-09 05:39:15,709 INFO L168 Benchmark]: TraceAbstraction took 101418.50 ms. Allocated memory was 1.2 GB in the beginning and 7.3 GB in the end (delta: 6.2 GB). Free memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. [2018-12-09 05:39:15,709 INFO L168 Benchmark]: Witness Printer took 87.03 ms. Allocated memory is still 7.3 GB. Free memory was 3.1 GB in the beginning and 3.0 GB in the end (delta: 42.0 MB). Peak memory consumption was 42.0 MB. Max. memory is 11.5 GB. [2018-12-09 05:39:15,710 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 338.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -150.1 MB). Peak memory consumption was 37.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.22 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 417.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 101418.50 ms. Allocated memory was 1.2 GB in the beginning and 7.3 GB in the end (delta: 6.2 GB). Free memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. * Witness Printer took 87.03 ms. Allocated memory is still 7.3 GB. Free memory was 3.1 GB in the beginning and 3.0 GB in the end (delta: 42.0 MB). Peak memory consumption was 42.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: 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_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L678] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L680] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L681] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L682] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L684] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L686] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L687] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L688] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L689] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L690] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L691] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L692] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L693] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L694] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L695] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L696] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L697] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L698] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L699] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L700] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L701] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L702] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L794] -1 pthread_t t4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] FCALL, FORK -1 pthread_create(&t4, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] -1 pthread_t t5; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] FCALL, FORK -1 pthread_create(&t5, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L706] 0 y$w_buff1 = y$w_buff0 [L707] 0 y$w_buff0 = 1 [L708] 0 y$w_buff1_used = y$w_buff0_used [L709] 0 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L711] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L712] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L713] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L714] 0 y$r_buff0_thd1 = (_Bool)1 [L717] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L718] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L719] 0 y$flush_delayed = weak$$choice2 [L720] 0 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L721] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L721] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L721] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L721] 0 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L722] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L722] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L723] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L723] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L724] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L724] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L725] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L725] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L726] EXPR 0 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L726] 0 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L727] EXPR 0 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L727] 0 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L728] 0 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L729] EXPR 0 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L729] 0 y = y$flush_delayed ? y$mem_tmp : y [L730] 0 y$flush_delayed = (_Bool)0 [L733] 0 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 1 x = 1 [L753] 1 __unbuffered_p1_EAX = x [L756] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 1 y$flush_delayed = weak$$choice2 [L759] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 1 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L761] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L736] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L763] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L763] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L764] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L765] EXPR 1 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L765] 1 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L766] EXPR 1 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L766] 1 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L767] 1 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] 1 y = y$flush_delayed ? y$mem_tmp : y [L769] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L772] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L772] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L773] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L774] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L775] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L776] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L776] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L737] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L737] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L738] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L738] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L739] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L740] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L743] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] -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) [L804] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L805] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L805] -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 [L806] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L807] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L807] -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 [L810] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 308 locations, 3 error locations. UNSAFE Result, 101.3s OverallTime, 43 OverallIterations, 1 TraceHistogramMax, 33.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 20361 SDtfs, 26516 SDslu, 78464 SDs, 0 SdLazy, 18602 SolverSat, 1221 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 618 GetRequests, 125 SyntacticMatches, 38 SemanticMatches, 455 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1610 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=256642occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 56.1s AutomataMinimizationTime, 42 MinimizatonAttempts, 921379 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 3945 NumberOfCodeBlocks, 3945 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 3788 ConstructedInterpolants, 0 QuantifiedInterpolants, 1108562 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 42 InterpolantComputations, 42 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...