./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/safe029_power.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/safe029_power.oepc_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 310137b68016bca6db925b36630c05d75ac56ea2 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 05:26:35,809 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 05:26:35,811 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 05:26:35,826 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 05:26:35,827 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 05:26:35,830 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 05:26:35,832 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 05:26:35,835 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 05:26:35,836 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 05:26:35,837 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 05:26:35,841 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 05:26:35,841 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 05:26:35,842 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 05:26:35,846 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 05:26:35,849 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 05:26:35,850 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 05:26:35,851 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 05:26:35,855 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 05:26:35,861 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 05:26:35,865 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 05:26:35,867 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 05:26:35,868 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 05:26:35,872 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 05:26:35,872 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 05:26:35,873 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 05:26:35,874 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 05:26:35,875 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 05:26:35,876 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 05:26:35,878 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 05:26:35,881 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 05:26:35,881 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 05:26:35,882 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 05:26:35,883 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 05:26:35,884 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 05:26:35,885 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 05:26:35,886 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 05:26:35,886 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-13 05:26:35,914 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 05:26:35,916 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 05:26:35,921 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 05:26:35,923 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 05:26:35,923 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 05:26:35,923 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 05:26:35,923 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 05:26:35,923 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 05:26:35,924 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 05:26:35,924 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 05:26:35,924 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-13 05:26:35,924 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 05:26:35,924 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-13 05:26:35,925 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 05:26:35,926 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-13 05:26:35,927 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 05:26:35,927 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-13 05:26:35,927 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 05:26:35,927 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 05:26:35,927 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 05:26:35,928 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 05:26:35,930 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 05:26:35,930 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 05:26:35,930 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 05:26:35,931 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-13 05:26:35,931 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 05:26:35,931 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 05:26:35,931 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-13 05:26:35,931 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 -> 310137b68016bca6db925b36630c05d75ac56ea2 [2019-01-13 05:26:35,996 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 05:26:36,011 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 05:26:36,017 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 05:26:36,019 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 05:26:36,020 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 05:26:36,021 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/safe029_power.oepc_false-unreach-call.i [2019-01-13 05:26:36,087 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a29def252/82cdd0b58d8645bdb1a1d8cfabf997c8/FLAGef0be2b79 [2019-01-13 05:26:36,645 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 05:26:36,646 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/safe029_power.oepc_false-unreach-call.i [2019-01-13 05:26:36,664 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a29def252/82cdd0b58d8645bdb1a1d8cfabf997c8/FLAGef0be2b79 [2019-01-13 05:26:36,919 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a29def252/82cdd0b58d8645bdb1a1d8cfabf997c8 [2019-01-13 05:26:36,923 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 05:26:36,924 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-13 05:26:36,925 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 05:26:36,925 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 05:26:36,929 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 05:26:36,930 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 05:26:36" (1/1) ... [2019-01-13 05:26:36,934 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c433c7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:26:36, skipping insertion in model container [2019-01-13 05:26:36,935 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 05:26:36" (1/1) ... [2019-01-13 05:26:36,944 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 05:26:37,012 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 05:26:37,460 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 05:26:37,484 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 05:26:37,665 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 05:26:37,753 INFO L195 MainTranslator]: Completed translation [2019-01-13 05:26:37,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:26:37 WrapperNode [2019-01-13 05:26:37,754 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 05:26:37,754 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-13 05:26:37,755 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-13 05:26:37,755 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-13 05:26:37,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:26:37" (1/1) ... [2019-01-13 05:26:37,797 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:26:37" (1/1) ... [2019-01-13 05:26:37,839 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-13 05:26:37,840 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 05:26:37,840 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 05:26:37,840 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 05:26:37,849 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:26:37" (1/1) ... [2019-01-13 05:26:37,850 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:26:37" (1/1) ... [2019-01-13 05:26:37,855 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:26:37" (1/1) ... [2019-01-13 05:26:37,855 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:26:37" (1/1) ... [2019-01-13 05:26:37,868 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:26:37" (1/1) ... [2019-01-13 05:26:37,872 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:26:37" (1/1) ... [2019-01-13 05:26:37,875 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:26:37" (1/1) ... [2019-01-13 05:26:37,881 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 05:26:37,881 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 05:26:37,882 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 05:26:37,882 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 05:26:37,883 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:26:37" (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 05:26:37,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 05:26:37,954 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-13 05:26:37,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 05:26:37,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 05:26:37,956 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-13 05:26:37,956 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-13 05:26:37,956 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-13 05:26:37,956 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-13 05:26:37,957 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-13 05:26:37,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 05:26:37,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 05:26:37,959 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 05:26:39,078 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 05:26:39,078 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-13 05:26:39,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 05:26:39 BoogieIcfgContainer [2019-01-13 05:26:39,080 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 05:26:39,081 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 05:26:39,081 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 05:26:39,084 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 05:26:39,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 05:26:36" (1/3) ... [2019-01-13 05:26:39,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@763df29f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 05:26:39, skipping insertion in model container [2019-01-13 05:26:39,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:26:37" (2/3) ... [2019-01-13 05:26:39,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@763df29f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 05:26:39, skipping insertion in model container [2019-01-13 05:26:39,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 05:26:39" (3/3) ... [2019-01-13 05:26:39,089 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.oepc_false-unreach-call.i [2019-01-13 05:26:39,140 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,140 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,140 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,140 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,141 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,141 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,141 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,142 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,142 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,142 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,143 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,143 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,143 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,143 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,143 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,144 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,144 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,144 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,144 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,145 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,145 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,145 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,145 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,145 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,146 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,146 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,146 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,146 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,147 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,147 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,147 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,147 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,148 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,148 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,148 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,148 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,148 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,149 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,149 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,149 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,150 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,150 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,150 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,150 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,150 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,151 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,151 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,151 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,151 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,152 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,152 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,152 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,152 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,152 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,153 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,153 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,153 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,153 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,153 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,154 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,154 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,154 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,154 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,158 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,158 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,158 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,158 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,159 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,159 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,159 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,159 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,159 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:26:39,173 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-13 05:26:39,174 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 05:26:39,182 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-13 05:26:39,200 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-13 05:26:39,225 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 05:26:39,226 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 05:26:39,226 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-13 05:26:39,226 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 05:26:39,226 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 05:26:39,226 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 05:26:39,227 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 05:26:39,227 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 05:26:39,227 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 05:26:39,245 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 140places, 178 transitions [2019-01-13 05:26:41,043 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25102 states. [2019-01-13 05:26:41,045 INFO L276 IsEmpty]: Start isEmpty. Operand 25102 states. [2019-01-13 05:26:41,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-13 05:26:41,053 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:26:41,054 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:26:41,056 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:26:41,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:26:41,063 INFO L82 PathProgramCache]: Analyzing trace with hash 2024635459, now seen corresponding path program 1 times [2019-01-13 05:26:41,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:26:41,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:26:41,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:26:41,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:26:41,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:26:41,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:26:41,405 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 05:26:41,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:26:41,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 05:26:41,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 05:26:41,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 05:26:41,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 05:26:41,433 INFO L87 Difference]: Start difference. First operand 25102 states. Second operand 4 states. [2019-01-13 05:26:42,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:26:42,386 INFO L93 Difference]: Finished difference Result 45394 states and 177648 transitions. [2019-01-13 05:26:42,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 05:26:42,388 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-01-13 05:26:42,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:26:42,817 INFO L225 Difference]: With dead ends: 45394 [2019-01-13 05:26:42,817 INFO L226 Difference]: Without dead ends: 40634 [2019-01-13 05:26:42,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 05:26:43,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40634 states. [2019-01-13 05:26:44,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40634 to 23668. [2019-01-13 05:26:44,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23668 states. [2019-01-13 05:26:44,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23668 states to 23668 states and 92565 transitions. [2019-01-13 05:26:44,470 INFO L78 Accepts]: Start accepts. Automaton has 23668 states and 92565 transitions. Word has length 31 [2019-01-13 05:26:44,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:26:44,470 INFO L480 AbstractCegarLoop]: Abstraction has 23668 states and 92565 transitions. [2019-01-13 05:26:44,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 05:26:44,471 INFO L276 IsEmpty]: Start isEmpty. Operand 23668 states and 92565 transitions. [2019-01-13 05:26:44,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-13 05:26:44,482 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:26:44,482 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] [2019-01-13 05:26:44,482 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:26:44,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:26:44,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1263924681, now seen corresponding path program 1 times [2019-01-13 05:26:44,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:26:44,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:26:44,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:26:44,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:26:44,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:26:44,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:26:44,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 05:26:44,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:26:44,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 05:26:44,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 05:26:44,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 05:26:44,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 05:26:44,869 INFO L87 Difference]: Start difference. First operand 23668 states and 92565 transitions. Second operand 5 states. [2019-01-13 05:26:48,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:26:48,230 INFO L93 Difference]: Finished difference Result 64836 states and 241395 transitions. [2019-01-13 05:26:48,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 05:26:48,231 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-01-13 05:26:48,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:26:48,552 INFO L225 Difference]: With dead ends: 64836 [2019-01-13 05:26:48,553 INFO L226 Difference]: Without dead ends: 64676 [2019-01-13 05:26:48,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 05:26:48,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64676 states. [2019-01-13 05:26:50,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64676 to 37148. [2019-01-13 05:26:50,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37148 states. [2019-01-13 05:26:50,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37148 states to 37148 states and 138310 transitions. [2019-01-13 05:26:50,428 INFO L78 Accepts]: Start accepts. Automaton has 37148 states and 138310 transitions. Word has length 42 [2019-01-13 05:26:50,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:26:50,430 INFO L480 AbstractCegarLoop]: Abstraction has 37148 states and 138310 transitions. [2019-01-13 05:26:50,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 05:26:50,430 INFO L276 IsEmpty]: Start isEmpty. Operand 37148 states and 138310 transitions. [2019-01-13 05:26:50,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-13 05:26:50,435 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:26:50,435 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:26:50,435 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:26:50,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:26:50,437 INFO L82 PathProgramCache]: Analyzing trace with hash 555727520, now seen corresponding path program 1 times [2019-01-13 05:26:50,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:26:50,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:26:50,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:26:50,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:26:50,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:26:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:26:50,573 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 05:26:50,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:26:50,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 05:26:50,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 05:26:50,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 05:26:50,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 05:26:50,575 INFO L87 Difference]: Start difference. First operand 37148 states and 138310 transitions. Second operand 4 states. [2019-01-13 05:26:50,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:26:50,685 INFO L93 Difference]: Finished difference Result 12370 states and 41203 transitions. [2019-01-13 05:26:50,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 05:26:50,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-01-13 05:26:50,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:26:50,720 INFO L225 Difference]: With dead ends: 12370 [2019-01-13 05:26:50,721 INFO L226 Difference]: Without dead ends: 11849 [2019-01-13 05:26:50,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 05:26:50,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11849 states. [2019-01-13 05:26:50,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11849 to 11849. [2019-01-13 05:26:50,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11849 states. [2019-01-13 05:26:51,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11849 states to 11849 states and 39648 transitions. [2019-01-13 05:26:51,005 INFO L78 Accepts]: Start accepts. Automaton has 11849 states and 39648 transitions. Word has length 43 [2019-01-13 05:26:51,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:26:51,005 INFO L480 AbstractCegarLoop]: Abstraction has 11849 states and 39648 transitions. [2019-01-13 05:26:51,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 05:26:51,005 INFO L276 IsEmpty]: Start isEmpty. Operand 11849 states and 39648 transitions. [2019-01-13 05:26:51,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-13 05:26:51,012 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:26:51,012 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] [2019-01-13 05:26:51,013 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:26:51,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:26:51,014 INFO L82 PathProgramCache]: Analyzing trace with hash -2022717967, now seen corresponding path program 1 times [2019-01-13 05:26:51,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:26:51,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:26:51,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:26:51,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:26:51,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:26:51,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:26:51,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:26:51,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:26:51,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 05:26:51,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 05:26:51,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 05:26:51,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 05:26:51,151 INFO L87 Difference]: Start difference. First operand 11849 states and 39648 transitions. Second operand 4 states. [2019-01-13 05:26:51,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:26:51,539 INFO L93 Difference]: Finished difference Result 17025 states and 55723 transitions. [2019-01-13 05:26:51,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 05:26:51,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-01-13 05:26:51,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:26:51,578 INFO L225 Difference]: With dead ends: 17025 [2019-01-13 05:26:51,578 INFO L226 Difference]: Without dead ends: 17025 [2019-01-13 05:26:51,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 05:26:51,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17025 states. [2019-01-13 05:26:51,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17025 to 12885. [2019-01-13 05:26:51,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12885 states. [2019-01-13 05:26:51,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12885 states to 12885 states and 42750 transitions. [2019-01-13 05:26:51,934 INFO L78 Accepts]: Start accepts. Automaton has 12885 states and 42750 transitions. Word has length 56 [2019-01-13 05:26:51,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:26:51,935 INFO L480 AbstractCegarLoop]: Abstraction has 12885 states and 42750 transitions. [2019-01-13 05:26:51,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 05:26:51,935 INFO L276 IsEmpty]: Start isEmpty. Operand 12885 states and 42750 transitions. [2019-01-13 05:26:51,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-13 05:26:51,942 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:26:51,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] [2019-01-13 05:26:51,944 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:26:51,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:26:51,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1977003375, now seen corresponding path program 1 times [2019-01-13 05:26:51,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:26:51,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:26:51,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:26:51,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:26:51,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:26:51,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:26:52,140 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 05:26:52,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:26:52,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 05:26:52,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 05:26:52,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 05:26:52,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 05:26:52,142 INFO L87 Difference]: Start difference. First operand 12885 states and 42750 transitions. Second operand 4 states. [2019-01-13 05:26:53,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:26:53,109 INFO L93 Difference]: Finished difference Result 18380 states and 60007 transitions. [2019-01-13 05:26:53,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 05:26:53,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-01-13 05:26:53,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:26:53,151 INFO L225 Difference]: With dead ends: 18380 [2019-01-13 05:26:53,152 INFO L226 Difference]: Without dead ends: 18380 [2019-01-13 05:26:53,152 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 05:26:53,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18380 states. [2019-01-13 05:26:53,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18380 to 16341. [2019-01-13 05:26:53,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16341 states. [2019-01-13 05:26:53,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16341 states to 16341 states and 53832 transitions. [2019-01-13 05:26:53,883 INFO L78 Accepts]: Start accepts. Automaton has 16341 states and 53832 transitions. Word has length 56 [2019-01-13 05:26:53,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:26:53,883 INFO L480 AbstractCegarLoop]: Abstraction has 16341 states and 53832 transitions. [2019-01-13 05:26:53,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 05:26:53,884 INFO L276 IsEmpty]: Start isEmpty. Operand 16341 states and 53832 transitions. [2019-01-13 05:26:53,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-13 05:26:53,893 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:26:53,893 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] [2019-01-13 05:26:53,894 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:26:53,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:26:53,894 INFO L82 PathProgramCache]: Analyzing trace with hash -964654224, now seen corresponding path program 1 times [2019-01-13 05:26:53,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:26:53,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:26:53,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:26:53,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:26:53,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:26:53,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:26:54,213 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 05:26:54,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:26:54,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 05:26:54,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 05:26:54,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 05:26:54,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:26:54,216 INFO L87 Difference]: Start difference. First operand 16341 states and 53832 transitions. Second operand 6 states. [2019-01-13 05:26:54,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:26:54,828 INFO L93 Difference]: Finished difference Result 17857 states and 58003 transitions. [2019-01-13 05:26:54,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 05:26:54,829 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-01-13 05:26:54,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:26:54,861 INFO L225 Difference]: With dead ends: 17857 [2019-01-13 05:26:54,861 INFO L226 Difference]: Without dead ends: 17857 [2019-01-13 05:26:54,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-13 05:26:54,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17857 states. [2019-01-13 05:26:55,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17857 to 16903. [2019-01-13 05:26:55,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16903 states. [2019-01-13 05:26:55,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16903 states to 16903 states and 55361 transitions. [2019-01-13 05:26:55,147 INFO L78 Accepts]: Start accepts. Automaton has 16903 states and 55361 transitions. Word has length 56 [2019-01-13 05:26:55,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:26:55,147 INFO L480 AbstractCegarLoop]: Abstraction has 16903 states and 55361 transitions. [2019-01-13 05:26:55,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 05:26:55,147 INFO L276 IsEmpty]: Start isEmpty. Operand 16903 states and 55361 transitions. [2019-01-13 05:26:55,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-13 05:26:55,155 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:26:55,155 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] [2019-01-13 05:26:55,156 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:26:55,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:26:55,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1258057231, now seen corresponding path program 1 times [2019-01-13 05:26:55,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:26:55,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:26:55,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:26:55,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:26:55,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:26:55,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:26:55,547 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 05:26:55,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:26:55,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 05:26:55,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 05:26:55,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 05:26:55,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:26:55,548 INFO L87 Difference]: Start difference. First operand 16903 states and 55361 transitions. Second operand 6 states. [2019-01-13 05:26:56,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:26:56,417 INFO L93 Difference]: Finished difference Result 23475 states and 75946 transitions. [2019-01-13 05:26:56,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 05:26:56,417 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-01-13 05:26:56,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:26:56,461 INFO L225 Difference]: With dead ends: 23475 [2019-01-13 05:26:56,461 INFO L226 Difference]: Without dead ends: 23443 [2019-01-13 05:26:56,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-01-13 05:26:56,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23443 states. [2019-01-13 05:26:56,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23443 to 18807. [2019-01-13 05:26:56,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18807 states. [2019-01-13 05:26:57,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18807 states to 18807 states and 61305 transitions. [2019-01-13 05:26:57,304 INFO L78 Accepts]: Start accepts. Automaton has 18807 states and 61305 transitions. Word has length 56 [2019-01-13 05:26:57,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:26:57,304 INFO L480 AbstractCegarLoop]: Abstraction has 18807 states and 61305 transitions. [2019-01-13 05:26:57,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 05:26:57,305 INFO L276 IsEmpty]: Start isEmpty. Operand 18807 states and 61305 transitions. [2019-01-13 05:26:57,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-13 05:26:57,327 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:26:57,327 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] [2019-01-13 05:26:57,327 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:26:57,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:26:57,328 INFO L82 PathProgramCache]: Analyzing trace with hash -2076609247, now seen corresponding path program 1 times [2019-01-13 05:26:57,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:26:57,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:26:57,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:26:57,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:26:57,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:26:57,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:26:57,622 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 05:26:57,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:26:57,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 05:26:57,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 05:26:57,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 05:26:57,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:26:57,624 INFO L87 Difference]: Start difference. First operand 18807 states and 61305 transitions. Second operand 7 states. [2019-01-13 05:26:59,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:26:59,028 INFO L93 Difference]: Finished difference Result 24535 states and 79153 transitions. [2019-01-13 05:26:59,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-13 05:26:59,029 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2019-01-13 05:26:59,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:26:59,075 INFO L225 Difference]: With dead ends: 24535 [2019-01-13 05:26:59,075 INFO L226 Difference]: Without dead ends: 24471 [2019-01-13 05:26:59,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-01-13 05:26:59,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24471 states. [2019-01-13 05:26:59,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24471 to 20899. [2019-01-13 05:26:59,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20899 states. [2019-01-13 05:26:59,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20899 states to 20899 states and 67710 transitions. [2019-01-13 05:26:59,423 INFO L78 Accepts]: Start accepts. Automaton has 20899 states and 67710 transitions. Word has length 70 [2019-01-13 05:26:59,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:26:59,424 INFO L480 AbstractCegarLoop]: Abstraction has 20899 states and 67710 transitions. [2019-01-13 05:26:59,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 05:26:59,424 INFO L276 IsEmpty]: Start isEmpty. Operand 20899 states and 67710 transitions. [2019-01-13 05:26:59,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-13 05:26:59,449 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:26:59,449 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] [2019-01-13 05:26:59,450 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:26:59,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:26:59,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1643744653, now seen corresponding path program 1 times [2019-01-13 05:26:59,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:26:59,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:26:59,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:26:59,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:26:59,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:26:59,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:26:59,539 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 05:26:59,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:26:59,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 05:26:59,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 05:26:59,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 05:26:59,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 05:26:59,540 INFO L87 Difference]: Start difference. First operand 20899 states and 67710 transitions. Second operand 3 states. [2019-01-13 05:26:59,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:26:59,767 INFO L93 Difference]: Finished difference Result 24947 states and 79522 transitions. [2019-01-13 05:26:59,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 05:26:59,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-01-13 05:26:59,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:26:59,812 INFO L225 Difference]: With dead ends: 24947 [2019-01-13 05:26:59,812 INFO L226 Difference]: Without dead ends: 24947 [2019-01-13 05:26:59,813 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 05:26:59,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24947 states. [2019-01-13 05:27:00,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24947 to 22467. [2019-01-13 05:27:00,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22467 states. [2019-01-13 05:27:00,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22467 states to 22467 states and 72190 transitions. [2019-01-13 05:27:00,182 INFO L78 Accepts]: Start accepts. Automaton has 22467 states and 72190 transitions. Word has length 72 [2019-01-13 05:27:00,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:00,183 INFO L480 AbstractCegarLoop]: Abstraction has 22467 states and 72190 transitions. [2019-01-13 05:27:00,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 05:27:00,183 INFO L276 IsEmpty]: Start isEmpty. Operand 22467 states and 72190 transitions. [2019-01-13 05:27:00,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-13 05:27:00,211 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:00,212 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] [2019-01-13 05:27:00,212 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:00,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:00,212 INFO L82 PathProgramCache]: Analyzing trace with hash -671189007, now seen corresponding path program 1 times [2019-01-13 05:27:00,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:00,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:00,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:00,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:00,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:00,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:00,469 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 05:27:00,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:00,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 05:27:00,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 05:27:00,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 05:27:00,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 05:27:00,472 INFO L87 Difference]: Start difference. First operand 22467 states and 72190 transitions. Second operand 4 states. [2019-01-13 05:27:01,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:01,109 INFO L93 Difference]: Finished difference Result 34667 states and 110116 transitions. [2019-01-13 05:27:01,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 05:27:01,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-01-13 05:27:01,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:01,173 INFO L225 Difference]: With dead ends: 34667 [2019-01-13 05:27:01,173 INFO L226 Difference]: Without dead ends: 34471 [2019-01-13 05:27:01,174 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 05:27:01,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34471 states. [2019-01-13 05:27:01,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34471 to 29099. [2019-01-13 05:27:01,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29099 states. [2019-01-13 05:27:01,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29099 states to 29099 states and 93336 transitions. [2019-01-13 05:27:01,753 INFO L78 Accepts]: Start accepts. Automaton has 29099 states and 93336 transitions. Word has length 76 [2019-01-13 05:27:01,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:01,754 INFO L480 AbstractCegarLoop]: Abstraction has 29099 states and 93336 transitions. [2019-01-13 05:27:01,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 05:27:01,754 INFO L276 IsEmpty]: Start isEmpty. Operand 29099 states and 93336 transitions. [2019-01-13 05:27:01,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-13 05:27:01,793 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:01,793 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] [2019-01-13 05:27:01,794 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:01,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:01,794 INFO L82 PathProgramCache]: Analyzing trace with hash 573575474, now seen corresponding path program 1 times [2019-01-13 05:27:01,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:01,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:01,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:01,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:01,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:01,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:02,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 05:27:02,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:02,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 05:27:02,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 05:27:02,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 05:27:02,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:27:02,177 INFO L87 Difference]: Start difference. First operand 29099 states and 93336 transitions. Second operand 6 states. [2019-01-13 05:27:03,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:03,660 INFO L93 Difference]: Finished difference Result 52152 states and 164833 transitions. [2019-01-13 05:27:03,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 05:27:03,660 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2019-01-13 05:27:03,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:03,762 INFO L225 Difference]: With dead ends: 52152 [2019-01-13 05:27:03,762 INFO L226 Difference]: Without dead ends: 51912 [2019-01-13 05:27:03,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-01-13 05:27:03,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51912 states. [2019-01-13 05:27:04,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51912 to 43712. [2019-01-13 05:27:04,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43712 states. [2019-01-13 05:27:04,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43712 states to 43712 states and 140003 transitions. [2019-01-13 05:27:04,508 INFO L78 Accepts]: Start accepts. Automaton has 43712 states and 140003 transitions. Word has length 76 [2019-01-13 05:27:04,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:04,508 INFO L480 AbstractCegarLoop]: Abstraction has 43712 states and 140003 transitions. [2019-01-13 05:27:04,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 05:27:04,508 INFO L276 IsEmpty]: Start isEmpty. Operand 43712 states and 140003 transitions. [2019-01-13 05:27:04,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-13 05:27:04,554 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:04,554 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:27:04,555 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:04,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:04,555 INFO L82 PathProgramCache]: Analyzing trace with hash -270896397, now seen corresponding path program 1 times [2019-01-13 05:27:04,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:04,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:04,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:04,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:04,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:04,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:04,747 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 05:27:04,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:04,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 05:27:04,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 05:27:04,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 05:27:04,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 05:27:04,749 INFO L87 Difference]: Start difference. First operand 43712 states and 140003 transitions. Second operand 5 states. [2019-01-13 05:27:04,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:04,796 INFO L93 Difference]: Finished difference Result 5456 states and 14431 transitions. [2019-01-13 05:27:04,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 05:27:04,797 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-01-13 05:27:04,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:04,803 INFO L225 Difference]: With dead ends: 5456 [2019-01-13 05:27:04,803 INFO L226 Difference]: Without dead ends: 4832 [2019-01-13 05:27:04,804 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 05:27:04,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4832 states. [2019-01-13 05:27:04,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4832 to 4684. [2019-01-13 05:27:04,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4684 states. [2019-01-13 05:27:04,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4684 states to 4684 states and 12409 transitions. [2019-01-13 05:27:04,855 INFO L78 Accepts]: Start accepts. Automaton has 4684 states and 12409 transitions. Word has length 76 [2019-01-13 05:27:04,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:04,855 INFO L480 AbstractCegarLoop]: Abstraction has 4684 states and 12409 transitions. [2019-01-13 05:27:04,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 05:27:04,855 INFO L276 IsEmpty]: Start isEmpty. Operand 4684 states and 12409 transitions. [2019-01-13 05:27:04,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-13 05:27:04,861 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:04,861 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:27:04,861 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:04,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:04,862 INFO L82 PathProgramCache]: Analyzing trace with hash 127044203, now seen corresponding path program 1 times [2019-01-13 05:27:04,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:04,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:04,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:04,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:04,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:04,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:05,077 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 05:27:05,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:05,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 05:27:05,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 05:27:05,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 05:27:05,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 05:27:05,078 INFO L87 Difference]: Start difference. First operand 4684 states and 12409 transitions. Second operand 5 states. [2019-01-13 05:27:05,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:05,369 INFO L93 Difference]: Finished difference Result 5468 states and 14247 transitions. [2019-01-13 05:27:05,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 05:27:05,370 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-01-13 05:27:05,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:05,378 INFO L225 Difference]: With dead ends: 5468 [2019-01-13 05:27:05,378 INFO L226 Difference]: Without dead ends: 5440 [2019-01-13 05:27:05,379 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 05:27:05,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5440 states. [2019-01-13 05:27:05,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5440 to 5316. [2019-01-13 05:27:05,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5316 states. [2019-01-13 05:27:05,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5316 states to 5316 states and 13901 transitions. [2019-01-13 05:27:05,441 INFO L78 Accepts]: Start accepts. Automaton has 5316 states and 13901 transitions. Word has length 89 [2019-01-13 05:27:05,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:05,442 INFO L480 AbstractCegarLoop]: Abstraction has 5316 states and 13901 transitions. [2019-01-13 05:27:05,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 05:27:05,442 INFO L276 IsEmpty]: Start isEmpty. Operand 5316 states and 13901 transitions. [2019-01-13 05:27:05,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-13 05:27:05,448 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:05,448 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:27:05,448 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:05,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:05,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1765089868, now seen corresponding path program 1 times [2019-01-13 05:27:05,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:05,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:05,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:05,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:05,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:05,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:05,539 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 05:27:05,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:05,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 05:27:05,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 05:27:05,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 05:27:05,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 05:27:05,542 INFO L87 Difference]: Start difference. First operand 5316 states and 13901 transitions. Second operand 3 states. [2019-01-13 05:27:05,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:05,745 INFO L93 Difference]: Finished difference Result 5440 states and 14174 transitions. [2019-01-13 05:27:05,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 05:27:05,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-01-13 05:27:05,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:05,755 INFO L225 Difference]: With dead ends: 5440 [2019-01-13 05:27:05,755 INFO L226 Difference]: Without dead ends: 5440 [2019-01-13 05:27:05,756 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 05:27:05,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5440 states. [2019-01-13 05:27:05,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5440 to 5384. [2019-01-13 05:27:05,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5384 states. [2019-01-13 05:27:05,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5384 states to 5384 states and 14051 transitions. [2019-01-13 05:27:05,814 INFO L78 Accepts]: Start accepts. Automaton has 5384 states and 14051 transitions. Word has length 89 [2019-01-13 05:27:05,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:05,815 INFO L480 AbstractCegarLoop]: Abstraction has 5384 states and 14051 transitions. [2019-01-13 05:27:05,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 05:27:05,815 INFO L276 IsEmpty]: Start isEmpty. Operand 5384 states and 14051 transitions. [2019-01-13 05:27:05,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 05:27:05,823 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:05,823 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:27:05,823 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:05,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:05,824 INFO L82 PathProgramCache]: Analyzing trace with hash -602105678, now seen corresponding path program 1 times [2019-01-13 05:27:05,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:05,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:05,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:05,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:05,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:05,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:06,231 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 05:27:06,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:06,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 05:27:06,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 05:27:06,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 05:27:06,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-13 05:27:06,232 INFO L87 Difference]: Start difference. First operand 5384 states and 14051 transitions. Second operand 5 states. [2019-01-13 05:27:06,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:06,919 INFO L93 Difference]: Finished difference Result 5683 states and 14775 transitions. [2019-01-13 05:27:06,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 05:27:06,921 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-01-13 05:27:06,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:06,929 INFO L225 Difference]: With dead ends: 5683 [2019-01-13 05:27:06,929 INFO L226 Difference]: Without dead ends: 5683 [2019-01-13 05:27:06,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-13 05:27:06,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5683 states. [2019-01-13 05:27:06,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5683 to 5398. [2019-01-13 05:27:06,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5398 states. [2019-01-13 05:27:06,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5398 states to 5398 states and 14084 transitions. [2019-01-13 05:27:06,991 INFO L78 Accepts]: Start accepts. Automaton has 5398 states and 14084 transitions. Word has length 91 [2019-01-13 05:27:06,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:06,991 INFO L480 AbstractCegarLoop]: Abstraction has 5398 states and 14084 transitions. [2019-01-13 05:27:06,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 05:27:06,992 INFO L276 IsEmpty]: Start isEmpty. Operand 5398 states and 14084 transitions. [2019-01-13 05:27:06,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 05:27:06,997 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:06,997 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:27:06,998 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:06,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:06,998 INFO L82 PathProgramCache]: Analyzing trace with hash 531084915, now seen corresponding path program 1 times [2019-01-13 05:27:06,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:06,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:07,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:07,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:07,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:07,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:07,110 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 05:27:07,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:07,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 05:27:07,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 05:27:07,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 05:27:07,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 05:27:07,111 INFO L87 Difference]: Start difference. First operand 5398 states and 14084 transitions. Second operand 4 states. [2019-01-13 05:27:07,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:07,458 INFO L93 Difference]: Finished difference Result 11568 states and 30967 transitions. [2019-01-13 05:27:07,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 05:27:07,459 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-01-13 05:27:07,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:07,478 INFO L225 Difference]: With dead ends: 11568 [2019-01-13 05:27:07,479 INFO L226 Difference]: Without dead ends: 11519 [2019-01-13 05:27:07,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 05:27:07,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11519 states. [2019-01-13 05:27:07,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11519 to 5140. [2019-01-13 05:27:07,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5140 states. [2019-01-13 05:27:07,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5140 states to 5140 states and 13373 transitions. [2019-01-13 05:27:07,583 INFO L78 Accepts]: Start accepts. Automaton has 5140 states and 13373 transitions. Word has length 91 [2019-01-13 05:27:07,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:07,583 INFO L480 AbstractCegarLoop]: Abstraction has 5140 states and 13373 transitions. [2019-01-13 05:27:07,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 05:27:07,584 INFO L276 IsEmpty]: Start isEmpty. Operand 5140 states and 13373 transitions. [2019-01-13 05:27:07,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 05:27:07,592 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:07,593 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:27:07,593 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:07,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:07,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1618352203, now seen corresponding path program 1 times [2019-01-13 05:27:07,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:07,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:07,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:07,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:07,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:07,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:07,783 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 05:27:07,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:07,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 05:27:07,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 05:27:07,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 05:27:07,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:27:07,785 INFO L87 Difference]: Start difference. First operand 5140 states and 13373 transitions. Second operand 6 states. [2019-01-13 05:27:08,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:08,198 INFO L93 Difference]: Finished difference Result 6850 states and 17496 transitions. [2019-01-13 05:27:08,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 05:27:08,200 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-01-13 05:27:08,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:08,209 INFO L225 Difference]: With dead ends: 6850 [2019-01-13 05:27:08,210 INFO L226 Difference]: Without dead ends: 6818 [2019-01-13 05:27:08,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:27:08,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6818 states. [2019-01-13 05:27:08,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6818 to 5615. [2019-01-13 05:27:08,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5615 states. [2019-01-13 05:27:08,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5615 states to 5615 states and 14463 transitions. [2019-01-13 05:27:08,287 INFO L78 Accepts]: Start accepts. Automaton has 5615 states and 14463 transitions. Word has length 91 [2019-01-13 05:27:08,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:08,287 INFO L480 AbstractCegarLoop]: Abstraction has 5615 states and 14463 transitions. [2019-01-13 05:27:08,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 05:27:08,287 INFO L276 IsEmpty]: Start isEmpty. Operand 5615 states and 14463 transitions. [2019-01-13 05:27:08,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 05:27:08,294 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:08,294 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:27:08,294 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:08,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:08,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1901502667, now seen corresponding path program 1 times [2019-01-13 05:27:08,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:08,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:08,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:08,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:08,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:08,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:08,440 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 05:27:08,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:08,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 05:27:08,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 05:27:08,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 05:27:08,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:27:08,441 INFO L87 Difference]: Start difference. First operand 5615 states and 14463 transitions. Second operand 7 states. [2019-01-13 05:27:09,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:09,152 INFO L93 Difference]: Finished difference Result 11651 states and 30335 transitions. [2019-01-13 05:27:09,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-13 05:27:09,154 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2019-01-13 05:27:09,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:09,173 INFO L225 Difference]: With dead ends: 11651 [2019-01-13 05:27:09,173 INFO L226 Difference]: Without dead ends: 11651 [2019-01-13 05:27:09,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-01-13 05:27:09,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11651 states. [2019-01-13 05:27:09,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11651 to 6113. [2019-01-13 05:27:09,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6113 states. [2019-01-13 05:27:09,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6113 states to 6113 states and 15768 transitions. [2019-01-13 05:27:09,326 INFO L78 Accepts]: Start accepts. Automaton has 6113 states and 15768 transitions. Word has length 91 [2019-01-13 05:27:09,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:09,327 INFO L480 AbstractCegarLoop]: Abstraction has 6113 states and 15768 transitions. [2019-01-13 05:27:09,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 05:27:09,327 INFO L276 IsEmpty]: Start isEmpty. Operand 6113 states and 15768 transitions. [2019-01-13 05:27:09,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 05:27:09,333 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:09,333 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:27:09,334 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:09,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:09,334 INFO L82 PathProgramCache]: Analyzing trace with hash -656738186, now seen corresponding path program 1 times [2019-01-13 05:27:09,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:09,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:09,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:09,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:09,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:09,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:09,550 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 05:27:09,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:09,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 05:27:09,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 05:27:09,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 05:27:09,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 05:27:09,552 INFO L87 Difference]: Start difference. First operand 6113 states and 15768 transitions. Second operand 5 states. [2019-01-13 05:27:09,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:09,612 INFO L93 Difference]: Finished difference Result 9700 states and 25509 transitions. [2019-01-13 05:27:09,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 05:27:09,613 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-01-13 05:27:09,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:09,625 INFO L225 Difference]: With dead ends: 9700 [2019-01-13 05:27:09,626 INFO L226 Difference]: Without dead ends: 9700 [2019-01-13 05:27:09,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:27:09,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9700 states. [2019-01-13 05:27:09,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9700 to 5539. [2019-01-13 05:27:09,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5539 states. [2019-01-13 05:27:09,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5539 states to 5539 states and 14328 transitions. [2019-01-13 05:27:09,709 INFO L78 Accepts]: Start accepts. Automaton has 5539 states and 14328 transitions. Word has length 91 [2019-01-13 05:27:09,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:09,709 INFO L480 AbstractCegarLoop]: Abstraction has 5539 states and 14328 transitions. [2019-01-13 05:27:09,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 05:27:09,710 INFO L276 IsEmpty]: Start isEmpty. Operand 5539 states and 14328 transitions. [2019-01-13 05:27:09,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 05:27:09,716 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:09,716 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:27:09,716 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:09,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:09,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1702568823, now seen corresponding path program 1 times [2019-01-13 05:27:09,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:09,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:09,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:09,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:09,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:09,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:10,174 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 6 [2019-01-13 05:27:10,278 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 05:27:10,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:10,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 05:27:10,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 05:27:10,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 05:27:10,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:27:10,280 INFO L87 Difference]: Start difference. First operand 5539 states and 14328 transitions. Second operand 6 states. [2019-01-13 05:27:10,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:10,373 INFO L93 Difference]: Finished difference Result 8960 states and 23608 transitions. [2019-01-13 05:27:10,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 05:27:10,374 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-01-13 05:27:10,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:10,386 INFO L225 Difference]: With dead ends: 8960 [2019-01-13 05:27:10,386 INFO L226 Difference]: Without dead ends: 8960 [2019-01-13 05:27:10,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:27:10,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8960 states. [2019-01-13 05:27:10,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8960 to 5227. [2019-01-13 05:27:10,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5227 states. [2019-01-13 05:27:10,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5227 states to 5227 states and 13455 transitions. [2019-01-13 05:27:10,462 INFO L78 Accepts]: Start accepts. Automaton has 5227 states and 13455 transitions. Word has length 91 [2019-01-13 05:27:10,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:10,462 INFO L480 AbstractCegarLoop]: Abstraction has 5227 states and 13455 transitions. [2019-01-13 05:27:10,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 05:27:10,463 INFO L276 IsEmpty]: Start isEmpty. Operand 5227 states and 13455 transitions. [2019-01-13 05:27:10,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 05:27:10,468 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:10,468 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:27:10,469 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:10,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:10,470 INFO L82 PathProgramCache]: Analyzing trace with hash -2111682057, now seen corresponding path program 1 times [2019-01-13 05:27:10,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:10,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:10,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:10,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:10,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:10,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:11,081 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 9 [2019-01-13 05:27:11,097 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 05:27:11,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:11,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 05:27:11,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 05:27:11,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 05:27:11,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:27:11,102 INFO L87 Difference]: Start difference. First operand 5227 states and 13455 transitions. Second operand 6 states. [2019-01-13 05:27:11,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:11,911 INFO L93 Difference]: Finished difference Result 4523 states and 11391 transitions. [2019-01-13 05:27:11,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 05:27:11,912 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-01-13 05:27:11,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:11,919 INFO L225 Difference]: With dead ends: 4523 [2019-01-13 05:27:11,919 INFO L226 Difference]: Without dead ends: 4523 [2019-01-13 05:27:11,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-13 05:27:11,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4523 states. [2019-01-13 05:27:11,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4523 to 3659. [2019-01-13 05:27:11,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3659 states. [2019-01-13 05:27:11,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3659 states to 3659 states and 9437 transitions. [2019-01-13 05:27:11,963 INFO L78 Accepts]: Start accepts. Automaton has 3659 states and 9437 transitions. Word has length 91 [2019-01-13 05:27:11,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:11,964 INFO L480 AbstractCegarLoop]: Abstraction has 3659 states and 9437 transitions. [2019-01-13 05:27:11,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 05:27:11,964 INFO L276 IsEmpty]: Start isEmpty. Operand 3659 states and 9437 transitions. [2019-01-13 05:27:11,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 05:27:11,968 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:11,968 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:27:11,969 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:11,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:11,969 INFO L82 PathProgramCache]: Analyzing trace with hash -879974516, now seen corresponding path program 1 times [2019-01-13 05:27:11,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:11,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:11,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:11,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:11,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:11,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:12,231 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 05:27:12,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:12,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 05:27:12,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 05:27:12,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 05:27:12,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-13 05:27:12,234 INFO L87 Difference]: Start difference. First operand 3659 states and 9437 transitions. Second operand 8 states. [2019-01-13 05:27:12,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:12,811 INFO L93 Difference]: Finished difference Result 5920 states and 14721 transitions. [2019-01-13 05:27:12,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-13 05:27:12,813 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2019-01-13 05:27:12,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:12,822 INFO L225 Difference]: With dead ends: 5920 [2019-01-13 05:27:12,823 INFO L226 Difference]: Without dead ends: 5888 [2019-01-13 05:27:12,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-01-13 05:27:12,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5888 states. [2019-01-13 05:27:12,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5888 to 4271. [2019-01-13 05:27:12,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4271 states. [2019-01-13 05:27:12,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4271 states to 4271 states and 10898 transitions. [2019-01-13 05:27:12,882 INFO L78 Accepts]: Start accepts. Automaton has 4271 states and 10898 transitions. Word has length 93 [2019-01-13 05:27:12,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:12,883 INFO L480 AbstractCegarLoop]: Abstraction has 4271 states and 10898 transitions. [2019-01-13 05:27:12,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 05:27:12,883 INFO L276 IsEmpty]: Start isEmpty. Operand 4271 states and 10898 transitions. [2019-01-13 05:27:12,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 05:27:12,888 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:12,888 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:27:12,888 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:12,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:12,889 INFO L82 PathProgramCache]: Analyzing trace with hash 364789965, now seen corresponding path program 1 times [2019-01-13 05:27:12,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:12,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:12,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:12,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:12,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:12,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:13,095 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 05:27:13,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:13,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 05:27:13,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 05:27:13,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 05:27:13,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:27:13,096 INFO L87 Difference]: Start difference. First operand 4271 states and 10898 transitions. Second operand 7 states. [2019-01-13 05:27:13,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:13,303 INFO L93 Difference]: Finished difference Result 3981 states and 10019 transitions. [2019-01-13 05:27:13,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 05:27:13,304 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-01-13 05:27:13,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:13,309 INFO L225 Difference]: With dead ends: 3981 [2019-01-13 05:27:13,310 INFO L226 Difference]: Without dead ends: 3981 [2019-01-13 05:27:13,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-01-13 05:27:13,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3981 states. [2019-01-13 05:27:13,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3981 to 3690. [2019-01-13 05:27:13,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3690 states. [2019-01-13 05:27:13,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3690 states to 3690 states and 9463 transitions. [2019-01-13 05:27:13,354 INFO L78 Accepts]: Start accepts. Automaton has 3690 states and 9463 transitions. Word has length 93 [2019-01-13 05:27:13,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:13,354 INFO L480 AbstractCegarLoop]: Abstraction has 3690 states and 9463 transitions. [2019-01-13 05:27:13,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 05:27:13,354 INFO L276 IsEmpty]: Start isEmpty. Operand 3690 states and 9463 transitions. [2019-01-13 05:27:13,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 05:27:13,359 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:13,359 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:27:13,359 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:13,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:13,360 INFO L82 PathProgramCache]: Analyzing trace with hash -550208755, now seen corresponding path program 1 times [2019-01-13 05:27:13,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:13,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:13,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:13,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:13,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:13,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:13,511 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 05:27:13,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:13,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 05:27:13,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 05:27:13,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 05:27:13,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:27:13,512 INFO L87 Difference]: Start difference. First operand 3690 states and 9463 transitions. Second operand 7 states. [2019-01-13 05:27:14,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:14,625 INFO L93 Difference]: Finished difference Result 4149 states and 10417 transitions. [2019-01-13 05:27:14,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 05:27:14,626 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-01-13 05:27:14,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:14,633 INFO L225 Difference]: With dead ends: 4149 [2019-01-13 05:27:14,634 INFO L226 Difference]: Without dead ends: 4149 [2019-01-13 05:27:14,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:27:14,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4149 states. [2019-01-13 05:27:14,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4149 to 3764. [2019-01-13 05:27:14,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3764 states. [2019-01-13 05:27:14,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3764 states to 3764 states and 9602 transitions. [2019-01-13 05:27:14,700 INFO L78 Accepts]: Start accepts. Automaton has 3764 states and 9602 transitions. Word has length 93 [2019-01-13 05:27:14,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:14,700 INFO L480 AbstractCegarLoop]: Abstraction has 3764 states and 9602 transitions. [2019-01-13 05:27:14,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 05:27:14,700 INFO L276 IsEmpty]: Start isEmpty. Operand 3764 states and 9602 transitions. [2019-01-13 05:27:14,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 05:27:14,708 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:14,708 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:27:14,709 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:14,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:14,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1650479819, now seen corresponding path program 2 times [2019-01-13 05:27:14,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:14,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:14,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:14,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:14,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:14,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:15,137 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2019-01-13 05:27:15,240 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 05:27:15,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:15,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 05:27:15,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 05:27:15,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 05:27:15,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:27:15,241 INFO L87 Difference]: Start difference. First operand 3764 states and 9602 transitions. Second operand 7 states. [2019-01-13 05:27:15,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:15,384 INFO L93 Difference]: Finished difference Result 3855 states and 9744 transitions. [2019-01-13 05:27:15,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 05:27:15,385 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-01-13 05:27:15,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:15,392 INFO L225 Difference]: With dead ends: 3855 [2019-01-13 05:27:15,392 INFO L226 Difference]: Without dead ends: 3835 [2019-01-13 05:27:15,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-13 05:27:15,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3835 states. [2019-01-13 05:27:15,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3835 to 3710. [2019-01-13 05:27:15,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3710 states. [2019-01-13 05:27:15,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 9456 transitions. [2019-01-13 05:27:15,434 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 9456 transitions. Word has length 93 [2019-01-13 05:27:15,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:15,435 INFO L480 AbstractCegarLoop]: Abstraction has 3710 states and 9456 transitions. [2019-01-13 05:27:15,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 05:27:15,435 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 9456 transitions. [2019-01-13 05:27:15,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 05:27:15,439 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:15,439 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:27:15,439 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:15,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:15,440 INFO L82 PathProgramCache]: Analyzing trace with hash -285180468, now seen corresponding path program 1 times [2019-01-13 05:27:15,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:15,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:15,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:15,441 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 05:27:15,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:15,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:15,798 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 05:27:15,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:15,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 05:27:15,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 05:27:15,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 05:27:15,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 05:27:15,802 INFO L87 Difference]: Start difference. First operand 3710 states and 9456 transitions. Second operand 5 states. [2019-01-13 05:27:16,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:16,046 INFO L93 Difference]: Finished difference Result 4254 states and 10800 transitions. [2019-01-13 05:27:16,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 05:27:16,047 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-01-13 05:27:16,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:16,054 INFO L225 Difference]: With dead ends: 4254 [2019-01-13 05:27:16,054 INFO L226 Difference]: Without dead ends: 4222 [2019-01-13 05:27:16,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:27:16,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4222 states. [2019-01-13 05:27:16,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4222 to 3758. [2019-01-13 05:27:16,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3758 states. [2019-01-13 05:27:16,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3758 states to 3758 states and 9560 transitions. [2019-01-13 05:27:16,099 INFO L78 Accepts]: Start accepts. Automaton has 3758 states and 9560 transitions. Word has length 93 [2019-01-13 05:27:16,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:16,099 INFO L480 AbstractCegarLoop]: Abstraction has 3758 states and 9560 transitions. [2019-01-13 05:27:16,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 05:27:16,099 INFO L276 IsEmpty]: Start isEmpty. Operand 3758 states and 9560 transitions. [2019-01-13 05:27:16,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 05:27:16,103 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:16,104 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:27:16,104 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:16,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:16,104 INFO L82 PathProgramCache]: Analyzing trace with hash 959584013, now seen corresponding path program 1 times [2019-01-13 05:27:16,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:16,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:16,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:16,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:16,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:16,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:16,295 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-13 05:27:16,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:27:16,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:16,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 05:27:16,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 05:27:16,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 05:27:16,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:27:16,338 INFO L87 Difference]: Start difference. First operand 3758 states and 9560 transitions. Second operand 7 states. [2019-01-13 05:27:16,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:16,662 INFO L93 Difference]: Finished difference Result 5845 states and 14925 transitions. [2019-01-13 05:27:16,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 05:27:16,664 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-01-13 05:27:16,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:16,667 INFO L225 Difference]: With dead ends: 5845 [2019-01-13 05:27:16,668 INFO L226 Difference]: Without dead ends: 2182 [2019-01-13 05:27:16,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-01-13 05:27:16,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2182 states. [2019-01-13 05:27:16,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2182 to 2182. [2019-01-13 05:27:16,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2182 states. [2019-01-13 05:27:16,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 2182 states and 5546 transitions. [2019-01-13 05:27:16,691 INFO L78 Accepts]: Start accepts. Automaton has 2182 states and 5546 transitions. Word has length 93 [2019-01-13 05:27:16,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:16,691 INFO L480 AbstractCegarLoop]: Abstraction has 2182 states and 5546 transitions. [2019-01-13 05:27:16,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 05:27:16,692 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 5546 transitions. [2019-01-13 05:27:16,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 05:27:16,694 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:16,694 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:27:16,695 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:16,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:16,695 INFO L82 PathProgramCache]: Analyzing trace with hash -777910515, now seen corresponding path program 2 times [2019-01-13 05:27:16,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:16,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:16,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:16,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:16,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:16,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:16,933 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-13 05:27:17,955 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 05:27:17,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:17,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-13 05:27:17,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-13 05:27:17,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-13 05:27:17,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-13 05:27:17,956 INFO L87 Difference]: Start difference. First operand 2182 states and 5546 transitions. Second operand 12 states. [2019-01-13 05:27:18,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:18,696 INFO L93 Difference]: Finished difference Result 4039 states and 10414 transitions. [2019-01-13 05:27:18,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-13 05:27:18,697 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 93 [2019-01-13 05:27:18,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:18,702 INFO L225 Difference]: With dead ends: 4039 [2019-01-13 05:27:18,702 INFO L226 Difference]: Without dead ends: 2903 [2019-01-13 05:27:18,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2019-01-13 05:27:18,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2903 states. [2019-01-13 05:27:18,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2903 to 2733. [2019-01-13 05:27:18,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2733 states. [2019-01-13 05:27:18,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2733 states to 2733 states and 6802 transitions. [2019-01-13 05:27:18,733 INFO L78 Accepts]: Start accepts. Automaton has 2733 states and 6802 transitions. Word has length 93 [2019-01-13 05:27:18,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:18,734 INFO L480 AbstractCegarLoop]: Abstraction has 2733 states and 6802 transitions. [2019-01-13 05:27:18,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-13 05:27:18,734 INFO L276 IsEmpty]: Start isEmpty. Operand 2733 states and 6802 transitions. [2019-01-13 05:27:18,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 05:27:18,737 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:18,737 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:27:18,737 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:18,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:18,738 INFO L82 PathProgramCache]: Analyzing trace with hash 45507955, now seen corresponding path program 3 times [2019-01-13 05:27:18,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:18,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:18,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:18,739 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 05:27:18,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:18,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 05:27:18,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 05:27:18,831 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 05:27:19,019 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-13 05:27:19,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 05:27:19 BasicIcfg [2019-01-13 05:27:19,022 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 05:27:19,023 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 05:27:19,023 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 05:27:19,025 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 05:27:19,025 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 05:26:39" (3/4) ... [2019-01-13 05:27:19,030 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-13 05:27:19,275 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 05:27:19,279 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 05:27:19,281 INFO L168 Benchmark]: Toolchain (without parser) took 42357.38 ms. Allocated memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: 2.0 GB). Free memory was 947.3 MB in the beginning and 1.4 GB in the end (delta: -466.9 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-01-13 05:27:19,282 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 05:27:19,284 INFO L168 Benchmark]: CACSL2BoogieTranslator took 828.94 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -139.1 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. [2019-01-13 05:27:19,285 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-13 05:27:19,285 INFO L168 Benchmark]: Boogie Preprocessor took 41.13 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 05:27:19,285 INFO L168 Benchmark]: RCFGBuilder took 1198.59 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.7 MB). Peak memory consumption was 45.7 MB. Max. memory is 11.5 GB. [2019-01-13 05:27:19,286 INFO L168 Benchmark]: TraceAbstraction took 39941.37 ms. Allocated memory was 1.1 GB in the beginning and 3.1 GB in the end (delta: 1.9 GB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -426.7 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-01-13 05:27:19,286 INFO L168 Benchmark]: Witness Printer took 256.67 ms. Allocated memory is still 3.1 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 41.0 MB). Peak memory consumption was 41.0 MB. Max. memory is 11.5 GB. [2019-01-13 05:27:19,292 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 828.94 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -139.1 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 85.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.13 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1198.59 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.7 MB). Peak memory consumption was 45.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 39941.37 ms. Allocated memory was 1.1 GB in the beginning and 3.1 GB in the end (delta: 1.9 GB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -426.7 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. * Witness Printer took 256.67 ms. Allocated memory is still 3.1 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 41.0 MB). Peak memory consumption was 41.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L672] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L673] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L675] -1 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L677] -1 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L678] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L679] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L680] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=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] [L681] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=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] [L682] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=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] [L683] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=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] [L684] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=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] [L685] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=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] [L686] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=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] [L687] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=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}] [L688] -1 int y$w_buff0; VAL [__unbuffered_cnt=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] [L689] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=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] [L690] -1 int y$w_buff1; VAL [__unbuffered_cnt=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] [L691] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=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] [L692] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=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] [L693] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=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] [L753] -1 pthread_t t2475; VAL [__unbuffered_cnt=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] [L754] FCALL, FORK -1 pthread_create(&t2475, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L755] -1 pthread_t t2476; VAL [__unbuffered_cnt=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] [L756] FCALL, FORK -1 pthread_create(&t2476, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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] [L697] 0 y$w_buff1 = y$w_buff0 [L698] 0 y$w_buff0 = 2 [L699] 0 y$w_buff1_used = y$w_buff0_used [L700] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L702] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L703] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L704] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L705] 0 y$r_buff0_thd1 = (_Bool)1 [L708] 0 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L711] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L725] 1 x = 2 [L728] 1 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L711] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L712] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L731] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L712] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L731] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L731] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L731] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L732] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L732] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L733] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L733] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L734] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L735] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L735] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L738] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L713] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L713] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L714] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L714] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L715] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L715] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L718] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L758] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] -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) [L763] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L763] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L764] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] -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 [L765] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L766] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] -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 [L769] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L770] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L771] -1 y$flush_delayed = weak$$choice2 [L772] -1 y$mem_tmp = y VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L773] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L773] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L774] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L775] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L776] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L777] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L778] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L779] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L780] -1 main$tmp_guard1 = !(x == 2 && y == 2) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] -1 y = y$flush_delayed ? y$mem_tmp : y [L782] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 178 locations, 3 error locations. UNSAFE Result, 39.8s OverallTime, 29 OverallIterations, 1 TraceHistogramMax, 19.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6910 SDtfs, 6518 SDslu, 15219 SDs, 0 SdLazy, 6039 SolverSat, 359 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 284 GetRequests, 83 SyntacticMatches, 18 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 8.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43712occurred in iteration=11, 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: 9.1s AutomataMinimizationTime, 28 MinimizatonAttempts, 101430 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 2269 NumberOfCodeBlocks, 2269 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2148 ConstructedInterpolants, 0 QuantifiedInterpolants, 443734 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...