./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix012_pso.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/mix012_pso.oepc_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 61ec1444beade6c173560e18fc764e1e87b48a40 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-12 23:29:55,745 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 23:29:55,747 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 23:29:55,759 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 23:29:55,760 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 23:29:55,761 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 23:29:55,762 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 23:29:55,764 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 23:29:55,765 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 23:29:55,766 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 23:29:55,767 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 23:29:55,767 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 23:29:55,768 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 23:29:55,769 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 23:29:55,770 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 23:29:55,771 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 23:29:55,772 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 23:29:55,774 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 23:29:55,776 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 23:29:55,777 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 23:29:55,778 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 23:29:55,784 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 23:29:55,788 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 23:29:55,788 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 23:29:55,788 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 23:29:55,789 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 23:29:55,790 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 23:29:55,794 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 23:29:55,795 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 23:29:55,796 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 23:29:55,796 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 23:29:55,797 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 23:29:55,797 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 23:29:55,797 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 23:29:55,798 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 23:29:55,799 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 23:29:55,799 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 23:29:55,814 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 23:29:55,814 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 23:29:55,815 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 23:29:55,815 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 23:29:55,815 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 23:29:55,816 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 23:29:55,816 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 23:29:55,816 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 23:29:55,816 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 23:29:55,816 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 23:29:55,817 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 23:29:55,817 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 23:29:55,817 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 23:29:55,817 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 23:29:55,817 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 23:29:55,817 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 23:29:55,818 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 23:29:55,818 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 23:29:55,818 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 23:29:55,818 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 23:29:55,818 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 23:29:55,819 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 23:29:55,819 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 23:29:55,819 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 23:29:55,819 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 23:29:55,819 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 23:29:55,820 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 23:29:55,820 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 23:29:55,820 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 -> 61ec1444beade6c173560e18fc764e1e87b48a40 [2019-01-12 23:29:55,861 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 23:29:55,874 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 23:29:55,877 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 23:29:55,879 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 23:29:55,879 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 23:29:55,880 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix012_pso.oepc_false-unreach-call.i [2019-01-12 23:29:55,941 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83bf01cde/77394b717d124ea3b633fbc7b7473af6/FLAGc68e48901 [2019-01-12 23:29:56,446 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 23:29:56,448 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix012_pso.oepc_false-unreach-call.i [2019-01-12 23:29:56,471 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83bf01cde/77394b717d124ea3b633fbc7b7473af6/FLAGc68e48901 [2019-01-12 23:29:56,723 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83bf01cde/77394b717d124ea3b633fbc7b7473af6 [2019-01-12 23:29:56,727 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 23:29:56,728 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 23:29:56,729 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 23:29:56,729 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 23:29:56,733 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 23:29:56,734 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 11:29:56" (1/1) ... [2019-01-12 23:29:56,737 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cbe93f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:29:56, skipping insertion in model container [2019-01-12 23:29:56,737 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 11:29:56" (1/1) ... [2019-01-12 23:29:56,747 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 23:29:56,814 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 23:29:57,247 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 23:29:57,265 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 23:29:57,487 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 23:29:57,561 INFO L195 MainTranslator]: Completed translation [2019-01-12 23:29:57,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:29:57 WrapperNode [2019-01-12 23:29:57,562 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 23:29:57,563 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 23:29:57,563 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 23:29:57,563 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 23:29:57,572 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:29:57" (1/1) ... [2019-01-12 23:29:57,592 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:29:57" (1/1) ... [2019-01-12 23:29:57,628 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 23:29:57,629 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 23:29:57,629 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 23:29:57,629 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 23:29:57,642 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:29:57" (1/1) ... [2019-01-12 23:29:57,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:29:57" (1/1) ... [2019-01-12 23:29:57,650 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:29:57" (1/1) ... [2019-01-12 23:29:57,651 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:29:57" (1/1) ... [2019-01-12 23:29:57,672 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:29:57" (1/1) ... [2019-01-12 23:29:57,688 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:29:57" (1/1) ... [2019-01-12 23:29:57,695 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:29:57" (1/1) ... [2019-01-12 23:29:57,700 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 23:29:57,701 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 23:29:57,701 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 23:29:57,701 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 23:29:57,703 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:29:57" (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-12 23:29:57,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-12 23:29:57,765 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-12 23:29:57,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 23:29:57,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 23:29:57,766 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-12 23:29:57,766 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-12 23:29:57,766 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-12 23:29:57,766 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-12 23:29:57,766 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-12 23:29:57,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 23:29:57,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 23:29:57,769 WARN L204 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-12 23:29:58,911 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 23:29:58,912 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-12 23:29:58,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:29:58 BoogieIcfgContainer [2019-01-12 23:29:58,916 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 23:29:58,917 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 23:29:58,917 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 23:29:58,921 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 23:29:58,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 11:29:56" (1/3) ... [2019-01-12 23:29:58,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6877325b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 11:29:58, skipping insertion in model container [2019-01-12 23:29:58,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:29:57" (2/3) ... [2019-01-12 23:29:58,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6877325b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 11:29:58, skipping insertion in model container [2019-01-12 23:29:58,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:29:58" (3/3) ... [2019-01-12 23:29:58,926 INFO L112 eAbstractionObserver]: Analyzing ICFG mix012_pso.oepc_false-unreach-call.i [2019-01-12 23:29:58,974 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,974 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,975 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,975 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,975 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,975 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,976 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,977 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,978 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,978 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,978 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,978 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,980 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,980 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,980 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,980 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,981 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,982 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,982 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,982 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,982 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,983 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,983 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,983 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,983 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,984 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,984 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,986 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,986 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,987 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,987 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,987 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,987 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,987 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,988 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,989 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,989 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,989 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,991 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,992 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,992 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,992 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,992 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,993 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,993 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,993 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,994 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,994 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,994 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,994 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,995 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,996 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,997 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,997 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,997 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,997 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,997 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,999 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,999 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:58,999 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,000 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,000 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,000 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,000 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,002 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,002 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,004 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,004 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,004 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,005 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,005 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,005 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,005 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,005 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,006 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,006 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,006 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,006 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,007 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,009 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,009 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,009 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,009 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,010 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,010 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,011 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,011 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,011 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,011 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,013 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,013 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,013 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,013 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,014 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,014 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,015 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,015 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,015 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,015 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,015 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,016 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,016 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,016 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,016 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,017 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,019 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,019 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,019 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,019 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,020 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,021 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,021 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,021 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,021 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,022 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,022 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,022 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,022 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,022 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,023 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,024 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,025 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,025 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,026 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,026 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,026 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,026 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,026 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,027 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,027 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,027 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,027 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,028 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,029 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,029 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,030 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,030 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,030 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,030 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,030 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,032 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,032 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,032 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,033 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,034 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,034 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,034 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,034 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,034 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,036 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,036 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,036 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,036 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,037 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,037 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,037 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,037 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,037 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,038 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,039 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,040 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,040 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,040 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,040 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:59,070 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-12 23:29:59,070 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 23:29:59,082 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-12 23:29:59,102 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-12 23:29:59,128 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 23:29:59,129 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 23:29:59,129 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 23:29:59,129 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 23:29:59,129 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 23:29:59,130 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 23:29:59,130 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 23:29:59,130 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 23:29:59,130 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 23:29:59,147 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2019-01-12 23:30:01,980 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34807 states. [2019-01-12 23:30:01,982 INFO L276 IsEmpty]: Start isEmpty. Operand 34807 states. [2019-01-12 23:30:01,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-12 23:30:01,990 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:01,990 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:30:01,993 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:01,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:02,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1782476305, now seen corresponding path program 1 times [2019-01-12 23:30:02,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:02,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:02,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:02,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:02,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:02,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:02,383 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-12 23:30:02,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:02,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 23:30:02,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 23:30:02,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 23:30:02,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:30:02,407 INFO L87 Difference]: Start difference. First operand 34807 states. Second operand 4 states. [2019-01-12 23:30:03,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:03,931 INFO L93 Difference]: Finished difference Result 60791 states and 234494 transitions. [2019-01-12 23:30:03,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 23:30:03,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-01-12 23:30:03,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:04,238 INFO L225 Difference]: With dead ends: 60791 [2019-01-12 23:30:04,239 INFO L226 Difference]: Without dead ends: 44271 [2019-01-12 23:30:04,241 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-12 23:30:04,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44271 states. [2019-01-12 23:30:05,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44271 to 27339. [2019-01-12 23:30:05,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27339 states. [2019-01-12 23:30:05,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27339 states to 27339 states and 105500 transitions. [2019-01-12 23:30:05,830 INFO L78 Accepts]: Start accepts. Automaton has 27339 states and 105500 transitions. Word has length 34 [2019-01-12 23:30:05,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:05,830 INFO L480 AbstractCegarLoop]: Abstraction has 27339 states and 105500 transitions. [2019-01-12 23:30:05,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 23:30:05,830 INFO L276 IsEmpty]: Start isEmpty. Operand 27339 states and 105500 transitions. [2019-01-12 23:30:05,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-12 23:30:05,841 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:05,841 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:30:05,841 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:05,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:05,842 INFO L82 PathProgramCache]: Analyzing trace with hash -983112731, now seen corresponding path program 1 times [2019-01-12 23:30:05,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:05,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:05,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:05,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:05,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:05,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:06,058 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-12 23:30:06,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:06,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 23:30:06,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 23:30:06,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 23:30:06,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:30:06,062 INFO L87 Difference]: Start difference. First operand 27339 states and 105500 transitions. Second operand 5 states. [2019-01-12 23:30:08,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:08,229 INFO L93 Difference]: Finished difference Result 64005 states and 235335 transitions. [2019-01-12 23:30:08,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 23:30:08,230 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-01-12 23:30:08,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:08,699 INFO L225 Difference]: With dead ends: 64005 [2019-01-12 23:30:08,700 INFO L226 Difference]: Without dead ends: 63453 [2019-01-12 23:30:08,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-12 23:30:09,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63453 states. [2019-01-12 23:30:10,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63453 to 41421. [2019-01-12 23:30:10,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41421 states. [2019-01-12 23:30:10,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41421 states to 41421 states and 152330 transitions. [2019-01-12 23:30:10,578 INFO L78 Accepts]: Start accepts. Automaton has 41421 states and 152330 transitions. Word has length 46 [2019-01-12 23:30:10,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:10,579 INFO L480 AbstractCegarLoop]: Abstraction has 41421 states and 152330 transitions. [2019-01-12 23:30:10,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 23:30:10,580 INFO L276 IsEmpty]: Start isEmpty. Operand 41421 states and 152330 transitions. [2019-01-12 23:30:10,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-12 23:30:10,587 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:10,587 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:30:10,587 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:10,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:10,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1484418599, now seen corresponding path program 1 times [2019-01-12 23:30:10,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:10,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:10,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:10,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:10,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:10,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:10,706 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-12 23:30:10,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:10,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 23:30:10,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 23:30:10,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 23:30:10,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:30:10,708 INFO L87 Difference]: Start difference. First operand 41421 states and 152330 transitions. Second operand 5 states. [2019-01-12 23:30:12,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:12,168 INFO L93 Difference]: Finished difference Result 81367 states and 298048 transitions. [2019-01-12 23:30:12,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 23:30:12,169 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-01-12 23:30:12,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:12,456 INFO L225 Difference]: With dead ends: 81367 [2019-01-12 23:30:12,456 INFO L226 Difference]: Without dead ends: 80855 [2019-01-12 23:30:12,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-12 23:30:12,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80855 states. [2019-01-12 23:30:14,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80855 to 45375. [2019-01-12 23:30:14,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45375 states. [2019-01-12 23:30:14,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45375 states to 45375 states and 166018 transitions. [2019-01-12 23:30:14,445 INFO L78 Accepts]: Start accepts. Automaton has 45375 states and 166018 transitions. Word has length 47 [2019-01-12 23:30:14,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:14,446 INFO L480 AbstractCegarLoop]: Abstraction has 45375 states and 166018 transitions. [2019-01-12 23:30:14,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 23:30:14,446 INFO L276 IsEmpty]: Start isEmpty. Operand 45375 states and 166018 transitions. [2019-01-12 23:30:14,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-12 23:30:14,454 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:14,454 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:30:14,454 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:14,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:14,455 INFO L82 PathProgramCache]: Analyzing trace with hash 375052511, now seen corresponding path program 1 times [2019-01-12 23:30:14,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:14,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:14,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:14,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:14,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:14,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:14,519 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-12 23:30:14,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:14,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 23:30:14,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 23:30:14,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 23:30:14,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 23:30:14,520 INFO L87 Difference]: Start difference. First operand 45375 states and 166018 transitions. Second operand 3 states. [2019-01-12 23:30:14,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:14,830 INFO L93 Difference]: Finished difference Result 65251 states and 235814 transitions. [2019-01-12 23:30:14,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 23:30:14,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-01-12 23:30:14,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:14,986 INFO L225 Difference]: With dead ends: 65251 [2019-01-12 23:30:14,986 INFO L226 Difference]: Without dead ends: 65251 [2019-01-12 23:30:14,986 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-12 23:30:15,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65251 states. [2019-01-12 23:30:16,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65251 to 50945. [2019-01-12 23:30:16,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50945 states. [2019-01-12 23:30:17,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50945 states to 50945 states and 184325 transitions. [2019-01-12 23:30:17,386 INFO L78 Accepts]: Start accepts. Automaton has 50945 states and 184325 transitions. Word has length 49 [2019-01-12 23:30:17,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:17,386 INFO L480 AbstractCegarLoop]: Abstraction has 50945 states and 184325 transitions. [2019-01-12 23:30:17,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 23:30:17,387 INFO L276 IsEmpty]: Start isEmpty. Operand 50945 states and 184325 transitions. [2019-01-12 23:30:17,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-12 23:30:17,405 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:17,406 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:30:17,406 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:17,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:17,406 INFO L82 PathProgramCache]: Analyzing trace with hash -559765890, now seen corresponding path program 1 times [2019-01-12 23:30:17,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:17,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:17,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:17,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:17,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:17,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:17,662 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-12 23:30:17,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:17,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 23:30:17,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 23:30:17,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 23:30:17,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:30:17,664 INFO L87 Difference]: Start difference. First operand 50945 states and 184325 transitions. Second operand 6 states. [2019-01-12 23:30:18,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:18,976 INFO L93 Difference]: Finished difference Result 67511 states and 242185 transitions. [2019-01-12 23:30:18,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 23:30:18,976 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-01-12 23:30:18,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:19,139 INFO L225 Difference]: With dead ends: 67511 [2019-01-12 23:30:19,140 INFO L226 Difference]: Without dead ends: 67511 [2019-01-12 23:30:19,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-12 23:30:19,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67511 states. [2019-01-12 23:30:20,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67511 to 63436. [2019-01-12 23:30:20,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63436 states. [2019-01-12 23:30:20,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63436 states to 63436 states and 227584 transitions. [2019-01-12 23:30:20,487 INFO L78 Accepts]: Start accepts. Automaton has 63436 states and 227584 transitions. Word has length 53 [2019-01-12 23:30:20,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:20,488 INFO L480 AbstractCegarLoop]: Abstraction has 63436 states and 227584 transitions. [2019-01-12 23:30:20,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 23:30:20,488 INFO L276 IsEmpty]: Start isEmpty. Operand 63436 states and 227584 transitions. [2019-01-12 23:30:20,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-12 23:30:20,506 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:20,506 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:30:20,507 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:20,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:20,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1938250047, now seen corresponding path program 1 times [2019-01-12 23:30:20,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:20,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:20,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:20,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:20,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:20,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:20,735 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-12 23:30:20,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:20,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 23:30:20,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 23:30:20,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 23:30:20,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:30:20,737 INFO L87 Difference]: Start difference. First operand 63436 states and 227584 transitions. Second operand 7 states. [2019-01-12 23:30:23,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:23,274 INFO L93 Difference]: Finished difference Result 88528 states and 306201 transitions. [2019-01-12 23:30:23,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 23:30:23,275 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-01-12 23:30:23,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:23,483 INFO L225 Difference]: With dead ends: 88528 [2019-01-12 23:30:23,483 INFO L226 Difference]: Without dead ends: 88528 [2019-01-12 23:30:23,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-01-12 23:30:23,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88528 states. [2019-01-12 23:30:24,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88528 to 74881. [2019-01-12 23:30:24,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74881 states. [2019-01-12 23:30:25,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74881 states to 74881 states and 262987 transitions. [2019-01-12 23:30:25,070 INFO L78 Accepts]: Start accepts. Automaton has 74881 states and 262987 transitions. Word has length 53 [2019-01-12 23:30:25,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:25,070 INFO L480 AbstractCegarLoop]: Abstraction has 74881 states and 262987 transitions. [2019-01-12 23:30:25,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 23:30:25,070 INFO L276 IsEmpty]: Start isEmpty. Operand 74881 states and 262987 transitions. [2019-01-12 23:30:25,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-12 23:30:25,085 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:25,085 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:30:25,086 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:25,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:25,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1469213568, now seen corresponding path program 1 times [2019-01-12 23:30:25,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:25,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:25,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:25,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:25,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:25,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:25,263 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-12 23:30:25,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:25,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 23:30:25,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 23:30:25,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 23:30:25,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:30:25,265 INFO L87 Difference]: Start difference. First operand 74881 states and 262987 transitions. Second operand 4 states. [2019-01-12 23:30:25,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:25,461 INFO L93 Difference]: Finished difference Result 15375 states and 48826 transitions. [2019-01-12 23:30:25,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 23:30:25,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-01-12 23:30:25,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:25,485 INFO L225 Difference]: With dead ends: 15375 [2019-01-12 23:30:25,485 INFO L226 Difference]: Without dead ends: 13789 [2019-01-12 23:30:25,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:30:25,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13789 states. [2019-01-12 23:30:25,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13789 to 13740. [2019-01-12 23:30:25,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13740 states. [2019-01-12 23:30:25,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13740 states to 13740 states and 43352 transitions. [2019-01-12 23:30:25,678 INFO L78 Accepts]: Start accepts. Automaton has 13740 states and 43352 transitions. Word has length 53 [2019-01-12 23:30:25,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:25,678 INFO L480 AbstractCegarLoop]: Abstraction has 13740 states and 43352 transitions. [2019-01-12 23:30:25,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 23:30:25,679 INFO L276 IsEmpty]: Start isEmpty. Operand 13740 states and 43352 transitions. [2019-01-12 23:30:25,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-12 23:30:25,680 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:25,680 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:30:25,681 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:25,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:25,681 INFO L82 PathProgramCache]: Analyzing trace with hash -211879190, now seen corresponding path program 1 times [2019-01-12 23:30:25,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:25,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:25,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:25,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:25,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:25,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:25,972 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-12 23:30:25,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:25,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 23:30:25,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 23:30:25,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 23:30:25,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:30:25,974 INFO L87 Difference]: Start difference. First operand 13740 states and 43352 transitions. Second operand 6 states. [2019-01-12 23:30:26,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:26,819 INFO L93 Difference]: Finished difference Result 19970 states and 62589 transitions. [2019-01-12 23:30:26,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 23:30:26,820 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-01-12 23:30:26,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:26,855 INFO L225 Difference]: With dead ends: 19970 [2019-01-12 23:30:26,855 INFO L226 Difference]: Without dead ends: 19898 [2019-01-12 23:30:26,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-01-12 23:30:26,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19898 states. [2019-01-12 23:30:28,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19898 to 14314. [2019-01-12 23:30:28,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14314 states. [2019-01-12 23:30:28,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14314 states to 14314 states and 45049 transitions. [2019-01-12 23:30:28,582 INFO L78 Accepts]: Start accepts. Automaton has 14314 states and 45049 transitions. Word has length 53 [2019-01-12 23:30:28,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:28,583 INFO L480 AbstractCegarLoop]: Abstraction has 14314 states and 45049 transitions. [2019-01-12 23:30:28,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 23:30:28,583 INFO L276 IsEmpty]: Start isEmpty. Operand 14314 states and 45049 transitions. [2019-01-12 23:30:28,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-12 23:30:28,587 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:28,587 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:30:28,588 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:28,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:28,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1760614074, now seen corresponding path program 1 times [2019-01-12 23:30:28,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:28,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:28,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:28,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:28,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:28,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:28,681 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-12 23:30:28,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:28,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 23:30:28,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 23:30:28,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 23:30:28,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:30:28,682 INFO L87 Difference]: Start difference. First operand 14314 states and 45049 transitions. Second operand 4 states. [2019-01-12 23:30:28,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:28,845 INFO L93 Difference]: Finished difference Result 16617 states and 52377 transitions. [2019-01-12 23:30:28,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 23:30:28,846 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-01-12 23:30:28,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:28,874 INFO L225 Difference]: With dead ends: 16617 [2019-01-12 23:30:28,874 INFO L226 Difference]: Without dead ends: 16617 [2019-01-12 23:30:28,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:30:28,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16617 states. [2019-01-12 23:30:29,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16617 to 15134. [2019-01-12 23:30:29,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15134 states. [2019-01-12 23:30:29,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15134 states to 15134 states and 47639 transitions. [2019-01-12 23:30:29,129 INFO L78 Accepts]: Start accepts. Automaton has 15134 states and 47639 transitions. Word has length 61 [2019-01-12 23:30:29,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:29,130 INFO L480 AbstractCegarLoop]: Abstraction has 15134 states and 47639 transitions. [2019-01-12 23:30:29,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 23:30:29,130 INFO L276 IsEmpty]: Start isEmpty. Operand 15134 states and 47639 transitions. [2019-01-12 23:30:29,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-12 23:30:29,135 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:29,135 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:30:29,136 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:29,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:29,136 INFO L82 PathProgramCache]: Analyzing trace with hash -17803739, now seen corresponding path program 1 times [2019-01-12 23:30:29,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:29,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:29,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:29,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:29,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:29,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:29,262 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-12 23:30:29,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:29,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 23:30:29,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 23:30:29,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 23:30:29,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:30:29,264 INFO L87 Difference]: Start difference. First operand 15134 states and 47639 transitions. Second operand 6 states. [2019-01-12 23:30:29,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:29,932 INFO L93 Difference]: Finished difference Result 28106 states and 88147 transitions. [2019-01-12 23:30:29,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 23:30:29,932 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-01-12 23:30:29,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:29,984 INFO L225 Difference]: With dead ends: 28106 [2019-01-12 23:30:29,984 INFO L226 Difference]: Without dead ends: 28035 [2019-01-12 23:30:29,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-01-12 23:30:30,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28035 states. [2019-01-12 23:30:30,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28035 to 17412. [2019-01-12 23:30:30,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17412 states. [2019-01-12 23:30:30,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17412 states to 17412 states and 54313 transitions. [2019-01-12 23:30:30,290 INFO L78 Accepts]: Start accepts. Automaton has 17412 states and 54313 transitions. Word has length 61 [2019-01-12 23:30:30,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:30,290 INFO L480 AbstractCegarLoop]: Abstraction has 17412 states and 54313 transitions. [2019-01-12 23:30:30,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 23:30:30,291 INFO L276 IsEmpty]: Start isEmpty. Operand 17412 states and 54313 transitions. [2019-01-12 23:30:30,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-12 23:30:30,297 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:30,297 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:30:30,298 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:30,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:30,298 INFO L82 PathProgramCache]: Analyzing trace with hash -2056127163, now seen corresponding path program 1 times [2019-01-12 23:30:30,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:30,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:30,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:30,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:30,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:30,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:30,426 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-12 23:30:30,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:30,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 23:30:30,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 23:30:30,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 23:30:30,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 23:30:30,428 INFO L87 Difference]: Start difference. First operand 17412 states and 54313 transitions. Second operand 3 states. [2019-01-12 23:30:31,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:31,330 INFO L93 Difference]: Finished difference Result 18092 states and 56145 transitions. [2019-01-12 23:30:31,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 23:30:31,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-01-12 23:30:31,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:31,362 INFO L225 Difference]: With dead ends: 18092 [2019-01-12 23:30:31,362 INFO L226 Difference]: Without dead ends: 18092 [2019-01-12 23:30:31,362 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-12 23:30:31,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18092 states. [2019-01-12 23:30:31,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18092 to 17752. [2019-01-12 23:30:31,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17752 states. [2019-01-12 23:30:31,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17752 states to 17752 states and 55229 transitions. [2019-01-12 23:30:31,613 INFO L78 Accepts]: Start accepts. Automaton has 17752 states and 55229 transitions. Word has length 65 [2019-01-12 23:30:31,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:31,613 INFO L480 AbstractCegarLoop]: Abstraction has 17752 states and 55229 transitions. [2019-01-12 23:30:31,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 23:30:31,613 INFO L276 IsEmpty]: Start isEmpty. Operand 17752 states and 55229 transitions. [2019-01-12 23:30:31,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-12 23:30:31,620 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:31,620 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:30:31,621 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:31,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:31,621 INFO L82 PathProgramCache]: Analyzing trace with hash 21082180, now seen corresponding path program 1 times [2019-01-12 23:30:31,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:31,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:31,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:31,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:31,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:31,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:31,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-12 23:30:31,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:31,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 23:30:31,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 23:30:31,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 23:30:31,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:30:31,789 INFO L87 Difference]: Start difference. First operand 17752 states and 55229 transitions. Second operand 4 states. [2019-01-12 23:30:32,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:32,161 INFO L93 Difference]: Finished difference Result 21696 states and 66718 transitions. [2019-01-12 23:30:32,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 23:30:32,162 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-01-12 23:30:32,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:32,199 INFO L225 Difference]: With dead ends: 21696 [2019-01-12 23:30:32,199 INFO L226 Difference]: Without dead ends: 21696 [2019-01-12 23:30:32,199 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-12 23:30:32,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21696 states. [2019-01-12 23:30:32,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21696 to 19646. [2019-01-12 23:30:32,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19646 states. [2019-01-12 23:30:32,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19646 states to 19646 states and 60608 transitions. [2019-01-12 23:30:32,493 INFO L78 Accepts]: Start accepts. Automaton has 19646 states and 60608 transitions. Word has length 65 [2019-01-12 23:30:32,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:32,494 INFO L480 AbstractCegarLoop]: Abstraction has 19646 states and 60608 transitions. [2019-01-12 23:30:32,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 23:30:32,494 INFO L276 IsEmpty]: Start isEmpty. Operand 19646 states and 60608 transitions. [2019-01-12 23:30:32,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-12 23:30:32,506 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:32,506 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:30:32,506 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:32,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:32,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1344510516, now seen corresponding path program 1 times [2019-01-12 23:30:32,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:32,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:32,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:32,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:32,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:32,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:32,667 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-12 23:30:32,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:32,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 23:30:32,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 23:30:32,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 23:30:32,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:30:32,668 INFO L87 Difference]: Start difference. First operand 19646 states and 60608 transitions. Second operand 6 states. [2019-01-12 23:30:34,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:34,022 INFO L93 Difference]: Finished difference Result 23814 states and 72326 transitions. [2019-01-12 23:30:34,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 23:30:34,023 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-01-12 23:30:34,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:34,067 INFO L225 Difference]: With dead ends: 23814 [2019-01-12 23:30:34,067 INFO L226 Difference]: Without dead ends: 23814 [2019-01-12 23:30:34,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:30:34,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23814 states. [2019-01-12 23:30:34,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23814 to 22474. [2019-01-12 23:30:34,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22474 states. [2019-01-12 23:30:34,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22474 states to 22474 states and 68748 transitions. [2019-01-12 23:30:34,723 INFO L78 Accepts]: Start accepts. Automaton has 22474 states and 68748 transitions. Word has length 67 [2019-01-12 23:30:34,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:34,723 INFO L480 AbstractCegarLoop]: Abstraction has 22474 states and 68748 transitions. [2019-01-12 23:30:34,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 23:30:34,723 INFO L276 IsEmpty]: Start isEmpty. Operand 22474 states and 68748 transitions. [2019-01-12 23:30:34,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-12 23:30:34,735 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:34,735 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:30:34,735 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:34,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:34,736 INFO L82 PathProgramCache]: Analyzing trace with hash 873247437, now seen corresponding path program 1 times [2019-01-12 23:30:34,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:34,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:34,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:34,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:34,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:34,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:34,876 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-12 23:30:34,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:34,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 23:30:34,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 23:30:34,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 23:30:34,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:30:34,877 INFO L87 Difference]: Start difference. First operand 22474 states and 68748 transitions. Second operand 6 states. [2019-01-12 23:30:35,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:35,451 INFO L93 Difference]: Finished difference Result 25702 states and 76208 transitions. [2019-01-12 23:30:35,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 23:30:35,459 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-01-12 23:30:35,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:35,509 INFO L225 Difference]: With dead ends: 25702 [2019-01-12 23:30:35,510 INFO L226 Difference]: Without dead ends: 25702 [2019-01-12 23:30:35,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-01-12 23:30:35,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25702 states. [2019-01-12 23:30:35,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25702 to 22858. [2019-01-12 23:30:35,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22858 states. [2019-01-12 23:30:35,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22858 states to 22858 states and 68854 transitions. [2019-01-12 23:30:35,836 INFO L78 Accepts]: Start accepts. Automaton has 22858 states and 68854 transitions. Word has length 67 [2019-01-12 23:30:35,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:35,836 INFO L480 AbstractCegarLoop]: Abstraction has 22858 states and 68854 transitions. [2019-01-12 23:30:35,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 23:30:35,836 INFO L276 IsEmpty]: Start isEmpty. Operand 22858 states and 68854 transitions. [2019-01-12 23:30:35,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-12 23:30:35,847 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:35,848 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:30:35,848 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:35,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:35,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1084598350, now seen corresponding path program 1 times [2019-01-12 23:30:35,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:35,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:35,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:35,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:35,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:35,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:35,993 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-12 23:30:35,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:35,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 23:30:35,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 23:30:35,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 23:30:35,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:30:35,994 INFO L87 Difference]: Start difference. First operand 22858 states and 68854 transitions. Second operand 5 states. [2019-01-12 23:30:36,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:36,485 INFO L93 Difference]: Finished difference Result 29793 states and 89419 transitions. [2019-01-12 23:30:36,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 23:30:36,486 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-01-12 23:30:36,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:36,537 INFO L225 Difference]: With dead ends: 29793 [2019-01-12 23:30:36,537 INFO L226 Difference]: Without dead ends: 29793 [2019-01-12 23:30:36,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:30:36,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29793 states. [2019-01-12 23:30:36,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29793 to 26814. [2019-01-12 23:30:36,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26814 states. [2019-01-12 23:30:36,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26814 states to 26814 states and 80363 transitions. [2019-01-12 23:30:36,943 INFO L78 Accepts]: Start accepts. Automaton has 26814 states and 80363 transitions. Word has length 67 [2019-01-12 23:30:36,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:36,943 INFO L480 AbstractCegarLoop]: Abstraction has 26814 states and 80363 transitions. [2019-01-12 23:30:36,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 23:30:36,943 INFO L276 IsEmpty]: Start isEmpty. Operand 26814 states and 80363 transitions. [2019-01-12 23:30:36,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-12 23:30:36,956 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:36,957 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:30:36,957 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:36,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:36,957 INFO L82 PathProgramCache]: Analyzing trace with hash 574064173, now seen corresponding path program 1 times [2019-01-12 23:30:36,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:36,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:36,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:36,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:36,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:36,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:37,189 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-12 23:30:37,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:37,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 23:30:37,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 23:30:37,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 23:30:37,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:30:37,190 INFO L87 Difference]: Start difference. First operand 26814 states and 80363 transitions. Second operand 5 states. [2019-01-12 23:30:37,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:37,823 INFO L93 Difference]: Finished difference Result 36420 states and 108433 transitions. [2019-01-12 23:30:37,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 23:30:37,824 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-01-12 23:30:37,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:37,887 INFO L225 Difference]: With dead ends: 36420 [2019-01-12 23:30:37,887 INFO L226 Difference]: Without dead ends: 36420 [2019-01-12 23:30:37,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 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-12 23:30:37,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36420 states. [2019-01-12 23:30:38,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36420 to 29428. [2019-01-12 23:30:38,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29428 states. [2019-01-12 23:30:38,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29428 states to 29428 states and 87839 transitions. [2019-01-12 23:30:38,364 INFO L78 Accepts]: Start accepts. Automaton has 29428 states and 87839 transitions. Word has length 67 [2019-01-12 23:30:38,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:38,365 INFO L480 AbstractCegarLoop]: Abstraction has 29428 states and 87839 transitions. [2019-01-12 23:30:38,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 23:30:38,365 INFO L276 IsEmpty]: Start isEmpty. Operand 29428 states and 87839 transitions. [2019-01-12 23:30:38,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-12 23:30:38,376 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:38,376 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:30:38,376 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:38,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:38,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1233390290, now seen corresponding path program 1 times [2019-01-12 23:30:38,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:38,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:38,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:38,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:38,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:38,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:38,559 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-12 23:30:38,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:38,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 23:30:38,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 23:30:38,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 23:30:38,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:30:38,560 INFO L87 Difference]: Start difference. First operand 29428 states and 87839 transitions. Second operand 4 states. [2019-01-12 23:30:39,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:39,305 INFO L93 Difference]: Finished difference Result 39012 states and 116891 transitions. [2019-01-12 23:30:39,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 23:30:39,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-01-12 23:30:39,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:39,370 INFO L225 Difference]: With dead ends: 39012 [2019-01-12 23:30:39,370 INFO L226 Difference]: Without dead ends: 38780 [2019-01-12 23:30:39,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-12 23:30:39,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38780 states. [2019-01-12 23:30:39,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38780 to 35900. [2019-01-12 23:30:39,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35900 states. [2019-01-12 23:30:39,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35900 states to 35900 states and 107661 transitions. [2019-01-12 23:30:39,917 INFO L78 Accepts]: Start accepts. Automaton has 35900 states and 107661 transitions. Word has length 67 [2019-01-12 23:30:39,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:39,918 INFO L480 AbstractCegarLoop]: Abstraction has 35900 states and 107661 transitions. [2019-01-12 23:30:39,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 23:30:39,918 INFO L276 IsEmpty]: Start isEmpty. Operand 35900 states and 107661 transitions. [2019-01-12 23:30:39,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-12 23:30:39,930 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:39,930 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:30:39,930 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:39,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:39,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1264625647, now seen corresponding path program 1 times [2019-01-12 23:30:39,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:39,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:39,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:39,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:39,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:39,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:40,093 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-12 23:30:40,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:40,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 23:30:40,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 23:30:40,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 23:30:40,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:30:40,094 INFO L87 Difference]: Start difference. First operand 35900 states and 107661 transitions. Second operand 5 states. [2019-01-12 23:30:40,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:40,166 INFO L93 Difference]: Finished difference Result 9316 states and 22547 transitions. [2019-01-12 23:30:40,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 23:30:40,167 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-01-12 23:30:40,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:40,178 INFO L225 Difference]: With dead ends: 9316 [2019-01-12 23:30:40,178 INFO L226 Difference]: Without dead ends: 7464 [2019-01-12 23:30:40,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:30:40,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7464 states. [2019-01-12 23:30:40,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7464 to 6361. [2019-01-12 23:30:40,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6361 states. [2019-01-12 23:30:40,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6361 states to 6361 states and 15018 transitions. [2019-01-12 23:30:40,282 INFO L78 Accepts]: Start accepts. Automaton has 6361 states and 15018 transitions. Word has length 67 [2019-01-12 23:30:40,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:40,282 INFO L480 AbstractCegarLoop]: Abstraction has 6361 states and 15018 transitions. [2019-01-12 23:30:40,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 23:30:40,282 INFO L276 IsEmpty]: Start isEmpty. Operand 6361 states and 15018 transitions. [2019-01-12 23:30:40,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-12 23:30:40,288 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:40,289 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:30:40,289 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:40,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:40,289 INFO L82 PathProgramCache]: Analyzing trace with hash 288361846, now seen corresponding path program 1 times [2019-01-12 23:30:40,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:40,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:40,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:40,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:40,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:40,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:40,371 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-12 23:30:40,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:40,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 23:30:40,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 23:30:40,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 23:30:40,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 23:30:40,373 INFO L87 Difference]: Start difference. First operand 6361 states and 15018 transitions. Second operand 3 states. [2019-01-12 23:30:40,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:40,640 INFO L93 Difference]: Finished difference Result 8820 states and 20757 transitions. [2019-01-12 23:30:40,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 23:30:40,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-01-12 23:30:40,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:40,659 INFO L225 Difference]: With dead ends: 8820 [2019-01-12 23:30:40,659 INFO L226 Difference]: Without dead ends: 8820 [2019-01-12 23:30:40,660 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-12 23:30:40,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8820 states. [2019-01-12 23:30:40,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8820 to 6300. [2019-01-12 23:30:40,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6300 states. [2019-01-12 23:30:40,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6300 states to 6300 states and 14558 transitions. [2019-01-12 23:30:40,843 INFO L78 Accepts]: Start accepts. Automaton has 6300 states and 14558 transitions. Word has length 67 [2019-01-12 23:30:40,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:40,843 INFO L480 AbstractCegarLoop]: Abstraction has 6300 states and 14558 transitions. [2019-01-12 23:30:40,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 23:30:40,844 INFO L276 IsEmpty]: Start isEmpty. Operand 6300 states and 14558 transitions. [2019-01-12 23:30:40,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-12 23:30:40,854 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:40,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] [2019-01-12 23:30:40,855 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:40,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:40,856 INFO L82 PathProgramCache]: Analyzing trace with hash -211461463, now seen corresponding path program 1 times [2019-01-12 23:30:40,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:40,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:40,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:40,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:40,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:40,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:41,184 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-12 23:30:41,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:41,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 23:30:41,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 23:30:41,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 23:30:41,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:30:41,186 INFO L87 Difference]: Start difference. First operand 6300 states and 14558 transitions. Second operand 5 states. [2019-01-12 23:30:42,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:42,291 INFO L93 Difference]: Finished difference Result 7470 states and 17199 transitions. [2019-01-12 23:30:42,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 23:30:42,292 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-01-12 23:30:42,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:42,301 INFO L225 Difference]: With dead ends: 7470 [2019-01-12 23:30:42,302 INFO L226 Difference]: Without dead ends: 7470 [2019-01-12 23:30:42,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 23:30:42,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7470 states. [2019-01-12 23:30:42,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7470 to 6744. [2019-01-12 23:30:42,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6744 states. [2019-01-12 23:30:42,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6744 states to 6744 states and 15562 transitions. [2019-01-12 23:30:42,398 INFO L78 Accepts]: Start accepts. Automaton has 6744 states and 15562 transitions. Word has length 73 [2019-01-12 23:30:42,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:42,399 INFO L480 AbstractCegarLoop]: Abstraction has 6744 states and 15562 transitions. [2019-01-12 23:30:42,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 23:30:42,399 INFO L276 IsEmpty]: Start isEmpty. Operand 6744 states and 15562 transitions. [2019-01-12 23:30:42,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-12 23:30:42,406 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:42,406 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:30:42,406 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:42,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:42,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1531348872, now seen corresponding path program 1 times [2019-01-12 23:30:42,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:42,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:42,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:42,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:42,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:42,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:42,554 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-12 23:30:42,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:42,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 23:30:42,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 23:30:42,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 23:30:42,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:30:42,556 INFO L87 Difference]: Start difference. First operand 6744 states and 15562 transitions. Second operand 7 states. [2019-01-12 23:30:43,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:43,089 INFO L93 Difference]: Finished difference Result 7881 states and 17984 transitions. [2019-01-12 23:30:43,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 23:30:43,091 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-01-12 23:30:43,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:43,102 INFO L225 Difference]: With dead ends: 7881 [2019-01-12 23:30:43,102 INFO L226 Difference]: Without dead ends: 7762 [2019-01-12 23:30:43,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-01-12 23:30:43,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7762 states. [2019-01-12 23:30:43,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7762 to 6841. [2019-01-12 23:30:43,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6841 states. [2019-01-12 23:30:43,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6841 states to 6841 states and 15655 transitions. [2019-01-12 23:30:43,196 INFO L78 Accepts]: Start accepts. Automaton has 6841 states and 15655 transitions. Word has length 73 [2019-01-12 23:30:43,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:43,197 INFO L480 AbstractCegarLoop]: Abstraction has 6841 states and 15655 transitions. [2019-01-12 23:30:43,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 23:30:43,197 INFO L276 IsEmpty]: Start isEmpty. Operand 6841 states and 15655 transitions. [2019-01-12 23:30:43,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-12 23:30:43,205 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:43,205 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-12 23:30:43,206 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:43,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:43,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1190095737, now seen corresponding path program 1 times [2019-01-12 23:30:43,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:43,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:43,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:43,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:43,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:43,279 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-12 23:30:43,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:43,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 23:30:43,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 23:30:43,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 23:30:43,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:30:43,280 INFO L87 Difference]: Start difference. First operand 6841 states and 15655 transitions. Second operand 4 states. [2019-01-12 23:30:43,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:43,639 INFO L93 Difference]: Finished difference Result 10608 states and 24142 transitions. [2019-01-12 23:30:43,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 23:30:43,641 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-01-12 23:30:43,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:43,654 INFO L225 Difference]: With dead ends: 10608 [2019-01-12 23:30:43,654 INFO L226 Difference]: Without dead ends: 10608 [2019-01-12 23:30:43,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:30:43,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10608 states. [2019-01-12 23:30:43,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10608 to 7961. [2019-01-12 23:30:43,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7961 states. [2019-01-12 23:30:43,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7961 states to 7961 states and 17989 transitions. [2019-01-12 23:30:43,786 INFO L78 Accepts]: Start accepts. Automaton has 7961 states and 17989 transitions. Word has length 92 [2019-01-12 23:30:43,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:43,786 INFO L480 AbstractCegarLoop]: Abstraction has 7961 states and 17989 transitions. [2019-01-12 23:30:43,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 23:30:43,786 INFO L276 IsEmpty]: Start isEmpty. Operand 7961 states and 17989 transitions. [2019-01-12 23:30:43,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-12 23:30:43,795 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:43,795 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-12 23:30:43,796 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:43,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:43,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1830258482, now seen corresponding path program 1 times [2019-01-12 23:30:43,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:43,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:43,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:43,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:43,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:44,126 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-12 23:30:44,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:44,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 23:30:44,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 23:30:44,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 23:30:44,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:30:44,128 INFO L87 Difference]: Start difference. First operand 7961 states and 17989 transitions. Second operand 4 states. [2019-01-12 23:30:44,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:44,294 INFO L93 Difference]: Finished difference Result 8526 states and 19282 transitions. [2019-01-12 23:30:44,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 23:30:44,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-01-12 23:30:44,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:44,304 INFO L225 Difference]: With dead ends: 8526 [2019-01-12 23:30:44,305 INFO L226 Difference]: Without dead ends: 8526 [2019-01-12 23:30:44,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:30:44,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8526 states. [2019-01-12 23:30:44,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8526 to 7867. [2019-01-12 23:30:44,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7867 states. [2019-01-12 23:30:44,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7867 states to 7867 states and 17884 transitions. [2019-01-12 23:30:44,388 INFO L78 Accepts]: Start accepts. Automaton has 7867 states and 17884 transitions. Word has length 92 [2019-01-12 23:30:44,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:44,388 INFO L480 AbstractCegarLoop]: Abstraction has 7867 states and 17884 transitions. [2019-01-12 23:30:44,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 23:30:44,388 INFO L276 IsEmpty]: Start isEmpty. Operand 7867 states and 17884 transitions. [2019-01-12 23:30:44,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-12 23:30:44,396 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:44,396 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-12 23:30:44,396 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:44,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:44,397 INFO L82 PathProgramCache]: Analyzing trace with hash -2094563457, now seen corresponding path program 1 times [2019-01-12 23:30:44,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:44,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:44,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:44,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:44,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:44,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:44,551 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-12 23:30:44,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:44,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 23:30:44,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 23:30:44,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 23:30:44,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:30:44,552 INFO L87 Difference]: Start difference. First operand 7867 states and 17884 transitions. Second operand 5 states. [2019-01-12 23:30:44,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:44,966 INFO L93 Difference]: Finished difference Result 7433 states and 16736 transitions. [2019-01-12 23:30:44,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 23:30:44,967 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-01-12 23:30:44,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:44,977 INFO L225 Difference]: With dead ends: 7433 [2019-01-12 23:30:44,977 INFO L226 Difference]: Without dead ends: 7433 [2019-01-12 23:30:44,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:30:44,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7433 states. [2019-01-12 23:30:45,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7433 to 7001. [2019-01-12 23:30:45,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7001 states. [2019-01-12 23:30:45,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7001 states to 7001 states and 15799 transitions. [2019-01-12 23:30:45,048 INFO L78 Accepts]: Start accepts. Automaton has 7001 states and 15799 transitions. Word has length 94 [2019-01-12 23:30:45,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:45,048 INFO L480 AbstractCegarLoop]: Abstraction has 7001 states and 15799 transitions. [2019-01-12 23:30:45,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 23:30:45,048 INFO L276 IsEmpty]: Start isEmpty. Operand 7001 states and 15799 transitions. [2019-01-12 23:30:45,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-12 23:30:45,055 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:45,055 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-12 23:30:45,055 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:45,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:45,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1751651615, now seen corresponding path program 1 times [2019-01-12 23:30:45,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:45,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:45,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:45,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:45,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:45,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:45,264 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-12 23:30:45,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:45,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 23:30:45,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 23:30:45,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 23:30:45,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-12 23:30:45,266 INFO L87 Difference]: Start difference. First operand 7001 states and 15799 transitions. Second operand 8 states. [2019-01-12 23:30:48,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:48,022 INFO L93 Difference]: Finished difference Result 19264 states and 43254 transitions. [2019-01-12 23:30:48,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-12 23:30:48,023 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2019-01-12 23:30:48,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:48,045 INFO L225 Difference]: With dead ends: 19264 [2019-01-12 23:30:48,045 INFO L226 Difference]: Without dead ends: 19145 [2019-01-12 23:30:48,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=324, Invalid=1158, Unknown=0, NotChecked=0, Total=1482 [2019-01-12 23:30:48,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19145 states. [2019-01-12 23:30:48,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19145 to 10407. [2019-01-12 23:30:48,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10407 states. [2019-01-12 23:30:48,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10407 states to 10407 states and 23675 transitions. [2019-01-12 23:30:48,205 INFO L78 Accepts]: Start accepts. Automaton has 10407 states and 23675 transitions. Word has length 94 [2019-01-12 23:30:48,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:48,205 INFO L480 AbstractCegarLoop]: Abstraction has 10407 states and 23675 transitions. [2019-01-12 23:30:48,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 23:30:48,205 INFO L276 IsEmpty]: Start isEmpty. Operand 10407 states and 23675 transitions. [2019-01-12 23:30:48,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-12 23:30:48,216 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:48,216 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-12 23:30:48,216 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:48,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:48,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1298551200, now seen corresponding path program 1 times [2019-01-12 23:30:48,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:48,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:48,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:48,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:48,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:48,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:48,556 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-12 23:30:48,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:48,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 23:30:48,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 23:30:48,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 23:30:48,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:30:48,557 INFO L87 Difference]: Start difference. First operand 10407 states and 23675 transitions. Second operand 6 states. [2019-01-12 23:30:48,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:48,873 INFO L93 Difference]: Finished difference Result 11096 states and 24687 transitions. [2019-01-12 23:30:48,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 23:30:48,874 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-01-12 23:30:48,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:48,888 INFO L225 Difference]: With dead ends: 11096 [2019-01-12 23:30:48,888 INFO L226 Difference]: Without dead ends: 11056 [2019-01-12 23:30:48,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:30:48,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11056 states. [2019-01-12 23:30:48,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11056 to 9526. [2019-01-12 23:30:48,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9526 states. [2019-01-12 23:30:48,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9526 states to 9526 states and 21397 transitions. [2019-01-12 23:30:48,991 INFO L78 Accepts]: Start accepts. Automaton has 9526 states and 21397 transitions. Word has length 94 [2019-01-12 23:30:48,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:48,992 INFO L480 AbstractCegarLoop]: Abstraction has 9526 states and 21397 transitions. [2019-01-12 23:30:48,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 23:30:48,992 INFO L276 IsEmpty]: Start isEmpty. Operand 9526 states and 21397 transitions. [2019-01-12 23:30:49,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-12 23:30:49,000 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:49,001 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-12 23:30:49,001 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:49,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:49,001 INFO L82 PathProgramCache]: Analyzing trace with hash 317655775, now seen corresponding path program 1 times [2019-01-12 23:30:49,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:49,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:49,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:49,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:49,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:49,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:49,193 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-12 23:30:49,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:49,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 23:30:49,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 23:30:49,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 23:30:49,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:30:49,195 INFO L87 Difference]: Start difference. First operand 9526 states and 21397 transitions. Second operand 5 states. [2019-01-12 23:30:49,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:49,721 INFO L93 Difference]: Finished difference Result 11733 states and 26116 transitions. [2019-01-12 23:30:49,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 23:30:49,722 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-01-12 23:30:49,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:49,735 INFO L225 Difference]: With dead ends: 11733 [2019-01-12 23:30:49,736 INFO L226 Difference]: Without dead ends: 11553 [2019-01-12 23:30:49,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:30:49,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11553 states. [2019-01-12 23:30:49,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11553 to 10359. [2019-01-12 23:30:49,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10359 states. [2019-01-12 23:30:49,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10359 states to 10359 states and 23191 transitions. [2019-01-12 23:30:49,852 INFO L78 Accepts]: Start accepts. Automaton has 10359 states and 23191 transitions. Word has length 94 [2019-01-12 23:30:49,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:49,852 INFO L480 AbstractCegarLoop]: Abstraction has 10359 states and 23191 transitions. [2019-01-12 23:30:49,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 23:30:49,853 INFO L276 IsEmpty]: Start isEmpty. Operand 10359 states and 23191 transitions. [2019-01-12 23:30:49,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-12 23:30:49,863 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:49,863 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-12 23:30:49,863 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:49,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:49,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1759553568, now seen corresponding path program 1 times [2019-01-12 23:30:49,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:49,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:49,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:49,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:49,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:49,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:50,171 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-12 23:30:50,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:50,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 23:30:50,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 23:30:50,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 23:30:50,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:30:50,173 INFO L87 Difference]: Start difference. First operand 10359 states and 23191 transitions. Second operand 5 states. [2019-01-12 23:30:50,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:50,812 INFO L93 Difference]: Finished difference Result 13005 states and 28915 transitions. [2019-01-12 23:30:50,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 23:30:50,813 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-01-12 23:30:50,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:50,830 INFO L225 Difference]: With dead ends: 13005 [2019-01-12 23:30:50,830 INFO L226 Difference]: Without dead ends: 12872 [2019-01-12 23:30:50,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-12 23:30:50,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12872 states. [2019-01-12 23:30:50,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12872 to 10524. [2019-01-12 23:30:50,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10524 states. [2019-01-12 23:30:50,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10524 states to 10524 states and 23529 transitions. [2019-01-12 23:30:50,960 INFO L78 Accepts]: Start accepts. Automaton has 10524 states and 23529 transitions. Word has length 94 [2019-01-12 23:30:50,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:50,961 INFO L480 AbstractCegarLoop]: Abstraction has 10524 states and 23529 transitions. [2019-01-12 23:30:50,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 23:30:50,961 INFO L276 IsEmpty]: Start isEmpty. Operand 10524 states and 23529 transitions. [2019-01-12 23:30:50,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-12 23:30:50,974 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:50,974 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-12 23:30:50,974 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:50,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:50,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1679056660, now seen corresponding path program 1 times [2019-01-12 23:30:50,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:50,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:50,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:50,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:50,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:50,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:51,102 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-12 23:30:51,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:51,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 23:30:51,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 23:30:51,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 23:30:51,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:30:51,103 INFO L87 Difference]: Start difference. First operand 10524 states and 23529 transitions. Second operand 5 states. [2019-01-12 23:30:51,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:51,227 INFO L93 Difference]: Finished difference Result 8563 states and 19163 transitions. [2019-01-12 23:30:51,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 23:30:51,228 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-01-12 23:30:51,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:51,237 INFO L225 Difference]: With dead ends: 8563 [2019-01-12 23:30:51,237 INFO L226 Difference]: Without dead ends: 8563 [2019-01-12 23:30:51,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:30:51,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8563 states. [2019-01-12 23:30:51,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8563 to 6968. [2019-01-12 23:30:51,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6968 states. [2019-01-12 23:30:51,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6968 states to 6968 states and 15719 transitions. [2019-01-12 23:30:51,314 INFO L78 Accepts]: Start accepts. Automaton has 6968 states and 15719 transitions. Word has length 94 [2019-01-12 23:30:51,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:51,314 INFO L480 AbstractCegarLoop]: Abstraction has 6968 states and 15719 transitions. [2019-01-12 23:30:51,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 23:30:51,314 INFO L276 IsEmpty]: Start isEmpty. Operand 6968 states and 15719 transitions. [2019-01-12 23:30:51,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-12 23:30:51,321 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:51,321 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-12 23:30:51,322 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:51,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:51,322 INFO L82 PathProgramCache]: Analyzing trace with hash 46424237, now seen corresponding path program 2 times [2019-01-12 23:30:51,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:51,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:51,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:51,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:51,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:51,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:51,542 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-12 23:30:51,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:51,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 23:30:51,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 23:30:51,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 23:30:51,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:30:51,544 INFO L87 Difference]: Start difference. First operand 6968 states and 15719 transitions. Second operand 7 states. [2019-01-12 23:30:51,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:51,956 INFO L93 Difference]: Finished difference Result 8682 states and 19319 transitions. [2019-01-12 23:30:51,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 23:30:51,958 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-01-12 23:30:51,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:51,968 INFO L225 Difference]: With dead ends: 8682 [2019-01-12 23:30:51,969 INFO L226 Difference]: Without dead ends: 8682 [2019-01-12 23:30:51,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-01-12 23:30:51,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8682 states. [2019-01-12 23:30:52,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8682 to 7081. [2019-01-12 23:30:52,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7081 states. [2019-01-12 23:30:52,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7081 states to 7081 states and 15958 transitions. [2019-01-12 23:30:52,047 INFO L78 Accepts]: Start accepts. Automaton has 7081 states and 15958 transitions. Word has length 94 [2019-01-12 23:30:52,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:52,047 INFO L480 AbstractCegarLoop]: Abstraction has 7081 states and 15958 transitions. [2019-01-12 23:30:52,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 23:30:52,047 INFO L276 IsEmpty]: Start isEmpty. Operand 7081 states and 15958 transitions. [2019-01-12 23:30:52,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-12 23:30:52,054 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:52,054 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-12 23:30:52,055 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:52,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:52,055 INFO L82 PathProgramCache]: Analyzing trace with hash -2030785106, now seen corresponding path program 2 times [2019-01-12 23:30:52,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:52,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:52,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:52,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 23:30:52,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:52,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:52,592 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-12 23:30:52,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:52,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 23:30:52,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 23:30:52,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 23:30:52,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:30:52,594 INFO L87 Difference]: Start difference. First operand 7081 states and 15958 transitions. Second operand 7 states. [2019-01-12 23:30:53,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:53,014 INFO L93 Difference]: Finished difference Result 9946 states and 22406 transitions. [2019-01-12 23:30:53,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 23:30:53,015 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-01-12 23:30:53,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:53,026 INFO L225 Difference]: With dead ends: 9946 [2019-01-12 23:30:53,026 INFO L226 Difference]: Without dead ends: 9914 [2019-01-12 23:30:53,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-01-12 23:30:53,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9914 states. [2019-01-12 23:30:53,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9914 to 8741. [2019-01-12 23:30:53,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8741 states. [2019-01-12 23:30:53,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8741 states to 8741 states and 19564 transitions. [2019-01-12 23:30:53,123 INFO L78 Accepts]: Start accepts. Automaton has 8741 states and 19564 transitions. Word has length 94 [2019-01-12 23:30:53,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:53,123 INFO L480 AbstractCegarLoop]: Abstraction has 8741 states and 19564 transitions. [2019-01-12 23:30:53,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 23:30:53,124 INFO L276 IsEmpty]: Start isEmpty. Operand 8741 states and 19564 transitions. [2019-01-12 23:30:53,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-12 23:30:53,134 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:53,134 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-12 23:30:53,134 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:53,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:53,135 INFO L82 PathProgramCache]: Analyzing trace with hash 467230831, now seen corresponding path program 1 times [2019-01-12 23:30:53,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:53,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:53,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:53,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 23:30:53,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:53,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:53,708 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-12 23:30:53,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:53,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 23:30:53,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 23:30:53,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 23:30:53,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-12 23:30:53,710 INFO L87 Difference]: Start difference. First operand 8741 states and 19564 transitions. Second operand 8 states. [2019-01-12 23:30:54,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:54,249 INFO L93 Difference]: Finished difference Result 13745 states and 31428 transitions. [2019-01-12 23:30:54,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 23:30:54,250 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2019-01-12 23:30:54,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:54,269 INFO L225 Difference]: With dead ends: 13745 [2019-01-12 23:30:54,269 INFO L226 Difference]: Without dead ends: 13745 [2019-01-12 23:30:54,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-01-12 23:30:54,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13745 states. [2019-01-12 23:30:54,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13745 to 9372. [2019-01-12 23:30:54,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9372 states. [2019-01-12 23:30:54,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9372 states to 9372 states and 21224 transitions. [2019-01-12 23:30:54,414 INFO L78 Accepts]: Start accepts. Automaton has 9372 states and 21224 transitions. Word has length 94 [2019-01-12 23:30:54,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:54,415 INFO L480 AbstractCegarLoop]: Abstraction has 9372 states and 21224 transitions. [2019-01-12 23:30:54,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 23:30:54,415 INFO L276 IsEmpty]: Start isEmpty. Operand 9372 states and 21224 transitions. [2019-01-12 23:30:54,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-12 23:30:54,425 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:54,425 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-12 23:30:54,425 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:54,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:54,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1354734512, now seen corresponding path program 1 times [2019-01-12 23:30:54,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:54,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:54,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:54,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:54,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:54,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:55,181 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-12 23:30:55,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:55,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 23:30:55,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 23:30:55,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 23:30:55,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:30:55,182 INFO L87 Difference]: Start difference. First operand 9372 states and 21224 transitions. Second operand 7 states. [2019-01-12 23:30:55,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:55,367 INFO L93 Difference]: Finished difference Result 12354 states and 28392 transitions. [2019-01-12 23:30:55,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 23:30:55,368 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-01-12 23:30:55,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:55,381 INFO L225 Difference]: With dead ends: 12354 [2019-01-12 23:30:55,381 INFO L226 Difference]: Without dead ends: 12354 [2019-01-12 23:30:55,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-01-12 23:30:55,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12354 states. [2019-01-12 23:30:55,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12354 to 9024. [2019-01-12 23:30:55,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9024 states. [2019-01-12 23:30:55,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9024 states to 9024 states and 20322 transitions. [2019-01-12 23:30:55,491 INFO L78 Accepts]: Start accepts. Automaton has 9024 states and 20322 transitions. Word has length 94 [2019-01-12 23:30:55,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:55,491 INFO L480 AbstractCegarLoop]: Abstraction has 9024 states and 20322 transitions. [2019-01-12 23:30:55,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 23:30:55,492 INFO L276 IsEmpty]: Start isEmpty. Operand 9024 states and 20322 transitions. [2019-01-12 23:30:55,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-12 23:30:55,500 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:55,501 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-12 23:30:55,501 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:55,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:55,501 INFO L82 PathProgramCache]: Analyzing trace with hash -377241040, now seen corresponding path program 1 times [2019-01-12 23:30:55,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:55,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:55,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:55,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:55,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:55,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:55,707 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-12 23:30:55,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:55,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 23:30:55,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 23:30:55,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 23:30:55,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:30:55,708 INFO L87 Difference]: Start difference. First operand 9024 states and 20322 transitions. Second operand 6 states. [2019-01-12 23:30:55,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:55,856 INFO L93 Difference]: Finished difference Result 8544 states and 18834 transitions. [2019-01-12 23:30:55,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 23:30:55,857 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-01-12 23:30:55,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:55,867 INFO L225 Difference]: With dead ends: 8544 [2019-01-12 23:30:55,867 INFO L226 Difference]: Without dead ends: 8544 [2019-01-12 23:30:55,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-12 23:30:55,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8544 states. [2019-01-12 23:30:55,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8544 to 5376. [2019-01-12 23:30:55,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5376 states. [2019-01-12 23:30:55,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5376 states to 5376 states and 11789 transitions. [2019-01-12 23:30:55,941 INFO L78 Accepts]: Start accepts. Automaton has 5376 states and 11789 transitions. Word has length 94 [2019-01-12 23:30:55,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:55,942 INFO L480 AbstractCegarLoop]: Abstraction has 5376 states and 11789 transitions. [2019-01-12 23:30:55,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 23:30:55,942 INFO L276 IsEmpty]: Start isEmpty. Operand 5376 states and 11789 transitions. [2019-01-12 23:30:55,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-12 23:30:55,948 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:55,948 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:30:55,948 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:55,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:55,948 INFO L82 PathProgramCache]: Analyzing trace with hash -2113137847, now seen corresponding path program 1 times [2019-01-12 23:30:55,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:55,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:55,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:55,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:55,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:55,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:56,069 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-12 23:30:56,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:56,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 23:30:56,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 23:30:56,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 23:30:56,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:30:56,070 INFO L87 Difference]: Start difference. First operand 5376 states and 11789 transitions. Second operand 6 states. [2019-01-12 23:30:56,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:56,281 INFO L93 Difference]: Finished difference Result 5653 states and 12339 transitions. [2019-01-12 23:30:56,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 23:30:56,282 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-01-12 23:30:56,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:56,289 INFO L225 Difference]: With dead ends: 5653 [2019-01-12 23:30:56,289 INFO L226 Difference]: Without dead ends: 5653 [2019-01-12 23:30:56,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-12 23:30:56,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5653 states. [2019-01-12 23:30:56,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5653 to 5267. [2019-01-12 23:30:56,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5267 states. [2019-01-12 23:30:56,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5267 states to 5267 states and 11535 transitions. [2019-01-12 23:30:56,342 INFO L78 Accepts]: Start accepts. Automaton has 5267 states and 11535 transitions. Word has length 96 [2019-01-12 23:30:56,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:56,342 INFO L480 AbstractCegarLoop]: Abstraction has 5267 states and 11535 transitions. [2019-01-12 23:30:56,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 23:30:56,343 INFO L276 IsEmpty]: Start isEmpty. Operand 5267 states and 11535 transitions. [2019-01-12 23:30:56,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-12 23:30:56,348 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:56,348 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:30:56,349 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:56,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:56,349 INFO L82 PathProgramCache]: Analyzing trace with hash -990915638, now seen corresponding path program 1 times [2019-01-12 23:30:56,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:56,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:56,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:56,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:56,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:56,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:56,817 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-12 23:30:56,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:56,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 23:30:56,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 23:30:56,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 23:30:56,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-12 23:30:56,818 INFO L87 Difference]: Start difference. First operand 5267 states and 11535 transitions. Second operand 8 states. [2019-01-12 23:30:57,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:57,219 INFO L93 Difference]: Finished difference Result 6197 states and 13514 transitions. [2019-01-12 23:30:57,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 23:30:57,220 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2019-01-12 23:30:57,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:57,227 INFO L225 Difference]: With dead ends: 6197 [2019-01-12 23:30:57,227 INFO L226 Difference]: Without dead ends: 6197 [2019-01-12 23:30:57,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-01-12 23:30:57,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6197 states. [2019-01-12 23:30:57,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6197 to 6115. [2019-01-12 23:30:57,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6115 states. [2019-01-12 23:30:57,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6115 states to 6115 states and 13345 transitions. [2019-01-12 23:30:57,288 INFO L78 Accepts]: Start accepts. Automaton has 6115 states and 13345 transitions. Word has length 96 [2019-01-12 23:30:57,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:57,288 INFO L480 AbstractCegarLoop]: Abstraction has 6115 states and 13345 transitions. [2019-01-12 23:30:57,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 23:30:57,288 INFO L276 IsEmpty]: Start isEmpty. Operand 6115 states and 13345 transitions. [2019-01-12 23:30:57,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-12 23:30:57,294 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:57,294 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:30:57,294 INFO L423 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:57,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:57,295 INFO L82 PathProgramCache]: Analyzing trace with hash -103411957, now seen corresponding path program 1 times [2019-01-12 23:30:57,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:57,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:57,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:57,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:57,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:57,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:57,559 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-12 23:30:57,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:57,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-12 23:30:57,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 23:30:57,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 23:30:57,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-01-12 23:30:57,561 INFO L87 Difference]: Start difference. First operand 6115 states and 13345 transitions. Second operand 11 states. [2019-01-12 23:30:59,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:59,203 INFO L93 Difference]: Finished difference Result 11346 states and 24932 transitions. [2019-01-12 23:30:59,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-12 23:30:59,205 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2019-01-12 23:30:59,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:59,213 INFO L225 Difference]: With dead ends: 11346 [2019-01-12 23:30:59,213 INFO L226 Difference]: Without dead ends: 7294 [2019-01-12 23:30:59,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2019-01-12 23:30:59,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7294 states. [2019-01-12 23:30:59,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7294 to 5527. [2019-01-12 23:30:59,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5527 states. [2019-01-12 23:30:59,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5527 states to 5527 states and 12042 transitions. [2019-01-12 23:30:59,274 INFO L78 Accepts]: Start accepts. Automaton has 5527 states and 12042 transitions. Word has length 96 [2019-01-12 23:30:59,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:59,274 INFO L480 AbstractCegarLoop]: Abstraction has 5527 states and 12042 transitions. [2019-01-12 23:30:59,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 23:30:59,274 INFO L276 IsEmpty]: Start isEmpty. Operand 5527 states and 12042 transitions. [2019-01-12 23:30:59,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-12 23:30:59,281 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:59,281 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:30:59,281 INFO L423 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:59,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:59,281 INFO L82 PathProgramCache]: Analyzing trace with hash 397601140, now seen corresponding path program 1 times [2019-01-12 23:30:59,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:59,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:59,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:59,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:59,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:59,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:59,883 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-12 23:30:59,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:59,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 23:30:59,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 23:30:59,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 23:30:59,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:30:59,884 INFO L87 Difference]: Start difference. First operand 5527 states and 12042 transitions. Second operand 6 states. [2019-01-12 23:31:00,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:31:00,329 INFO L93 Difference]: Finished difference Result 6293 states and 13733 transitions. [2019-01-12 23:31:00,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 23:31:00,330 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-01-12 23:31:00,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:31:00,338 INFO L225 Difference]: With dead ends: 6293 [2019-01-12 23:31:00,338 INFO L226 Difference]: Without dead ends: 6293 [2019-01-12 23:31:00,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-12 23:31:00,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6293 states. [2019-01-12 23:31:00,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6293 to 5700. [2019-01-12 23:31:00,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5700 states. [2019-01-12 23:31:00,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5700 states to 5700 states and 12418 transitions. [2019-01-12 23:31:00,400 INFO L78 Accepts]: Start accepts. Automaton has 5700 states and 12418 transitions. Word has length 96 [2019-01-12 23:31:00,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:31:00,401 INFO L480 AbstractCegarLoop]: Abstraction has 5700 states and 12418 transitions. [2019-01-12 23:31:00,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 23:31:00,401 INFO L276 IsEmpty]: Start isEmpty. Operand 5700 states and 12418 transitions. [2019-01-12 23:31:00,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-12 23:31:00,407 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:31:00,407 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:31:00,408 INFO L423 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:31:00,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:31:00,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1711267723, now seen corresponding path program 2 times [2019-01-12 23:31:00,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:31:00,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:31:00,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:00,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:31:00,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:00,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 23:31:00,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 23:31:00,488 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 23:31:00,651 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-12 23:31:00,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 11:31:00 BasicIcfg [2019-01-12 23:31:00,658 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 23:31:00,658 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 23:31:00,658 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 23:31:00,658 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 23:31:00,659 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:29:58" (3/4) ... [2019-01-12 23:31:00,665 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 23:31:00,824 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 23:31:00,825 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 23:31:00,825 INFO L168 Benchmark]: Toolchain (without parser) took 64098.43 ms. Allocated memory was 1.0 GB in the beginning and 4.9 GB in the end (delta: 3.9 GB). Free memory was 946.0 MB in the beginning and 4.1 GB in the end (delta: -3.2 GB). Peak memory consumption was 704.2 MB. Max. memory is 11.5 GB. [2019-01-12 23:31:00,829 INFO L168 Benchmark]: CDTParser took 0.16 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-12 23:31:00,829 INFO L168 Benchmark]: CACSL2BoogieTranslator took 832.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -154.1 MB). Peak memory consumption was 38.9 MB. Max. memory is 11.5 GB. [2019-01-12 23:31:00,830 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 23:31:00,830 INFO L168 Benchmark]: Boogie Preprocessor took 71.66 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 23:31:00,830 INFO L168 Benchmark]: RCFGBuilder took 1214.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 47.3 MB). Peak memory consumption was 47.3 MB. Max. memory is 11.5 GB. [2019-01-12 23:31:00,833 INFO L168 Benchmark]: TraceAbstraction took 61741.12 ms. Allocated memory was 1.2 GB in the beginning and 4.9 GB in the end (delta: 3.7 GB). Free memory was 1.1 GB in the beginning and 4.2 GB in the end (delta: -3.1 GB). Peak memory consumption was 618.8 MB. Max. memory is 11.5 GB. [2019-01-12 23:31:00,834 INFO L168 Benchmark]: Witness Printer took 166.57 ms. Allocated memory is still 4.9 GB. Free memory was 4.2 GB in the beginning and 4.1 GB in the end (delta: 61.7 MB). Peak memory consumption was 61.7 MB. Max. memory is 11.5 GB. [2019-01-12 23:31:00,838 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.16 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 832.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -154.1 MB). Peak memory consumption was 38.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 71.66 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1214.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 47.3 MB). Peak memory consumption was 47.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 61741.12 ms. Allocated memory was 1.2 GB in the beginning and 4.9 GB in the end (delta: 3.7 GB). Free memory was 1.1 GB in the beginning and 4.2 GB in the end (delta: -3.1 GB). Peak memory consumption was 618.8 MB. Max. memory is 11.5 GB. * Witness Printer took 166.57 ms. Allocated memory is still 4.9 GB. Free memory was 4.2 GB in the beginning and 4.1 GB in the end (delta: 61.7 MB). Peak memory consumption was 61.7 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_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L675] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L677] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L678] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L679] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L681] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L683] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L684] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L685] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L686] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L687] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L688] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L689] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L690] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L691] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L692] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L693] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L694] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L695] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L696] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L697] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L698] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L699] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] -1 pthread_t t311; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] FCALL, FORK -1 pthread_create(&t311, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L703] 0 y$w_buff1 = y$w_buff0 [L704] 0 y$w_buff0 = 1 [L705] 0 y$w_buff1_used = y$w_buff0_used [L706] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L777] -1 pthread_t t312; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L708] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L709] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L710] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L711] 0 y$r_buff0_thd1 = (_Bool)1 [L714] 0 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L717] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] FCALL, FORK -1 pthread_create(&t312, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L731] 1 x = 1 [L734] 1 __unbuffered_p1_EAX = x [L737] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L738] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L739] 1 y$flush_delayed = weak$$choice2 [L740] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L742] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L743] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L744] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L745] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L745] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L746] EXPR 1 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L746] 1 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L747] EXPR 1 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] 1 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L748] 1 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L749] 1 y = y$flush_delayed ? y$mem_tmp : y [L750] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L753] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L753] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L753] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L753] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L755] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L755] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L756] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L756] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L757] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L757] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L718] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L718] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L719] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L720] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L720] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L721] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L721] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L724] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L785] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L786] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L786] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L788] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L788] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L791] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 223 locations, 3 error locations. UNSAFE Result, 61.5s OverallTime, 39 OverallIterations, 1 TraceHistogramMax, 30.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10624 SDtfs, 12604 SDslu, 24609 SDs, 0 SdLazy, 11202 SolverSat, 742 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 408 GetRequests, 103 SyntacticMatches, 35 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 9.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74881occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 18.2s AutomataMinimizationTime, 38 MinimizatonAttempts, 184522 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 2953 NumberOfCodeBlocks, 2953 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 2819 ConstructedInterpolants, 0 QuantifiedInterpolants, 638247 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...