./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix041_power.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/mix041_power.oepc_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 424d85e81579c93fea3149876316172742bff15d ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.24-0ed9222-m [2019-01-13 02:06:21,396 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 02:06:21,398 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 02:06:21,410 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 02:06:21,411 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 02:06:21,412 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 02:06:21,413 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 02:06:21,416 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 02:06:21,417 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 02:06:21,418 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 02:06:21,420 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 02:06:21,420 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 02:06:21,421 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 02:06:21,422 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 02:06:21,423 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 02:06:21,424 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 02:06:21,425 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 02:06:21,428 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 02:06:21,430 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 02:06:21,432 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 02:06:21,433 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 02:06:21,435 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 02:06:21,437 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 02:06:21,438 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 02:06:21,438 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 02:06:21,439 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 02:06:21,440 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 02:06:21,442 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 02:06:21,442 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 02:06:21,444 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 02:06:21,444 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 02:06:21,445 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 02:06:21,445 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 02:06:21,445 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 02:06:21,447 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 02:06:21,448 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 02:06:21,448 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-13 02:06:21,470 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 02:06:21,470 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 02:06:21,471 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 02:06:21,472 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 02:06:21,472 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 02:06:21,472 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 02:06:21,472 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 02:06:21,472 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 02:06:21,474 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 02:06:21,474 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 02:06:21,474 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-13 02:06:21,474 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 02:06:21,474 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-13 02:06:21,475 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 02:06:21,475 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-13 02:06:21,475 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 02:06:21,475 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-13 02:06:21,475 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 02:06:21,476 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 02:06:21,477 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 02:06:21,477 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 02:06:21,477 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 02:06:21,478 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 02:06:21,478 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 02:06:21,478 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-13 02:06:21,479 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 02:06:21,479 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 02:06:21,479 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-13 02:06:21,479 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 424d85e81579c93fea3149876316172742bff15d [2019-01-13 02:06:21,528 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 02:06:21,548 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 02:06:21,553 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 02:06:21,555 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 02:06:21,555 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 02:06:21,556 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix041_power.oepc_false-unreach-call.i [2019-01-13 02:06:21,616 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf911bb83/3c862d3364c744bfb6780c505a5bebed/FLAG8eb50272e [2019-01-13 02:06:22,113 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 02:06:22,114 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix041_power.oepc_false-unreach-call.i [2019-01-13 02:06:22,137 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf911bb83/3c862d3364c744bfb6780c505a5bebed/FLAG8eb50272e [2019-01-13 02:06:22,391 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf911bb83/3c862d3364c744bfb6780c505a5bebed [2019-01-13 02:06:22,395 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 02:06:22,397 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-13 02:06:22,398 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 02:06:22,398 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 02:06:22,403 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 02:06:22,404 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 02:06:22" (1/1) ... [2019-01-13 02:06:22,407 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f9cdb9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:06:22, skipping insertion in model container [2019-01-13 02:06:22,408 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 02:06:22" (1/1) ... [2019-01-13 02:06:22,417 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 02:06:22,476 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 02:06:22,933 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 02:06:22,948 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 02:06:23,139 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 02:06:23,238 INFO L195 MainTranslator]: Completed translation [2019-01-13 02:06:23,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:06:23 WrapperNode [2019-01-13 02:06:23,238 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 02:06:23,240 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-13 02:06:23,240 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-13 02:06:23,240 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-13 02:06:23,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:06:23" (1/1) ... [2019-01-13 02:06:23,272 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:06:23" (1/1) ... [2019-01-13 02:06:23,318 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-13 02:06:23,319 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 02:06:23,319 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 02:06:23,319 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 02:06:23,331 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:06:23" (1/1) ... [2019-01-13 02:06:23,332 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:06:23" (1/1) ... [2019-01-13 02:06:23,345 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:06:23" (1/1) ... [2019-01-13 02:06:23,347 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:06:23" (1/1) ... [2019-01-13 02:06:23,378 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:06:23" (1/1) ... [2019-01-13 02:06:23,393 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:06:23" (1/1) ... [2019-01-13 02:06:23,399 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:06:23" (1/1) ... [2019-01-13 02:06:23,407 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 02:06:23,410 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 02:06:23,410 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 02:06:23,411 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 02:06:23,412 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:06:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-13 02:06:23,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 02:06:23,504 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-13 02:06:23,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 02:06:23,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 02:06:23,505 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-13 02:06:23,505 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-13 02:06:23,505 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-13 02:06:23,505 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-13 02:06:23,505 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-13 02:06:23,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 02:06:23,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 02:06:23,509 WARN L204 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-13 02:06:24,632 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 02:06:24,633 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-13 02:06:24,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 02:06:24 BoogieIcfgContainer [2019-01-13 02:06:24,636 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 02:06:24,637 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 02:06:24,638 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 02:06:24,641 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 02:06:24,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 02:06:22" (1/3) ... [2019-01-13 02:06:24,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@de7c7ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 02:06:24, skipping insertion in model container [2019-01-13 02:06:24,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:06:23" (2/3) ... [2019-01-13 02:06:24,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@de7c7ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 02:06:24, skipping insertion in model container [2019-01-13 02:06:24,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 02:06:24" (3/3) ... [2019-01-13 02:06:24,648 INFO L112 eAbstractionObserver]: Analyzing ICFG mix041_power.oepc_false-unreach-call.i [2019-01-13 02:06:24,712 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,713 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,713 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,713 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,713 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,713 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,715 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,715 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,716 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,717 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,717 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,718 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,718 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,718 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,718 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,720 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,720 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,720 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,721 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,721 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,722 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,722 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,722 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,722 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,723 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,723 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,723 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,723 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,723 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,724 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,726 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,727 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,728 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,728 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,728 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,728 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,728 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,729 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,736 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,737 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,737 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,737 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,737 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,737 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,737 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,738 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,741 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,741 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,742 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,742 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,742 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,743 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,745 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,746 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,746 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,746 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,746 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,747 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,747 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,747 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,747 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,747 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,748 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,751 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,751 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,751 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,751 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,752 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,752 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,752 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,752 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,753 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,755 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,756 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,756 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,756 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,756 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,757 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,759 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,759 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,759 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,760 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,760 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,760 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,760 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,760 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,763 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,763 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,763 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,764 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,764 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,764 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,764 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,764 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,768 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,768 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,768 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,769 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,770 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,770 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,771 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,772 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,772 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,772 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,774 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,774 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,775 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,775 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,775 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,775 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,776 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,776 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,776 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,776 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,776 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,777 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,781 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,782 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,783 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,783 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,784 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,784 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,785 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,785 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,786 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,786 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,786 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,786 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,786 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,787 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,788 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,788 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,789 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,789 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,789 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,790 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,791 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,791 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,791 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,791 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,791 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,792 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,792 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,792 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,792 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,792 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,792 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,795 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,795 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,795 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,796 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,796 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,796 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,796 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,796 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,797 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,797 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,797 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,797 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,797 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,798 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,800 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,800 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,801 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:06:24,834 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-13 02:06:24,834 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 02:06:24,848 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-13 02:06:24,869 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-13 02:06:24,908 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 02:06:24,909 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 02:06:24,910 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-13 02:06:24,910 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 02:06:24,910 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 02:06:24,910 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 02:06:24,910 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 02:06:24,910 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 02:06:24,911 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 02:06:24,931 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2019-01-13 02:06:27,565 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34807 states. [2019-01-13 02:06:27,568 INFO L276 IsEmpty]: Start isEmpty. Operand 34807 states. [2019-01-13 02:06:27,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-13 02:06:27,576 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:06:27,577 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] [2019-01-13 02:06:27,580 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:06:27,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:06:27,588 INFO L82 PathProgramCache]: Analyzing trace with hash 375373260, now seen corresponding path program 1 times [2019-01-13 02:06:27,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:06:27,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:06:27,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:06:27,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:06:27,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:06:27,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:06:27,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:06:28,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:06:28,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 02:06:28,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 02:06:28,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 02:06:28,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 02:06:28,026 INFO L87 Difference]: Start difference. First operand 34807 states. Second operand 4 states. [2019-01-13 02:06:29,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:06:29,412 INFO L93 Difference]: Finished difference Result 60791 states and 234494 transitions. [2019-01-13 02:06:29,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 02:06:29,421 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-01-13 02:06:29,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:06:29,813 INFO L225 Difference]: With dead ends: 60791 [2019-01-13 02:06:29,813 INFO L226 Difference]: Without dead ends: 44271 [2019-01-13 02:06:29,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 02:06:30,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44271 states. [2019-01-13 02:06:31,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44271 to 27339. [2019-01-13 02:06:31,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27339 states. [2019-01-13 02:06:31,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27339 states to 27339 states and 105500 transitions. [2019-01-13 02:06:31,536 INFO L78 Accepts]: Start accepts. Automaton has 27339 states and 105500 transitions. Word has length 34 [2019-01-13 02:06:31,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:06:31,537 INFO L480 AbstractCegarLoop]: Abstraction has 27339 states and 105500 transitions. [2019-01-13 02:06:31,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 02:06:31,537 INFO L276 IsEmpty]: Start isEmpty. Operand 27339 states and 105500 transitions. [2019-01-13 02:06:31,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-13 02:06:31,549 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:06:31,549 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] [2019-01-13 02:06:31,549 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:06:31,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:06:31,551 INFO L82 PathProgramCache]: Analyzing trace with hash 510140563, now seen corresponding path program 1 times [2019-01-13 02:06:31,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:06:31,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:06:31,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:06:31,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:06:31,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:06:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:06:31,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:06:31,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:06:31,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 02:06:31,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 02:06:31,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 02:06:31,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 02:06:31,721 INFO L87 Difference]: Start difference. First operand 27339 states and 105500 transitions. Second operand 3 states. [2019-01-13 02:06:32,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:06:32,428 INFO L93 Difference]: Finished difference Result 27339 states and 105223 transitions. [2019-01-13 02:06:32,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 02:06:32,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-01-13 02:06:32,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:06:32,627 INFO L225 Difference]: With dead ends: 27339 [2019-01-13 02:06:32,627 INFO L226 Difference]: Without dead ends: 27339 [2019-01-13 02:06:32,628 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 [2019-01-13 02:06:32,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27339 states. [2019-01-13 02:06:33,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27339 to 27339. [2019-01-13 02:06:33,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27339 states. [2019-01-13 02:06:34,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27339 states to 27339 states and 105223 transitions. [2019-01-13 02:06:34,103 INFO L78 Accepts]: Start accepts. Automaton has 27339 states and 105223 transitions. Word has length 46 [2019-01-13 02:06:34,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:06:34,105 INFO L480 AbstractCegarLoop]: Abstraction has 27339 states and 105223 transitions. [2019-01-13 02:06:34,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 02:06:34,105 INFO L276 IsEmpty]: Start isEmpty. Operand 27339 states and 105223 transitions. [2019-01-13 02:06:34,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-13 02:06:34,113 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:06:34,113 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] [2019-01-13 02:06:34,113 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:06:34,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:06:34,115 INFO L82 PathProgramCache]: Analyzing trace with hash -2042016398, now seen corresponding path program 1 times [2019-01-13 02:06:34,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:06:34,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:06:34,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:06:34,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:06:34,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:06:34,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:06:34,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:06:34,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:06:34,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 02:06:34,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 02:06:34,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 02:06:34,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:06:34,327 INFO L87 Difference]: Start difference. First operand 27339 states and 105223 transitions. Second operand 5 states. [2019-01-13 02:06:35,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:06:35,915 INFO L93 Difference]: Finished difference Result 64005 states and 235022 transitions. [2019-01-13 02:06:35,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 02:06:35,916 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-01-13 02:06:35,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:06:36,230 INFO L225 Difference]: With dead ends: 64005 [2019-01-13 02:06:36,230 INFO L226 Difference]: Without dead ends: 63453 [2019-01-13 02:06:36,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 02:06:36,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63453 states. [2019-01-13 02:06:38,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63453 to 41421. [2019-01-13 02:06:38,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41421 states. [2019-01-13 02:06:38,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41421 states to 41421 states and 152053 transitions. [2019-01-13 02:06:38,710 INFO L78 Accepts]: Start accepts. Automaton has 41421 states and 152053 transitions. Word has length 46 [2019-01-13 02:06:38,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:06:38,714 INFO L480 AbstractCegarLoop]: Abstraction has 41421 states and 152053 transitions. [2019-01-13 02:06:38,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 02:06:38,714 INFO L276 IsEmpty]: Start isEmpty. Operand 41421 states and 152053 transitions. [2019-01-13 02:06:38,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-13 02:06:38,723 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:06:38,723 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 02:06:38,724 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:06:38,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:06:38,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1974914378, now seen corresponding path program 1 times [2019-01-13 02:06:38,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:06:38,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:06:38,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:06:38,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:06:38,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:06:38,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:06:39,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:06:39,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:06:39,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 02:06:39,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 02:06:39,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 02:06:39,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 02:06:39,003 INFO L87 Difference]: Start difference. First operand 41421 states and 152053 transitions. Second operand 6 states. [2019-01-13 02:06:39,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:06:39,888 INFO L93 Difference]: Finished difference Result 52771 states and 190649 transitions. [2019-01-13 02:06:39,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 02:06:39,888 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-01-13 02:06:39,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:06:40,081 INFO L225 Difference]: With dead ends: 52771 [2019-01-13 02:06:40,081 INFO L226 Difference]: Without dead ends: 52259 [2019-01-13 02:06:40,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-01-13 02:06:41,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52259 states. [2019-01-13 02:06:42,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52259 to 45375. [2019-01-13 02:06:42,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45375 states. [2019-01-13 02:06:42,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45375 states to 45375 states and 165678 transitions. [2019-01-13 02:06:42,314 INFO L78 Accepts]: Start accepts. Automaton has 45375 states and 165678 transitions. Word has length 47 [2019-01-13 02:06:42,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:06:42,315 INFO L480 AbstractCegarLoop]: Abstraction has 45375 states and 165678 transitions. [2019-01-13 02:06:42,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 02:06:42,315 INFO L276 IsEmpty]: Start isEmpty. Operand 45375 states and 165678 transitions. [2019-01-13 02:06:42,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-13 02:06:42,325 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:06:42,325 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] [2019-01-13 02:06:42,325 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:06:42,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:06:42,326 INFO L82 PathProgramCache]: Analyzing trace with hash 489356304, now seen corresponding path program 1 times [2019-01-13 02:06:42,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:06:42,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:06:42,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:06:42,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:06:42,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:06:42,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:06:42,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:06:42,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:06:42,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 02:06:42,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 02:06:42,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 02:06:42,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 02:06:42,405 INFO L87 Difference]: Start difference. First operand 45375 states and 165678 transitions. Second operand 3 states. [2019-01-13 02:06:42,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:06:42,846 INFO L93 Difference]: Finished difference Result 65251 states and 235338 transitions. [2019-01-13 02:06:42,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 02:06:42,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-01-13 02:06:42,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:06:43,035 INFO L225 Difference]: With dead ends: 65251 [2019-01-13 02:06:43,035 INFO L226 Difference]: Without dead ends: 65251 [2019-01-13 02:06:43,036 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 [2019-01-13 02:06:43,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65251 states. [2019-01-13 02:06:47,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65251 to 50945. [2019-01-13 02:06:47,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50945 states. [2019-01-13 02:06:47,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50945 states to 50945 states and 183963 transitions. [2019-01-13 02:06:47,875 INFO L78 Accepts]: Start accepts. Automaton has 50945 states and 183963 transitions. Word has length 49 [2019-01-13 02:06:47,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:06:47,875 INFO L480 AbstractCegarLoop]: Abstraction has 50945 states and 183963 transitions. [2019-01-13 02:06:47,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 02:06:47,876 INFO L276 IsEmpty]: Start isEmpty. Operand 50945 states and 183963 transitions. [2019-01-13 02:06:47,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-13 02:06:47,894 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:06:47,895 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] [2019-01-13 02:06:47,895 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:06:47,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:06:47,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1592139769, now seen corresponding path program 1 times [2019-01-13 02:06:47,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:06:47,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:06:47,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:06:47,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:06:47,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:06:47,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:06:48,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:06:48,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:06:48,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 02:06:48,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 02:06:48,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 02:06:48,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 02:06:48,072 INFO L87 Difference]: Start difference. First operand 50945 states and 183963 transitions. Second operand 6 states. [2019-01-13 02:06:49,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:06:49,340 INFO L93 Difference]: Finished difference Result 67511 states and 241920 transitions. [2019-01-13 02:06:49,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 02:06:49,341 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-01-13 02:06:49,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:06:49,536 INFO L225 Difference]: With dead ends: 67511 [2019-01-13 02:06:49,536 INFO L226 Difference]: Without dead ends: 67511 [2019-01-13 02:06:49,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 02:06:49,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67511 states. [2019-01-13 02:06:50,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67511 to 63436. [2019-01-13 02:06:50,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63436 states. [2019-01-13 02:06:51,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63436 states to 63436 states and 227319 transitions. [2019-01-13 02:06:51,551 INFO L78 Accepts]: Start accepts. Automaton has 63436 states and 227319 transitions. Word has length 53 [2019-01-13 02:06:51,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:06:51,552 INFO L480 AbstractCegarLoop]: Abstraction has 63436 states and 227319 transitions. [2019-01-13 02:06:51,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 02:06:51,552 INFO L276 IsEmpty]: Start isEmpty. Operand 63436 states and 227319 transitions. [2019-01-13 02:06:51,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-13 02:06:51,576 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:06:51,576 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] [2019-01-13 02:06:51,576 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:06:51,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:06:51,577 INFO L82 PathProgramCache]: Analyzing trace with hash 905876168, now seen corresponding path program 1 times [2019-01-13 02:06:51,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:06:51,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:06:51,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:06:51,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:06:51,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:06:51,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:06:51,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:06:51,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:06:51,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 02:06:51,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 02:06:51,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 02:06:51,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-13 02:06:51,778 INFO L87 Difference]: Start difference. First operand 63436 states and 227319 transitions. Second operand 7 states. [2019-01-13 02:06:53,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:06:53,605 INFO L93 Difference]: Finished difference Result 88528 states and 305936 transitions. [2019-01-13 02:06:53,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-13 02:06:53,606 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-01-13 02:06:53,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:06:53,825 INFO L225 Difference]: With dead ends: 88528 [2019-01-13 02:06:53,825 INFO L226 Difference]: Without dead ends: 88528 [2019-01-13 02:06:53,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-01-13 02:06:54,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88528 states. [2019-01-13 02:06:55,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88528 to 74881. [2019-01-13 02:06:55,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74881 states. [2019-01-13 02:06:55,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74881 states to 74881 states and 262722 transitions. [2019-01-13 02:06:55,388 INFO L78 Accepts]: Start accepts. Automaton has 74881 states and 262722 transitions. Word has length 53 [2019-01-13 02:06:55,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:06:55,388 INFO L480 AbstractCegarLoop]: Abstraction has 74881 states and 262722 transitions. [2019-01-13 02:06:55,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 02:06:55,388 INFO L276 IsEmpty]: Start isEmpty. Operand 74881 states and 262722 transitions. [2019-01-13 02:06:55,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-13 02:06:55,406 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:06:55,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] [2019-01-13 02:06:55,407 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:06:55,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:06:55,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1793379849, now seen corresponding path program 1 times [2019-01-13 02:06:55,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:06:55,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:06:55,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:06:55,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:06:55,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:06:55,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:06:55,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:06:55,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:06:55,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 02:06:55,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 02:06:55,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 02:06:55,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 02:06:55,572 INFO L87 Difference]: Start difference. First operand 74881 states and 262722 transitions. Second operand 4 states. [2019-01-13 02:06:55,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:06:55,788 INFO L93 Difference]: Finished difference Result 15375 states and 48802 transitions. [2019-01-13 02:06:55,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 02:06:55,789 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-01-13 02:06:55,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:06:55,812 INFO L225 Difference]: With dead ends: 15375 [2019-01-13 02:06:55,813 INFO L226 Difference]: Without dead ends: 13789 [2019-01-13 02:06:55,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:06:55,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13789 states. [2019-01-13 02:06:55,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13789 to 13740. [2019-01-13 02:06:55,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13740 states. [2019-01-13 02:06:56,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13740 states to 13740 states and 43328 transitions. [2019-01-13 02:06:56,004 INFO L78 Accepts]: Start accepts. Automaton has 13740 states and 43328 transitions. Word has length 53 [2019-01-13 02:06:56,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:06:56,004 INFO L480 AbstractCegarLoop]: Abstraction has 13740 states and 43328 transitions. [2019-01-13 02:06:56,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 02:06:56,004 INFO L276 IsEmpty]: Start isEmpty. Operand 13740 states and 43328 transitions. [2019-01-13 02:06:56,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-13 02:06:56,006 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:06:56,006 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 02:06:56,007 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:06:56,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:06:56,007 INFO L82 PathProgramCache]: Analyzing trace with hash 35134875, now seen corresponding path program 1 times [2019-01-13 02:06:56,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:06:56,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:06:56,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:06:56,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:06:56,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:06:56,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:06:56,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:06:56,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:06:56,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 02:06:56,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 02:06:56,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 02:06:56,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 02:06:56,200 INFO L87 Difference]: Start difference. First operand 13740 states and 43328 transitions. Second operand 6 states. [2019-01-13 02:06:56,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:06:56,778 INFO L93 Difference]: Finished difference Result 19970 states and 62557 transitions. [2019-01-13 02:06:56,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 02:06:56,778 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-01-13 02:06:56,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:06:56,811 INFO L225 Difference]: With dead ends: 19970 [2019-01-13 02:06:56,812 INFO L226 Difference]: Without dead ends: 19898 [2019-01-13 02:06:56,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-01-13 02:06:57,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19898 states. [2019-01-13 02:06:57,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19898 to 14314. [2019-01-13 02:06:57,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14314 states. [2019-01-13 02:06:57,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14314 states to 14314 states and 45025 transitions. [2019-01-13 02:06:57,329 INFO L78 Accepts]: Start accepts. Automaton has 14314 states and 45025 transitions. Word has length 53 [2019-01-13 02:06:57,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:06:57,329 INFO L480 AbstractCegarLoop]: Abstraction has 14314 states and 45025 transitions. [2019-01-13 02:06:57,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 02:06:57,329 INFO L276 IsEmpty]: Start isEmpty. Operand 14314 states and 45025 transitions. [2019-01-13 02:06:57,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-13 02:06:57,334 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:06:57,335 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 02:06:57,335 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:06:57,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:06:57,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1993804535, now seen corresponding path program 1 times [2019-01-13 02:06:57,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:06:57,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:06:57,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:06:57,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:06:57,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:06:57,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:06:57,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:06:57,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:06:57,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 02:06:57,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 02:06:57,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 02:06:57,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 02:06:57,560 INFO L87 Difference]: Start difference. First operand 14314 states and 45025 transitions. Second operand 4 states. [2019-01-13 02:06:57,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:06:57,973 INFO L93 Difference]: Finished difference Result 16617 states and 52353 transitions. [2019-01-13 02:06:57,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 02:06:57,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-01-13 02:06:57,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:06:58,004 INFO L225 Difference]: With dead ends: 16617 [2019-01-13 02:06:58,005 INFO L226 Difference]: Without dead ends: 16617 [2019-01-13 02:06:58,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:06:58,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16617 states. [2019-01-13 02:06:58,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16617 to 15134. [2019-01-13 02:06:58,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15134 states. [2019-01-13 02:06:58,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15134 states to 15134 states and 47615 transitions. [2019-01-13 02:06:58,235 INFO L78 Accepts]: Start accepts. Automaton has 15134 states and 47615 transitions. Word has length 61 [2019-01-13 02:06:58,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:06:58,235 INFO L480 AbstractCegarLoop]: Abstraction has 15134 states and 47615 transitions. [2019-01-13 02:06:58,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 02:06:58,235 INFO L276 IsEmpty]: Start isEmpty. Operand 15134 states and 47615 transitions. [2019-01-13 02:06:58,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-13 02:06:58,240 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:06:58,240 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] [2019-01-13 02:06:58,240 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:06:58,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:06:58,241 INFO L82 PathProgramCache]: Analyzing trace with hash -558352426, now seen corresponding path program 1 times [2019-01-13 02:06:58,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:06:58,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:06:58,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:06:58,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:06:58,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:06:58,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:06:58,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:06:58,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:06:58,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 02:06:58,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 02:06:58,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 02:06:58,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 02:06:58,484 INFO L87 Difference]: Start difference. First operand 15134 states and 47615 transitions. Second operand 6 states. [2019-01-13 02:06:59,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:06:59,556 INFO L93 Difference]: Finished difference Result 28106 states and 88091 transitions. [2019-01-13 02:06:59,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 02:06:59,557 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-01-13 02:06:59,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:06:59,627 INFO L225 Difference]: With dead ends: 28106 [2019-01-13 02:06:59,627 INFO L226 Difference]: Without dead ends: 28035 [2019-01-13 02:06:59,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-01-13 02:06:59,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28035 states. [2019-01-13 02:06:59,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28035 to 17412. [2019-01-13 02:06:59,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17412 states. [2019-01-13 02:06:59,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17412 states to 17412 states and 54277 transitions. [2019-01-13 02:06:59,955 INFO L78 Accepts]: Start accepts. Automaton has 17412 states and 54277 transitions. Word has length 61 [2019-01-13 02:06:59,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:06:59,956 INFO L480 AbstractCegarLoop]: Abstraction has 17412 states and 54277 transitions. [2019-01-13 02:06:59,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 02:06:59,956 INFO L276 IsEmpty]: Start isEmpty. Operand 17412 states and 54277 transitions. [2019-01-13 02:06:59,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-13 02:06:59,962 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:06:59,963 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] [2019-01-13 02:06:59,963 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:06:59,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:06:59,963 INFO L82 PathProgramCache]: Analyzing trace with hash 962407834, now seen corresponding path program 1 times [2019-01-13 02:06:59,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:06:59,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:06:59,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:06:59,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:06:59,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:06:59,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:07:00,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:07:00,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:07:00,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 02:07:00,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 02:07:00,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 02:07:00,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 02:07:00,072 INFO L87 Difference]: Start difference. First operand 17412 states and 54277 transitions. Second operand 3 states. [2019-01-13 02:07:00,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:07:00,368 INFO L93 Difference]: Finished difference Result 18092 states and 56109 transitions. [2019-01-13 02:07:00,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 02:07:00,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-01-13 02:07:00,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:07:00,398 INFO L225 Difference]: With dead ends: 18092 [2019-01-13 02:07:00,399 INFO L226 Difference]: Without dead ends: 18092 [2019-01-13 02:07:00,399 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 [2019-01-13 02:07:00,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18092 states. [2019-01-13 02:07:00,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18092 to 17752. [2019-01-13 02:07:00,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17752 states. [2019-01-13 02:07:00,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17752 states to 17752 states and 55193 transitions. [2019-01-13 02:07:00,648 INFO L78 Accepts]: Start accepts. Automaton has 17752 states and 55193 transitions. Word has length 65 [2019-01-13 02:07:00,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:07:00,648 INFO L480 AbstractCegarLoop]: Abstraction has 17752 states and 55193 transitions. [2019-01-13 02:07:00,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 02:07:00,648 INFO L276 IsEmpty]: Start isEmpty. Operand 17752 states and 55193 transitions. [2019-01-13 02:07:00,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-13 02:07:00,655 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:07:00,656 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] [2019-01-13 02:07:00,656 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:07:00,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:07:00,656 INFO L82 PathProgramCache]: Analyzing trace with hash -901897063, now seen corresponding path program 1 times [2019-01-13 02:07:00,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:07:00,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:07:00,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:00,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:07:00,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:00,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:07:00,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:07:00,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:07:00,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 02:07:00,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 02:07:00,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 02:07:00,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 02:07:00,899 INFO L87 Difference]: Start difference. First operand 17752 states and 55193 transitions. Second operand 4 states. [2019-01-13 02:07:01,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:07:01,393 INFO L93 Difference]: Finished difference Result 21696 states and 66682 transitions. [2019-01-13 02:07:01,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 02:07:01,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-01-13 02:07:01,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:07:01,430 INFO L225 Difference]: With dead ends: 21696 [2019-01-13 02:07:01,431 INFO L226 Difference]: Without dead ends: 21696 [2019-01-13 02:07:01,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 02:07:01,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21696 states. [2019-01-13 02:07:01,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21696 to 19646. [2019-01-13 02:07:01,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19646 states. [2019-01-13 02:07:01,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19646 states to 19646 states and 60572 transitions. [2019-01-13 02:07:01,723 INFO L78 Accepts]: Start accepts. Automaton has 19646 states and 60572 transitions. Word has length 65 [2019-01-13 02:07:01,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:07:01,723 INFO L480 AbstractCegarLoop]: Abstraction has 19646 states and 60572 transitions. [2019-01-13 02:07:01,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 02:07:01,724 INFO L276 IsEmpty]: Start isEmpty. Operand 19646 states and 60572 transitions. [2019-01-13 02:07:01,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-13 02:07:01,735 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:07:01,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] [2019-01-13 02:07:01,735 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:07:01,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:07:01,735 INFO L82 PathProgramCache]: Analyzing trace with hash -987757598, now seen corresponding path program 1 times [2019-01-13 02:07:01,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:07:01,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:07:01,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:01,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:07:01,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:01,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:07:01,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:07:01,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:07:01,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 02:07:01,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 02:07:01,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 02:07:01,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 02:07:01,993 INFO L87 Difference]: Start difference. First operand 19646 states and 60572 transitions. Second operand 6 states. [2019-01-13 02:07:03,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:07:03,266 INFO L93 Difference]: Finished difference Result 23814 states and 72270 transitions. [2019-01-13 02:07:03,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 02:07:03,276 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-01-13 02:07:03,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:07:03,323 INFO L225 Difference]: With dead ends: 23814 [2019-01-13 02:07:03,323 INFO L226 Difference]: Without dead ends: 23814 [2019-01-13 02:07:03,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 02:07:03,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23814 states. [2019-01-13 02:07:03,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23814 to 22474. [2019-01-13 02:07:03,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22474 states. [2019-01-13 02:07:03,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22474 states to 22474 states and 68700 transitions. [2019-01-13 02:07:03,679 INFO L78 Accepts]: Start accepts. Automaton has 22474 states and 68700 transitions. Word has length 67 [2019-01-13 02:07:03,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:07:03,679 INFO L480 AbstractCegarLoop]: Abstraction has 22474 states and 68700 transitions. [2019-01-13 02:07:03,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 02:07:03,680 INFO L276 IsEmpty]: Start isEmpty. Operand 22474 states and 68700 transitions. [2019-01-13 02:07:03,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-13 02:07:03,693 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:07:03,693 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] [2019-01-13 02:07:03,693 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:07:03,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:07:03,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1230000355, now seen corresponding path program 1 times [2019-01-13 02:07:03,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:07:03,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:07:03,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:03,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:07:03,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:03,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:07:03,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:07:03,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:07:03,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 02:07:03,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 02:07:03,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 02:07:03,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 02:07:03,945 INFO L87 Difference]: Start difference. First operand 22474 states and 68700 transitions. Second operand 6 states. [2019-01-13 02:07:04,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:07:04,723 INFO L93 Difference]: Finished difference Result 25702 states and 76160 transitions. [2019-01-13 02:07:04,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 02:07:04,724 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-01-13 02:07:04,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:07:04,764 INFO L225 Difference]: With dead ends: 25702 [2019-01-13 02:07:04,764 INFO L226 Difference]: Without dead ends: 25702 [2019-01-13 02:07:04,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-01-13 02:07:04,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25702 states. [2019-01-13 02:07:05,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25702 to 22858. [2019-01-13 02:07:05,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22858 states. [2019-01-13 02:07:05,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22858 states to 22858 states and 68806 transitions. [2019-01-13 02:07:05,094 INFO L78 Accepts]: Start accepts. Automaton has 22858 states and 68806 transitions. Word has length 67 [2019-01-13 02:07:05,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:07:05,094 INFO L480 AbstractCegarLoop]: Abstraction has 22858 states and 68806 transitions. [2019-01-13 02:07:05,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 02:07:05,094 INFO L276 IsEmpty]: Start isEmpty. Operand 22858 states and 68806 transitions. [2019-01-13 02:07:05,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-13 02:07:05,106 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:07:05,106 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] [2019-01-13 02:07:05,106 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:07:05,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:07:05,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1441351268, now seen corresponding path program 1 times [2019-01-13 02:07:05,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:07:05,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:07:05,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:05,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:07:05,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:05,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:07:05,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:07:05,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:07:05,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 02:07:05,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 02:07:05,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 02:07:05,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:07:05,297 INFO L87 Difference]: Start difference. First operand 22858 states and 68806 transitions. Second operand 5 states. [2019-01-13 02:07:05,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:07:05,780 INFO L93 Difference]: Finished difference Result 29793 states and 89371 transitions. [2019-01-13 02:07:05,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 02:07:05,781 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-01-13 02:07:05,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:07:05,828 INFO L225 Difference]: With dead ends: 29793 [2019-01-13 02:07:05,829 INFO L226 Difference]: Without dead ends: 29793 [2019-01-13 02:07:05,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 02:07:05,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29793 states. [2019-01-13 02:07:06,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29793 to 26814. [2019-01-13 02:07:06,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26814 states. [2019-01-13 02:07:06,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26814 states to 26814 states and 80315 transitions. [2019-01-13 02:07:06,207 INFO L78 Accepts]: Start accepts. Automaton has 26814 states and 80315 transitions. Word has length 67 [2019-01-13 02:07:06,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:07:06,207 INFO L480 AbstractCegarLoop]: Abstraction has 26814 states and 80315 transitions. [2019-01-13 02:07:06,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 02:07:06,207 INFO L276 IsEmpty]: Start isEmpty. Operand 26814 states and 80315 transitions. [2019-01-13 02:07:06,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-13 02:07:06,221 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:07:06,222 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] [2019-01-13 02:07:06,222 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:07:06,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:07:06,222 INFO L82 PathProgramCache]: Analyzing trace with hash 930817091, now seen corresponding path program 1 times [2019-01-13 02:07:06,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:07:06,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:07:06,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:06,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:07:06,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:06,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:07:06,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:07:06,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:07:06,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 02:07:06,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 02:07:06,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 02:07:06,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:07:06,324 INFO L87 Difference]: Start difference. First operand 26814 states and 80315 transitions. Second operand 5 states. [2019-01-13 02:07:06,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:07:06,994 INFO L93 Difference]: Finished difference Result 36420 states and 108385 transitions. [2019-01-13 02:07:06,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 02:07:06,995 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-01-13 02:07:06,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:07:07,068 INFO L225 Difference]: With dead ends: 36420 [2019-01-13 02:07:07,068 INFO L226 Difference]: Without dead ends: 36420 [2019-01-13 02:07:07,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 02:07:07,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36420 states. [2019-01-13 02:07:07,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36420 to 29428. [2019-01-13 02:07:07,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29428 states. [2019-01-13 02:07:07,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29428 states to 29428 states and 87791 transitions. [2019-01-13 02:07:07,542 INFO L78 Accepts]: Start accepts. Automaton has 29428 states and 87791 transitions. Word has length 67 [2019-01-13 02:07:07,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:07:07,543 INFO L480 AbstractCegarLoop]: Abstraction has 29428 states and 87791 transitions. [2019-01-13 02:07:07,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 02:07:07,543 INFO L276 IsEmpty]: Start isEmpty. Operand 29428 states and 87791 transitions. [2019-01-13 02:07:07,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-13 02:07:07,554 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:07:07,554 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] [2019-01-13 02:07:07,554 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:07:07,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:07:07,555 INFO L82 PathProgramCache]: Analyzing trace with hash -876637372, now seen corresponding path program 1 times [2019-01-13 02:07:07,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:07:07,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:07:07,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:07,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:07:07,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:07,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:07:07,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:07:07,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:07:07,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 02:07:07,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 02:07:07,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 02:07:07,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 02:07:07,652 INFO L87 Difference]: Start difference. First operand 29428 states and 87791 transitions. Second operand 4 states. [2019-01-13 02:07:08,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:07:08,546 INFO L93 Difference]: Finished difference Result 38892 states and 116477 transitions. [2019-01-13 02:07:08,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 02:07:08,548 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-01-13 02:07:08,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:07:08,661 INFO L225 Difference]: With dead ends: 38892 [2019-01-13 02:07:08,661 INFO L226 Difference]: Without dead ends: 38660 [2019-01-13 02:07:08,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:07:08,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38660 states. [2019-01-13 02:07:09,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38660 to 35784. [2019-01-13 02:07:09,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35784 states. [2019-01-13 02:07:09,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35784 states to 35784 states and 107258 transitions. [2019-01-13 02:07:09,599 INFO L78 Accepts]: Start accepts. Automaton has 35784 states and 107258 transitions. Word has length 67 [2019-01-13 02:07:09,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:07:09,600 INFO L480 AbstractCegarLoop]: Abstraction has 35784 states and 107258 transitions. [2019-01-13 02:07:09,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 02:07:09,600 INFO L276 IsEmpty]: Start isEmpty. Operand 35784 states and 107258 transitions. [2019-01-13 02:07:09,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-13 02:07:09,618 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:07:09,618 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] [2019-01-13 02:07:09,618 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:07:09,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:07:09,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1621378565, now seen corresponding path program 1 times [2019-01-13 02:07:09,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:07:09,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:07:09,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:09,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:07:09,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:07:09,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:07:09,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:07:09,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 02:07:09,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 02:07:09,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 02:07:09,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:07:09,811 INFO L87 Difference]: Start difference. First operand 35784 states and 107258 transitions. Second operand 5 states. [2019-01-13 02:07:09,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:07:09,874 INFO L93 Difference]: Finished difference Result 9316 states and 22547 transitions. [2019-01-13 02:07:09,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 02:07:09,875 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-01-13 02:07:09,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:07:09,885 INFO L225 Difference]: With dead ends: 9316 [2019-01-13 02:07:09,885 INFO L226 Difference]: Without dead ends: 7464 [2019-01-13 02:07:09,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 02:07:09,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7464 states. [2019-01-13 02:07:09,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7464 to 6361. [2019-01-13 02:07:09,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6361 states. [2019-01-13 02:07:09,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6361 states to 6361 states and 15018 transitions. [2019-01-13 02:07:09,966 INFO L78 Accepts]: Start accepts. Automaton has 6361 states and 15018 transitions. Word has length 67 [2019-01-13 02:07:09,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:07:09,966 INFO L480 AbstractCegarLoop]: Abstraction has 6361 states and 15018 transitions. [2019-01-13 02:07:09,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 02:07:09,966 INFO L276 IsEmpty]: Start isEmpty. Operand 6361 states and 15018 transitions. [2019-01-13 02:07:09,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-13 02:07:09,972 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:07:09,972 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] [2019-01-13 02:07:09,972 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:07:09,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:07:09,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1392892313, now seen corresponding path program 1 times [2019-01-13 02:07:09,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:07:09,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:07:09,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:09,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:07:09,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:07:10,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:07:10,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:07:10,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 02:07:10,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 02:07:10,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 02:07:10,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 02:07:10,045 INFO L87 Difference]: Start difference. First operand 6361 states and 15018 transitions. Second operand 3 states. [2019-01-13 02:07:10,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:07:10,302 INFO L93 Difference]: Finished difference Result 8820 states and 20757 transitions. [2019-01-13 02:07:10,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 02:07:10,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-01-13 02:07:10,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:07:10,319 INFO L225 Difference]: With dead ends: 8820 [2019-01-13 02:07:10,320 INFO L226 Difference]: Without dead ends: 8820 [2019-01-13 02:07:10,320 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 [2019-01-13 02:07:10,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8820 states. [2019-01-13 02:07:10,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8820 to 6300. [2019-01-13 02:07:10,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6300 states. [2019-01-13 02:07:10,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6300 states to 6300 states and 14558 transitions. [2019-01-13 02:07:10,461 INFO L78 Accepts]: Start accepts. Automaton has 6300 states and 14558 transitions. Word has length 67 [2019-01-13 02:07:10,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:07:10,462 INFO L480 AbstractCegarLoop]: Abstraction has 6300 states and 14558 transitions. [2019-01-13 02:07:10,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 02:07:10,462 INFO L276 IsEmpty]: Start isEmpty. Operand 6300 states and 14558 transitions. [2019-01-13 02:07:10,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-13 02:07:10,471 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:07:10,471 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 02:07:10,472 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:07:10,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:07:10,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1912290010, now seen corresponding path program 1 times [2019-01-13 02:07:10,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:07:10,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:07:10,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:10,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:07:10,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:10,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:07:10,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:07:10,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:07:10,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 02:07:10,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 02:07:10,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 02:07:10,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:07:10,828 INFO L87 Difference]: Start difference. First operand 6300 states and 14558 transitions. Second operand 5 states. [2019-01-13 02:07:11,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:07:11,416 INFO L93 Difference]: Finished difference Result 7470 states and 17199 transitions. [2019-01-13 02:07:11,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 02:07:11,417 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-01-13 02:07:11,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:07:11,428 INFO L225 Difference]: With dead ends: 7470 [2019-01-13 02:07:11,428 INFO L226 Difference]: Without dead ends: 7470 [2019-01-13 02:07:11,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-13 02:07:11,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7470 states. [2019-01-13 02:07:11,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7470 to 6744. [2019-01-13 02:07:11,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6744 states. [2019-01-13 02:07:11,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6744 states to 6744 states and 15562 transitions. [2019-01-13 02:07:11,509 INFO L78 Accepts]: Start accepts. Automaton has 6744 states and 15562 transitions. Word has length 73 [2019-01-13 02:07:11,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:07:11,509 INFO L480 AbstractCegarLoop]: Abstraction has 6744 states and 15562 transitions. [2019-01-13 02:07:11,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 02:07:11,509 INFO L276 IsEmpty]: Start isEmpty. Operand 6744 states and 15562 transitions. [2019-01-13 02:07:11,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-13 02:07:11,517 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:07:11,517 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] [2019-01-13 02:07:11,517 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:07:11,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:07:11,518 INFO L82 PathProgramCache]: Analyzing trace with hash -639866951, now seen corresponding path program 1 times [2019-01-13 02:07:11,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:07:11,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:07:11,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:11,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:07:11,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:11,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:07:12,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:07:12,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:07:12,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 02:07:12,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 02:07:12,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 02:07:12,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 02:07:12,020 INFO L87 Difference]: Start difference. First operand 6744 states and 15562 transitions. Second operand 7 states. [2019-01-13 02:07:12,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:07:12,637 INFO L93 Difference]: Finished difference Result 7881 states and 17984 transitions. [2019-01-13 02:07:12,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 02:07:12,638 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-01-13 02:07:12,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:07:12,649 INFO L225 Difference]: With dead ends: 7881 [2019-01-13 02:07:12,650 INFO L226 Difference]: Without dead ends: 7762 [2019-01-13 02:07:12,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-01-13 02:07:12,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7762 states. [2019-01-13 02:07:12,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7762 to 6841. [2019-01-13 02:07:12,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6841 states. [2019-01-13 02:07:12,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6841 states to 6841 states and 15655 transitions. [2019-01-13 02:07:12,750 INFO L78 Accepts]: Start accepts. Automaton has 6841 states and 15655 transitions. Word has length 73 [2019-01-13 02:07:12,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:07:12,750 INFO L480 AbstractCegarLoop]: Abstraction has 6841 states and 15655 transitions. [2019-01-13 02:07:12,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 02:07:12,751 INFO L276 IsEmpty]: Start isEmpty. Operand 6841 states and 15655 transitions. [2019-01-13 02:07:12,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 02:07:12,761 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:07:12,761 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] [2019-01-13 02:07:12,761 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:07:12,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:07:12,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1900952980, now seen corresponding path program 1 times [2019-01-13 02:07:12,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:07:12,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:07:12,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:12,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:07:12,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:12,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:07:12,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:07:12,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:07:12,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 02:07:12,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 02:07:12,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 02:07:12,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 02:07:12,948 INFO L87 Difference]: Start difference. First operand 6841 states and 15655 transitions. Second operand 4 states. [2019-01-13 02:07:13,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:07:13,341 INFO L93 Difference]: Finished difference Result 10608 states and 24142 transitions. [2019-01-13 02:07:13,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 02:07:13,342 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-01-13 02:07:13,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:07:13,357 INFO L225 Difference]: With dead ends: 10608 [2019-01-13 02:07:13,357 INFO L226 Difference]: Without dead ends: 10608 [2019-01-13 02:07:13,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 02:07:13,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10608 states. [2019-01-13 02:07:13,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10608 to 7961. [2019-01-13 02:07:13,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7961 states. [2019-01-13 02:07:13,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7961 states to 7961 states and 17989 transitions. [2019-01-13 02:07:13,482 INFO L78 Accepts]: Start accepts. Automaton has 7961 states and 17989 transitions. Word has length 92 [2019-01-13 02:07:13,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:07:13,482 INFO L480 AbstractCegarLoop]: Abstraction has 7961 states and 17989 transitions. [2019-01-13 02:07:13,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 02:07:13,482 INFO L276 IsEmpty]: Start isEmpty. Operand 7961 states and 17989 transitions. [2019-01-13 02:07:13,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 02:07:13,494 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:07:13,494 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] [2019-01-13 02:07:13,494 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:07:13,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:07:13,495 INFO L82 PathProgramCache]: Analyzing trace with hash -824739963, now seen corresponding path program 1 times [2019-01-13 02:07:13,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:07:13,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:07:13,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:13,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:07:13,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:13,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:07:13,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:07:13,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:07:13,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 02:07:13,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 02:07:13,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 02:07:13,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 02:07:13,608 INFO L87 Difference]: Start difference. First operand 7961 states and 17989 transitions. Second operand 4 states. [2019-01-13 02:07:13,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:07:13,745 INFO L93 Difference]: Finished difference Result 8526 states and 19282 transitions. [2019-01-13 02:07:13,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 02:07:13,746 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-01-13 02:07:13,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:07:13,756 INFO L225 Difference]: With dead ends: 8526 [2019-01-13 02:07:13,756 INFO L226 Difference]: Without dead ends: 8526 [2019-01-13 02:07:13,757 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 [2019-01-13 02:07:13,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8526 states. [2019-01-13 02:07:13,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8526 to 7867. [2019-01-13 02:07:13,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7867 states. [2019-01-13 02:07:13,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7867 states to 7867 states and 17884 transitions. [2019-01-13 02:07:13,859 INFO L78 Accepts]: Start accepts. Automaton has 7867 states and 17884 transitions. Word has length 92 [2019-01-13 02:07:13,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:07:13,860 INFO L480 AbstractCegarLoop]: Abstraction has 7867 states and 17884 transitions. [2019-01-13 02:07:13,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 02:07:13,860 INFO L276 IsEmpty]: Start isEmpty. Operand 7867 states and 17884 transitions. [2019-01-13 02:07:13,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 02:07:13,869 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:07:13,869 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] [2019-01-13 02:07:13,869 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:07:13,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:07:13,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1344279218, now seen corresponding path program 1 times [2019-01-13 02:07:13,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:07:13,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:07:13,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:13,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:07:13,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:13,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:07:14,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:07:14,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:07:14,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 02:07:14,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 02:07:14,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 02:07:14,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:07:14,150 INFO L87 Difference]: Start difference. First operand 7867 states and 17884 transitions. Second operand 5 states. [2019-01-13 02:07:14,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:07:14,727 INFO L93 Difference]: Finished difference Result 7433 states and 16736 transitions. [2019-01-13 02:07:14,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 02:07:14,728 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-01-13 02:07:14,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:07:14,738 INFO L225 Difference]: With dead ends: 7433 [2019-01-13 02:07:14,738 INFO L226 Difference]: Without dead ends: 7433 [2019-01-13 02:07:14,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-13 02:07:14,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7433 states. [2019-01-13 02:07:14,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7433 to 7001. [2019-01-13 02:07:14,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7001 states. [2019-01-13 02:07:14,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7001 states to 7001 states and 15799 transitions. [2019-01-13 02:07:14,821 INFO L78 Accepts]: Start accepts. Automaton has 7001 states and 15799 transitions. Word has length 94 [2019-01-13 02:07:14,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:07:14,821 INFO L480 AbstractCegarLoop]: Abstraction has 7001 states and 15799 transitions. [2019-01-13 02:07:14,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 02:07:14,821 INFO L276 IsEmpty]: Start isEmpty. Operand 7001 states and 15799 transitions. [2019-01-13 02:07:14,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 02:07:14,832 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:07:14,832 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] [2019-01-13 02:07:14,832 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:07:14,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:07:14,833 INFO L82 PathProgramCache]: Analyzing trace with hash 895526994, now seen corresponding path program 1 times [2019-01-13 02:07:14,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:07:14,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:07:14,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:14,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:07:14,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:14,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:07:15,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:07:15,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:07:15,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-13 02:07:15,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 02:07:15,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 02:07:15,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-01-13 02:07:15,101 INFO L87 Difference]: Start difference. First operand 7001 states and 15799 transitions. Second operand 9 states. [2019-01-13 02:07:18,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:07:18,072 INFO L93 Difference]: Finished difference Result 19264 states and 43254 transitions. [2019-01-13 02:07:18,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-13 02:07:18,073 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-01-13 02:07:18,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:07:18,095 INFO L225 Difference]: With dead ends: 19264 [2019-01-13 02:07:18,096 INFO L226 Difference]: Without dead ends: 19145 [2019-01-13 02:07:18,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=354, Invalid=1206, Unknown=0, NotChecked=0, Total=1560 [2019-01-13 02:07:18,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19145 states. [2019-01-13 02:07:18,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19145 to 10407. [2019-01-13 02:07:18,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10407 states. [2019-01-13 02:07:18,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10407 states to 10407 states and 23675 transitions. [2019-01-13 02:07:18,255 INFO L78 Accepts]: Start accepts. Automaton has 10407 states and 23675 transitions. Word has length 94 [2019-01-13 02:07:18,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:07:18,256 INFO L480 AbstractCegarLoop]: Abstraction has 10407 states and 23675 transitions. [2019-01-13 02:07:18,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 02:07:18,256 INFO L276 IsEmpty]: Start isEmpty. Operand 10407 states and 23675 transitions. [2019-01-13 02:07:18,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 02:07:18,266 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:07:18,267 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] [2019-01-13 02:07:18,267 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:07:18,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:07:18,267 INFO L82 PathProgramCache]: Analyzing trace with hash 2140291475, now seen corresponding path program 1 times [2019-01-13 02:07:18,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:07:18,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:07:18,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:18,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:07:18,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:18,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:07:18,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:07:18,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:07:18,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 02:07:18,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 02:07:18,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 02:07:18,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 02:07:18,567 INFO L87 Difference]: Start difference. First operand 10407 states and 23675 transitions. Second operand 6 states. [2019-01-13 02:07:18,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:07:18,879 INFO L93 Difference]: Finished difference Result 11096 states and 24687 transitions. [2019-01-13 02:07:18,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 02:07:18,881 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-01-13 02:07:18,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:07:18,895 INFO L225 Difference]: With dead ends: 11096 [2019-01-13 02:07:18,895 INFO L226 Difference]: Without dead ends: 11056 [2019-01-13 02:07:18,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-13 02:07:18,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11056 states. [2019-01-13 02:07:18,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11056 to 9526. [2019-01-13 02:07:18,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9526 states. [2019-01-13 02:07:18,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9526 states to 9526 states and 21397 transitions. [2019-01-13 02:07:18,998 INFO L78 Accepts]: Start accepts. Automaton has 9526 states and 21397 transitions. Word has length 94 [2019-01-13 02:07:18,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:07:18,999 INFO L480 AbstractCegarLoop]: Abstraction has 9526 states and 21397 transitions. [2019-01-13 02:07:18,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 02:07:18,999 INFO L276 IsEmpty]: Start isEmpty. Operand 9526 states and 21397 transitions. [2019-01-13 02:07:19,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 02:07:19,011 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:07:19,011 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] [2019-01-13 02:07:19,011 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:07:19,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:07:19,012 INFO L82 PathProgramCache]: Analyzing trace with hash -538468846, now seen corresponding path program 1 times [2019-01-13 02:07:19,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:07:19,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:07:19,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:19,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:07:19,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:19,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:07:19,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:07:19,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:07:19,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 02:07:19,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 02:07:19,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 02:07:19,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:07:19,214 INFO L87 Difference]: Start difference. First operand 9526 states and 21397 transitions. Second operand 5 states. [2019-01-13 02:07:19,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:07:19,745 INFO L93 Difference]: Finished difference Result 11733 states and 26116 transitions. [2019-01-13 02:07:19,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 02:07:19,746 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-01-13 02:07:19,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:07:19,761 INFO L225 Difference]: With dead ends: 11733 [2019-01-13 02:07:19,761 INFO L226 Difference]: Without dead ends: 11553 [2019-01-13 02:07:19,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-13 02:07:19,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11553 states. [2019-01-13 02:07:19,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11553 to 10359. [2019-01-13 02:07:19,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10359 states. [2019-01-13 02:07:19,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10359 states to 10359 states and 23191 transitions. [2019-01-13 02:07:19,875 INFO L78 Accepts]: Start accepts. Automaton has 10359 states and 23191 transitions. Word has length 94 [2019-01-13 02:07:19,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:07:19,875 INFO L480 AbstractCegarLoop]: Abstraction has 10359 states and 23191 transitions. [2019-01-13 02:07:19,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 02:07:19,876 INFO L276 IsEmpty]: Start isEmpty. Operand 10359 states and 23191 transitions. [2019-01-13 02:07:19,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 02:07:19,886 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:07:19,886 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] [2019-01-13 02:07:19,887 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:07:19,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:07:19,887 INFO L82 PathProgramCache]: Analyzing trace with hash -713260941, now seen corresponding path program 1 times [2019-01-13 02:07:19,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:07:19,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:07:19,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:19,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:07:19,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:19,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:07:19,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:07:19,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:07:19,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 02:07:19,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 02:07:19,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 02:07:19,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:07:19,991 INFO L87 Difference]: Start difference. First operand 10359 states and 23191 transitions. Second operand 5 states. [2019-01-13 02:07:20,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:07:20,330 INFO L93 Difference]: Finished difference Result 13005 states and 28915 transitions. [2019-01-13 02:07:20,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 02:07:20,332 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-01-13 02:07:20,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:07:20,350 INFO L225 Difference]: With dead ends: 13005 [2019-01-13 02:07:20,351 INFO L226 Difference]: Without dead ends: 12872 [2019-01-13 02:07:20,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 02:07:20,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12872 states. [2019-01-13 02:07:20,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12872 to 10524. [2019-01-13 02:07:20,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10524 states. [2019-01-13 02:07:20,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10524 states to 10524 states and 23529 transitions. [2019-01-13 02:07:20,490 INFO L78 Accepts]: Start accepts. Automaton has 10524 states and 23529 transitions. Word has length 94 [2019-01-13 02:07:20,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:07:20,490 INFO L480 AbstractCegarLoop]: Abstraction has 10524 states and 23529 transitions. [2019-01-13 02:07:20,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 02:07:20,490 INFO L276 IsEmpty]: Start isEmpty. Operand 10524 states and 23529 transitions. [2019-01-13 02:07:20,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 02:07:20,502 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:07:20,502 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] [2019-01-13 02:07:20,503 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:07:20,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:07:20,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1759786015, now seen corresponding path program 1 times [2019-01-13 02:07:20,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:07:20,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:07:20,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:20,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:07:20,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:20,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:07:20,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:07:20,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:07:20,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 02:07:20,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 02:07:20,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 02:07:20,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:07:20,654 INFO L87 Difference]: Start difference. First operand 10524 states and 23529 transitions. Second operand 5 states. [2019-01-13 02:07:20,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:07:20,782 INFO L93 Difference]: Finished difference Result 8563 states and 19163 transitions. [2019-01-13 02:07:20,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 02:07:20,783 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-01-13 02:07:20,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:07:20,793 INFO L225 Difference]: With dead ends: 8563 [2019-01-13 02:07:20,793 INFO L226 Difference]: Without dead ends: 8563 [2019-01-13 02:07:20,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 02:07:20,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8563 states. [2019-01-13 02:07:20,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8563 to 6968. [2019-01-13 02:07:20,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6968 states. [2019-01-13 02:07:20,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6968 states to 6968 states and 15719 transitions. [2019-01-13 02:07:20,869 INFO L78 Accepts]: Start accepts. Automaton has 6968 states and 15719 transitions. Word has length 94 [2019-01-13 02:07:20,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:07:20,870 INFO L480 AbstractCegarLoop]: Abstraction has 6968 states and 15719 transitions. [2019-01-13 02:07:20,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 02:07:20,870 INFO L276 IsEmpty]: Start isEmpty. Operand 6968 states and 15719 transitions. [2019-01-13 02:07:20,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 02:07:20,877 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:07:20,877 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] [2019-01-13 02:07:20,878 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:07:20,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:07:20,878 INFO L82 PathProgramCache]: Analyzing trace with hash -809700384, now seen corresponding path program 2 times [2019-01-13 02:07:20,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:07:20,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:07:20,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:20,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:07:20,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:20,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:07:21,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:07:21,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:07:21,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 02:07:21,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 02:07:21,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 02:07:21,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-13 02:07:21,388 INFO L87 Difference]: Start difference. First operand 6968 states and 15719 transitions. Second operand 7 states. [2019-01-13 02:07:21,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:07:21,850 INFO L93 Difference]: Finished difference Result 8682 states and 19319 transitions. [2019-01-13 02:07:21,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 02:07:21,852 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-01-13 02:07:21,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:07:21,863 INFO L225 Difference]: With dead ends: 8682 [2019-01-13 02:07:21,863 INFO L226 Difference]: Without dead ends: 8682 [2019-01-13 02:07:21,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-01-13 02:07:21,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8682 states. [2019-01-13 02:07:21,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8682 to 7081. [2019-01-13 02:07:21,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7081 states. [2019-01-13 02:07:21,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7081 states to 7081 states and 15958 transitions. [2019-01-13 02:07:21,939 INFO L78 Accepts]: Start accepts. Automaton has 7081 states and 15958 transitions. Word has length 94 [2019-01-13 02:07:21,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:07:21,939 INFO L480 AbstractCegarLoop]: Abstraction has 7081 states and 15958 transitions. [2019-01-13 02:07:21,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 02:07:21,940 INFO L276 IsEmpty]: Start isEmpty. Operand 7081 states and 15958 transitions. [2019-01-13 02:07:21,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 02:07:21,946 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:07:21,947 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 02:07:21,947 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:07:21,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:07:21,947 INFO L82 PathProgramCache]: Analyzing trace with hash -984492479, now seen corresponding path program 2 times [2019-01-13 02:07:21,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:07:21,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:07:21,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:21,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 02:07:21,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:21,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:07:22,600 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 10 [2019-01-13 02:07:22,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:07:22,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:07:22,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 02:07:22,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 02:07:22,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 02:07:22,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 02:07:22,630 INFO L87 Difference]: Start difference. First operand 7081 states and 15958 transitions. Second operand 7 states. [2019-01-13 02:07:23,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:07:23,096 INFO L93 Difference]: Finished difference Result 9946 states and 22406 transitions. [2019-01-13 02:07:23,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 02:07:23,098 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-01-13 02:07:23,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:07:23,110 INFO L225 Difference]: With dead ends: 9946 [2019-01-13 02:07:23,111 INFO L226 Difference]: Without dead ends: 9914 [2019-01-13 02:07:23,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-01-13 02:07:23,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9914 states. [2019-01-13 02:07:23,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9914 to 8741. [2019-01-13 02:07:23,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8741 states. [2019-01-13 02:07:23,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8741 states to 8741 states and 19564 transitions. [2019-01-13 02:07:23,216 INFO L78 Accepts]: Start accepts. Automaton has 8741 states and 19564 transitions. Word has length 94 [2019-01-13 02:07:23,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:07:23,217 INFO L480 AbstractCegarLoop]: Abstraction has 8741 states and 19564 transitions. [2019-01-13 02:07:23,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 02:07:23,217 INFO L276 IsEmpty]: Start isEmpty. Operand 8741 states and 19564 transitions. [2019-01-13 02:07:23,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 02:07:23,226 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:07:23,226 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] [2019-01-13 02:07:23,227 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:07:23,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:07:23,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1513523458, now seen corresponding path program 1 times [2019-01-13 02:07:23,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:07:23,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:07:23,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:23,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 02:07:23,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:23,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:07:23,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:07:23,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:07:23,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 02:07:23,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 02:07:23,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 02:07:23,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-13 02:07:23,525 INFO L87 Difference]: Start difference. First operand 8741 states and 19564 transitions. Second operand 8 states. [2019-01-13 02:07:24,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:07:24,014 INFO L93 Difference]: Finished difference Result 13745 states and 31428 transitions. [2019-01-13 02:07:24,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 02:07:24,015 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2019-01-13 02:07:24,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:07:24,031 INFO L225 Difference]: With dead ends: 13745 [2019-01-13 02:07:24,031 INFO L226 Difference]: Without dead ends: 13745 [2019-01-13 02:07:24,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-01-13 02:07:24,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13745 states. [2019-01-13 02:07:24,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13745 to 9372. [2019-01-13 02:07:24,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9372 states. [2019-01-13 02:07:24,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9372 states to 9372 states and 21224 transitions. [2019-01-13 02:07:24,157 INFO L78 Accepts]: Start accepts. Automaton has 9372 states and 21224 transitions. Word has length 94 [2019-01-13 02:07:24,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:07:24,157 INFO L480 AbstractCegarLoop]: Abstraction has 9372 states and 21224 transitions. [2019-01-13 02:07:24,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 02:07:24,157 INFO L276 IsEmpty]: Start isEmpty. Operand 9372 states and 21224 transitions. [2019-01-13 02:07:24,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 02:07:24,168 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:07:24,169 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] [2019-01-13 02:07:24,169 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:07:24,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:07:24,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1893940157, now seen corresponding path program 1 times [2019-01-13 02:07:24,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:07:24,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:07:24,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:24,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:07:24,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:24,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:07:24,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:07:24,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:07:24,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 02:07:24,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 02:07:24,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 02:07:24,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-13 02:07:24,826 INFO L87 Difference]: Start difference. First operand 9372 states and 21224 transitions. Second operand 7 states. [2019-01-13 02:07:25,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:07:25,067 INFO L93 Difference]: Finished difference Result 12354 states and 28392 transitions. [2019-01-13 02:07:25,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 02:07:25,068 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-01-13 02:07:25,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:07:25,081 INFO L225 Difference]: With dead ends: 12354 [2019-01-13 02:07:25,081 INFO L226 Difference]: Without dead ends: 12354 [2019-01-13 02:07:25,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-01-13 02:07:25,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12354 states. [2019-01-13 02:07:25,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12354 to 9024. [2019-01-13 02:07:25,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9024 states. [2019-01-13 02:07:25,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9024 states to 9024 states and 20322 transitions. [2019-01-13 02:07:25,185 INFO L78 Accepts]: Start accepts. Automaton has 9024 states and 20322 transitions. Word has length 94 [2019-01-13 02:07:25,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:07:25,185 INFO L480 AbstractCegarLoop]: Abstraction has 9024 states and 20322 transitions. [2019-01-13 02:07:25,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 02:07:25,185 INFO L276 IsEmpty]: Start isEmpty. Operand 9024 states and 20322 transitions. [2019-01-13 02:07:25,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 02:07:25,194 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:07:25,194 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 02:07:25,194 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:07:25,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:07:25,195 INFO L82 PathProgramCache]: Analyzing trace with hash 669051587, now seen corresponding path program 1 times [2019-01-13 02:07:25,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:07:25,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:07:25,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:25,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:07:25,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:25,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:07:25,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:07:25,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:07:25,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 02:07:25,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 02:07:25,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 02:07:25,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 02:07:25,412 INFO L87 Difference]: Start difference. First operand 9024 states and 20322 transitions. Second operand 6 states. [2019-01-13 02:07:25,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:07:25,557 INFO L93 Difference]: Finished difference Result 8544 states and 18834 transitions. [2019-01-13 02:07:25,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 02:07:25,558 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-01-13 02:07:25,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:07:25,569 INFO L225 Difference]: With dead ends: 8544 [2019-01-13 02:07:25,569 INFO L226 Difference]: Without dead ends: 8544 [2019-01-13 02:07:25,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-13 02:07:25,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8544 states. [2019-01-13 02:07:25,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8544 to 5376. [2019-01-13 02:07:25,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5376 states. [2019-01-13 02:07:25,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5376 states to 5376 states and 11789 transitions. [2019-01-13 02:07:25,642 INFO L78 Accepts]: Start accepts. Automaton has 5376 states and 11789 transitions. Word has length 94 [2019-01-13 02:07:25,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:07:25,643 INFO L480 AbstractCegarLoop]: Abstraction has 5376 states and 11789 transitions. [2019-01-13 02:07:25,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 02:07:25,643 INFO L276 IsEmpty]: Start isEmpty. Operand 5376 states and 11789 transitions. [2019-01-13 02:07:25,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-13 02:07:25,649 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:07:25,649 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] [2019-01-13 02:07:25,649 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:07:25,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:07:25,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1206757213, now seen corresponding path program 1 times [2019-01-13 02:07:25,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:07:25,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:07:25,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:25,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:07:25,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:25,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:07:25,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:07:25,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:07:25,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 02:07:25,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 02:07:25,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 02:07:25,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-13 02:07:25,768 INFO L87 Difference]: Start difference. First operand 5376 states and 11789 transitions. Second operand 7 states. [2019-01-13 02:07:26,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:07:26,215 INFO L93 Difference]: Finished difference Result 6566 states and 14255 transitions. [2019-01-13 02:07:26,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 02:07:26,216 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-01-13 02:07:26,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:07:26,224 INFO L225 Difference]: With dead ends: 6566 [2019-01-13 02:07:26,224 INFO L226 Difference]: Without dead ends: 6566 [2019-01-13 02:07:26,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-01-13 02:07:26,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6566 states. [2019-01-13 02:07:26,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6566 to 5425. [2019-01-13 02:07:26,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5425 states. [2019-01-13 02:07:26,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5425 states to 5425 states and 11892 transitions. [2019-01-13 02:07:26,279 INFO L78 Accepts]: Start accepts. Automaton has 5425 states and 11892 transitions. Word has length 96 [2019-01-13 02:07:26,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:07:26,280 INFO L480 AbstractCegarLoop]: Abstraction has 5425 states and 11892 transitions. [2019-01-13 02:07:26,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 02:07:26,280 INFO L276 IsEmpty]: Start isEmpty. Operand 5425 states and 11892 transitions. [2019-01-13 02:07:26,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-13 02:07:26,285 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:07:26,286 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] [2019-01-13 02:07:26,286 INFO L423 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:07:26,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:07:26,286 INFO L82 PathProgramCache]: Analyzing trace with hash -811380418, now seen corresponding path program 1 times [2019-01-13 02:07:26,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:07:26,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:07:26,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:26,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:07:26,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:26,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:07:26,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:07:26,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:07:26,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 02:07:26,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 02:07:26,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 02:07:26,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-13 02:07:26,446 INFO L87 Difference]: Start difference. First operand 5425 states and 11892 transitions. Second operand 8 states. [2019-01-13 02:07:26,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:07:26,869 INFO L93 Difference]: Finished difference Result 6503 states and 14168 transitions. [2019-01-13 02:07:26,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-13 02:07:26,870 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2019-01-13 02:07:26,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:07:26,878 INFO L225 Difference]: With dead ends: 6503 [2019-01-13 02:07:26,879 INFO L226 Difference]: Without dead ends: 6503 [2019-01-13 02:07:26,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-01-13 02:07:26,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6503 states. [2019-01-13 02:07:26,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6503 to 6413. [2019-01-13 02:07:26,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6413 states. [2019-01-13 02:07:26,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6413 states to 6413 states and 13982 transitions. [2019-01-13 02:07:26,940 INFO L78 Accepts]: Start accepts. Automaton has 6413 states and 13982 transitions. Word has length 96 [2019-01-13 02:07:26,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:07:26,940 INFO L480 AbstractCegarLoop]: Abstraction has 6413 states and 13982 transitions. [2019-01-13 02:07:26,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 02:07:26,940 INFO L276 IsEmpty]: Start isEmpty. Operand 6413 states and 13982 transitions. [2019-01-13 02:07:26,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-13 02:07:26,948 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:07:26,948 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] [2019-01-13 02:07:26,948 INFO L423 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:07:26,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:07:26,949 INFO L82 PathProgramCache]: Analyzing trace with hash 76123263, now seen corresponding path program 1 times [2019-01-13 02:07:26,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:07:26,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:07:26,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:26,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:07:26,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:26,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:07:27,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:07:27,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:07:27,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-13 02:07:27,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-13 02:07:27,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-13 02:07:27,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-01-13 02:07:27,153 INFO L87 Difference]: Start difference. First operand 6413 states and 13982 transitions. Second operand 11 states. [2019-01-13 02:07:28,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:07:28,843 INFO L93 Difference]: Finished difference Result 11999 states and 26363 transitions. [2019-01-13 02:07:28,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-13 02:07:28,844 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2019-01-13 02:07:28,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:07:28,855 INFO L225 Difference]: With dead ends: 11999 [2019-01-13 02:07:28,855 INFO L226 Difference]: Without dead ends: 7711 [2019-01-13 02:07:28,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2019-01-13 02:07:28,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7711 states. [2019-01-13 02:07:28,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7711 to 5796. [2019-01-13 02:07:28,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5796 states. [2019-01-13 02:07:28,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5796 states to 5796 states and 12625 transitions. [2019-01-13 02:07:28,924 INFO L78 Accepts]: Start accepts. Automaton has 5796 states and 12625 transitions. Word has length 96 [2019-01-13 02:07:28,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:07:28,924 INFO L480 AbstractCegarLoop]: Abstraction has 5796 states and 12625 transitions. [2019-01-13 02:07:28,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-13 02:07:28,924 INFO L276 IsEmpty]: Start isEmpty. Operand 5796 states and 12625 transitions. [2019-01-13 02:07:28,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-13 02:07:28,931 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:07:28,931 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] [2019-01-13 02:07:28,931 INFO L423 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:07:28,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:07:28,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1590223112, now seen corresponding path program 1 times [2019-01-13 02:07:28,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:07:28,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:07:28,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:28,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:07:28,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:28,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:07:29,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:07:29,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:07:29,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 02:07:29,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 02:07:29,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 02:07:29,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 02:07:29,488 INFO L87 Difference]: Start difference. First operand 5796 states and 12625 transitions. Second operand 6 states. [2019-01-13 02:07:30,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:07:30,099 INFO L93 Difference]: Finished difference Result 6573 states and 14340 transitions. [2019-01-13 02:07:30,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 02:07:30,101 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-01-13 02:07:30,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:07:30,110 INFO L225 Difference]: With dead ends: 6573 [2019-01-13 02:07:30,110 INFO L226 Difference]: Without dead ends: 6573 [2019-01-13 02:07:30,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-13 02:07:30,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6573 states. [2019-01-13 02:07:30,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6573 to 5979. [2019-01-13 02:07:30,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5979 states. [2019-01-13 02:07:30,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5979 states to 5979 states and 13022 transitions. [2019-01-13 02:07:30,176 INFO L78 Accepts]: Start accepts. Automaton has 5979 states and 13022 transitions. Word has length 96 [2019-01-13 02:07:30,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:07:30,177 INFO L480 AbstractCegarLoop]: Abstraction has 5979 states and 13022 transitions. [2019-01-13 02:07:30,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 02:07:30,177 INFO L276 IsEmpty]: Start isEmpty. Operand 5979 states and 13022 transitions. [2019-01-13 02:07:30,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-13 02:07:30,184 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:07:30,184 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] [2019-01-13 02:07:30,184 INFO L423 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:07:30,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:07:30,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1130643175, now seen corresponding path program 2 times [2019-01-13 02:07:30,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:07:30,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:07:30,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:30,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:07:30,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:30,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 02:07:30,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 02:07:30,273 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 02:07:30,477 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-13 02:07:30,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 02:07:30 BasicIcfg [2019-01-13 02:07:30,480 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 02:07:30,482 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 02:07:30,483 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 02:07:30,483 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 02:07:30,483 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 02:06:24" (3/4) ... [2019-01-13 02:07:30,489 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-13 02:07:30,714 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 02:07:30,714 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 02:07:30,716 INFO L168 Benchmark]: Toolchain (without parser) took 68319.74 ms. Allocated memory was 1.0 GB in the beginning and 5.1 GB in the end (delta: 4.1 GB). Free memory was 952.7 MB in the beginning and 4.1 GB in the end (delta: -3.1 GB). Peak memory consumption was 985.6 MB. Max. memory is 11.5 GB. [2019-01-13 02:07:30,716 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 02:07:30,716 INFO L168 Benchmark]: CACSL2BoogieTranslator took 841.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -162.1 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. [2019-01-13 02:07:30,721 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-13 02:07:30,721 INFO L168 Benchmark]: Boogie Preprocessor took 90.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 02:07:30,721 INFO L168 Benchmark]: RCFGBuilder took 1225.92 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: 45.9 MB). Peak memory consumption was 45.9 MB. Max. memory is 11.5 GB. [2019-01-13 02:07:30,723 INFO L168 Benchmark]: TraceAbstraction took 65842.95 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 4.0 GB). Free memory was 1.1 GB in the beginning and 4.1 GB in the end (delta: -3.1 GB). Peak memory consumption was 888.1 MB. Max. memory is 11.5 GB. [2019-01-13 02:07:30,723 INFO L168 Benchmark]: Witness Printer took 232.11 ms. Allocated memory is still 5.1 GB. Free memory was 4.1 GB in the beginning and 4.1 GB in the end (delta: 59.6 MB). Peak memory consumption was 59.6 MB. Max. memory is 11.5 GB. [2019-01-13 02:07:30,729 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 841.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -162.1 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 78.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 90.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1225.92 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: 45.9 MB). Peak memory consumption was 45.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 65842.95 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 4.0 GB). Free memory was 1.1 GB in the beginning and 4.1 GB in the end (delta: -3.1 GB). Peak memory consumption was 888.1 MB. Max. memory is 11.5 GB. * Witness Printer took 232.11 ms. Allocated memory is still 5.1 GB. Free memory was 4.1 GB in the beginning and 4.1 GB in the end (delta: 59.6 MB). Peak memory consumption was 59.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L681] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L683] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L684] -1 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L685] -1 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L686] -1 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L687] -1 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L688] -1 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L689] -1 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0] [L690] -1 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L691] -1 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L692] -1 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0] [L693] -1 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L694] -1 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L695] -1 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L696] -1 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L697] -1 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L698] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L699] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L778] -1 pthread_t t1091; VAL [__unbuffered_cnt=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L779] FCALL, FORK -1 pthread_create(&t1091, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L703] 0 z$w_buff1 = z$w_buff0 [L704] 0 z$w_buff0 = 1 [L705] 0 z$w_buff1_used = z$w_buff0_used [L706] 0 z$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L708] 0 z$r_buff1_thd0 = z$r_buff0_thd0 [L709] 0 z$r_buff1_thd1 = z$r_buff0_thd1 [L710] 0 z$r_buff1_thd2 = z$r_buff0_thd2 [L711] 0 z$r_buff0_thd1 = (_Bool)1 [L714] 0 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L717] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] -1 pthread_t t1092; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] FCALL, FORK -1 pthread_create(&t1092, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 x = 2 [L734] 1 y = 1 [L737] 1 __unbuffered_p1_EAX = y [L740] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L741] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L742] 1 z$flush_delayed = weak$$choice2 [L743] 1 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L745] EXPR 1 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L745] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L746] EXPR 1 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L747] EXPR 1 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L747] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L748] EXPR 1 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L749] EXPR 1 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L750] EXPR 1 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L751] 1 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] EXPR 1 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L717] 0 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L752] 1 z = z$flush_delayed ? z$mem_tmp : z [L753] 1 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] EXPR 1 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L756] 1 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L718] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L718] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L719] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L719] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L720] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L720] 0 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L721] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L721] 0 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L724] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L783] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR -1 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] -1 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L788] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L788] -1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L789] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L789] -1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L790] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L790] -1 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L791] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L791] -1 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L794] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 223 locations, 3 error locations. UNSAFE Result, 65.5s OverallTime, 40 OverallIterations, 1 TraceHistogramMax, 29.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10776 SDtfs, 12537 SDslu, 24914 SDs, 0 SdLazy, 11649 SolverSat, 763 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 413 GetRequests, 103 SyntacticMatches, 34 SemanticMatches, 276 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 9.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74881occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 22.6s AutomataMinimizationTime, 39 MinimizatonAttempts, 156834 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 2999 NumberOfCodeBlocks, 2999 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 2864 ConstructedInterpolants, 0 QuantifiedInterpolants, 650140 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 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...