./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/rfi004_tso.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/rfi004_tso.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 c03146009f534c0722aad7848bbf331ef46c4ee1 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-13 03:42:46,790 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 03:42:46,792 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 03:42:46,803 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 03:42:46,804 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 03:42:46,805 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 03:42:46,806 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 03:42:46,808 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 03:42:46,809 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 03:42:46,810 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 03:42:46,811 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 03:42:46,811 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 03:42:46,812 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 03:42:46,813 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 03:42:46,814 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 03:42:46,815 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 03:42:46,816 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 03:42:46,818 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 03:42:46,820 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 03:42:46,821 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 03:42:46,823 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 03:42:46,824 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 03:42:46,826 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 03:42:46,827 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 03:42:46,827 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 03:42:46,828 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 03:42:46,829 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 03:42:46,830 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 03:42:46,831 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 03:42:46,832 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 03:42:46,833 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 03:42:46,833 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 03:42:46,834 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 03:42:46,837 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 03:42:46,838 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 03:42:46,839 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 03:42:46,839 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-13 03:42:46,855 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 03:42:46,855 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 03:42:46,856 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 03:42:46,857 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 03:42:46,857 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 03:42:46,857 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 03:42:46,857 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 03:42:46,857 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 03:42:46,858 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 03:42:46,858 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 03:42:46,858 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-13 03:42:46,858 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 03:42:46,858 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-13 03:42:46,858 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 03:42:46,859 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-13 03:42:46,859 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 03:42:46,859 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-13 03:42:46,859 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 03:42:46,859 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 03:42:46,859 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 03:42:46,860 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 03:42:46,860 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 03:42:46,860 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 03:42:46,860 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 03:42:46,860 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-13 03:42:46,861 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 03:42:46,861 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 03:42:46,861 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-13 03:42:46,861 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 -> c03146009f534c0722aad7848bbf331ef46c4ee1 [2019-01-13 03:42:46,896 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 03:42:46,908 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 03:42:46,911 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 03:42:46,913 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 03:42:46,913 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 03:42:46,914 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/rfi004_tso.oepc_false-unreach-call.i [2019-01-13 03:42:46,977 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52d3145da/47a48d2b91814e2ca92393d5dd177d21/FLAGcb88671ed [2019-01-13 03:42:47,464 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 03:42:47,464 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/rfi004_tso.oepc_false-unreach-call.i [2019-01-13 03:42:47,481 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52d3145da/47a48d2b91814e2ca92393d5dd177d21/FLAGcb88671ed [2019-01-13 03:42:47,742 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52d3145da/47a48d2b91814e2ca92393d5dd177d21 [2019-01-13 03:42:47,747 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 03:42:47,748 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-13 03:42:47,750 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 03:42:47,750 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 03:42:47,756 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 03:42:47,757 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 03:42:47" (1/1) ... [2019-01-13 03:42:47,761 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54c3e362 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:42:47, skipping insertion in model container [2019-01-13 03:42:47,761 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 03:42:47" (1/1) ... [2019-01-13 03:42:47,771 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 03:42:47,838 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 03:42:48,379 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 03:42:48,398 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 03:42:48,565 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 03:42:48,654 INFO L195 MainTranslator]: Completed translation [2019-01-13 03:42:48,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:42:48 WrapperNode [2019-01-13 03:42:48,655 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 03:42:48,656 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-13 03:42:48,656 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-13 03:42:48,656 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-13 03:42:48,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:42:48" (1/1) ... [2019-01-13 03:42:48,705 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:42:48" (1/1) ... [2019-01-13 03:42:48,741 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-13 03:42:48,742 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 03:42:48,742 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 03:42:48,742 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 03:42:48,751 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:42:48" (1/1) ... [2019-01-13 03:42:48,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:42:48" (1/1) ... [2019-01-13 03:42:48,756 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:42:48" (1/1) ... [2019-01-13 03:42:48,757 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:42:48" (1/1) ... [2019-01-13 03:42:48,766 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:42:48" (1/1) ... [2019-01-13 03:42:48,771 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:42:48" (1/1) ... [2019-01-13 03:42:48,774 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:42:48" (1/1) ... [2019-01-13 03:42:48,778 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 03:42:48,779 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 03:42:48,779 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 03:42:48,779 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 03:42:48,780 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:42:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 03:42:48,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 03:42:48,871 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-13 03:42:48,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 03:42:48,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 03:42:48,872 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-13 03:42:48,872 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-13 03:42:48,872 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-13 03:42:48,872 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-13 03:42:48,872 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-13 03:42:48,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 03:42:48,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 03:42:48,878 WARN L204 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-13 03:42:50,028 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 03:42:50,029 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-13 03:42:50,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 03:42:50 BoogieIcfgContainer [2019-01-13 03:42:50,030 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 03:42:50,031 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 03:42:50,031 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 03:42:50,034 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 03:42:50,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 03:42:47" (1/3) ... [2019-01-13 03:42:50,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c59037a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 03:42:50, skipping insertion in model container [2019-01-13 03:42:50,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:42:48" (2/3) ... [2019-01-13 03:42:50,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c59037a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 03:42:50, skipping insertion in model container [2019-01-13 03:42:50,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 03:42:50" (3/3) ... [2019-01-13 03:42:50,038 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi004_tso.oepc_false-unreach-call.i [2019-01-13 03:42:50,080 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,080 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,080 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,081 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,081 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,081 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,081 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,083 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,083 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,084 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,084 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,084 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,085 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,085 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,085 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,086 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,086 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,086 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,086 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,086 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,087 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,088 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,089 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,090 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,090 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,090 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,091 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,092 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,093 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,093 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,093 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,093 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,094 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,094 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,095 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,096 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,096 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,097 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,097 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,097 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,097 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,098 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,098 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,098 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,098 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,099 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,100 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,101 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,101 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,101 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,101 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,102 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,105 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,105 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,105 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,105 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,106 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,106 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,106 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,106 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,107 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,109 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,109 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,110 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,110 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,110 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,110 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,110 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,112 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,113 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,113 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,114 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,114 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,115 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,115 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,115 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,115 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,116 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,117 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,117 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,118 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,118 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,118 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,119 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,126 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,126 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,127 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,127 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,127 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,127 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,128 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,128 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,128 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,128 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,128 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,128 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,131 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,131 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,132 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,133 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,133 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,133 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,133 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,134 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,134 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,135 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,135 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,135 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,135 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,139 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,139 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,139 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,140 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,140 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,140 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,140 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,141 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,141 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,141 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,141 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,141 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,142 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,144 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,145 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,145 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,145 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,145 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,147 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,147 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,148 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,148 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,148 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,148 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,148 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,150 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,150 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:50,183 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-13 03:42:50,183 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 03:42:50,195 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-13 03:42:50,213 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-13 03:42:50,236 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 03:42:50,237 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 03:42:50,237 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-13 03:42:50,237 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 03:42:50,237 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 03:42:50,237 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 03:42:50,237 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 03:42:50,237 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 03:42:50,238 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 03:42:50,249 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 132places, 164 transitions [2019-01-13 03:42:52,052 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27856 states. [2019-01-13 03:42:52,055 INFO L276 IsEmpty]: Start isEmpty. Operand 27856 states. [2019-01-13 03:42:52,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-13 03:42:52,067 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:52,068 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] [2019-01-13 03:42:52,072 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:52,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:52,079 INFO L82 PathProgramCache]: Analyzing trace with hash -31372928, now seen corresponding path program 1 times [2019-01-13 03:42:52,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:52,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:52,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:52,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:52,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:52,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:52,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:42:52,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:52,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:42:52,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:42:52,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:42:52,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:42:52,506 INFO L87 Difference]: Start difference. First operand 27856 states. Second operand 4 states. [2019-01-13 03:42:53,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:53,966 INFO L93 Difference]: Finished difference Result 47768 states and 183119 transitions. [2019-01-13 03:42:53,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 03:42:53,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-01-13 03:42:53,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:54,668 INFO L225 Difference]: With dead ends: 47768 [2019-01-13 03:42:54,670 INFO L226 Difference]: Without dead ends: 34608 [2019-01-13 03:42:54,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:42:55,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34608 states. [2019-01-13 03:42:55,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34608 to 21756. [2019-01-13 03:42:55,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21756 states. [2019-01-13 03:42:56,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21756 states to 21756 states and 83441 transitions. [2019-01-13 03:42:56,141 INFO L78 Accepts]: Start accepts. Automaton has 21756 states and 83441 transitions. Word has length 39 [2019-01-13 03:42:56,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:56,142 INFO L480 AbstractCegarLoop]: Abstraction has 21756 states and 83441 transitions. [2019-01-13 03:42:56,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:42:56,142 INFO L276 IsEmpty]: Start isEmpty. Operand 21756 states and 83441 transitions. [2019-01-13 03:42:56,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-13 03:42:56,151 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:56,152 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:42:56,152 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:56,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:56,152 INFO L82 PathProgramCache]: Analyzing trace with hash -954263015, now seen corresponding path program 1 times [2019-01-13 03:42:56,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:56,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:56,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:56,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:56,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:56,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:56,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:42:56,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:56,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:42:56,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:42:56,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:42:56,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:42:56,490 INFO L87 Difference]: Start difference. First operand 21756 states and 83441 transitions. Second operand 5 states. [2019-01-13 03:42:59,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:59,055 INFO L93 Difference]: Finished difference Result 47634 states and 173802 transitions. [2019-01-13 03:42:59,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:42:59,056 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-01-13 03:42:59,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:59,300 INFO L225 Difference]: With dead ends: 47634 [2019-01-13 03:42:59,300 INFO L226 Difference]: Without dead ends: 47066 [2019-01-13 03:42:59,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:42:59,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47066 states. [2019-01-13 03:43:00,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47066 to 31796. [2019-01-13 03:43:00,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31796 states. [2019-01-13 03:43:00,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31796 states to 31796 states and 116819 transitions. [2019-01-13 03:43:00,809 INFO L78 Accepts]: Start accepts. Automaton has 31796 states and 116819 transitions. Word has length 47 [2019-01-13 03:43:00,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:43:00,810 INFO L480 AbstractCegarLoop]: Abstraction has 31796 states and 116819 transitions. [2019-01-13 03:43:00,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:43:00,811 INFO L276 IsEmpty]: Start isEmpty. Operand 31796 states and 116819 transitions. [2019-01-13 03:43:00,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-13 03:43:00,816 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:43:00,816 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] [2019-01-13 03:43:00,819 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:43:00,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:43:00,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1367871073, now seen corresponding path program 1 times [2019-01-13 03:43:00,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:43:00,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:43:00,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:00,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:43:00,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:00,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:43:00,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:43:00,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:43:00,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:43:00,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:43:00,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:43:00,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:43:00,919 INFO L87 Difference]: Start difference. First operand 31796 states and 116819 transitions. Second operand 5 states. [2019-01-13 03:43:01,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:43:01,658 INFO L93 Difference]: Finished difference Result 63028 states and 229114 transitions. [2019-01-13 03:43:01,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:43:01,658 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-01-13 03:43:01,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:43:01,936 INFO L225 Difference]: With dead ends: 63028 [2019-01-13 03:43:01,937 INFO L226 Difference]: Without dead ends: 62564 [2019-01-13 03:43:01,937 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-13 03:43:02,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62564 states. [2019-01-13 03:43:04,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62564 to 35364. [2019-01-13 03:43:04,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35364 states. [2019-01-13 03:43:04,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35364 states to 35364 states and 128877 transitions. [2019-01-13 03:43:04,211 INFO L78 Accepts]: Start accepts. Automaton has 35364 states and 128877 transitions. Word has length 48 [2019-01-13 03:43:04,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:43:04,212 INFO L480 AbstractCegarLoop]: Abstraction has 35364 states and 128877 transitions. [2019-01-13 03:43:04,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:43:04,212 INFO L276 IsEmpty]: Start isEmpty. Operand 35364 states and 128877 transitions. [2019-01-13 03:43:04,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-13 03:43:04,220 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:43:04,220 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] [2019-01-13 03:43:04,220 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:43:04,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:43:04,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1372813561, now seen corresponding path program 1 times [2019-01-13 03:43:04,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:43:04,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:43:04,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:04,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:43:04,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:04,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:43:04,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:43:04,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:43:04,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 03:43:04,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 03:43:04,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 03:43:04,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 03:43:04,299 INFO L87 Difference]: Start difference. First operand 35364 states and 128877 transitions. Second operand 3 states. [2019-01-13 03:43:04,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:43:04,540 INFO L93 Difference]: Finished difference Result 45910 states and 163945 transitions. [2019-01-13 03:43:04,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 03:43:04,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-01-13 03:43:04,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:43:04,684 INFO L225 Difference]: With dead ends: 45910 [2019-01-13 03:43:04,684 INFO L226 Difference]: Without dead ends: 45910 [2019-01-13 03:43:04,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 03:43:04,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45910 states. [2019-01-13 03:43:06,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45910 to 40247. [2019-01-13 03:43:06,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40247 states. [2019-01-13 03:43:06,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40247 states to 40247 states and 145215 transitions. [2019-01-13 03:43:06,680 INFO L78 Accepts]: Start accepts. Automaton has 40247 states and 145215 transitions. Word has length 50 [2019-01-13 03:43:06,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:43:06,681 INFO L480 AbstractCegarLoop]: Abstraction has 40247 states and 145215 transitions. [2019-01-13 03:43:06,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 03:43:06,681 INFO L276 IsEmpty]: Start isEmpty. Operand 40247 states and 145215 transitions. [2019-01-13 03:43:06,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-13 03:43:06,699 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:43:06,699 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] [2019-01-13 03:43:06,700 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:43:06,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:43:06,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1505170194, now seen corresponding path program 1 times [2019-01-13 03:43:06,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:43:06,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:43:06,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:06,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:43:06,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:06,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:43:06,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:43:06,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:43:06,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:43:06,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:43:06,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:43:06,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:43:06,946 INFO L87 Difference]: Start difference. First operand 40247 states and 145215 transitions. Second operand 6 states. [2019-01-13 03:43:08,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:43:08,144 INFO L93 Difference]: Finished difference Result 70850 states and 252355 transitions. [2019-01-13 03:43:08,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 03:43:08,144 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-01-13 03:43:08,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:43:08,317 INFO L225 Difference]: With dead ends: 70850 [2019-01-13 03:43:08,317 INFO L226 Difference]: Without dead ends: 70314 [2019-01-13 03:43:08,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-01-13 03:43:08,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70314 states. [2019-01-13 03:43:09,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70314 to 40898. [2019-01-13 03:43:09,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40898 states. [2019-01-13 03:43:09,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40898 states to 40898 states and 147668 transitions. [2019-01-13 03:43:09,426 INFO L78 Accepts]: Start accepts. Automaton has 40898 states and 147668 transitions. Word has length 54 [2019-01-13 03:43:09,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:43:09,427 INFO L480 AbstractCegarLoop]: Abstraction has 40898 states and 147668 transitions. [2019-01-13 03:43:09,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:43:09,427 INFO L276 IsEmpty]: Start isEmpty. Operand 40898 states and 147668 transitions. [2019-01-13 03:43:09,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-13 03:43:09,442 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:43:09,443 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] [2019-01-13 03:43:09,443 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:43:09,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:43:09,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1915358571, now seen corresponding path program 1 times [2019-01-13 03:43:09,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:43:09,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:43:09,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:09,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:43:09,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:09,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:43:09,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:43:09,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:43:09,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:43:09,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:43:09,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:43:09,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:43:09,631 INFO L87 Difference]: Start difference. First operand 40898 states and 147668 transitions. Second operand 6 states. [2019-01-13 03:43:13,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:43:13,407 INFO L93 Difference]: Finished difference Result 56599 states and 201648 transitions. [2019-01-13 03:43:13,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:43:13,408 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-01-13 03:43:13,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:43:13,550 INFO L225 Difference]: With dead ends: 56599 [2019-01-13 03:43:13,550 INFO L226 Difference]: Without dead ends: 55460 [2019-01-13 03:43:13,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:43:13,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55460 states. [2019-01-13 03:43:14,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55460 to 51955. [2019-01-13 03:43:14,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51955 states. [2019-01-13 03:43:14,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51955 states to 51955 states and 186007 transitions. [2019-01-13 03:43:14,633 INFO L78 Accepts]: Start accepts. Automaton has 51955 states and 186007 transitions. Word has length 54 [2019-01-13 03:43:14,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:43:14,634 INFO L480 AbstractCegarLoop]: Abstraction has 51955 states and 186007 transitions. [2019-01-13 03:43:14,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:43:14,634 INFO L276 IsEmpty]: Start isEmpty. Operand 51955 states and 186007 transitions. [2019-01-13 03:43:14,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-13 03:43:14,649 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:43:14,649 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:43:14,650 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:43:14,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:43:14,650 INFO L82 PathProgramCache]: Analyzing trace with hash 582657366, now seen corresponding path program 1 times [2019-01-13 03:43:14,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:43:14,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:43:14,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:14,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:43:14,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:14,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:43:15,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:43:15,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:43:15,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:43:15,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:43:15,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:43:15,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:43:15,097 INFO L87 Difference]: Start difference. First operand 51955 states and 186007 transitions. Second operand 7 states. [2019-01-13 03:43:16,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:43:16,397 INFO L93 Difference]: Finished difference Result 75638 states and 260104 transitions. [2019-01-13 03:43:16,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-13 03:43:16,398 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-01-13 03:43:16,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:43:16,575 INFO L225 Difference]: With dead ends: 75638 [2019-01-13 03:43:16,576 INFO L226 Difference]: Without dead ends: 75638 [2019-01-13 03:43:16,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-01-13 03:43:16,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75638 states. [2019-01-13 03:43:18,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75638 to 61473. [2019-01-13 03:43:18,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61473 states. [2019-01-13 03:43:18,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61473 states to 61473 states and 215184 transitions. [2019-01-13 03:43:18,505 INFO L78 Accepts]: Start accepts. Automaton has 61473 states and 215184 transitions. Word has length 54 [2019-01-13 03:43:18,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:43:18,505 INFO L480 AbstractCegarLoop]: Abstraction has 61473 states and 215184 transitions. [2019-01-13 03:43:18,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:43:18,505 INFO L276 IsEmpty]: Start isEmpty. Operand 61473 states and 215184 transitions. [2019-01-13 03:43:18,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-13 03:43:18,521 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:43:18,521 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] [2019-01-13 03:43:18,522 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:43:18,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:43:18,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1470161047, now seen corresponding path program 1 times [2019-01-13 03:43:18,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:43:18,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:43:18,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:18,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:43:18,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:18,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:43:18,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:43:18,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:43:18,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:43:18,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:43:18,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:43:18,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:43:18,680 INFO L87 Difference]: Start difference. First operand 61473 states and 215184 transitions. Second operand 4 states. [2019-01-13 03:43:18,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:43:18,829 INFO L93 Difference]: Finished difference Result 13778 states and 43274 transitions. [2019-01-13 03:43:18,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 03:43:18,830 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-01-13 03:43:18,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:43:18,850 INFO L225 Difference]: With dead ends: 13778 [2019-01-13 03:43:18,851 INFO L226 Difference]: Without dead ends: 12161 [2019-01-13 03:43:18,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:43:18,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12161 states. [2019-01-13 03:43:18,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12161 to 12113. [2019-01-13 03:43:18,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12113 states. [2019-01-13 03:43:19,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12113 states to 12113 states and 37958 transitions. [2019-01-13 03:43:19,026 INFO L78 Accepts]: Start accepts. Automaton has 12113 states and 37958 transitions. Word has length 54 [2019-01-13 03:43:19,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:43:19,026 INFO L480 AbstractCegarLoop]: Abstraction has 12113 states and 37958 transitions. [2019-01-13 03:43:19,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:43:19,027 INFO L276 IsEmpty]: Start isEmpty. Operand 12113 states and 37958 transitions. [2019-01-13 03:43:19,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-13 03:43:19,033 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:43:19,033 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] [2019-01-13 03:43:19,034 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:43:19,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:43:19,034 INFO L82 PathProgramCache]: Analyzing trace with hash 2067258406, now seen corresponding path program 1 times [2019-01-13 03:43:19,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:43:19,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:43:19,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:19,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:43:19,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:43:19,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:43:19,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:43:19,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:43:19,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:43:19,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:43:19,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:43:19,209 INFO L87 Difference]: Start difference. First operand 12113 states and 37958 transitions. Second operand 4 states. [2019-01-13 03:43:19,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:43:19,476 INFO L93 Difference]: Finished difference Result 14276 states and 44581 transitions. [2019-01-13 03:43:19,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 03:43:19,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-01-13 03:43:19,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:43:19,501 INFO L225 Difference]: With dead ends: 14276 [2019-01-13 03:43:19,502 INFO L226 Difference]: Without dead ends: 14276 [2019-01-13 03:43:19,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:43:19,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14276 states. [2019-01-13 03:43:19,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14276 to 12844. [2019-01-13 03:43:19,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12844 states. [2019-01-13 03:43:19,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12844 states to 12844 states and 40183 transitions. [2019-01-13 03:43:19,701 INFO L78 Accepts]: Start accepts. Automaton has 12844 states and 40183 transitions. Word has length 64 [2019-01-13 03:43:19,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:43:19,701 INFO L480 AbstractCegarLoop]: Abstraction has 12844 states and 40183 transitions. [2019-01-13 03:43:19,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:43:19,701 INFO L276 IsEmpty]: Start isEmpty. Operand 12844 states and 40183 transitions. [2019-01-13 03:43:19,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-13 03:43:19,709 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:43:19,709 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:43:19,709 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:43:19,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:43:19,710 INFO L82 PathProgramCache]: Analyzing trace with hash -484898555, now seen corresponding path program 1 times [2019-01-13 03:43:19,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:43:19,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:43:19,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:19,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:43:19,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:19,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:43:19,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-13 03:43:19,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:43:19,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:43:19,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:43:19,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:43:19,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:43:19,884 INFO L87 Difference]: Start difference. First operand 12844 states and 40183 transitions. Second operand 6 states. [2019-01-13 03:43:20,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:43:20,629 INFO L93 Difference]: Finished difference Result 23411 states and 72792 transitions. [2019-01-13 03:43:20,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-13 03:43:20,629 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-01-13 03:43:20,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:43:20,669 INFO L225 Difference]: With dead ends: 23411 [2019-01-13 03:43:20,669 INFO L226 Difference]: Without dead ends: 23347 [2019-01-13 03:43:20,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-01-13 03:43:20,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23347 states. [2019-01-13 03:43:20,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23347 to 13813. [2019-01-13 03:43:20,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13813 states. [2019-01-13 03:43:20,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13813 states to 13813 states and 42967 transitions. [2019-01-13 03:43:20,932 INFO L78 Accepts]: Start accepts. Automaton has 13813 states and 42967 transitions. Word has length 64 [2019-01-13 03:43:20,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:43:20,932 INFO L480 AbstractCegarLoop]: Abstraction has 13813 states and 42967 transitions. [2019-01-13 03:43:20,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:43:20,932 INFO L276 IsEmpty]: Start isEmpty. Operand 13813 states and 42967 transitions. [2019-01-13 03:43:20,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-13 03:43:20,941 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:43:20,942 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] [2019-01-13 03:43:20,942 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:43:20,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:43:20,942 INFO L82 PathProgramCache]: Analyzing trace with hash 708445986, now seen corresponding path program 1 times [2019-01-13 03:43:20,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:43:20,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:43:20,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:20,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:43:20,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:20,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:43:21,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:43:21,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:43:21,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:43:21,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:43:21,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:43:21,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:43:21,107 INFO L87 Difference]: Start difference. First operand 13813 states and 42967 transitions. Second operand 4 states. [2019-01-13 03:43:22,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:43:22,312 INFO L93 Difference]: Finished difference Result 20043 states and 60866 transitions. [2019-01-13 03:43:22,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 03:43:22,313 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-01-13 03:43:22,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:43:22,345 INFO L225 Difference]: With dead ends: 20043 [2019-01-13 03:43:22,345 INFO L226 Difference]: Without dead ends: 19971 [2019-01-13 03:43:22,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:43:22,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19971 states. [2019-01-13 03:43:22,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19971 to 15684. [2019-01-13 03:43:22,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15684 states. [2019-01-13 03:43:22,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15684 states to 15684 states and 48127 transitions. [2019-01-13 03:43:22,601 INFO L78 Accepts]: Start accepts. Automaton has 15684 states and 48127 transitions. Word has length 66 [2019-01-13 03:43:22,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:43:22,601 INFO L480 AbstractCegarLoop]: Abstraction has 15684 states and 48127 transitions. [2019-01-13 03:43:22,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:43:22,601 INFO L276 IsEmpty]: Start isEmpty. Operand 15684 states and 48127 transitions. [2019-01-13 03:43:22,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-13 03:43:22,614 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:43:22,614 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] [2019-01-13 03:43:22,614 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:43:22,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:43:22,615 INFO L82 PathProgramCache]: Analyzing trace with hash 497095073, now seen corresponding path program 1 times [2019-01-13 03:43:22,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:43:22,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:43:22,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:22,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:43:22,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:22,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:43:22,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:43:22,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:43:22,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:43:22,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:43:22,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:43:22,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:43:22,886 INFO L87 Difference]: Start difference. First operand 15684 states and 48127 transitions. Second operand 4 states. [2019-01-13 03:43:23,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:43:23,317 INFO L93 Difference]: Finished difference Result 19514 states and 59136 transitions. [2019-01-13 03:43:23,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 03:43:23,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-01-13 03:43:23,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:43:23,353 INFO L225 Difference]: With dead ends: 19514 [2019-01-13 03:43:23,353 INFO L226 Difference]: Without dead ends: 19514 [2019-01-13 03:43:23,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:43:23,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19514 states. [2019-01-13 03:43:23,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19514 to 15967. [2019-01-13 03:43:23,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15967 states. [2019-01-13 03:43:23,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15967 states to 15967 states and 48937 transitions. [2019-01-13 03:43:23,610 INFO L78 Accepts]: Start accepts. Automaton has 15967 states and 48937 transitions. Word has length 66 [2019-01-13 03:43:23,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:43:23,610 INFO L480 AbstractCegarLoop]: Abstraction has 15967 states and 48937 transitions. [2019-01-13 03:43:23,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:43:23,611 INFO L276 IsEmpty]: Start isEmpty. Operand 15967 states and 48937 transitions. [2019-01-13 03:43:23,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-13 03:43:23,623 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:43:23,623 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] [2019-01-13 03:43:23,624 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:43:23,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:43:23,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1580114270, now seen corresponding path program 1 times [2019-01-13 03:43:23,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:43:23,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:43:23,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:23,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:43:23,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:23,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:43:23,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:43:23,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:43:23,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 03:43:23,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 03:43:23,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 03:43:23,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 03:43:23,744 INFO L87 Difference]: Start difference. First operand 15967 states and 48937 transitions. Second operand 3 states. [2019-01-13 03:43:24,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:43:24,151 INFO L93 Difference]: Finished difference Result 16435 states and 50215 transitions. [2019-01-13 03:43:24,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 03:43:24,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-01-13 03:43:24,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:43:24,181 INFO L225 Difference]: With dead ends: 16435 [2019-01-13 03:43:24,181 INFO L226 Difference]: Without dead ends: 16435 [2019-01-13 03:43:24,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 03:43:24,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16435 states. [2019-01-13 03:43:24,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16435 to 16201. [2019-01-13 03:43:24,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16201 states. [2019-01-13 03:43:24,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16201 states to 16201 states and 49549 transitions. [2019-01-13 03:43:24,414 INFO L78 Accepts]: Start accepts. Automaton has 16201 states and 49549 transitions. Word has length 66 [2019-01-13 03:43:24,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:43:24,415 INFO L480 AbstractCegarLoop]: Abstraction has 16201 states and 49549 transitions. [2019-01-13 03:43:24,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 03:43:24,415 INFO L276 IsEmpty]: Start isEmpty. Operand 16201 states and 49549 transitions. [2019-01-13 03:43:24,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-13 03:43:24,430 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:43:24,431 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] [2019-01-13 03:43:24,431 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:43:24,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:43:24,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1496622296, now seen corresponding path program 1 times [2019-01-13 03:43:24,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:43:24,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:43:24,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:24,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:43:24,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:24,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:43:24,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:43:24,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:43:24,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:43:24,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:43:24,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:43:24,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:43:24,653 INFO L87 Difference]: Start difference. First operand 16201 states and 49549 transitions. Second operand 6 states. [2019-01-13 03:43:25,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:43:25,663 INFO L93 Difference]: Finished difference Result 19533 states and 58786 transitions. [2019-01-13 03:43:25,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:43:25,664 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-01-13 03:43:25,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:43:25,696 INFO L225 Difference]: With dead ends: 19533 [2019-01-13 03:43:25,696 INFO L226 Difference]: Without dead ends: 19533 [2019-01-13 03:43:25,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:43:25,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19533 states. [2019-01-13 03:43:25,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19533 to 18145. [2019-01-13 03:43:25,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18145 states. [2019-01-13 03:43:25,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18145 states to 18145 states and 54956 transitions. [2019-01-13 03:43:25,957 INFO L78 Accepts]: Start accepts. Automaton has 18145 states and 54956 transitions. Word has length 68 [2019-01-13 03:43:25,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:43:25,957 INFO L480 AbstractCegarLoop]: Abstraction has 18145 states and 54956 transitions. [2019-01-13 03:43:25,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:43:25,957 INFO L276 IsEmpty]: Start isEmpty. Operand 18145 states and 54956 transitions. [2019-01-13 03:43:25,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-13 03:43:25,970 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:43:25,971 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] [2019-01-13 03:43:25,971 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:43:25,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:43:25,971 INFO L82 PathProgramCache]: Analyzing trace with hash 721135657, now seen corresponding path program 1 times [2019-01-13 03:43:25,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:43:25,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:43:25,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:25,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:43:25,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:25,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:43:26,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:43:26,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:43:26,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:43:26,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:43:26,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:43:26,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:43:26,120 INFO L87 Difference]: Start difference. First operand 18145 states and 54956 transitions. Second operand 6 states. [2019-01-13 03:43:26,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:43:26,528 INFO L93 Difference]: Finished difference Result 19926 states and 59453 transitions. [2019-01-13 03:43:26,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 03:43:26,529 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-01-13 03:43:26,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:43:26,562 INFO L225 Difference]: With dead ends: 19926 [2019-01-13 03:43:26,562 INFO L226 Difference]: Without dead ends: 19926 [2019-01-13 03:43:26,562 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-13 03:43:26,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19926 states. [2019-01-13 03:43:26,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19926 to 18237. [2019-01-13 03:43:26,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18237 states. [2019-01-13 03:43:26,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18237 states to 18237 states and 54811 transitions. [2019-01-13 03:43:26,827 INFO L78 Accepts]: Start accepts. Automaton has 18237 states and 54811 transitions. Word has length 68 [2019-01-13 03:43:26,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:43:26,828 INFO L480 AbstractCegarLoop]: Abstraction has 18237 states and 54811 transitions. [2019-01-13 03:43:26,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:43:26,828 INFO L276 IsEmpty]: Start isEmpty. Operand 18237 states and 54811 transitions. [2019-01-13 03:43:26,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-13 03:43:26,840 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:43:26,840 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] [2019-01-13 03:43:26,841 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:43:26,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:43:26,841 INFO L82 PathProgramCache]: Analyzing trace with hash 932486570, now seen corresponding path program 1 times [2019-01-13 03:43:26,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:43:26,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:43:26,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:26,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:43:26,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:26,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:43:27,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:43:27,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:43:27,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:43:27,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:43:27,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:43:27,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:43:27,054 INFO L87 Difference]: Start difference. First operand 18237 states and 54811 transitions. Second operand 5 states. [2019-01-13 03:43:27,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:43:27,475 INFO L93 Difference]: Finished difference Result 22525 states and 67154 transitions. [2019-01-13 03:43:27,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:43:27,476 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-01-13 03:43:27,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:43:27,512 INFO L225 Difference]: With dead ends: 22525 [2019-01-13 03:43:27,513 INFO L226 Difference]: Without dead ends: 22525 [2019-01-13 03:43:27,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:43:27,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22525 states. [2019-01-13 03:43:27,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22525 to 19323. [2019-01-13 03:43:27,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19323 states. [2019-01-13 03:43:27,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19323 states to 19323 states and 57570 transitions. [2019-01-13 03:43:27,818 INFO L78 Accepts]: Start accepts. Automaton has 19323 states and 57570 transitions. Word has length 68 [2019-01-13 03:43:27,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:43:27,819 INFO L480 AbstractCegarLoop]: Abstraction has 19323 states and 57570 transitions. [2019-01-13 03:43:27,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:43:27,819 INFO L276 IsEmpty]: Start isEmpty. Operand 19323 states and 57570 transitions. [2019-01-13 03:43:27,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-13 03:43:27,833 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:43:27,833 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] [2019-01-13 03:43:27,834 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:43:27,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:43:27,834 INFO L82 PathProgramCache]: Analyzing trace with hash 421952393, now seen corresponding path program 1 times [2019-01-13 03:43:27,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:43:27,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:43:27,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:27,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:43:27,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:27,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:43:27,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:43:27,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:43:27,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:43:27,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:43:27,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:43:27,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:43:27,959 INFO L87 Difference]: Start difference. First operand 19323 states and 57570 transitions. Second operand 5 states. [2019-01-13 03:43:28,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:43:28,503 INFO L93 Difference]: Finished difference Result 27944 states and 82376 transitions. [2019-01-13 03:43:28,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:43:28,504 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-01-13 03:43:28,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:43:28,553 INFO L225 Difference]: With dead ends: 27944 [2019-01-13 03:43:28,554 INFO L226 Difference]: Without dead ends: 27944 [2019-01-13 03:43:28,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:43:28,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27944 states. [2019-01-13 03:43:28,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27944 to 22126. [2019-01-13 03:43:28,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22126 states. [2019-01-13 03:43:28,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22126 states to 22126 states and 65535 transitions. [2019-01-13 03:43:28,939 INFO L78 Accepts]: Start accepts. Automaton has 22126 states and 65535 transitions. Word has length 68 [2019-01-13 03:43:28,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:43:28,940 INFO L480 AbstractCegarLoop]: Abstraction has 22126 states and 65535 transitions. [2019-01-13 03:43:28,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:43:28,940 INFO L276 IsEmpty]: Start isEmpty. Operand 22126 states and 65535 transitions. [2019-01-13 03:43:28,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-13 03:43:28,956 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:43:28,956 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] [2019-01-13 03:43:28,957 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:43:28,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:43:28,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1385502070, now seen corresponding path program 1 times [2019-01-13 03:43:28,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:43:28,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:43:28,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:28,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:43:28,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:28,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:43:29,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:43:29,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:43:29,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:43:29,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:43:29,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:43:29,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:43:29,178 INFO L87 Difference]: Start difference. First operand 22126 states and 65535 transitions. Second operand 6 states. [2019-01-13 03:43:30,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:43:30,159 INFO L93 Difference]: Finished difference Result 35126 states and 103809 transitions. [2019-01-13 03:43:30,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:43:30,160 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-01-13 03:43:30,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:43:30,220 INFO L225 Difference]: With dead ends: 35126 [2019-01-13 03:43:30,220 INFO L226 Difference]: Without dead ends: 35126 [2019-01-13 03:43:30,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:43:30,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35126 states. [2019-01-13 03:43:30,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35126 to 27938. [2019-01-13 03:43:30,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27938 states. [2019-01-13 03:43:30,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27938 states to 27938 states and 83546 transitions. [2019-01-13 03:43:30,864 INFO L78 Accepts]: Start accepts. Automaton has 27938 states and 83546 transitions. Word has length 68 [2019-01-13 03:43:30,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:43:30,864 INFO L480 AbstractCegarLoop]: Abstraction has 27938 states and 83546 transitions. [2019-01-13 03:43:30,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:43:30,864 INFO L276 IsEmpty]: Start isEmpty. Operand 27938 states and 83546 transitions. [2019-01-13 03:43:30,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-13 03:43:30,889 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:43:30,890 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] [2019-01-13 03:43:30,890 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:43:30,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:43:30,890 INFO L82 PathProgramCache]: Analyzing trace with hash -497998389, now seen corresponding path program 1 times [2019-01-13 03:43:30,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:43:30,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:43:30,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:30,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:43:30,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:30,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:43:31,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:43:31,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:43:31,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:43:31,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:43:31,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:43:31,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:43:31,169 INFO L87 Difference]: Start difference. First operand 27938 states and 83546 transitions. Second operand 4 states. [2019-01-13 03:43:31,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:43:31,794 INFO L93 Difference]: Finished difference Result 30414 states and 90227 transitions. [2019-01-13 03:43:31,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 03:43:31,795 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-01-13 03:43:31,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:43:31,846 INFO L225 Difference]: With dead ends: 30414 [2019-01-13 03:43:31,846 INFO L226 Difference]: Without dead ends: 29906 [2019-01-13 03:43:31,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:43:31,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29906 states. [2019-01-13 03:43:32,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29906 to 27610. [2019-01-13 03:43:32,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27610 states. [2019-01-13 03:43:32,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27610 states to 27610 states and 82079 transitions. [2019-01-13 03:43:32,280 INFO L78 Accepts]: Start accepts. Automaton has 27610 states and 82079 transitions. Word has length 68 [2019-01-13 03:43:32,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:43:32,280 INFO L480 AbstractCegarLoop]: Abstraction has 27610 states and 82079 transitions. [2019-01-13 03:43:32,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:43:32,281 INFO L276 IsEmpty]: Start isEmpty. Operand 27610 states and 82079 transitions. [2019-01-13 03:43:32,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-13 03:43:32,299 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:43:32,300 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] [2019-01-13 03:43:32,300 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:43:32,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:43:32,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1112513867, now seen corresponding path program 1 times [2019-01-13 03:43:32,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:43:32,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:43:32,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:32,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:43:32,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:32,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:43:32,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:43:32,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:43:32,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-13 03:43:32,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 03:43:32,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 03:43:32,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-13 03:43:32,535 INFO L87 Difference]: Start difference. First operand 27610 states and 82079 transitions. Second operand 9 states. [2019-01-13 03:43:34,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:43:34,482 INFO L93 Difference]: Finished difference Result 34850 states and 102928 transitions. [2019-01-13 03:43:34,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 03:43:34,483 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2019-01-13 03:43:34,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:43:34,539 INFO L225 Difference]: With dead ends: 34850 [2019-01-13 03:43:34,540 INFO L226 Difference]: Without dead ends: 34850 [2019-01-13 03:43:34,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-01-13 03:43:34,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34850 states. [2019-01-13 03:43:34,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34850 to 29288. [2019-01-13 03:43:34,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29288 states. [2019-01-13 03:43:35,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29288 states to 29288 states and 87100 transitions. [2019-01-13 03:43:35,004 INFO L78 Accepts]: Start accepts. Automaton has 29288 states and 87100 transitions. Word has length 68 [2019-01-13 03:43:35,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:43:35,005 INFO L480 AbstractCegarLoop]: Abstraction has 29288 states and 87100 transitions. [2019-01-13 03:43:35,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 03:43:35,005 INFO L276 IsEmpty]: Start isEmpty. Operand 29288 states and 87100 transitions. [2019-01-13 03:43:35,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-13 03:43:35,022 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:43:35,023 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] [2019-01-13 03:43:35,023 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:43:35,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:43:35,023 INFO L82 PathProgramCache]: Analyzing trace with hash 2000017548, now seen corresponding path program 1 times [2019-01-13 03:43:35,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:43:35,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:43:35,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:35,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:43:35,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:35,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:43:35,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:43:35,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:43:35,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:43:35,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:43:35,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:43:35,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:43:35,258 INFO L87 Difference]: Start difference. First operand 29288 states and 87100 transitions. Second operand 5 states. [2019-01-13 03:43:35,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:43:35,321 INFO L93 Difference]: Finished difference Result 7664 states and 18502 transitions. [2019-01-13 03:43:35,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 03:43:35,322 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-01-13 03:43:35,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:43:35,329 INFO L225 Difference]: With dead ends: 7664 [2019-01-13 03:43:35,329 INFO L226 Difference]: Without dead ends: 5913 [2019-01-13 03:43:35,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:43:35,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5913 states. [2019-01-13 03:43:35,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5913 to 4971. [2019-01-13 03:43:35,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4971 states. [2019-01-13 03:43:35,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4971 states to 4971 states and 11771 transitions. [2019-01-13 03:43:35,386 INFO L78 Accepts]: Start accepts. Automaton has 4971 states and 11771 transitions. Word has length 68 [2019-01-13 03:43:35,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:43:35,386 INFO L480 AbstractCegarLoop]: Abstraction has 4971 states and 11771 transitions. [2019-01-13 03:43:35,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:43:35,386 INFO L276 IsEmpty]: Start isEmpty. Operand 4971 states and 11771 transitions. [2019-01-13 03:43:35,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-13 03:43:35,392 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:43:35,392 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] [2019-01-13 03:43:35,392 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:43:35,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:43:35,393 INFO L82 PathProgramCache]: Analyzing trace with hash -150323517, now seen corresponding path program 1 times [2019-01-13 03:43:35,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:43:35,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:43:35,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:35,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:43:35,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:35,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:43:35,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:43:35,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:43:35,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:43:35,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:43:35,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:43:35,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:43:35,703 INFO L87 Difference]: Start difference. First operand 4971 states and 11771 transitions. Second operand 6 states. [2019-01-13 03:43:36,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:43:36,078 INFO L93 Difference]: Finished difference Result 6778 states and 15982 transitions. [2019-01-13 03:43:36,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:43:36,079 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-01-13 03:43:36,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:43:36,088 INFO L225 Difference]: With dead ends: 6778 [2019-01-13 03:43:36,088 INFO L226 Difference]: Without dead ends: 6746 [2019-01-13 03:43:36,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:43:36,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6746 states. [2019-01-13 03:43:36,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6746 to 5276. [2019-01-13 03:43:36,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5276 states. [2019-01-13 03:43:36,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5276 states to 5276 states and 12536 transitions. [2019-01-13 03:43:36,154 INFO L78 Accepts]: Start accepts. Automaton has 5276 states and 12536 transitions. Word has length 83 [2019-01-13 03:43:36,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:43:36,154 INFO L480 AbstractCegarLoop]: Abstraction has 5276 states and 12536 transitions. [2019-01-13 03:43:36,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:43:36,154 INFO L276 IsEmpty]: Start isEmpty. Operand 5276 states and 12536 transitions. [2019-01-13 03:43:36,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-13 03:43:36,160 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:43:36,160 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:43:36,160 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:43:36,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:43:36,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1947274876, now seen corresponding path program 1 times [2019-01-13 03:43:36,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:43:36,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:43:36,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:36,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:43:36,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:36,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:43:36,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:43:36,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:43:36,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:43:36,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:43:36,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:43:36,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:43:36,473 INFO L87 Difference]: Start difference. First operand 5276 states and 12536 transitions. Second operand 7 states. [2019-01-13 03:43:37,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:43:37,172 INFO L93 Difference]: Finished difference Result 8217 states and 19889 transitions. [2019-01-13 03:43:37,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 03:43:37,173 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2019-01-13 03:43:37,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:43:37,183 INFO L225 Difference]: With dead ends: 8217 [2019-01-13 03:43:37,183 INFO L226 Difference]: Without dead ends: 8217 [2019-01-13 03:43:37,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-01-13 03:43:37,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8217 states. [2019-01-13 03:43:37,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8217 to 5921. [2019-01-13 03:43:37,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5921 states. [2019-01-13 03:43:37,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5921 states to 5921 states and 14180 transitions. [2019-01-13 03:43:37,266 INFO L78 Accepts]: Start accepts. Automaton has 5921 states and 14180 transitions. Word has length 83 [2019-01-13 03:43:37,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:43:37,267 INFO L480 AbstractCegarLoop]: Abstraction has 5921 states and 14180 transitions. [2019-01-13 03:43:37,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:43:37,267 INFO L276 IsEmpty]: Start isEmpty. Operand 5921 states and 14180 transitions. [2019-01-13 03:43:37,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-13 03:43:37,273 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:43:37,274 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] [2019-01-13 03:43:37,274 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:43:37,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:43:37,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1059771195, now seen corresponding path program 1 times [2019-01-13 03:43:37,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:43:37,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:43:37,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:37,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:43:37,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:37,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:43:37,991 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 14 [2019-01-13 03:43:37,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:43:37,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:43:37,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:43:37,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:43:38,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:43:38,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:43:38,001 INFO L87 Difference]: Start difference. First operand 5921 states and 14180 transitions. Second operand 6 states. [2019-01-13 03:43:38,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:43:38,468 INFO L93 Difference]: Finished difference Result 6595 states and 15795 transitions. [2019-01-13 03:43:38,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:43:38,470 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-01-13 03:43:38,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:43:38,478 INFO L225 Difference]: With dead ends: 6595 [2019-01-13 03:43:38,478 INFO L226 Difference]: Without dead ends: 6595 [2019-01-13 03:43:38,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-01-13 03:43:38,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6595 states. [2019-01-13 03:43:38,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6595 to 5382. [2019-01-13 03:43:38,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5382 states. [2019-01-13 03:43:38,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5382 states to 5382 states and 12786 transitions. [2019-01-13 03:43:38,542 INFO L78 Accepts]: Start accepts. Automaton has 5382 states and 12786 transitions. Word has length 83 [2019-01-13 03:43:38,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:43:38,543 INFO L480 AbstractCegarLoop]: Abstraction has 5382 states and 12786 transitions. [2019-01-13 03:43:38,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:43:38,543 INFO L276 IsEmpty]: Start isEmpty. Operand 5382 states and 12786 transitions. [2019-01-13 03:43:38,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-13 03:43:38,549 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:43:38,549 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:43:38,549 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:43:38,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:43:38,550 INFO L82 PathProgramCache]: Analyzing trace with hash -582057176, now seen corresponding path program 1 times [2019-01-13 03:43:38,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:43:38,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:43:38,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:38,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:43:38,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:38,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:43:38,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:43:38,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:43:38,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:43:38,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:43:38,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:43:38,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:43:38,781 INFO L87 Difference]: Start difference. First operand 5382 states and 12786 transitions. Second operand 6 states. [2019-01-13 03:43:38,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:43:38,835 INFO L93 Difference]: Finished difference Result 5612 states and 13396 transitions. [2019-01-13 03:43:38,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 03:43:38,836 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-01-13 03:43:38,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:43:38,843 INFO L225 Difference]: With dead ends: 5612 [2019-01-13 03:43:38,843 INFO L226 Difference]: Without dead ends: 5612 [2019-01-13 03:43:38,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:43:38,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5612 states. [2019-01-13 03:43:38,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5612 to 4827. [2019-01-13 03:43:38,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4827 states. [2019-01-13 03:43:38,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4827 states to 4827 states and 11330 transitions. [2019-01-13 03:43:38,898 INFO L78 Accepts]: Start accepts. Automaton has 4827 states and 11330 transitions. Word has length 83 [2019-01-13 03:43:38,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:43:38,899 INFO L480 AbstractCegarLoop]: Abstraction has 4827 states and 11330 transitions. [2019-01-13 03:43:38,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:43:38,899 INFO L276 IsEmpty]: Start isEmpty. Operand 4827 states and 11330 transitions. [2019-01-13 03:43:38,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-13 03:43:38,904 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:43:38,904 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] [2019-01-13 03:43:38,905 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:43:38,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:43:38,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1980934568, now seen corresponding path program 1 times [2019-01-13 03:43:38,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:43:38,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:43:38,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:38,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:43:38,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:38,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:43:39,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:43:39,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:43:39,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:43:39,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:43:39,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:43:39,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:43:39,149 INFO L87 Difference]: Start difference. First operand 4827 states and 11330 transitions. Second operand 6 states. [2019-01-13 03:43:39,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:43:39,300 INFO L93 Difference]: Finished difference Result 4507 states and 10322 transitions. [2019-01-13 03:43:39,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:43:39,301 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-01-13 03:43:39,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:43:39,308 INFO L225 Difference]: With dead ends: 4507 [2019-01-13 03:43:39,309 INFO L226 Difference]: Without dead ends: 4507 [2019-01-13 03:43:39,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:43:39,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4507 states. [2019-01-13 03:43:39,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4507 to 2803. [2019-01-13 03:43:39,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2803 states. [2019-01-13 03:43:39,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2803 states to 2803 states and 6453 transitions. [2019-01-13 03:43:39,347 INFO L78 Accepts]: Start accepts. Automaton has 2803 states and 6453 transitions. Word has length 83 [2019-01-13 03:43:39,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:43:39,347 INFO L480 AbstractCegarLoop]: Abstraction has 2803 states and 6453 transitions. [2019-01-13 03:43:39,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:43:39,348 INFO L276 IsEmpty]: Start isEmpty. Operand 2803 states and 6453 transitions. [2019-01-13 03:43:39,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-13 03:43:39,351 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:43:39,351 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] [2019-01-13 03:43:39,351 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:43:39,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:43:39,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1696141667, now seen corresponding path program 1 times [2019-01-13 03:43:39,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:43:39,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:43:39,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:39,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:43:39,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:39,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:43:39,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:43:39,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:43:39,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:43:39,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:43:39,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:43:39,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:43:39,514 INFO L87 Difference]: Start difference. First operand 2803 states and 6453 transitions. Second operand 6 states. [2019-01-13 03:43:39,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:43:39,719 INFO L93 Difference]: Finished difference Result 3212 states and 7302 transitions. [2019-01-13 03:43:39,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:43:39,720 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2019-01-13 03:43:39,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:43:39,724 INFO L225 Difference]: With dead ends: 3212 [2019-01-13 03:43:39,724 INFO L226 Difference]: Without dead ends: 3136 [2019-01-13 03:43:39,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:43:39,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3136 states. [2019-01-13 03:43:39,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3136 to 2597. [2019-01-13 03:43:39,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2597 states. [2019-01-13 03:43:39,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2597 states to 2597 states and 5931 transitions. [2019-01-13 03:43:39,754 INFO L78 Accepts]: Start accepts. Automaton has 2597 states and 5931 transitions. Word has length 85 [2019-01-13 03:43:39,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:43:39,754 INFO L480 AbstractCegarLoop]: Abstraction has 2597 states and 5931 transitions. [2019-01-13 03:43:39,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:43:39,755 INFO L276 IsEmpty]: Start isEmpty. Operand 2597 states and 5931 transitions. [2019-01-13 03:43:39,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-13 03:43:39,758 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:43:39,758 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] [2019-01-13 03:43:39,758 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:43:39,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:43:39,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1441405122, now seen corresponding path program 1 times [2019-01-13 03:43:39,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:43:39,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:43:39,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:39,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:43:39,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:39,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:43:39,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:43:39,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:43:39,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:43:39,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:43:39,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:43:39,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:43:39,958 INFO L87 Difference]: Start difference. First operand 2597 states and 5931 transitions. Second operand 7 states. [2019-01-13 03:43:40,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:43:40,222 INFO L93 Difference]: Finished difference Result 3089 states and 7036 transitions. [2019-01-13 03:43:40,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 03:43:40,223 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2019-01-13 03:43:40,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:43:40,228 INFO L225 Difference]: With dead ends: 3089 [2019-01-13 03:43:40,228 INFO L226 Difference]: Without dead ends: 3089 [2019-01-13 03:43:40,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-01-13 03:43:40,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3089 states. [2019-01-13 03:43:40,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3089 to 2678. [2019-01-13 03:43:40,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2678 states. [2019-01-13 03:43:40,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2678 states to 2678 states and 6081 transitions. [2019-01-13 03:43:40,258 INFO L78 Accepts]: Start accepts. Automaton has 2678 states and 6081 transitions. Word has length 85 [2019-01-13 03:43:40,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:43:40,259 INFO L480 AbstractCegarLoop]: Abstraction has 2678 states and 6081 transitions. [2019-01-13 03:43:40,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:43:40,259 INFO L276 IsEmpty]: Start isEmpty. Operand 2678 states and 6081 transitions. [2019-01-13 03:43:40,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-13 03:43:40,262 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:43:40,262 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] [2019-01-13 03:43:40,263 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:43:40,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:43:40,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1966058493, now seen corresponding path program 1 times [2019-01-13 03:43:40,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:43:40,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:43:40,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:40,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:43:40,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:40,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:43:40,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:43:40,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:43:40,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:43:40,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:43:40,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:43:40,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:43:40,862 INFO L87 Difference]: Start difference. First operand 2678 states and 6081 transitions. Second operand 7 states. [2019-01-13 03:43:41,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:43:41,469 INFO L93 Difference]: Finished difference Result 4634 states and 10603 transitions. [2019-01-13 03:43:41,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:43:41,470 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2019-01-13 03:43:41,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:43:41,474 INFO L225 Difference]: With dead ends: 4634 [2019-01-13 03:43:41,474 INFO L226 Difference]: Without dead ends: 2041 [2019-01-13 03:43:41,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-01-13 03:43:41,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2041 states. [2019-01-13 03:43:41,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2041 to 2041. [2019-01-13 03:43:41,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2041 states. [2019-01-13 03:43:41,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2041 states to 2041 states and 4668 transitions. [2019-01-13 03:43:41,502 INFO L78 Accepts]: Start accepts. Automaton has 2041 states and 4668 transitions. Word has length 85 [2019-01-13 03:43:41,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:43:41,503 INFO L480 AbstractCegarLoop]: Abstraction has 2041 states and 4668 transitions. [2019-01-13 03:43:41,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:43:41,503 INFO L276 IsEmpty]: Start isEmpty. Operand 2041 states and 4668 transitions. [2019-01-13 03:43:41,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-13 03:43:41,506 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:43:41,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:43:41,507 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:43:41,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:43:41,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1464778360, now seen corresponding path program 2 times [2019-01-13 03:43:41,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:43:41,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:43:41,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:41,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:43:41,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:41,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:43:41,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:43:41,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:43:41,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 03:43:41,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 03:43:41,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 03:43:41,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:43:41,831 INFO L87 Difference]: Start difference. First operand 2041 states and 4668 transitions. Second operand 8 states. [2019-01-13 03:43:42,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:43:42,191 INFO L93 Difference]: Finished difference Result 2443 states and 5589 transitions. [2019-01-13 03:43:42,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-13 03:43:42,192 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 85 [2019-01-13 03:43:42,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:43:42,196 INFO L225 Difference]: With dead ends: 2443 [2019-01-13 03:43:42,196 INFO L226 Difference]: Without dead ends: 2419 [2019-01-13 03:43:42,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2019-01-13 03:43:42,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2419 states. [2019-01-13 03:43:42,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2419 to 2067. [2019-01-13 03:43:42,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2067 states. [2019-01-13 03:43:42,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2067 states to 2067 states and 4729 transitions. [2019-01-13 03:43:42,226 INFO L78 Accepts]: Start accepts. Automaton has 2067 states and 4729 transitions. Word has length 85 [2019-01-13 03:43:42,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:43:42,227 INFO L480 AbstractCegarLoop]: Abstraction has 2067 states and 4729 transitions. [2019-01-13 03:43:42,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 03:43:42,227 INFO L276 IsEmpty]: Start isEmpty. Operand 2067 states and 4729 transitions. [2019-01-13 03:43:42,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-13 03:43:42,230 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:43:42,230 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] [2019-01-13 03:43:42,230 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:43:42,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:43:42,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1942685255, now seen corresponding path program 2 times [2019-01-13 03:43:42,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:43:42,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:43:42,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:42,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 03:43:42,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:42,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:43:42,411 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-13 03:43:42,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:43:42,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:43:42,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-13 03:43:42,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-13 03:43:42,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-13 03:43:42,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-01-13 03:43:42,501 INFO L87 Difference]: Start difference. First operand 2067 states and 4729 transitions. Second operand 11 states. [2019-01-13 03:43:43,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:43:43,662 INFO L93 Difference]: Finished difference Result 4150 states and 9558 transitions. [2019-01-13 03:43:43,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 03:43:43,664 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 85 [2019-01-13 03:43:43,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:43:43,669 INFO L225 Difference]: With dead ends: 4150 [2019-01-13 03:43:43,669 INFO L226 Difference]: Without dead ends: 2428 [2019-01-13 03:43:43,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2019-01-13 03:43:43,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2428 states. [2019-01-13 03:43:43,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2428 to 2100. [2019-01-13 03:43:43,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2100 states. [2019-01-13 03:43:43,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 4752 transitions. [2019-01-13 03:43:43,708 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 4752 transitions. Word has length 85 [2019-01-13 03:43:43,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:43:43,709 INFO L480 AbstractCegarLoop]: Abstraction has 2100 states and 4752 transitions. [2019-01-13 03:43:43,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-13 03:43:43,709 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 4752 transitions. [2019-01-13 03:43:43,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-13 03:43:43,712 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:43:43,713 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] [2019-01-13 03:43:43,713 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:43:43,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:43:43,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1542877223, now seen corresponding path program 3 times [2019-01-13 03:43:43,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:43:43,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:43:43,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:43,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 03:43:43,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:43,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 03:43:43,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 03:43:43,818 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 03:43:44,000 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-13 03:43:44,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 03:43:44 BasicIcfg [2019-01-13 03:43:44,003 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 03:43:44,003 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 03:43:44,003 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 03:43:44,005 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 03:43:44,006 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 03:42:50" (3/4) ... [2019-01-13 03:43:44,010 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-13 03:43:44,221 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 03:43:44,222 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 03:43:44,223 INFO L168 Benchmark]: Toolchain (without parser) took 56475.25 ms. Allocated memory was 1.0 GB in the beginning and 4.5 GB in the end (delta: 3.5 GB). Free memory was 946.0 MB in the beginning and 1.7 GB in the end (delta: -718.0 MB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. [2019-01-13 03:43:44,223 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 03:43:44,224 INFO L168 Benchmark]: CACSL2BoogieTranslator took 905.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -151.3 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2019-01-13 03:43:44,228 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-13 03:43:44,228 INFO L168 Benchmark]: Boogie Preprocessor took 36.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 03:43:44,228 INFO L168 Benchmark]: RCFGBuilder took 1251.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 11.5 GB. [2019-01-13 03:43:44,229 INFO L168 Benchmark]: TraceAbstraction took 53971.72 ms. Allocated memory was 1.2 GB in the beginning and 4.5 GB in the end (delta: 3.4 GB). Free memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: -619.4 MB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. [2019-01-13 03:43:44,229 INFO L168 Benchmark]: Witness Printer took 218.26 ms. Allocated memory is still 4.5 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-01-13 03:43:44,239 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 905.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -151.3 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 85.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.96 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 1251.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 53971.72 ms. Allocated memory was 1.2 GB in the beginning and 4.5 GB in the end (delta: 3.4 GB). Free memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: -619.4 MB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. * Witness Printer took 218.26 ms. Allocated memory is still 4.5 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L678] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L679] -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] [L680] -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] [L682] -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] [L684] -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] [L685] -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] [L686] -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] [L687] -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] [L688] -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] [L689] -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] [L690] -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] [L691] -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] [L692] -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] [L693] -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] [L694] -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}] [L695] -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] [L696] -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] [L697] -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] [L698] -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] [L700] -1 int z = 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, 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, z=0] [L701] -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, z=0] [L702] -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, z=0] [L778] -1 pthread_t t1663; 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, z=0] [L779] FCALL, FORK -1 pthread_create(&t1663, ((void *)0), P0, ((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=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, z=0] [L780] -1 pthread_t t1664; 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=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, z=0] [L781] FCALL, FORK -1 pthread_create(&t1664, ((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=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, z=0] [L736] 0 y$w_buff1 = y$w_buff0 [L737] 0 y$w_buff0 = 1 [L738] 0 y$w_buff1_used = y$w_buff0_used [L739] 0 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) 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=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, z=0] [L741] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L742] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L743] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L744] 0 y$r_buff0_thd2 = (_Bool)1 [L747] 0 z = 1 [L750] 0 __unbuffered_p1_EAX = z [L753] 0 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L756] EXPR 0 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}, 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=1, 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, z=1] [L706] 1 x = 1 [L711] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L712] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L713] 1 y$flush_delayed = weak$$choice2 [L714] 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=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L715] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=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=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L756] 0 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L757] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=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=5, weak$$choice2=3, x=1, y=1, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L757] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L715] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L716] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L716] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L717] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L717] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L758] EXPR 0 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=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L758] 0 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 [L759] EXPR 0 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=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L759] 0 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L760] EXPR 0 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=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L760] 0 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 [L763] 0 __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=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L718] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=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=5, weak$$choice2=3, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L718] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L719] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=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=5, weak$$choice2=3, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L719] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L720] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=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=5, weak$$choice2=3, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L720] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L721] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=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=5, weak$$choice2=3, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L721] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L722] 1 __unbuffered_p0_EAX = y 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=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L723] EXPR 1 y$flush_delayed ? y$mem_tmp : y 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=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=3, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L723] 1 y = y$flush_delayed ? y$mem_tmp : y [L724] 1 y$flush_delayed = (_Bool)0 [L729] 1 __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=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L783] -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=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=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=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L787] 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=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=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=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L787] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L788] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=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=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L788] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L789] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=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=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L789] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L790] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=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=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L790] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L791] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=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=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L791] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L794] -1 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=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L5] 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=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L5] -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=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 200 locations, 3 error locations. UNSAFE Result, 53.7s OverallTime, 32 OverallIterations, 1 TraceHistogramMax, 27.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8537 SDtfs, 10511 SDslu, 19211 SDs, 0 SdLazy, 7669 SolverSat, 462 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 291 GetRequests, 75 SyntacticMatches, 20 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 7.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61473occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 15.9s AutomataMinimizationTime, 31 MinimizatonAttempts, 164336 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 2195 NumberOfCodeBlocks, 2195 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2079 ConstructedInterpolants, 0 QuantifiedInterpolants, 381298 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...