./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix054_pso.opt_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/mix054_pso.opt_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 98be72c950df5c9f21ba93d5244e9546239a88fe ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 03:12:32,688 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 03:12:32,691 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 03:12:32,705 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 03:12:32,705 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 03:12:32,707 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 03:12:32,708 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 03:12:32,710 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 03:12:32,711 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 03:12:32,712 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 03:12:32,713 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 03:12:32,713 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 03:12:32,714 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 03:12:32,715 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 03:12:32,716 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 03:12:32,717 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 03:12:32,718 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 03:12:32,720 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 03:12:32,722 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 03:12:32,724 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 03:12:32,725 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 03:12:32,726 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 03:12:32,732 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 03:12:32,733 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 03:12:32,733 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 03:12:32,736 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 03:12:32,737 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 03:12:32,737 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 03:12:32,741 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 03:12:32,743 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 03:12:32,744 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 03:12:32,744 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 03:12:32,744 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 03:12:32,746 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 03:12:32,747 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 03:12:32,747 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 03:12:32,749 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-13 03:12:32,780 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 03:12:32,784 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 03:12:32,785 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 03:12:32,785 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 03:12:32,785 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 03:12:32,787 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 03:12:32,787 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 03:12:32,787 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 03:12:32,788 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 03:12:32,788 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 03:12:32,788 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-13 03:12:32,788 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 03:12:32,788 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-13 03:12:32,788 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 03:12:32,789 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-13 03:12:32,790 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 03:12:32,790 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-13 03:12:32,790 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 03:12:32,791 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 03:12:32,791 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 03:12:32,791 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 03:12:32,791 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 03:12:32,791 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 03:12:32,791 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 03:12:32,793 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-13 03:12:32,793 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 03:12:32,793 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 03:12:32,793 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-13 03:12:32,793 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 -> 98be72c950df5c9f21ba93d5244e9546239a88fe [2019-01-13 03:12:32,831 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 03:12:32,844 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 03:12:32,848 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 03:12:32,849 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 03:12:32,849 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 03:12:32,851 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix054_pso.opt_false-unreach-call.i [2019-01-13 03:12:32,910 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63866c3af/437f7bb4de4b49ecaca9a0d8a548dc4c/FLAG382897782 [2019-01-13 03:12:33,468 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 03:12:33,469 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix054_pso.opt_false-unreach-call.i [2019-01-13 03:12:33,492 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63866c3af/437f7bb4de4b49ecaca9a0d8a548dc4c/FLAG382897782 [2019-01-13 03:12:33,717 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63866c3af/437f7bb4de4b49ecaca9a0d8a548dc4c [2019-01-13 03:12:33,721 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 03:12:33,722 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-13 03:12:33,723 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 03:12:33,723 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 03:12:33,727 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 03:12:33,728 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 03:12:33" (1/1) ... [2019-01-13 03:12:33,730 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d5b287e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:12:33, skipping insertion in model container [2019-01-13 03:12:33,731 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 03:12:33" (1/1) ... [2019-01-13 03:12:33,738 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 03:12:33,797 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 03:12:34,173 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 03:12:34,186 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 03:12:34,404 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 03:12:34,488 INFO L195 MainTranslator]: Completed translation [2019-01-13 03:12:34,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:12:34 WrapperNode [2019-01-13 03:12:34,488 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 03:12:34,490 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-13 03:12:34,490 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-13 03:12:34,490 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-13 03:12:34,500 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:12:34" (1/1) ... [2019-01-13 03:12:34,519 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:12:34" (1/1) ... [2019-01-13 03:12:34,565 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-13 03:12:34,565 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 03:12:34,565 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 03:12:34,565 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 03:12:34,576 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:12:34" (1/1) ... [2019-01-13 03:12:34,576 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:12:34" (1/1) ... [2019-01-13 03:12:34,581 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:12:34" (1/1) ... [2019-01-13 03:12:34,581 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:12:34" (1/1) ... [2019-01-13 03:12:34,592 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:12:34" (1/1) ... [2019-01-13 03:12:34,595 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:12:34" (1/1) ... [2019-01-13 03:12:34,600 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:12:34" (1/1) ... [2019-01-13 03:12:34,604 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 03:12:34,605 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 03:12:34,605 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 03:12:34,605 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 03:12:34,606 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:12:34" (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 03:12:34,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 03:12:34,663 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-13 03:12:34,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 03:12:34,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 03:12:34,663 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-13 03:12:34,663 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-13 03:12:34,663 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-13 03:12:34,664 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-13 03:12:34,664 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-13 03:12:34,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 03:12:34,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 03:12:34,666 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 03:12:35,756 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 03:12:35,757 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-13 03:12:35,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 03:12:35 BoogieIcfgContainer [2019-01-13 03:12:35,758 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 03:12:35,759 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 03:12:35,759 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 03:12:35,763 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 03:12:35,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 03:12:33" (1/3) ... [2019-01-13 03:12:35,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57e19f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 03:12:35, skipping insertion in model container [2019-01-13 03:12:35,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:12:34" (2/3) ... [2019-01-13 03:12:35,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57e19f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 03:12:35, skipping insertion in model container [2019-01-13 03:12:35,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 03:12:35" (3/3) ... [2019-01-13 03:12:35,766 INFO L112 eAbstractionObserver]: Analyzing ICFG mix054_pso.opt_false-unreach-call.i [2019-01-13 03:12:35,808 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,809 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,809 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,809 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,810 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,810 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,810 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,811 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,811 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,811 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,811 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,812 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,812 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,812 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,812 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,813 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,813 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,813 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,813 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,814 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,814 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,814 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,814 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,815 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,815 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,815 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,815 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,816 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,816 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,816 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,816 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,816 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,817 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,817 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,818 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,818 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,818 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,818 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,818 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,819 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,819 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,819 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,819 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,820 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,820 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,820 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,820 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,821 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,821 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,821 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,821 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,822 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,822 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,822 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,822 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,822 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,823 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,823 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,823 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,823 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,824 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,824 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,824 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,824 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,824 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,825 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,825 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,825 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,825 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,825 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,826 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,826 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:12:35,847 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-13 03:12:35,848 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 03:12:35,855 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-13 03:12:35,871 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-13 03:12:35,895 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 03:12:35,896 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 03:12:35,896 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-13 03:12:35,896 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 03:12:35,896 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 03:12:35,897 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 03:12:35,897 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 03:12:35,897 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 03:12:35,897 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 03:12:35,910 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 141places, 179 transitions [2019-01-13 03:12:37,710 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25087 states. [2019-01-13 03:12:37,712 INFO L276 IsEmpty]: Start isEmpty. Operand 25087 states. [2019-01-13 03:12:37,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-13 03:12:37,723 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:12:37,724 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] [2019-01-13 03:12:37,726 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:12:37,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:12:37,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1104590460, now seen corresponding path program 1 times [2019-01-13 03:12:37,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:12:37,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:12:37,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:12:37,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:12:37,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:12:37,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:12:38,180 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 03:12:38,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:12:38,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:12:38,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:12:38,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:12:38,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:12:38,208 INFO L87 Difference]: Start difference. First operand 25087 states. Second operand 4 states. [2019-01-13 03:12:39,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:12:39,430 INFO L93 Difference]: Finished difference Result 45387 states and 177625 transitions. [2019-01-13 03:12:39,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 03:12:39,434 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-01-13 03:12:39,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:12:39,827 INFO L225 Difference]: With dead ends: 45387 [2019-01-13 03:12:39,828 INFO L226 Difference]: Without dead ends: 40627 [2019-01-13 03:12:39,830 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 03:12:40,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40627 states. [2019-01-13 03:12:41,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40627 to 23661. [2019-01-13 03:12:41,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23661 states. [2019-01-13 03:12:41,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23661 states to 23661 states and 92542 transitions. [2019-01-13 03:12:41,718 INFO L78 Accepts]: Start accepts. Automaton has 23661 states and 92542 transitions. Word has length 36 [2019-01-13 03:12:41,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:12:41,721 INFO L480 AbstractCegarLoop]: Abstraction has 23661 states and 92542 transitions. [2019-01-13 03:12:41,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:12:41,722 INFO L276 IsEmpty]: Start isEmpty. Operand 23661 states and 92542 transitions. [2019-01-13 03:12:41,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-13 03:12:41,739 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:12:41,739 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] [2019-01-13 03:12:41,740 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:12:41,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:12:41,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1826409231, now seen corresponding path program 1 times [2019-01-13 03:12:41,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:12:41,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:12:41,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:12:41,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:12:41,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:12:41,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:12:41,935 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 03:12:41,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:12:41,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:12:41,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:12:41,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:12:41,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:12:41,939 INFO L87 Difference]: Start difference. First operand 23661 states and 92542 transitions. Second operand 5 states. [2019-01-13 03:12:45,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:12:45,078 INFO L93 Difference]: Finished difference Result 64829 states and 241368 transitions. [2019-01-13 03:12:45,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:12:45,078 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-01-13 03:12:45,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:12:45,413 INFO L225 Difference]: With dead ends: 64829 [2019-01-13 03:12:45,414 INFO L226 Difference]: Without dead ends: 64669 [2019-01-13 03:12:45,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:12:45,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64669 states. [2019-01-13 03:12:47,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64669 to 37141. [2019-01-13 03:12:47,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37141 states. [2019-01-13 03:12:47,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37141 states to 37141 states and 138283 transitions. [2019-01-13 03:12:47,352 INFO L78 Accepts]: Start accepts. Automaton has 37141 states and 138283 transitions. Word has length 43 [2019-01-13 03:12:47,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:12:47,353 INFO L480 AbstractCegarLoop]: Abstraction has 37141 states and 138283 transitions. [2019-01-13 03:12:47,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:12:47,353 INFO L276 IsEmpty]: Start isEmpty. Operand 37141 states and 138283 transitions. [2019-01-13 03:12:47,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-13 03:12:47,368 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:12:47,368 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] [2019-01-13 03:12:47,369 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:12:47,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:12:47,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1003362560, now seen corresponding path program 1 times [2019-01-13 03:12:47,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:12:47,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:12:47,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:12:47,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:12:47,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:12:47,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:12:47,546 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 03:12:47,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:12:47,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:12:47,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:12:47,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:12:47,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:12:47,548 INFO L87 Difference]: Start difference. First operand 37141 states and 138283 transitions. Second operand 4 states. [2019-01-13 03:12:47,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:12:47,630 INFO L93 Difference]: Finished difference Result 12363 states and 41176 transitions. [2019-01-13 03:12:47,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 03:12:47,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-01-13 03:12:47,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:12:47,673 INFO L225 Difference]: With dead ends: 12363 [2019-01-13 03:12:47,674 INFO L226 Difference]: Without dead ends: 11842 [2019-01-13 03:12:47,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 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 03:12:47,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11842 states. [2019-01-13 03:12:47,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11842 to 11842. [2019-01-13 03:12:47,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11842 states. [2019-01-13 03:12:48,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11842 states to 11842 states and 39621 transitions. [2019-01-13 03:12:48,006 INFO L78 Accepts]: Start accepts. Automaton has 11842 states and 39621 transitions. Word has length 44 [2019-01-13 03:12:48,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:12:48,007 INFO L480 AbstractCegarLoop]: Abstraction has 11842 states and 39621 transitions. [2019-01-13 03:12:48,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:12:48,007 INFO L276 IsEmpty]: Start isEmpty. Operand 11842 states and 39621 transitions. [2019-01-13 03:12:48,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-13 03:12:48,017 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:12:48,017 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] [2019-01-13 03:12:48,018 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:12:48,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:12:48,018 INFO L82 PathProgramCache]: Analyzing trace with hash 77217480, now seen corresponding path program 1 times [2019-01-13 03:12:48,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:12:48,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:12:48,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:12:48,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:12:48,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:12:48,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:12:48,190 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 03:12:48,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:12:48,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:12:48,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:12:48,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:12:48,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:12:48,192 INFO L87 Difference]: Start difference. First operand 11842 states and 39621 transitions. Second operand 4 states. [2019-01-13 03:12:48,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:12:48,712 INFO L93 Difference]: Finished difference Result 17018 states and 55692 transitions. [2019-01-13 03:12:48,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 03:12:48,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-01-13 03:12:48,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:12:48,754 INFO L225 Difference]: With dead ends: 17018 [2019-01-13 03:12:48,754 INFO L226 Difference]: Without dead ends: 17018 [2019-01-13 03:12:48,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:12:48,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17018 states. [2019-01-13 03:12:49,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17018 to 12878. [2019-01-13 03:12:49,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12878 states. [2019-01-13 03:12:49,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12878 states to 12878 states and 42719 transitions. [2019-01-13 03:12:49,098 INFO L78 Accepts]: Start accepts. Automaton has 12878 states and 42719 transitions. Word has length 57 [2019-01-13 03:12:49,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:12:49,099 INFO L480 AbstractCegarLoop]: Abstraction has 12878 states and 42719 transitions. [2019-01-13 03:12:49,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:12:49,099 INFO L276 IsEmpty]: Start isEmpty. Operand 12878 states and 42719 transitions. [2019-01-13 03:12:49,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-13 03:12:49,107 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:12:49,107 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] [2019-01-13 03:12:49,107 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:12:49,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:12:49,108 INFO L82 PathProgramCache]: Analyzing trace with hash -257181528, now seen corresponding path program 1 times [2019-01-13 03:12:49,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:12:49,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:12:49,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:12:49,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:12:49,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:12:49,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:12:49,215 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 03:12:49,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:12:49,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:12:49,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:12:49,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:12:49,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:12:49,217 INFO L87 Difference]: Start difference. First operand 12878 states and 42719 transitions. Second operand 4 states. [2019-01-13 03:12:50,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:12:50,605 INFO L93 Difference]: Finished difference Result 18385 states and 59996 transitions. [2019-01-13 03:12:50,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 03:12:50,606 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-01-13 03:12:50,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:12:50,645 INFO L225 Difference]: With dead ends: 18385 [2019-01-13 03:12:50,645 INFO L226 Difference]: Without dead ends: 18385 [2019-01-13 03:12:50,646 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 03:12:50,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18385 states. [2019-01-13 03:12:50,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18385 to 16342. [2019-01-13 03:12:50,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16342 states. [2019-01-13 03:12:50,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16342 states to 16342 states and 53813 transitions. [2019-01-13 03:12:50,998 INFO L78 Accepts]: Start accepts. Automaton has 16342 states and 53813 transitions. Word has length 57 [2019-01-13 03:12:50,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:12:50,998 INFO L480 AbstractCegarLoop]: Abstraction has 16342 states and 53813 transitions. [2019-01-13 03:12:50,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:12:50,999 INFO L276 IsEmpty]: Start isEmpty. Operand 16342 states and 53813 transitions. [2019-01-13 03:12:51,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-13 03:12:51,006 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:12:51,007 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] [2019-01-13 03:12:51,007 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:12:51,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:12:51,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1101653399, now seen corresponding path program 1 times [2019-01-13 03:12:51,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:12:51,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:12:51,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:12:51,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:12:51,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:12:51,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:12:51,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 03:12:51,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:12:51,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:12:51,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:12:51,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:12:51,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:12:51,199 INFO L87 Difference]: Start difference. First operand 16342 states and 53813 transitions. Second operand 6 states. [2019-01-13 03:12:51,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:12:51,800 INFO L93 Difference]: Finished difference Result 17850 states and 57964 transitions. [2019-01-13 03:12:51,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:12:51,801 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-01-13 03:12:51,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:12:51,835 INFO L225 Difference]: With dead ends: 17850 [2019-01-13 03:12:51,835 INFO L226 Difference]: Without dead ends: 17850 [2019-01-13 03:12:51,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:12:51,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17850 states. [2019-01-13 03:12:52,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17850 to 16896. [2019-01-13 03:12:52,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16896 states. [2019-01-13 03:12:52,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16896 states to 16896 states and 55322 transitions. [2019-01-13 03:12:52,141 INFO L78 Accepts]: Start accepts. Automaton has 16896 states and 55322 transitions. Word has length 57 [2019-01-13 03:12:52,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:12:52,142 INFO L480 AbstractCegarLoop]: Abstraction has 16896 states and 55322 transitions. [2019-01-13 03:12:52,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:12:52,142 INFO L276 IsEmpty]: Start isEmpty. Operand 16896 states and 55322 transitions. [2019-01-13 03:12:52,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-13 03:12:52,152 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:12:52,152 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] [2019-01-13 03:12:52,153 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:12:52,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:12:52,153 INFO L82 PathProgramCache]: Analyzing trace with hash 405898410, now seen corresponding path program 1 times [2019-01-13 03:12:52,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:12:52,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:12:52,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:12:52,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:12:52,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:12:52,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:12:52,423 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 03:12:52,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:12:52,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:12:52,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:12:52,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:12:52,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:12:52,424 INFO L87 Difference]: Start difference. First operand 16896 states and 55322 transitions. Second operand 6 states. [2019-01-13 03:12:53,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:12:53,270 INFO L93 Difference]: Finished difference Result 23468 states and 75907 transitions. [2019-01-13 03:12:53,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 03:12:53,270 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-01-13 03:12:53,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:12:53,316 INFO L225 Difference]: With dead ends: 23468 [2019-01-13 03:12:53,316 INFO L226 Difference]: Without dead ends: 23436 [2019-01-13 03:12:53,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-01-13 03:12:53,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23436 states. [2019-01-13 03:12:53,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23436 to 18800. [2019-01-13 03:12:53,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18800 states. [2019-01-13 03:12:53,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18800 states to 18800 states and 61266 transitions. [2019-01-13 03:12:53,955 INFO L78 Accepts]: Start accepts. Automaton has 18800 states and 61266 transitions. Word has length 57 [2019-01-13 03:12:53,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:12:53,955 INFO L480 AbstractCegarLoop]: Abstraction has 18800 states and 61266 transitions. [2019-01-13 03:12:53,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:12:53,956 INFO L276 IsEmpty]: Start isEmpty. Operand 18800 states and 61266 transitions. [2019-01-13 03:12:53,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-13 03:12:53,981 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:12:53,981 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:12:53,982 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:12:53,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:12:53,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1755157955, now seen corresponding path program 1 times [2019-01-13 03:12:53,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:12:53,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:12:53,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:12:53,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:12:53,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:12:53,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:12:54,218 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 03:12:54,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:12:54,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:12:54,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:12:54,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:12:54,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:12:54,219 INFO L87 Difference]: Start difference. First operand 18800 states and 61266 transitions. Second operand 4 states. [2019-01-13 03:12:54,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:12:54,824 INFO L93 Difference]: Finished difference Result 29980 states and 96079 transitions. [2019-01-13 03:12:54,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 03:12:54,825 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-01-13 03:12:54,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:12:54,873 INFO L225 Difference]: With dead ends: 29980 [2019-01-13 03:12:54,873 INFO L226 Difference]: Without dead ends: 29784 [2019-01-13 03:12:54,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 03:12:54,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29784 states. [2019-01-13 03:12:55,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29784 to 25432. [2019-01-13 03:12:55,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25432 states. [2019-01-13 03:12:55,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25432 states to 25432 states and 82412 transitions. [2019-01-13 03:12:55,257 INFO L78 Accepts]: Start accepts. Automaton has 25432 states and 82412 transitions. Word has length 71 [2019-01-13 03:12:55,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:12:55,258 INFO L480 AbstractCegarLoop]: Abstraction has 25432 states and 82412 transitions. [2019-01-13 03:12:55,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:12:55,258 INFO L276 IsEmpty]: Start isEmpty. Operand 25432 states and 82412 transitions. [2019-01-13 03:12:55,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-13 03:12:55,282 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:12:55,283 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] [2019-01-13 03:12:55,283 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:12:55,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:12:55,283 INFO L82 PathProgramCache]: Analyzing trace with hash -401848258, now seen corresponding path program 1 times [2019-01-13 03:12:55,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:12:55,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:12:55,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:12:55,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:12:55,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:12:55,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:12:55,473 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 03:12:55,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:12:55,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 03:12:55,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 03:12:55,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 03:12:55,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:12:55,475 INFO L87 Difference]: Start difference. First operand 25432 states and 82412 transitions. Second operand 8 states. [2019-01-13 03:12:56,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:12:56,840 INFO L93 Difference]: Finished difference Result 33032 states and 105236 transitions. [2019-01-13 03:12:56,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-13 03:12:56,841 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 71 [2019-01-13 03:12:56,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:12:56,893 INFO L225 Difference]: With dead ends: 33032 [2019-01-13 03:12:56,894 INFO L226 Difference]: Without dead ends: 32968 [2019-01-13 03:12:56,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2019-01-13 03:12:56,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32968 states. [2019-01-13 03:12:57,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32968 to 27524. [2019-01-13 03:12:57,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27524 states. [2019-01-13 03:12:57,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27524 states to 27524 states and 88817 transitions. [2019-01-13 03:12:57,373 INFO L78 Accepts]: Start accepts. Automaton has 27524 states and 88817 transitions. Word has length 71 [2019-01-13 03:12:57,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:12:57,374 INFO L480 AbstractCegarLoop]: Abstraction has 27524 states and 88817 transitions. [2019-01-13 03:12:57,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 03:12:57,374 INFO L276 IsEmpty]: Start isEmpty. Operand 27524 states and 88817 transitions. [2019-01-13 03:12:57,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-13 03:12:57,404 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:12:57,404 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 03:12:57,405 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:12:57,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:12:57,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1556249552, now seen corresponding path program 1 times [2019-01-13 03:12:57,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:12:57,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:12:57,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:12:57,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:12:57,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:12:57,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:12:57,504 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 03:12:57,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:12:57,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 03:12:57,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 03:12:57,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 03:12:57,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 03:12:57,505 INFO L87 Difference]: Start difference. First operand 27524 states and 88817 transitions. Second operand 3 states. [2019-01-13 03:12:57,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:12:57,784 INFO L93 Difference]: Finished difference Result 32244 states and 102685 transitions. [2019-01-13 03:12:57,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 03:12:57,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-01-13 03:12:57,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:12:58,171 INFO L225 Difference]: With dead ends: 32244 [2019-01-13 03:12:58,171 INFO L226 Difference]: Without dead ends: 32244 [2019-01-13 03:12:58,172 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 03:12:58,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32244 states. [2019-01-13 03:12:58,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32244 to 29092. [2019-01-13 03:12:58,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29092 states. [2019-01-13 03:12:58,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29092 states to 29092 states and 93297 transitions. [2019-01-13 03:12:58,570 INFO L78 Accepts]: Start accepts. Automaton has 29092 states and 93297 transitions. Word has length 73 [2019-01-13 03:12:58,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:12:58,570 INFO L480 AbstractCegarLoop]: Abstraction has 29092 states and 93297 transitions. [2019-01-13 03:12:58,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 03:12:58,571 INFO L276 IsEmpty]: Start isEmpty. Operand 29092 states and 93297 transitions. [2019-01-13 03:12:58,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-13 03:12:58,600 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:12:58,600 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:12:58,600 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:12:58,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:12:58,601 INFO L82 PathProgramCache]: Analyzing trace with hash -874835023, now seen corresponding path program 1 times [2019-01-13 03:12:58,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:12:58,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:12:58,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:12:58,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:12:58,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:12:58,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:12:58,813 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 03:12:58,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:12:58,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:12:58,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:12:58,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:12:58,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:12:58,815 INFO L87 Difference]: Start difference. First operand 29092 states and 93297 transitions. Second operand 6 states. [2019-01-13 03:13:00,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:13:00,309 INFO L93 Difference]: Finished difference Result 52145 states and 164794 transitions. [2019-01-13 03:13:00,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 03:13:00,310 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2019-01-13 03:13:00,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:13:00,398 INFO L225 Difference]: With dead ends: 52145 [2019-01-13 03:13:00,398 INFO L226 Difference]: Without dead ends: 51905 [2019-01-13 03:13:00,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-01-13 03:13:00,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51905 states. [2019-01-13 03:13:00,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51905 to 43705. [2019-01-13 03:13:00,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43705 states. [2019-01-13 03:13:01,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43705 states to 43705 states and 139964 transitions. [2019-01-13 03:13:01,054 INFO L78 Accepts]: Start accepts. Automaton has 43705 states and 139964 transitions. Word has length 77 [2019-01-13 03:13:01,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:13:01,054 INFO L480 AbstractCegarLoop]: Abstraction has 43705 states and 139964 transitions. [2019-01-13 03:13:01,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:13:01,055 INFO L276 IsEmpty]: Start isEmpty. Operand 43705 states and 139964 transitions. [2019-01-13 03:13:01,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-13 03:13:01,093 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:13:01,093 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] [2019-01-13 03:13:01,093 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:13:01,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:13:01,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1719306894, now seen corresponding path program 1 times [2019-01-13 03:13:01,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:13:01,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:13:01,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:01,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:13:01,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:01,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:13:01,335 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 03:13:01,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:13:01,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 03:13:01,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 03:13:01,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 03:13:01,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:13:01,336 INFO L87 Difference]: Start difference. First operand 43705 states and 139964 transitions. Second operand 8 states. [2019-01-13 03:13:02,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:13:02,841 INFO L93 Difference]: Finished difference Result 49305 states and 156664 transitions. [2019-01-13 03:13:02,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-13 03:13:02,842 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 77 [2019-01-13 03:13:02,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:13:02,938 INFO L225 Difference]: With dead ends: 49305 [2019-01-13 03:13:02,938 INFO L226 Difference]: Without dead ends: 49241 [2019-01-13 03:13:02,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2019-01-13 03:13:03,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49241 states. [2019-01-13 03:13:03,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49241 to 42697. [2019-01-13 03:13:03,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42697 states. [2019-01-13 03:13:03,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42697 states to 42697 states and 137132 transitions. [2019-01-13 03:13:03,542 INFO L78 Accepts]: Start accepts. Automaton has 42697 states and 137132 transitions. Word has length 77 [2019-01-13 03:13:03,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:13:03,542 INFO L480 AbstractCegarLoop]: Abstraction has 42697 states and 137132 transitions. [2019-01-13 03:13:03,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 03:13:03,542 INFO L276 IsEmpty]: Start isEmpty. Operand 42697 states and 137132 transitions. [2019-01-13 03:13:03,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-13 03:13:03,596 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:13:03,596 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] [2019-01-13 03:13:03,596 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:13:03,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:13:03,596 INFO L82 PathProgramCache]: Analyzing trace with hash -524203698, now seen corresponding path program 1 times [2019-01-13 03:13:03,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:13:03,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:13:03,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:03,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:13:03,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:03,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:13:03,745 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 03:13:03,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:13:03,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:13:03,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:13:03,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:13:03,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:13:03,746 INFO L87 Difference]: Start difference. First operand 42697 states and 137132 transitions. Second operand 4 states. [2019-01-13 03:13:04,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:13:04,218 INFO L93 Difference]: Finished difference Result 49703 states and 157732 transitions. [2019-01-13 03:13:04,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 03:13:04,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-01-13 03:13:04,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:13:04,300 INFO L225 Difference]: With dead ends: 49703 [2019-01-13 03:13:04,301 INFO L226 Difference]: Without dead ends: 49527 [2019-01-13 03:13:04,301 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 03:13:04,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49527 states. [2019-01-13 03:13:04,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49527 to 47755. [2019-01-13 03:13:04,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47755 states. [2019-01-13 03:13:04,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47755 states to 47755 states and 152167 transitions. [2019-01-13 03:13:04,943 INFO L78 Accepts]: Start accepts. Automaton has 47755 states and 152167 transitions. Word has length 79 [2019-01-13 03:13:04,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:13:04,943 INFO L480 AbstractCegarLoop]: Abstraction has 47755 states and 152167 transitions. [2019-01-13 03:13:04,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:13:04,944 INFO L276 IsEmpty]: Start isEmpty. Operand 47755 states and 152167 transitions. [2019-01-13 03:13:04,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-13 03:13:04,996 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:13:04,996 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] [2019-01-13 03:13:04,996 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:13:04,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:13:04,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1835103311, now seen corresponding path program 1 times [2019-01-13 03:13:04,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:13:04,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:13:04,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:05,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:13:05,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:05,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:13:05,124 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 03:13:05,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:13:05,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 03:13:05,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 03:13:05,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 03:13:05,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 03:13:05,126 INFO L87 Difference]: Start difference. First operand 47755 states and 152167 transitions. Second operand 3 states. [2019-01-13 03:13:06,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:13:06,143 INFO L93 Difference]: Finished difference Result 50547 states and 160607 transitions. [2019-01-13 03:13:06,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 03:13:06,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-01-13 03:13:06,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:13:06,240 INFO L225 Difference]: With dead ends: 50547 [2019-01-13 03:13:06,241 INFO L226 Difference]: Without dead ends: 50547 [2019-01-13 03:13:06,241 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 03:13:06,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50547 states. [2019-01-13 03:13:07,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50547 to 49183. [2019-01-13 03:13:07,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49183 states. [2019-01-13 03:13:07,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49183 states to 49183 states and 156477 transitions. [2019-01-13 03:13:07,489 INFO L78 Accepts]: Start accepts. Automaton has 49183 states and 156477 transitions. Word has length 79 [2019-01-13 03:13:07,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:13:07,489 INFO L480 AbstractCegarLoop]: Abstraction has 49183 states and 156477 transitions. [2019-01-13 03:13:07,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 03:13:07,490 INFO L276 IsEmpty]: Start isEmpty. Operand 49183 states and 156477 transitions. [2019-01-13 03:13:07,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-13 03:13:07,539 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:13:07,539 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] [2019-01-13 03:13:07,539 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:13:07,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:13:07,541 INFO L82 PathProgramCache]: Analyzing trace with hash -20398191, now seen corresponding path program 1 times [2019-01-13 03:13:07,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:13:07,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:13:07,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:07,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:13:07,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:07,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:13:07,717 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 03:13:07,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:13:07,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:13:07,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:13:07,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:13:07,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:13:07,720 INFO L87 Difference]: Start difference. First operand 49183 states and 156477 transitions. Second operand 7 states. [2019-01-13 03:13:09,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:13:09,837 INFO L93 Difference]: Finished difference Result 61106 states and 192232 transitions. [2019-01-13 03:13:09,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 03:13:09,838 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 80 [2019-01-13 03:13:09,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:13:09,949 INFO L225 Difference]: With dead ends: 61106 [2019-01-13 03:13:09,949 INFO L226 Difference]: Without dead ends: 60650 [2019-01-13 03:13:09,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-01-13 03:13:10,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60650 states. [2019-01-13 03:13:10,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60650 to 49700. [2019-01-13 03:13:10,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49700 states. [2019-01-13 03:13:10,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49700 states to 49700 states and 158347 transitions. [2019-01-13 03:13:10,804 INFO L78 Accepts]: Start accepts. Automaton has 49700 states and 158347 transitions. Word has length 80 [2019-01-13 03:13:10,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:13:10,805 INFO L480 AbstractCegarLoop]: Abstraction has 49700 states and 158347 transitions. [2019-01-13 03:13:10,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:13:10,805 INFO L276 IsEmpty]: Start isEmpty. Operand 49700 states and 158347 transitions. [2019-01-13 03:13:10,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-13 03:13:10,855 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:13:10,855 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] [2019-01-13 03:13:10,855 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:13:10,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:13:10,856 INFO L82 PathProgramCache]: Analyzing trace with hash -303548655, now seen corresponding path program 1 times [2019-01-13 03:13:10,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:13:10,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:13:10,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:10,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:13:10,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:10,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:13:11,107 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 03:13:11,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:13:11,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:13:11,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:13:11,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:13:11,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:13:11,111 INFO L87 Difference]: Start difference. First operand 49700 states and 158347 transitions. Second operand 5 states. [2019-01-13 03:13:11,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:13:11,555 INFO L93 Difference]: Finished difference Result 6376 states and 16630 transitions. [2019-01-13 03:13:11,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 03:13:11,557 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-01-13 03:13:11,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:13:11,567 INFO L225 Difference]: With dead ends: 6376 [2019-01-13 03:13:11,568 INFO L226 Difference]: Without dead ends: 5504 [2019-01-13 03:13:11,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:13:11,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5504 states. [2019-01-13 03:13:11,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5504 to 5231. [2019-01-13 03:13:11,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5231 states. [2019-01-13 03:13:11,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5231 states to 5231 states and 13645 transitions. [2019-01-13 03:13:11,668 INFO L78 Accepts]: Start accepts. Automaton has 5231 states and 13645 transitions. Word has length 80 [2019-01-13 03:13:11,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:13:11,668 INFO L480 AbstractCegarLoop]: Abstraction has 5231 states and 13645 transitions. [2019-01-13 03:13:11,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:13:11,669 INFO L276 IsEmpty]: Start isEmpty. Operand 5231 states and 13645 transitions. [2019-01-13 03:13:11,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-13 03:13:11,678 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:13:11,678 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] [2019-01-13 03:13:11,678 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:13:11,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:13:11,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1675671717, now seen corresponding path program 1 times [2019-01-13 03:13:11,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:13:11,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:13:11,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:11,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:13:11,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:11,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:13:11,952 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 03:13:11,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:13:11,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:13:11,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:13:11,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:13:11,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:13:11,953 INFO L87 Difference]: Start difference. First operand 5231 states and 13645 transitions. Second operand 5 states. [2019-01-13 03:13:12,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:13:12,198 INFO L93 Difference]: Finished difference Result 5842 states and 15101 transitions. [2019-01-13 03:13:12,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:13:12,200 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-01-13 03:13:12,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:13:12,208 INFO L225 Difference]: With dead ends: 5842 [2019-01-13 03:13:12,208 INFO L226 Difference]: Without dead ends: 5814 [2019-01-13 03:13:12,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 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 03:13:12,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5814 states. [2019-01-13 03:13:12,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5814 to 5258. [2019-01-13 03:13:12,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5258 states. [2019-01-13 03:13:12,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5258 states to 5258 states and 13701 transitions. [2019-01-13 03:13:12,266 INFO L78 Accepts]: Start accepts. Automaton has 5258 states and 13701 transitions. Word has length 90 [2019-01-13 03:13:12,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:13:12,267 INFO L480 AbstractCegarLoop]: Abstraction has 5258 states and 13701 transitions. [2019-01-13 03:13:12,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:13:12,267 INFO L276 IsEmpty]: Start isEmpty. Operand 5258 states and 13701 transitions. [2019-01-13 03:13:12,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 03:13:12,272 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:13:12,273 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 03:13:12,273 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:13:12,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:13:12,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1448647059, now seen corresponding path program 1 times [2019-01-13 03:13:12,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:13:12,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:13:12,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:12,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:13:12,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:12,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:13:12,497 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 03:13:12,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:13:12,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:13:12,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:13:12,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:13:12,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:13:12,502 INFO L87 Difference]: Start difference. First operand 5258 states and 13701 transitions. Second operand 4 states. [2019-01-13 03:13:13,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:13:13,080 INFO L93 Difference]: Finished difference Result 9643 states and 25502 transitions. [2019-01-13 03:13:13,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 03:13:13,082 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-01-13 03:13:13,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:13:13,095 INFO L225 Difference]: With dead ends: 9643 [2019-01-13 03:13:13,095 INFO L226 Difference]: Without dead ends: 9615 [2019-01-13 03:13:13,095 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 03:13:13,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9615 states. [2019-01-13 03:13:13,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9615 to 5065. [2019-01-13 03:13:13,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5065 states. [2019-01-13 03:13:13,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5065 states to 5065 states and 13158 transitions. [2019-01-13 03:13:13,171 INFO L78 Accepts]: Start accepts. Automaton has 5065 states and 13158 transitions. Word has length 92 [2019-01-13 03:13:13,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:13:13,171 INFO L480 AbstractCegarLoop]: Abstraction has 5065 states and 13158 transitions. [2019-01-13 03:13:13,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:13:13,171 INFO L276 IsEmpty]: Start isEmpty. Operand 5065 states and 13158 transitions. [2019-01-13 03:13:13,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 03:13:13,177 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:13:13,177 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 03:13:13,177 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:13:13,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:13:13,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1143940188, now seen corresponding path program 1 times [2019-01-13 03:13:13,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:13:13,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:13:13,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:13,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:13:13,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:13,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:13:13,336 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 03:13:13,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:13:13,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:13:13,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:13:13,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:13:13,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:13:13,337 INFO L87 Difference]: Start difference. First operand 5065 states and 13158 transitions. Second operand 6 states. [2019-01-13 03:13:13,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:13:13,837 INFO L93 Difference]: Finished difference Result 5559 states and 14249 transitions. [2019-01-13 03:13:13,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 03:13:13,839 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-01-13 03:13:13,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:13:13,847 INFO L225 Difference]: With dead ends: 5559 [2019-01-13 03:13:13,847 INFO L226 Difference]: Without dead ends: 5559 [2019-01-13 03:13:13,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:13:13,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5559 states. [2019-01-13 03:13:13,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5559 to 5139. [2019-01-13 03:13:13,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5139 states. [2019-01-13 03:13:13,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5139 states to 5139 states and 13325 transitions. [2019-01-13 03:13:13,907 INFO L78 Accepts]: Start accepts. Automaton has 5139 states and 13325 transitions. Word has length 92 [2019-01-13 03:13:13,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:13:13,907 INFO L480 AbstractCegarLoop]: Abstraction has 5139 states and 13325 transitions. [2019-01-13 03:13:13,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:13:13,908 INFO L276 IsEmpty]: Start isEmpty. Operand 5139 states and 13325 transitions. [2019-01-13 03:13:13,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 03:13:13,913 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:13:13,913 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 03:13:13,913 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:13:13,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:13:13,914 INFO L82 PathProgramCache]: Analyzing trace with hash 2113521211, now seen corresponding path program 1 times [2019-01-13 03:13:13,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:13:13,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:13:13,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:13,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:13:13,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:13,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:13:14,153 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 03:13:14,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:13:14,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:13:14,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:13:14,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:13:14,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:13:14,155 INFO L87 Difference]: Start difference. First operand 5139 states and 13325 transitions. Second operand 6 states. [2019-01-13 03:13:14,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:13:14,531 INFO L93 Difference]: Finished difference Result 6777 states and 17298 transitions. [2019-01-13 03:13:14,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:13:14,532 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-01-13 03:13:14,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:13:14,541 INFO L225 Difference]: With dead ends: 6777 [2019-01-13 03:13:14,541 INFO L226 Difference]: Without dead ends: 6745 [2019-01-13 03:13:14,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:13:14,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6745 states. [2019-01-13 03:13:14,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6745 to 5542. [2019-01-13 03:13:14,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5542 states. [2019-01-13 03:13:14,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5542 states to 5542 states and 14265 transitions. [2019-01-13 03:13:14,605 INFO L78 Accepts]: Start accepts. Automaton has 5542 states and 14265 transitions. Word has length 92 [2019-01-13 03:13:14,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:13:14,606 INFO L480 AbstractCegarLoop]: Abstraction has 5542 states and 14265 transitions. [2019-01-13 03:13:14,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:13:14,606 INFO L276 IsEmpty]: Start isEmpty. Operand 5542 states and 14265 transitions. [2019-01-13 03:13:14,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 03:13:14,611 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:13:14,611 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:13:14,612 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:13:14,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:13:14,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1830370747, now seen corresponding path program 1 times [2019-01-13 03:13:14,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:13:14,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:13:14,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:14,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:13:14,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:14,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:13:14,851 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 03:13:14,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:13:14,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:13:14,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:13:14,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:13:14,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:13:14,852 INFO L87 Difference]: Start difference. First operand 5542 states and 14265 transitions. Second operand 7 states. [2019-01-13 03:13:15,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:13:15,450 INFO L93 Difference]: Finished difference Result 11188 states and 29243 transitions. [2019-01-13 03:13:15,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-13 03:13:15,451 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-01-13 03:13:15,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:13:15,466 INFO L225 Difference]: With dead ends: 11188 [2019-01-13 03:13:15,466 INFO L226 Difference]: Without dead ends: 11188 [2019-01-13 03:13:15,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-01-13 03:13:15,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11188 states. [2019-01-13 03:13:15,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11188 to 5896. [2019-01-13 03:13:15,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5896 states. [2019-01-13 03:13:15,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5896 states to 5896 states and 15210 transitions. [2019-01-13 03:13:15,560 INFO L78 Accepts]: Start accepts. Automaton has 5896 states and 15210 transitions. Word has length 92 [2019-01-13 03:13:15,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:13:15,560 INFO L480 AbstractCegarLoop]: Abstraction has 5896 states and 15210 transitions. [2019-01-13 03:13:15,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:13:15,561 INFO L276 IsEmpty]: Start isEmpty. Operand 5896 states and 15210 transitions. [2019-01-13 03:13:16,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 03:13:16,560 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:13:16,560 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 03:13:16,560 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:13:16,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:13:16,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1219832068, now seen corresponding path program 1 times [2019-01-13 03:13:16,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:13:16,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:13:16,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:16,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:13:16,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:16,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:13:16,787 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 03:13:16,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:13:16,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:13:16,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:13:16,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:13:16,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:13:16,788 INFO L87 Difference]: Start difference. First operand 5896 states and 15210 transitions. Second operand 7 states. [2019-01-13 03:13:17,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:13:17,228 INFO L93 Difference]: Finished difference Result 5649 states and 14573 transitions. [2019-01-13 03:13:17,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:13:17,229 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-01-13 03:13:17,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:13:17,238 INFO L225 Difference]: With dead ends: 5649 [2019-01-13 03:13:17,239 INFO L226 Difference]: Without dead ends: 5649 [2019-01-13 03:13:17,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-01-13 03:13:17,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5649 states. [2019-01-13 03:13:17,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5649 to 5496. [2019-01-13 03:13:17,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5496 states. [2019-01-13 03:13:17,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5496 states to 5496 states and 14218 transitions. [2019-01-13 03:13:17,303 INFO L78 Accepts]: Start accepts. Automaton has 5496 states and 14218 transitions. Word has length 92 [2019-01-13 03:13:17,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:13:17,304 INFO L480 AbstractCegarLoop]: Abstraction has 5496 states and 14218 transitions. [2019-01-13 03:13:17,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:13:17,304 INFO L276 IsEmpty]: Start isEmpty. Operand 5496 states and 14218 transitions. [2019-01-13 03:13:17,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 03:13:17,310 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:13:17,310 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 03:13:17,310 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:13:17,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:13:17,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1105598609, now seen corresponding path program 1 times [2019-01-13 03:13:17,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:13:17,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:13:17,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:17,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:13:17,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:17,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:13:17,797 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 03:13:17,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:13:17,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:13:17,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:13:17,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:13:17,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:13:17,799 INFO L87 Difference]: Start difference. First operand 5496 states and 14218 transitions. Second operand 6 states. [2019-01-13 03:13:18,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:13:18,159 INFO L93 Difference]: Finished difference Result 5760 states and 14736 transitions. [2019-01-13 03:13:18,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:13:18,161 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-01-13 03:13:18,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:13:18,170 INFO L225 Difference]: With dead ends: 5760 [2019-01-13 03:13:18,170 INFO L226 Difference]: Without dead ends: 5685 [2019-01-13 03:13:18,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:13:18,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5685 states. [2019-01-13 03:13:18,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5685 to 5565. [2019-01-13 03:13:18,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5565 states. [2019-01-13 03:13:18,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5565 states to 5565 states and 14347 transitions. [2019-01-13 03:13:18,235 INFO L78 Accepts]: Start accepts. Automaton has 5565 states and 14347 transitions. Word has length 92 [2019-01-13 03:13:18,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:13:18,236 INFO L480 AbstractCegarLoop]: Abstraction has 5565 states and 14347 transitions. [2019-01-13 03:13:18,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:13:18,236 INFO L276 IsEmpty]: Start isEmpty. Operand 5565 states and 14347 transitions. [2019-01-13 03:13:18,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 03:13:18,242 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:13:18,243 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 03:13:18,243 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:13:18,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:13:18,243 INFO L82 PathProgramCache]: Analyzing trace with hash 595141870, now seen corresponding path program 1 times [2019-01-13 03:13:18,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:13:18,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:13:18,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:18,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:13:18,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:18,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:13:18,505 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 03:13:18,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:13:18,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:13:18,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:13:18,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:13:18,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:13:18,507 INFO L87 Difference]: Start difference. First operand 5565 states and 14347 transitions. Second operand 7 states. [2019-01-13 03:13:18,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:13:18,786 INFO L93 Difference]: Finished difference Result 5795 states and 14936 transitions. [2019-01-13 03:13:18,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:13:18,787 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-01-13 03:13:18,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:13:18,797 INFO L225 Difference]: With dead ends: 5795 [2019-01-13 03:13:18,797 INFO L226 Difference]: Without dead ends: 5795 [2019-01-13 03:13:18,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:13:18,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5795 states. [2019-01-13 03:13:18,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5795 to 5493. [2019-01-13 03:13:18,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5493 states. [2019-01-13 03:13:18,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5493 states to 5493 states and 14197 transitions. [2019-01-13 03:13:18,883 INFO L78 Accepts]: Start accepts. Automaton has 5493 states and 14197 transitions. Word has length 92 [2019-01-13 03:13:18,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:13:18,883 INFO L480 AbstractCegarLoop]: Abstraction has 5493 states and 14197 transitions. [2019-01-13 03:13:18,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:13:18,883 INFO L276 IsEmpty]: Start isEmpty. Operand 5493 states and 14197 transitions. [2019-01-13 03:13:18,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 03:13:18,889 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:13:18,889 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 03:13:18,889 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:13:18,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:13:18,890 INFO L82 PathProgramCache]: Analyzing trace with hash 2006021390, now seen corresponding path program 1 times [2019-01-13 03:13:18,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:13:18,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:13:18,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:18,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:13:18,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:18,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:13:19,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 03:13:19,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:13:19,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:13:19,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:13:19,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:13:19,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:13:19,002 INFO L87 Difference]: Start difference. First operand 5493 states and 14197 transitions. Second operand 5 states. [2019-01-13 03:13:19,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:13:19,141 INFO L93 Difference]: Finished difference Result 5084 states and 13161 transitions. [2019-01-13 03:13:19,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 03:13:19,142 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-01-13 03:13:19,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:13:19,150 INFO L225 Difference]: With dead ends: 5084 [2019-01-13 03:13:19,150 INFO L226 Difference]: Without dead ends: 5084 [2019-01-13 03:13:19,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:13:19,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5084 states. [2019-01-13 03:13:19,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5084 to 4958. [2019-01-13 03:13:19,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4958 states. [2019-01-13 03:13:19,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4958 states to 4958 states and 12908 transitions. [2019-01-13 03:13:19,203 INFO L78 Accepts]: Start accepts. Automaton has 4958 states and 12908 transitions. Word has length 92 [2019-01-13 03:13:19,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:13:19,203 INFO L480 AbstractCegarLoop]: Abstraction has 4958 states and 12908 transitions. [2019-01-13 03:13:19,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:13:19,203 INFO L276 IsEmpty]: Start isEmpty. Operand 4958 states and 12908 transitions. [2019-01-13 03:13:19,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 03:13:19,208 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:13:19,208 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:13:19,209 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:13:19,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:13:19,209 INFO L82 PathProgramCache]: Analyzing trace with hash 595710734, now seen corresponding path program 1 times [2019-01-13 03:13:19,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:13:19,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:13:19,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:19,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:13:19,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:19,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:13:19,642 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2019-01-13 03:13:20,127 WARN L181 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 16 [2019-01-13 03:13:20,161 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 03:13:20,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:13:20,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:13:20,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:13:20,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:13:20,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:13:20,163 INFO L87 Difference]: Start difference. First operand 4958 states and 12908 transitions. Second operand 6 states. [2019-01-13 03:13:20,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:13:20,619 INFO L93 Difference]: Finished difference Result 4494 states and 11460 transitions. [2019-01-13 03:13:20,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 03:13:20,620 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-01-13 03:13:20,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:13:20,627 INFO L225 Difference]: With dead ends: 4494 [2019-01-13 03:13:20,627 INFO L226 Difference]: Without dead ends: 4494 [2019-01-13 03:13:20,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:13:20,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4494 states. [2019-01-13 03:13:20,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4494 to 3728. [2019-01-13 03:13:20,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3728 states. [2019-01-13 03:13:20,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3728 states to 3728 states and 9640 transitions. [2019-01-13 03:13:20,668 INFO L78 Accepts]: Start accepts. Automaton has 3728 states and 9640 transitions. Word has length 92 [2019-01-13 03:13:20,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:13:20,669 INFO L480 AbstractCegarLoop]: Abstraction has 3728 states and 9640 transitions. [2019-01-13 03:13:20,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:13:20,669 INFO L276 IsEmpty]: Start isEmpty. Operand 3728 states and 9640 transitions. [2019-01-13 03:13:20,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 03:13:20,673 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:13:20,673 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:13:20,673 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:13:20,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:13:20,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1808878702, now seen corresponding path program 1 times [2019-01-13 03:13:20,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:13:20,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:13:20,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:20,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:13:20,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:13:20,809 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 03:13:20,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:13:20,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:13:20,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:13:20,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:13:20,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:13:20,810 INFO L87 Difference]: Start difference. First operand 3728 states and 9640 transitions. Second operand 7 states. [2019-01-13 03:13:21,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:13:21,350 INFO L93 Difference]: Finished difference Result 5627 states and 14220 transitions. [2019-01-13 03:13:21,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 03:13:21,351 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-01-13 03:13:21,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:13:21,359 INFO L225 Difference]: With dead ends: 5627 [2019-01-13 03:13:21,359 INFO L226 Difference]: Without dead ends: 5595 [2019-01-13 03:13:21,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-01-13 03:13:21,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5595 states. [2019-01-13 03:13:21,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5595 to 4380. [2019-01-13 03:13:21,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4380 states. [2019-01-13 03:13:21,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4380 states to 4380 states and 11219 transitions. [2019-01-13 03:13:21,412 INFO L78 Accepts]: Start accepts. Automaton has 4380 states and 11219 transitions. Word has length 94 [2019-01-13 03:13:21,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:13:21,412 INFO L480 AbstractCegarLoop]: Abstraction has 4380 states and 11219 transitions. [2019-01-13 03:13:21,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:13:21,412 INFO L276 IsEmpty]: Start isEmpty. Operand 4380 states and 11219 transitions. [2019-01-13 03:13:21,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 03:13:21,417 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:13:21,417 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 03:13:21,417 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:13:21,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:13:21,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1241324113, now seen corresponding path program 1 times [2019-01-13 03:13:21,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:13:21,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:13:21,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:21,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:13:21,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:21,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:13:21,648 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 03:13:21,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:13:21,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:13:21,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:13:21,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:13:21,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:13:21,649 INFO L87 Difference]: Start difference. First operand 4380 states and 11219 transitions. Second operand 6 states. [2019-01-13 03:13:21,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:13:21,795 INFO L93 Difference]: Finished difference Result 4435 states and 11267 transitions. [2019-01-13 03:13:21,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 03:13:21,796 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-01-13 03:13:21,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:13:21,802 INFO L225 Difference]: With dead ends: 4435 [2019-01-13 03:13:21,802 INFO L226 Difference]: Without dead ends: 4435 [2019-01-13 03:13:21,802 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 03:13:21,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4435 states. [2019-01-13 03:13:21,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4435 to 4335. [2019-01-13 03:13:21,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4335 states. [2019-01-13 03:13:21,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4335 states to 4335 states and 11080 transitions. [2019-01-13 03:13:21,846 INFO L78 Accepts]: Start accepts. Automaton has 4335 states and 11080 transitions. Word has length 94 [2019-01-13 03:13:21,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:13:21,846 INFO L480 AbstractCegarLoop]: Abstraction has 4335 states and 11080 transitions. [2019-01-13 03:13:21,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:13:21,846 INFO L276 IsEmpty]: Start isEmpty. Operand 4335 states and 11080 transitions. [2019-01-13 03:13:21,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 03:13:21,850 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:13:21,851 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 03:13:21,851 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:13:21,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:13:21,851 INFO L82 PathProgramCache]: Analyzing trace with hash 2138644463, now seen corresponding path program 1 times [2019-01-13 03:13:21,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:13:21,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:13:21,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:21,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:13:21,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:21,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:13:22,015 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 03:13:22,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:13:22,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:13:22,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:13:22,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:13:22,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:13:22,016 INFO L87 Difference]: Start difference. First operand 4335 states and 11080 transitions. Second operand 5 states. [2019-01-13 03:13:22,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:13:22,227 INFO L93 Difference]: Finished difference Result 4879 states and 12424 transitions. [2019-01-13 03:13:22,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:13:22,228 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-01-13 03:13:22,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:13:22,235 INFO L225 Difference]: With dead ends: 4879 [2019-01-13 03:13:22,235 INFO L226 Difference]: Without dead ends: 4847 [2019-01-13 03:13:22,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 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 03:13:22,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4847 states. [2019-01-13 03:13:22,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4847 to 3801. [2019-01-13 03:13:22,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3801 states. [2019-01-13 03:13:22,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3801 states to 3801 states and 9779 transitions. [2019-01-13 03:13:22,279 INFO L78 Accepts]: Start accepts. Automaton has 3801 states and 9779 transitions. Word has length 94 [2019-01-13 03:13:22,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:13:22,279 INFO L480 AbstractCegarLoop]: Abstraction has 3801 states and 9779 transitions. [2019-01-13 03:13:22,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:13:22,280 INFO L276 IsEmpty]: Start isEmpty. Operand 3801 states and 9779 transitions. [2019-01-13 03:13:22,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 03:13:22,284 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:13:22,284 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 03:13:22,285 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:13:22,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:13:22,285 INFO L82 PathProgramCache]: Analyzing trace with hash -911558352, now seen corresponding path program 1 times [2019-01-13 03:13:22,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:13:22,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:13:22,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:22,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:13:22,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:22,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:13:22,563 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 03:13:22,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:13:22,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-13 03:13:22,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 03:13:22,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 03:13:22,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-01-13 03:13:22,564 INFO L87 Difference]: Start difference. First operand 3801 states and 9779 transitions. Second operand 10 states. [2019-01-13 03:13:23,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:13:23,113 INFO L93 Difference]: Finished difference Result 5648 states and 14653 transitions. [2019-01-13 03:13:23,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 03:13:23,114 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2019-01-13 03:13:23,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:13:23,118 INFO L225 Difference]: With dead ends: 5648 [2019-01-13 03:13:23,118 INFO L226 Difference]: Without dead ends: 1887 [2019-01-13 03:13:23,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-01-13 03:13:23,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1887 states. [2019-01-13 03:13:23,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1887 to 1887. [2019-01-13 03:13:23,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1887 states. [2019-01-13 03:13:23,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1887 states to 1887 states and 4933 transitions. [2019-01-13 03:13:23,139 INFO L78 Accepts]: Start accepts. Automaton has 1887 states and 4933 transitions. Word has length 94 [2019-01-13 03:13:23,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:13:23,139 INFO L480 AbstractCegarLoop]: Abstraction has 1887 states and 4933 transitions. [2019-01-13 03:13:23,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 03:13:23,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1887 states and 4933 transitions. [2019-01-13 03:13:23,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 03:13:23,142 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:13:23,142 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 03:13:23,142 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:13:23,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:13:23,143 INFO L82 PathProgramCache]: Analyzing trace with hash -350187536, now seen corresponding path program 1 times [2019-01-13 03:13:23,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:13:23,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:13:23,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:23,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:13:23,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:23,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:13:23,445 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-13 03:13:23,482 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 03:13:23,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:13:23,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:13:23,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:13:23,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:13:23,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:13:23,483 INFO L87 Difference]: Start difference. First operand 1887 states and 4933 transitions. Second operand 6 states. [2019-01-13 03:13:23,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:13:23,804 INFO L93 Difference]: Finished difference Result 2153 states and 5522 transitions. [2019-01-13 03:13:23,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:13:23,805 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-01-13 03:13:23,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:13:23,808 INFO L225 Difference]: With dead ends: 2153 [2019-01-13 03:13:23,809 INFO L226 Difference]: Without dead ends: 2153 [2019-01-13 03:13:23,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-01-13 03:13:23,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2153 states. [2019-01-13 03:13:23,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2153 to 1922. [2019-01-13 03:13:23,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1922 states. [2019-01-13 03:13:23,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1922 states and 5004 transitions. [2019-01-13 03:13:23,829 INFO L78 Accepts]: Start accepts. Automaton has 1922 states and 5004 transitions. Word has length 94 [2019-01-13 03:13:23,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:13:23,829 INFO L480 AbstractCegarLoop]: Abstraction has 1922 states and 5004 transitions. [2019-01-13 03:13:23,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:13:23,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1922 states and 5004 transitions. [2019-01-13 03:13:23,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 03:13:23,832 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:13:23,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 03:13:23,832 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:13:23,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:13:23,832 INFO L82 PathProgramCache]: Analyzing trace with hash -20421775, now seen corresponding path program 1 times [2019-01-13 03:13:23,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:13:23,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:13:23,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:23,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:13:23,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:23,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:13:24,449 WARN L181 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 16 [2019-01-13 03:13:24,457 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 03:13:24,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:13:24,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:13:24,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:13:24,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:13:24,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:13:24,458 INFO L87 Difference]: Start difference. First operand 1922 states and 5004 transitions. Second operand 6 states. [2019-01-13 03:13:24,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:13:24,545 INFO L93 Difference]: Finished difference Result 1973 states and 5095 transitions. [2019-01-13 03:13:24,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:13:24,546 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-01-13 03:13:24,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:13:24,549 INFO L225 Difference]: With dead ends: 1973 [2019-01-13 03:13:24,549 INFO L226 Difference]: Without dead ends: 1953 [2019-01-13 03:13:24,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:13:24,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1953 states. [2019-01-13 03:13:24,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1953 to 1879. [2019-01-13 03:13:24,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1879 states. [2019-01-13 03:13:24,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1879 states to 1879 states and 4907 transitions. [2019-01-13 03:13:24,570 INFO L78 Accepts]: Start accepts. Automaton has 1879 states and 4907 transitions. Word has length 94 [2019-01-13 03:13:24,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:13:24,570 INFO L480 AbstractCegarLoop]: Abstraction has 1879 states and 4907 transitions. [2019-01-13 03:13:24,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:13:24,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 4907 transitions. [2019-01-13 03:13:24,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 03:13:24,573 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:13:24,573 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:13:24,574 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:13:24,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:13:24,574 INFO L82 PathProgramCache]: Analyzing trace with hash -2050928015, now seen corresponding path program 1 times [2019-01-13 03:13:24,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:13:24,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:13:24,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:24,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:13:24,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:24,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:13:25,159 WARN L181 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 10 [2019-01-13 03:13:25,557 WARN L181 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 9 [2019-01-13 03:13:25,568 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 03:13:25,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:13:25,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:13:25,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:13:25,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:13:25,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:13:25,572 INFO L87 Difference]: Start difference. First operand 1879 states and 4907 transitions. Second operand 6 states. [2019-01-13 03:13:25,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:13:25,927 INFO L93 Difference]: Finished difference Result 1921 states and 4983 transitions. [2019-01-13 03:13:25,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 03:13:25,928 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-01-13 03:13:25,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:13:25,931 INFO L225 Difference]: With dead ends: 1921 [2019-01-13 03:13:25,931 INFO L226 Difference]: Without dead ends: 1921 [2019-01-13 03:13:25,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-01-13 03:13:25,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1921 states. [2019-01-13 03:13:25,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1921 to 1914. [2019-01-13 03:13:25,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1914 states. [2019-01-13 03:13:25,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 4970 transitions. [2019-01-13 03:13:25,954 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 4970 transitions. Word has length 94 [2019-01-13 03:13:25,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:13:25,954 INFO L480 AbstractCegarLoop]: Abstraction has 1914 states and 4970 transitions. [2019-01-13 03:13:25,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:13:25,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 4970 transitions. [2019-01-13 03:13:25,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 03:13:25,958 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:13:25,958 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 03:13:25,958 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:13:25,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:13:25,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1721162254, now seen corresponding path program 2 times [2019-01-13 03:13:25,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:13:25,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:13:25,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:25,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:13:25,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:25,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 03:13:26,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 03:13:26,082 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 03:13:26,292 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-13 03:13:26,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 03:13:26 BasicIcfg [2019-01-13 03:13:26,295 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 03:13:26,295 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 03:13:26,295 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 03:13:26,296 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 03:13:26,296 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 03:12:35" (3/4) ... [2019-01-13 03:13:26,301 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-13 03:13:26,458 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 03:13:26,458 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 03:13:26,459 INFO L168 Benchmark]: Toolchain (without parser) took 52737.44 ms. Allocated memory was 1.0 GB in the beginning and 3.9 GB in the end (delta: 2.9 GB). Free memory was 945.9 MB in the beginning and 2.4 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-01-13 03:13:26,460 INFO L168 Benchmark]: CDTParser took 0.17 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 03:13:26,460 INFO L168 Benchmark]: CACSL2BoogieTranslator took 766.18 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.8 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -112.4 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2019-01-13 03:13:26,460 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-01-13 03:13:26,464 INFO L168 Benchmark]: Boogie Preprocessor took 39.36 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 03:13:26,464 INFO L168 Benchmark]: RCFGBuilder took 1153.49 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 11.5 GB. [2019-01-13 03:13:26,464 INFO L168 Benchmark]: TraceAbstraction took 50535.73 ms. Allocated memory was 1.1 GB in the beginning and 3.9 GB in the end (delta: 2.8 GB). Free memory was 1.0 GB in the beginning and 2.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-01-13 03:13:26,465 INFO L168 Benchmark]: Witness Printer took 162.66 ms. Allocated memory is still 3.9 GB. Free memory was 2.5 GB in the beginning and 2.4 GB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. [2019-01-13 03:13:26,470 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.17 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 766.18 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.8 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -112.4 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 74.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.36 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1153.49 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 50535.73 ms. Allocated memory was 1.1 GB in the beginning and 3.9 GB in the end (delta: 2.8 GB). Free memory was 1.0 GB in the beginning and 2.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * Witness Printer took 162.66 ms. Allocated memory is still 3.9 GB. Free memory was 2.5 GB in the beginning and 2.4 GB in the end (delta: 50.6 MB). Peak memory consumption was 50.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] [L674] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L675] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L677] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L678] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L679] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L680] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L681] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L682] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L683] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L684] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L685] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L686] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L687] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L688] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L689] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L690] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L691] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L693] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L694] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L695] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L755] -1 pthread_t t1449; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] FCALL, FORK -1 pthread_create(&t1449, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L757] -1 pthread_t t1450; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] FCALL, FORK -1 pthread_create(&t1450, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L719] 0 x$w_buff1 = x$w_buff0 [L720] 0 x$w_buff0 = 2 [L721] 0 x$w_buff1_used = x$w_buff0_used [L722] 0 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L724] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L725] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L726] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L727] 0 x$r_buff0_thd2 = (_Bool)1 [L730] 0 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L699] 1 y = 1 [L702] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L705] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L705] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=1] [L705] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=1] [L705] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L706] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L706] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L707] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L707] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L733] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L733] 0 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L734] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L734] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L735] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L735] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L736] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L736] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L737] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L737] 0 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L740] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L708] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L708] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L709] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L709] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L712] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L760] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L764] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L764] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L764] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L764] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L765] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L765] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L766] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L766] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L767] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L767] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L768] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L768] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L771] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L772] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L773] -1 x$flush_delayed = weak$$choice2 [L774] -1 x$mem_tmp = x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] EXPR -1 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] -1 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L776] EXPR -1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L776] -1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L777] EXPR -1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L777] -1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L778] EXPR -1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L778] -1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L779] EXPR -1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L779] -1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L780] EXPR -1 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L780] -1 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L781] EXPR -1 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L781] -1 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L782] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L783] EXPR -1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L783] -1 x = x$flush_delayed ? x$mem_tmp : x [L784] -1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 179 locations, 3 error locations. UNSAFE Result, 50.4s OverallTime, 34 OverallIterations, 1 TraceHistogramMax, 25.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8265 SDtfs, 8022 SDslu, 17727 SDs, 0 SdLazy, 8517 SolverSat, 464 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 338 GetRequests, 91 SyntacticMatches, 20 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 9.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49700occurred in iteration=15, 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: 12.0s AutomataMinimizationTime, 33 MinimizatonAttempts, 114479 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 2708 NumberOfCodeBlocks, 2708 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2581 ConstructedInterpolants, 0 QuantifiedInterpolants, 525340 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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...