./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix009_power.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e 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/mix009_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 3d287fce75dc873494b995778754ff1185af89eb .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-91b1670 [2018-11-28 19:42:43,822 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 19:42:43,825 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 19:42:43,837 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 19:42:43,838 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 19:42:43,839 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 19:42:43,840 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 19:42:43,850 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 19:42:43,852 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 19:42:43,853 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 19:42:43,854 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 19:42:43,854 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 19:42:43,855 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 19:42:43,856 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 19:42:43,858 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 19:42:43,859 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 19:42:43,860 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 19:42:43,862 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 19:42:43,864 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 19:42:43,866 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 19:42:43,867 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 19:42:43,868 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 19:42:43,871 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 19:42:43,871 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 19:42:43,872 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 19:42:43,873 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 19:42:43,874 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 19:42:43,875 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 19:42:43,876 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 19:42:43,877 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 19:42:43,878 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 19:42:43,878 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 19:42:43,879 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 19:42:43,879 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 19:42:43,880 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 19:42:43,881 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 19:42:43,881 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 19:42:43,896 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 19:42:43,897 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 19:42:43,897 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 19:42:43,898 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 19:42:43,899 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 19:42:43,899 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 19:42:43,899 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 19:42:43,899 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 19:42:43,899 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 19:42:43,899 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 19:42:43,900 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 19:42:43,900 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 19:42:43,900 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 19:42:43,900 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 19:42:43,900 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 19:42:43,900 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 19:42:43,901 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 19:42:43,901 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 19:42:43,901 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 19:42:43,901 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 19:42:43,901 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 19:42:43,901 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 19:42:43,904 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 19:42:43,904 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 19:42:43,904 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 19:42:43,904 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 19:42:43,904 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 19:42:43,905 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 19:42:43,906 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 19:42:43,906 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 19:42:43,906 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 -> 3d287fce75dc873494b995778754ff1185af89eb [2018-11-28 19:42:43,942 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 19:42:43,955 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 19:42:43,959 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 19:42:43,961 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 19:42:43,961 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 19:42:43,962 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix009_power.oepc_false-unreach-call.i [2018-11-28 19:42:44,022 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8a66e31b/ebb836d9a33e42e0ab02e512074ee5c4/FLAG1358b5a41 [2018-11-28 19:42:44,606 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 19:42:44,607 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix009_power.oepc_false-unreach-call.i [2018-11-28 19:42:44,624 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8a66e31b/ebb836d9a33e42e0ab02e512074ee5c4/FLAG1358b5a41 [2018-11-28 19:42:44,850 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8a66e31b/ebb836d9a33e42e0ab02e512074ee5c4 [2018-11-28 19:42:44,853 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 19:42:44,855 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 19:42:44,856 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 19:42:44,856 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 19:42:44,861 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 19:42:44,862 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 07:42:44" (1/1) ... [2018-11-28 19:42:44,867 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e9bb3cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:42:44, skipping insertion in model container [2018-11-28 19:42:44,867 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 07:42:44" (1/1) ... [2018-11-28 19:42:44,876 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 19:42:44,947 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 19:42:45,383 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 19:42:45,397 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 19:42:45,580 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 19:42:45,655 INFO L195 MainTranslator]: Completed translation [2018-11-28 19:42:45,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:42:45 WrapperNode [2018-11-28 19:42:45,656 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 19:42:45,657 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 19:42:45,657 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 19:42:45,657 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 19:42:45,668 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:42:45" (1/1) ... [2018-11-28 19:42:45,689 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:42:45" (1/1) ... [2018-11-28 19:42:45,723 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 19:42:45,724 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 19:42:45,724 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 19:42:45,725 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 19:42:45,735 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:42:45" (1/1) ... [2018-11-28 19:42:45,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:42:45" (1/1) ... [2018-11-28 19:42:45,740 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:42:45" (1/1) ... [2018-11-28 19:42:45,741 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:42:45" (1/1) ... [2018-11-28 19:42:45,760 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:42:45" (1/1) ... [2018-11-28 19:42:45,771 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:42:45" (1/1) ... [2018-11-28 19:42:45,774 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:42:45" (1/1) ... [2018-11-28 19:42:45,780 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 19:42:45,780 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 19:42:45,780 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 19:42:45,780 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 19:42:45,781 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:42:45" (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 [2018-11-28 19:42:45,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 19:42:45,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 19:42:45,853 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-11-28 19:42:45,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 19:42:45,853 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-11-28 19:42:45,854 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-11-28 19:42:45,854 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-11-28 19:42:45,854 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-11-28 19:42:45,854 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-11-28 19:42:45,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 19:42:45,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 19:42:45,856 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-11-28 19:42:46,965 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 19:42:46,965 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 19:42:46,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 07:42:46 BoogieIcfgContainer [2018-11-28 19:42:46,966 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 19:42:46,968 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 19:42:46,968 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 19:42:46,971 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 19:42:46,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 07:42:44" (1/3) ... [2018-11-28 19:42:46,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b54d9aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 07:42:46, skipping insertion in model container [2018-11-28 19:42:46,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:42:45" (2/3) ... [2018-11-28 19:42:46,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b54d9aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 07:42:46, skipping insertion in model container [2018-11-28 19:42:46,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 07:42:46" (3/3) ... [2018-11-28 19:42:46,975 INFO L112 eAbstractionObserver]: Analyzing ICFG mix009_power.oepc_false-unreach-call.i [2018-11-28 19:42:47,022 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,022 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,023 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,023 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,023 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,023 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,024 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,024 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,025 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,025 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,025 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,025 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,026 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,026 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,026 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,028 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,028 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,028 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,029 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,029 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,029 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,029 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,029 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,030 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,030 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,030 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,030 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,031 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,031 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,031 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,031 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,031 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,034 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,034 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,034 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,034 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,034 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,035 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,039 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,039 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,039 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,040 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,040 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,040 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,040 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,040 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,043 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,043 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,043 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,043 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,044 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,044 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,044 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,044 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,045 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,045 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,045 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,045 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,046 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,049 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,049 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,049 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,049 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,050 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,050 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,050 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,050 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,050 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,053 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,053 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,054 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,054 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,054 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,054 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,054 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,055 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,055 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,055 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,055 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,055 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,058 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,059 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,059 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,059 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,060 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,060 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,061 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,061 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,061 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,061 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,061 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,062 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,064 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,064 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,065 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,065 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,065 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,065 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,065 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,065 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,067 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,068 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,068 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,068 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,072 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,073 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,073 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,073 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,074 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,074 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,074 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,074 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,074 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,077 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,077 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,078 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,078 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,078 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,078 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,078 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,078 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,079 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,079 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,079 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,079 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,082 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,082 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,085 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,085 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,087 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,087 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,087 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,087 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,087 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,089 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,090 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,090 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,090 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,091 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,091 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,091 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,091 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,091 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,092 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,092 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,092 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,092 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,092 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,093 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,093 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,093 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,093 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,093 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,094 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,094 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,094 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:42:47,125 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-11-28 19:42:47,125 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 19:42:47,139 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-28 19:42:47,158 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-28 19:42:47,185 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 19:42:47,186 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 19:42:47,186 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 19:42:47,186 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 19:42:47,186 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 19:42:47,187 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 19:42:47,187 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 19:42:47,187 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 19:42:47,187 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 19:42:47,201 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 145places, 183 transitions [2018-11-28 19:42:49,513 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34809 states. [2018-11-28 19:42:49,516 INFO L276 IsEmpty]: Start isEmpty. Operand 34809 states. [2018-11-28 19:42:49,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-28 19:42:49,524 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:42:49,525 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] [2018-11-28 19:42:49,528 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:42:49,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:42:49,534 INFO L82 PathProgramCache]: Analyzing trace with hash 787354290, now seen corresponding path program 1 times [2018-11-28 19:42:49,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:42:49,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:42:49,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:42:49,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:42:49,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:42:49,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:42:49,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:42:49,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:42:49,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 19:42:49,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 19:42:49,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 19:42:49,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:42:49,921 INFO L87 Difference]: Start difference. First operand 34809 states. Second operand 4 states. [2018-11-28 19:42:51,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:42:51,567 INFO L93 Difference]: Finished difference Result 60793 states and 234496 transitions. [2018-11-28 19:42:51,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 19:42:51,569 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-28 19:42:51,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:42:51,919 INFO L225 Difference]: With dead ends: 60793 [2018-11-28 19:42:51,919 INFO L226 Difference]: Without dead ends: 44273 [2018-11-28 19:42:51,922 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 [2018-11-28 19:42:52,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44273 states. [2018-11-28 19:42:53,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44273 to 27341. [2018-11-28 19:42:53,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27341 states. [2018-11-28 19:42:53,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27341 states to 27341 states and 105502 transitions. [2018-11-28 19:42:53,810 INFO L78 Accepts]: Start accepts. Automaton has 27341 states and 105502 transitions. Word has length 36 [2018-11-28 19:42:53,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:42:53,811 INFO L480 AbstractCegarLoop]: Abstraction has 27341 states and 105502 transitions. [2018-11-28 19:42:53,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 19:42:53,811 INFO L276 IsEmpty]: Start isEmpty. Operand 27341 states and 105502 transitions. [2018-11-28 19:42:53,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-28 19:42:53,829 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:42:53,829 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] [2018-11-28 19:42:53,829 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:42:53,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:42:53,830 INFO L82 PathProgramCache]: Analyzing trace with hash 901056929, now seen corresponding path program 1 times [2018-11-28 19:42:53,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:42:53,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:42:53,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:42:53,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:42:53,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:42:53,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:42:53,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:42:53,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:42:53,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 19:42:53,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 19:42:53,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 19:42:53,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:42:53,995 INFO L87 Difference]: Start difference. First operand 27341 states and 105502 transitions. Second operand 4 states. [2018-11-28 19:42:54,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:42:54,310 INFO L93 Difference]: Finished difference Result 8531 states and 28347 transitions. [2018-11-28 19:42:54,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 19:42:54,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-11-28 19:42:54,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:42:54,339 INFO L225 Difference]: With dead ends: 8531 [2018-11-28 19:42:54,340 INFO L226 Difference]: Without dead ends: 7469 [2018-11-28 19:42:54,341 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 [2018-11-28 19:42:54,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7469 states. [2018-11-28 19:42:54,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7469 to 7469. [2018-11-28 19:42:54,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7469 states. [2018-11-28 19:42:54,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7469 states to 7469 states and 24639 transitions. [2018-11-28 19:42:54,559 INFO L78 Accepts]: Start accepts. Automaton has 7469 states and 24639 transitions. Word has length 48 [2018-11-28 19:42:54,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:42:54,559 INFO L480 AbstractCegarLoop]: Abstraction has 7469 states and 24639 transitions. [2018-11-28 19:42:54,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 19:42:54,559 INFO L276 IsEmpty]: Start isEmpty. Operand 7469 states and 24639 transitions. [2018-11-28 19:42:54,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-28 19:42:54,563 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:42:54,563 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] [2018-11-28 19:42:54,564 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:42:54,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:42:54,564 INFO L82 PathProgramCache]: Analyzing trace with hash 2027995578, now seen corresponding path program 1 times [2018-11-28 19:42:54,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:42:54,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:42:54,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:42:54,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:42:54,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:42:54,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:42:54,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:42:54,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:42:54,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 19:42:54,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 19:42:54,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 19:42:54,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:42:54,914 INFO L87 Difference]: Start difference. First operand 7469 states and 24639 transitions. Second operand 5 states. [2018-11-28 19:42:56,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:42:56,116 INFO L93 Difference]: Finished difference Result 14001 states and 45808 transitions. [2018-11-28 19:42:56,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 19:42:56,118 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-11-28 19:42:56,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:42:56,166 INFO L225 Difference]: With dead ends: 14001 [2018-11-28 19:42:56,166 INFO L226 Difference]: Without dead ends: 13933 [2018-11-28 19:42:56,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 19:42:56,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13933 states. [2018-11-28 19:42:56,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13933 to 9444. [2018-11-28 19:42:56,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9444 states. [2018-11-28 19:42:56,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9444 states to 9444 states and 30545 transitions. [2018-11-28 19:42:56,658 INFO L78 Accepts]: Start accepts. Automaton has 9444 states and 30545 transitions. Word has length 49 [2018-11-28 19:42:56,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:42:56,659 INFO L480 AbstractCegarLoop]: Abstraction has 9444 states and 30545 transitions. [2018-11-28 19:42:56,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 19:42:56,659 INFO L276 IsEmpty]: Start isEmpty. Operand 9444 states and 30545 transitions. [2018-11-28 19:42:56,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-28 19:42:56,663 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:42:56,663 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] [2018-11-28 19:42:56,663 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:42:56,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:42:56,664 INFO L82 PathProgramCache]: Analyzing trace with hash -39217920, now seen corresponding path program 1 times [2018-11-28 19:42:56,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:42:56,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:42:56,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:42:56,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:42:56,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:42:56,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:42:56,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:42:56,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:42:56,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 19:42:56,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 19:42:56,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 19:42:56,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 19:42:56,752 INFO L87 Difference]: Start difference. First operand 9444 states and 30545 transitions. Second operand 3 states. [2018-11-28 19:42:56,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:42:56,979 INFO L93 Difference]: Finished difference Result 13282 states and 42644 transitions. [2018-11-28 19:42:56,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 19:42:56,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-11-28 19:42:56,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:42:57,010 INFO L225 Difference]: With dead ends: 13282 [2018-11-28 19:42:57,010 INFO L226 Difference]: Without dead ends: 13282 [2018-11-28 19:42:57,011 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 [2018-11-28 19:42:57,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13282 states. [2018-11-28 19:42:57,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13282 to 9848. [2018-11-28 19:42:57,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9848 states. [2018-11-28 19:42:57,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9848 states to 9848 states and 31511 transitions. [2018-11-28 19:42:57,270 INFO L78 Accepts]: Start accepts. Automaton has 9848 states and 31511 transitions. Word has length 51 [2018-11-28 19:42:57,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:42:57,270 INFO L480 AbstractCegarLoop]: Abstraction has 9848 states and 31511 transitions. [2018-11-28 19:42:57,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 19:42:57,270 INFO L276 IsEmpty]: Start isEmpty. Operand 9848 states and 31511 transitions. [2018-11-28 19:42:57,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-28 19:42:57,275 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:42:57,275 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] [2018-11-28 19:42:57,275 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:42:57,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:42:57,275 INFO L82 PathProgramCache]: Analyzing trace with hash -557670517, now seen corresponding path program 1 times [2018-11-28 19:42:57,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:42:57,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:42:57,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:42:57,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:42:57,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:42:57,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:42:57,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:42:57,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:42:57,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 19:42:57,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 19:42:57,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 19:42:57,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 19:42:57,691 INFO L87 Difference]: Start difference. First operand 9848 states and 31511 transitions. Second operand 6 states. [2018-11-28 19:42:58,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:42:58,714 INFO L93 Difference]: Finished difference Result 14206 states and 45067 transitions. [2018-11-28 19:42:58,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 19:42:58,715 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-11-28 19:42:58,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:42:58,746 INFO L225 Difference]: With dead ends: 14206 [2018-11-28 19:42:58,746 INFO L226 Difference]: Without dead ends: 14134 [2018-11-28 19:42:58,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-11-28 19:42:58,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14134 states. [2018-11-28 19:42:58,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14134 to 10852. [2018-11-28 19:42:58,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10852 states. [2018-11-28 19:42:59,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10852 states to 10852 states and 34566 transitions. [2018-11-28 19:42:59,005 INFO L78 Accepts]: Start accepts. Automaton has 10852 states and 34566 transitions. Word has length 55 [2018-11-28 19:42:59,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:42:59,005 INFO L480 AbstractCegarLoop]: Abstraction has 10852 states and 34566 transitions. [2018-11-28 19:42:59,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 19:42:59,006 INFO L276 IsEmpty]: Start isEmpty. Operand 10852 states and 34566 transitions. [2018-11-28 19:42:59,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-28 19:42:59,012 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:42:59,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, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:42:59,012 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:42:59,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:42:59,013 INFO L82 PathProgramCache]: Analyzing trace with hash -3940633, now seen corresponding path program 1 times [2018-11-28 19:42:59,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:42:59,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:42:59,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:42:59,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:42:59,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:42:59,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:42:59,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:42:59,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:42:59,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 19:42:59,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 19:42:59,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 19:42:59,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:42:59,222 INFO L87 Difference]: Start difference. First operand 10852 states and 34566 transitions. Second operand 4 states. [2018-11-28 19:42:59,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:42:59,647 INFO L93 Difference]: Finished difference Result 12399 states and 39575 transitions. [2018-11-28 19:42:59,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 19:42:59,648 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-11-28 19:42:59,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:42:59,670 INFO L225 Difference]: With dead ends: 12399 [2018-11-28 19:42:59,670 INFO L226 Difference]: Without dead ends: 12399 [2018-11-28 19:42:59,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:42:59,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12399 states. [2018-11-28 19:42:59,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12399 to 11372. [2018-11-28 19:42:59,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11372 states. [2018-11-28 19:42:59,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11372 states to 11372 states and 36239 transitions. [2018-11-28 19:42:59,935 INFO L78 Accepts]: Start accepts. Automaton has 11372 states and 36239 transitions. Word has length 63 [2018-11-28 19:42:59,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:42:59,936 INFO L480 AbstractCegarLoop]: Abstraction has 11372 states and 36239 transitions. [2018-11-28 19:42:59,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 19:42:59,936 INFO L276 IsEmpty]: Start isEmpty. Operand 11372 states and 36239 transitions. [2018-11-28 19:42:59,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-28 19:42:59,943 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:42:59,943 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] [2018-11-28 19:42:59,944 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:42:59,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:42:59,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1738869702, now seen corresponding path program 1 times [2018-11-28 19:42:59,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:42:59,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:42:59,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:42:59,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:42:59,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:42:59,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:00,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:00,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:00,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 19:43:00,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 19:43:00,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 19:43:00,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 19:43:00,183 INFO L87 Difference]: Start difference. First operand 11372 states and 36239 transitions. Second operand 6 states. [2018-11-28 19:43:01,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:01,159 INFO L93 Difference]: Finished difference Result 20972 states and 66489 transitions. [2018-11-28 19:43:01,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 19:43:01,160 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2018-11-28 19:43:01,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:01,200 INFO L225 Difference]: With dead ends: 20972 [2018-11-28 19:43:01,200 INFO L226 Difference]: Without dead ends: 20901 [2018-11-28 19:43:01,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-28 19:43:01,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20901 states. [2018-11-28 19:43:01,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20901 to 13758. [2018-11-28 19:43:01,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13758 states. [2018-11-28 19:43:01,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13758 states to 13758 states and 43283 transitions. [2018-11-28 19:43:01,724 INFO L78 Accepts]: Start accepts. Automaton has 13758 states and 43283 transitions. Word has length 63 [2018-11-28 19:43:01,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:01,725 INFO L480 AbstractCegarLoop]: Abstraction has 13758 states and 43283 transitions. [2018-11-28 19:43:01,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 19:43:01,725 INFO L276 IsEmpty]: Start isEmpty. Operand 13758 states and 43283 transitions. [2018-11-28 19:43:01,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-28 19:43:01,736 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:01,736 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] [2018-11-28 19:43:01,736 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:01,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:01,736 INFO L82 PathProgramCache]: Analyzing trace with hash 81708496, now seen corresponding path program 1 times [2018-11-28 19:43:01,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:01,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:01,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:01,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:01,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:01,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:01,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:01,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:01,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 19:43:01,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 19:43:01,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 19:43:01,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:43:01,908 INFO L87 Difference]: Start difference. First operand 13758 states and 43283 transitions. Second operand 4 states. [2018-11-28 19:43:02,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:02,430 INFO L93 Difference]: Finished difference Result 19950 states and 63167 transitions. [2018-11-28 19:43:02,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 19:43:02,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-11-28 19:43:02,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:02,465 INFO L225 Difference]: With dead ends: 19950 [2018-11-28 19:43:02,466 INFO L226 Difference]: Without dead ends: 19950 [2018-11-28 19:43:02,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:43:02,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19950 states. [2018-11-28 19:43:02,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19950 to 17922. [2018-11-28 19:43:02,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17922 states. [2018-11-28 19:43:02,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17922 states to 17922 states and 57082 transitions. [2018-11-28 19:43:02,761 INFO L78 Accepts]: Start accepts. Automaton has 17922 states and 57082 transitions. Word has length 67 [2018-11-28 19:43:02,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:02,761 INFO L480 AbstractCegarLoop]: Abstraction has 17922 states and 57082 transitions. [2018-11-28 19:43:02,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 19:43:02,761 INFO L276 IsEmpty]: Start isEmpty. Operand 17922 states and 57082 transitions. [2018-11-28 19:43:02,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-28 19:43:02,771 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:02,771 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] [2018-11-28 19:43:02,771 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:02,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:02,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1725745967, now seen corresponding path program 1 times [2018-11-28 19:43:02,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:02,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:02,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:02,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:02,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:02,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:03,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:03,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:03,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 19:43:03,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 19:43:03,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 19:43:03,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:43:03,022 INFO L87 Difference]: Start difference. First operand 17922 states and 57082 transitions. Second operand 4 states. [2018-11-28 19:43:03,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:03,546 INFO L93 Difference]: Finished difference Result 22122 states and 69359 transitions. [2018-11-28 19:43:03,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 19:43:03,547 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-11-28 19:43:03,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:03,584 INFO L225 Difference]: With dead ends: 22122 [2018-11-28 19:43:03,584 INFO L226 Difference]: Without dead ends: 22122 [2018-11-28 19:43:03,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:43:03,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22122 states. [2018-11-28 19:43:03,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22122 to 20008. [2018-11-28 19:43:03,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20008 states. [2018-11-28 19:43:03,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20008 states to 20008 states and 63081 transitions. [2018-11-28 19:43:03,906 INFO L78 Accepts]: Start accepts. Automaton has 20008 states and 63081 transitions. Word has length 67 [2018-11-28 19:43:03,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:03,907 INFO L480 AbstractCegarLoop]: Abstraction has 20008 states and 63081 transitions. [2018-11-28 19:43:03,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 19:43:03,907 INFO L276 IsEmpty]: Start isEmpty. Operand 20008 states and 63081 transitions. [2018-11-28 19:43:03,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-28 19:43:03,919 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:03,920 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] [2018-11-28 19:43:03,920 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:03,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:03,920 INFO L82 PathProgramCache]: Analyzing trace with hash 492011986, now seen corresponding path program 1 times [2018-11-28 19:43:03,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:03,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:03,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:03,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:03,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:03,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:04,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:04,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:04,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 19:43:04,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 19:43:04,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 19:43:04,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 19:43:04,030 INFO L87 Difference]: Start difference. First operand 20008 states and 63081 transitions. Second operand 3 states. [2018-11-28 19:43:04,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:04,390 INFO L93 Difference]: Finished difference Result 20728 states and 65064 transitions. [2018-11-28 19:43:04,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 19:43:04,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-11-28 19:43:04,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:04,709 INFO L225 Difference]: With dead ends: 20728 [2018-11-28 19:43:04,709 INFO L226 Difference]: Without dead ends: 20728 [2018-11-28 19:43:04,710 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 [2018-11-28 19:43:04,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20728 states. [2018-11-28 19:43:04,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20728 to 20404. [2018-11-28 19:43:04,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20404 states. [2018-11-28 19:43:04,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20404 states to 20404 states and 64159 transitions. [2018-11-28 19:43:04,990 INFO L78 Accepts]: Start accepts. Automaton has 20404 states and 64159 transitions. Word has length 67 [2018-11-28 19:43:04,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:04,990 INFO L480 AbstractCegarLoop]: Abstraction has 20404 states and 64159 transitions. [2018-11-28 19:43:04,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 19:43:04,990 INFO L276 IsEmpty]: Start isEmpty. Operand 20404 states and 64159 transitions. [2018-11-28 19:43:05,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-28 19:43:05,003 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:05,003 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] [2018-11-28 19:43:05,004 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:05,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:05,004 INFO L82 PathProgramCache]: Analyzing trace with hash 2096525335, now seen corresponding path program 1 times [2018-11-28 19:43:05,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:05,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:05,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:05,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:05,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:05,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:05,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:05,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:05,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 19:43:05,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 19:43:05,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 19:43:05,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 19:43:05,141 INFO L87 Difference]: Start difference. First operand 20404 states and 64159 transitions. Second operand 3 states. [2018-11-28 19:43:05,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:05,427 INFO L93 Difference]: Finished difference Result 25692 states and 80601 transitions. [2018-11-28 19:43:05,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 19:43:05,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-11-28 19:43:05,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:05,472 INFO L225 Difference]: With dead ends: 25692 [2018-11-28 19:43:05,472 INFO L226 Difference]: Without dead ends: 25692 [2018-11-28 19:43:05,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 19:43:05,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25692 states. [2018-11-28 19:43:05,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25692 to 24788. [2018-11-28 19:43:05,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24788 states. [2018-11-28 19:43:05,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24788 states to 24788 states and 77827 transitions. [2018-11-28 19:43:05,844 INFO L78 Accepts]: Start accepts. Automaton has 24788 states and 77827 transitions. Word has length 69 [2018-11-28 19:43:05,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:05,844 INFO L480 AbstractCegarLoop]: Abstraction has 24788 states and 77827 transitions. [2018-11-28 19:43:05,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 19:43:05,844 INFO L276 IsEmpty]: Start isEmpty. Operand 24788 states and 77827 transitions. [2018-11-28 19:43:05,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-28 19:43:05,857 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:05,857 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] [2018-11-28 19:43:05,858 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:05,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:05,858 INFO L82 PathProgramCache]: Analyzing trace with hash -401490602, now seen corresponding path program 1 times [2018-11-28 19:43:05,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:05,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:05,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:05,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:05,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:05,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:06,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:06,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:06,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 19:43:06,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 19:43:06,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 19:43:06,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 19:43:06,010 INFO L87 Difference]: Start difference. First operand 24788 states and 77827 transitions. Second operand 6 states. [2018-11-28 19:43:07,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:07,325 INFO L93 Difference]: Finished difference Result 29944 states and 92734 transitions. [2018-11-28 19:43:07,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 19:43:07,326 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-11-28 19:43:07,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:07,383 INFO L225 Difference]: With dead ends: 29944 [2018-11-28 19:43:07,383 INFO L226 Difference]: Without dead ends: 29944 [2018-11-28 19:43:07,383 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 [2018-11-28 19:43:07,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29944 states. [2018-11-28 19:43:07,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29944 to 28268. [2018-11-28 19:43:07,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28268 states. [2018-11-28 19:43:07,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28268 states to 28268 states and 88152 transitions. [2018-11-28 19:43:07,841 INFO L78 Accepts]: Start accepts. Automaton has 28268 states and 88152 transitions. Word has length 69 [2018-11-28 19:43:07,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:07,842 INFO L480 AbstractCegarLoop]: Abstraction has 28268 states and 88152 transitions. [2018-11-28 19:43:07,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 19:43:07,842 INFO L276 IsEmpty]: Start isEmpty. Operand 28268 states and 88152 transitions. [2018-11-28 19:43:07,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-28 19:43:07,856 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:07,857 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] [2018-11-28 19:43:07,857 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:07,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:07,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1816267351, now seen corresponding path program 1 times [2018-11-28 19:43:07,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:07,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:07,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:07,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:07,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:07,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:08,272 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-11-28 19:43:08,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:08,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:08,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 19:43:08,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 19:43:08,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 19:43:08,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 19:43:08,382 INFO L87 Difference]: Start difference. First operand 28268 states and 88152 transitions. Second operand 6 states. [2018-11-28 19:43:09,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:09,502 INFO L93 Difference]: Finished difference Result 32012 states and 96857 transitions. [2018-11-28 19:43:09,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 19:43:09,502 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-11-28 19:43:09,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:09,564 INFO L225 Difference]: With dead ends: 32012 [2018-11-28 19:43:09,564 INFO L226 Difference]: Without dead ends: 32012 [2018-11-28 19:43:09,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-28 19:43:09,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32012 states. [2018-11-28 19:43:10,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32012 to 28944. [2018-11-28 19:43:10,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28944 states. [2018-11-28 19:43:10,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28944 states to 28944 states and 88943 transitions. [2018-11-28 19:43:10,369 INFO L78 Accepts]: Start accepts. Automaton has 28944 states and 88943 transitions. Word has length 69 [2018-11-28 19:43:10,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:10,369 INFO L480 AbstractCegarLoop]: Abstraction has 28944 states and 88943 transitions. [2018-11-28 19:43:10,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 19:43:10,369 INFO L276 IsEmpty]: Start isEmpty. Operand 28944 states and 88943 transitions. [2018-11-28 19:43:10,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-28 19:43:10,384 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:10,384 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] [2018-11-28 19:43:10,385 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:10,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:10,385 INFO L82 PathProgramCache]: Analyzing trace with hash 2027618264, now seen corresponding path program 1 times [2018-11-28 19:43:10,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:10,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:10,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:10,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:10,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:10,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:10,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:10,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 19:43:10,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 19:43:10,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 19:43:10,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:43:10,505 INFO L87 Difference]: Start difference. First operand 28944 states and 88943 transitions. Second operand 5 states. [2018-11-28 19:43:11,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:11,074 INFO L93 Difference]: Finished difference Result 35071 states and 107222 transitions. [2018-11-28 19:43:11,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 19:43:11,075 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-11-28 19:43:11,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:11,137 INFO L225 Difference]: With dead ends: 35071 [2018-11-28 19:43:11,138 INFO L226 Difference]: Without dead ends: 35071 [2018-11-28 19:43:11,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 19:43:11,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35071 states. [2018-11-28 19:43:11,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35071 to 31628. [2018-11-28 19:43:11,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31628 states. [2018-11-28 19:43:11,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31628 states to 31628 states and 96602 transitions. [2018-11-28 19:43:11,629 INFO L78 Accepts]: Start accepts. Automaton has 31628 states and 96602 transitions. Word has length 69 [2018-11-28 19:43:11,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:11,630 INFO L480 AbstractCegarLoop]: Abstraction has 31628 states and 96602 transitions. [2018-11-28 19:43:11,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 19:43:11,630 INFO L276 IsEmpty]: Start isEmpty. Operand 31628 states and 96602 transitions. [2018-11-28 19:43:11,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-28 19:43:11,644 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:11,645 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] [2018-11-28 19:43:11,645 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:11,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:11,645 INFO L82 PathProgramCache]: Analyzing trace with hash -279867272, now seen corresponding path program 1 times [2018-11-28 19:43:11,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:11,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:11,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:11,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:11,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:11,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:11,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:11,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:11,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 19:43:11,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 19:43:11,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 19:43:11,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 19:43:11,766 INFO L87 Difference]: Start difference. First operand 31628 states and 96602 transitions. Second operand 3 states. [2018-11-28 19:43:12,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:12,134 INFO L93 Difference]: Finished difference Result 42528 states and 128529 transitions. [2018-11-28 19:43:12,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 19:43:12,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-11-28 19:43:12,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:12,209 INFO L225 Difference]: With dead ends: 42528 [2018-11-28 19:43:12,209 INFO L226 Difference]: Without dead ends: 42528 [2018-11-28 19:43:12,210 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 [2018-11-28 19:43:12,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42528 states. [2018-11-28 19:43:12,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42528 to 32736. [2018-11-28 19:43:12,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32736 states. [2018-11-28 19:43:12,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32736 states to 32736 states and 99897 transitions. [2018-11-28 19:43:12,784 INFO L78 Accepts]: Start accepts. Automaton has 32736 states and 99897 transitions. Word has length 69 [2018-11-28 19:43:12,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:12,784 INFO L480 AbstractCegarLoop]: Abstraction has 32736 states and 99897 transitions. [2018-11-28 19:43:12,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 19:43:12,784 INFO L276 IsEmpty]: Start isEmpty. Operand 32736 states and 99897 transitions. [2018-11-28 19:43:12,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-28 19:43:12,799 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:12,799 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] [2018-11-28 19:43:12,799 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:12,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:12,800 INFO L82 PathProgramCache]: Analyzing trace with hash -2087321735, now seen corresponding path program 1 times [2018-11-28 19:43:12,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:12,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:12,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:12,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:12,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:12,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:13,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:13,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:13,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 19:43:13,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 19:43:13,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 19:43:13,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-28 19:43:13,026 INFO L87 Difference]: Start difference. First operand 32736 states and 99897 transitions. Second operand 7 states. [2018-11-28 19:43:13,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:13,809 INFO L93 Difference]: Finished difference Result 29386 states and 84354 transitions. [2018-11-28 19:43:13,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 19:43:13,810 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2018-11-28 19:43:13,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:13,855 INFO L225 Difference]: With dead ends: 29386 [2018-11-28 19:43:13,855 INFO L226 Difference]: Without dead ends: 29386 [2018-11-28 19:43:13,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-11-28 19:43:13,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29386 states. [2018-11-28 19:43:14,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29386 to 24927. [2018-11-28 19:43:14,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24927 states. [2018-11-28 19:43:14,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24927 states to 24927 states and 71599 transitions. [2018-11-28 19:43:14,445 INFO L78 Accepts]: Start accepts. Automaton has 24927 states and 71599 transitions. Word has length 69 [2018-11-28 19:43:14,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:14,445 INFO L480 AbstractCegarLoop]: Abstraction has 24927 states and 71599 transitions. [2018-11-28 19:43:14,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 19:43:14,445 INFO L276 IsEmpty]: Start isEmpty. Operand 24927 states and 71599 transitions. [2018-11-28 19:43:14,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-28 19:43:14,455 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:14,455 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] [2018-11-28 19:43:14,455 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:14,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:14,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1199818054, now seen corresponding path program 1 times [2018-11-28 19:43:14,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:14,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:14,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:14,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:14,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:14,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:14,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:14,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:14,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 19:43:14,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 19:43:14,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 19:43:14,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:43:14,604 INFO L87 Difference]: Start difference. First operand 24927 states and 71599 transitions. Second operand 5 states. [2018-11-28 19:43:14,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:14,689 INFO L93 Difference]: Finished difference Result 7463 states and 17981 transitions. [2018-11-28 19:43:14,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 19:43:14,690 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-11-28 19:43:14,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:14,699 INFO L225 Difference]: With dead ends: 7463 [2018-11-28 19:43:14,699 INFO L226 Difference]: Without dead ends: 6138 [2018-11-28 19:43:14,700 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 [2018-11-28 19:43:14,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6138 states. [2018-11-28 19:43:14,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6138 to 5532. [2018-11-28 19:43:14,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5532 states. [2018-11-28 19:43:14,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5532 states to 5532 states and 12870 transitions. [2018-11-28 19:43:14,764 INFO L78 Accepts]: Start accepts. Automaton has 5532 states and 12870 transitions. Word has length 69 [2018-11-28 19:43:14,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:14,765 INFO L480 AbstractCegarLoop]: Abstraction has 5532 states and 12870 transitions. [2018-11-28 19:43:14,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 19:43:14,765 INFO L276 IsEmpty]: Start isEmpty. Operand 5532 states and 12870 transitions. [2018-11-28 19:43:14,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-28 19:43:14,770 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:14,770 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] [2018-11-28 19:43:14,771 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:14,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:14,771 INFO L82 PathProgramCache]: Analyzing trace with hash 916580311, now seen corresponding path program 1 times [2018-11-28 19:43:14,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:14,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:14,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:14,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:14,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:14,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:14,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:14,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:14,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 19:43:14,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 19:43:14,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 19:43:14,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 19:43:14,828 INFO L87 Difference]: Start difference. First operand 5532 states and 12870 transitions. Second operand 3 states. [2018-11-28 19:43:15,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:15,025 INFO L93 Difference]: Finished difference Result 7168 states and 16476 transitions. [2018-11-28 19:43:15,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 19:43:15,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-11-28 19:43:15,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:15,034 INFO L225 Difference]: With dead ends: 7168 [2018-11-28 19:43:15,034 INFO L226 Difference]: Without dead ends: 7168 [2018-11-28 19:43:15,034 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 [2018-11-28 19:43:15,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7168 states. [2018-11-28 19:43:15,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7168 to 5471. [2018-11-28 19:43:15,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5471 states. [2018-11-28 19:43:15,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5471 states to 5471 states and 12410 transitions. [2018-11-28 19:43:15,101 INFO L78 Accepts]: Start accepts. Automaton has 5471 states and 12410 transitions. Word has length 69 [2018-11-28 19:43:15,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:15,101 INFO L480 AbstractCegarLoop]: Abstraction has 5471 states and 12410 transitions. [2018-11-28 19:43:15,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 19:43:15,101 INFO L276 IsEmpty]: Start isEmpty. Operand 5471 states and 12410 transitions. [2018-11-28 19:43:15,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-28 19:43:15,107 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:15,107 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:15,107 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:15,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:15,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1596601910, now seen corresponding path program 1 times [2018-11-28 19:43:15,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:15,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:15,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:15,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:15,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:15,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:15,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:15,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 19:43:15,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 19:43:15,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 19:43:15,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:43:15,351 INFO L87 Difference]: Start difference. First operand 5471 states and 12410 transitions. Second operand 5 states. [2018-11-28 19:43:15,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:15,538 INFO L93 Difference]: Finished difference Result 6625 states and 15015 transitions. [2018-11-28 19:43:15,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 19:43:15,540 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2018-11-28 19:43:15,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:15,548 INFO L225 Difference]: With dead ends: 6625 [2018-11-28 19:43:15,548 INFO L226 Difference]: Without dead ends: 6625 [2018-11-28 19:43:15,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-28 19:43:15,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6625 states. [2018-11-28 19:43:15,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6625 to 5915. [2018-11-28 19:43:15,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5915 states. [2018-11-28 19:43:15,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5915 states to 5915 states and 13414 transitions. [2018-11-28 19:43:15,615 INFO L78 Accepts]: Start accepts. Automaton has 5915 states and 13414 transitions. Word has length 75 [2018-11-28 19:43:15,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:15,616 INFO L480 AbstractCegarLoop]: Abstraction has 5915 states and 13414 transitions. [2018-11-28 19:43:15,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 19:43:15,616 INFO L276 IsEmpty]: Start isEmpty. Operand 5915 states and 13414 transitions. [2018-11-28 19:43:15,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-28 19:43:15,622 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:15,622 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] [2018-11-28 19:43:15,622 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:15,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:15,623 INFO L82 PathProgramCache]: Analyzing trace with hash 146208425, now seen corresponding path program 1 times [2018-11-28 19:43:15,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:15,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:15,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:15,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:15,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:15,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:15,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:15,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:15,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 19:43:15,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 19:43:15,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 19:43:15,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 19:43:15,861 INFO L87 Difference]: Start difference. First operand 5915 states and 13414 transitions. Second operand 7 states. [2018-11-28 19:43:16,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:16,348 INFO L93 Difference]: Finished difference Result 6842 states and 15342 transitions. [2018-11-28 19:43:16,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 19:43:16,351 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2018-11-28 19:43:16,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:16,358 INFO L225 Difference]: With dead ends: 6842 [2018-11-28 19:43:16,359 INFO L226 Difference]: Without dead ends: 6740 [2018-11-28 19:43:16,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-11-28 19:43:16,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6740 states. [2018-11-28 19:43:16,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6740 to 6012. [2018-11-28 19:43:16,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6012 states. [2018-11-28 19:43:16,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6012 states to 6012 states and 13507 transitions. [2018-11-28 19:43:16,428 INFO L78 Accepts]: Start accepts. Automaton has 6012 states and 13507 transitions. Word has length 75 [2018-11-28 19:43:16,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:16,428 INFO L480 AbstractCegarLoop]: Abstraction has 6012 states and 13507 transitions. [2018-11-28 19:43:16,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 19:43:16,428 INFO L276 IsEmpty]: Start isEmpty. Operand 6012 states and 13507 transitions. [2018-11-28 19:43:16,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-28 19:43:16,435 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:16,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:16,436 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:16,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:16,436 INFO L82 PathProgramCache]: Analyzing trace with hash 189178790, now seen corresponding path program 1 times [2018-11-28 19:43:16,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:16,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:16,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:16,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:16,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:16,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:16,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:16,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:16,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 19:43:16,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 19:43:16,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 19:43:16,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 19:43:16,887 INFO L87 Difference]: Start difference. First operand 6012 states and 13507 transitions. Second operand 7 states. [2018-11-28 19:43:17,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:17,608 INFO L93 Difference]: Finished difference Result 7492 states and 16836 transitions. [2018-11-28 19:43:17,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 19:43:17,609 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-11-28 19:43:17,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:17,619 INFO L225 Difference]: With dead ends: 7492 [2018-11-28 19:43:17,620 INFO L226 Difference]: Without dead ends: 7492 [2018-11-28 19:43:17,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 19:43:17,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7492 states. [2018-11-28 19:43:17,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7492 to 6152. [2018-11-28 19:43:17,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6152 states. [2018-11-28 19:43:17,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6152 states to 6152 states and 13895 transitions. [2018-11-28 19:43:17,698 INFO L78 Accepts]: Start accepts. Automaton has 6152 states and 13895 transitions. Word has length 96 [2018-11-28 19:43:17,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:17,698 INFO L480 AbstractCegarLoop]: Abstraction has 6152 states and 13895 transitions. [2018-11-28 19:43:17,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 19:43:17,698 INFO L276 IsEmpty]: Start isEmpty. Operand 6152 states and 13895 transitions. [2018-11-28 19:43:17,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-28 19:43:17,705 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:17,705 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:17,706 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:17,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:17,706 INFO L82 PathProgramCache]: Analyzing trace with hash -466870943, now seen corresponding path program 1 times [2018-11-28 19:43:17,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:17,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:17,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:17,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:17,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:17,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:17,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:17,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:17,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 19:43:17,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 19:43:17,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 19:43:17,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:43:17,935 INFO L87 Difference]: Start difference. First operand 6152 states and 13895 transitions. Second operand 4 states. [2018-11-28 19:43:18,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:18,051 INFO L93 Difference]: Finished difference Result 7319 states and 16393 transitions. [2018-11-28 19:43:18,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 19:43:18,052 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2018-11-28 19:43:18,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:18,060 INFO L225 Difference]: With dead ends: 7319 [2018-11-28 19:43:18,060 INFO L226 Difference]: Without dead ends: 7319 [2018-11-28 19:43:18,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:43:18,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7319 states. [2018-11-28 19:43:18,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7319 to 6509. [2018-11-28 19:43:18,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6509 states. [2018-11-28 19:43:18,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6509 states to 6509 states and 14665 transitions. [2018-11-28 19:43:18,136 INFO L78 Accepts]: Start accepts. Automaton has 6509 states and 14665 transitions. Word has length 96 [2018-11-28 19:43:18,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:18,136 INFO L480 AbstractCegarLoop]: Abstraction has 6509 states and 14665 transitions. [2018-11-28 19:43:18,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 19:43:18,137 INFO L276 IsEmpty]: Start isEmpty. Operand 6509 states and 14665 transitions. [2018-11-28 19:43:18,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-28 19:43:18,144 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:18,144 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:18,144 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:18,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:18,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1444042279, now seen corresponding path program 1 times [2018-11-28 19:43:18,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:18,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:18,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:18,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:18,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:18,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:18,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:18,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:18,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 19:43:18,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 19:43:18,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 19:43:18,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:43:18,368 INFO L87 Difference]: Start difference. First operand 6509 states and 14665 transitions. Second operand 5 states. [2018-11-28 19:43:18,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:18,497 INFO L93 Difference]: Finished difference Result 7016 states and 15753 transitions. [2018-11-28 19:43:18,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 19:43:18,498 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2018-11-28 19:43:18,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:18,506 INFO L225 Difference]: With dead ends: 7016 [2018-11-28 19:43:18,506 INFO L226 Difference]: Without dead ends: 7016 [2018-11-28 19:43:18,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 19:43:18,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7016 states. [2018-11-28 19:43:18,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7016 to 5405. [2018-11-28 19:43:18,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5405 states. [2018-11-28 19:43:18,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5405 states to 5405 states and 12181 transitions. [2018-11-28 19:43:18,571 INFO L78 Accepts]: Start accepts. Automaton has 5405 states and 12181 transitions. Word has length 98 [2018-11-28 19:43:18,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:18,571 INFO L480 AbstractCegarLoop]: Abstraction has 5405 states and 12181 transitions. [2018-11-28 19:43:18,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 19:43:18,571 INFO L276 IsEmpty]: Start isEmpty. Operand 5405 states and 12181 transitions. [2018-11-28 19:43:18,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-28 19:43:18,579 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:18,580 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:18,580 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:18,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:18,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1455358406, now seen corresponding path program 1 times [2018-11-28 19:43:18,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:18,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:18,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:18,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:18,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:18,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:18,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:18,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:18,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 19:43:18,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 19:43:18,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 19:43:18,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:43:18,818 INFO L87 Difference]: Start difference. First operand 5405 states and 12181 transitions. Second operand 4 states. [2018-11-28 19:43:19,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:19,180 INFO L93 Difference]: Finished difference Result 6953 states and 15553 transitions. [2018-11-28 19:43:19,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 19:43:19,182 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-11-28 19:43:19,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:19,190 INFO L225 Difference]: With dead ends: 6953 [2018-11-28 19:43:19,191 INFO L226 Difference]: Without dead ends: 6886 [2018-11-28 19:43:19,191 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 [2018-11-28 19:43:19,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6886 states. [2018-11-28 19:43:19,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6886 to 6454. [2018-11-28 19:43:19,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6454 states. [2018-11-28 19:43:19,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6454 states to 6454 states and 14500 transitions. [2018-11-28 19:43:19,265 INFO L78 Accepts]: Start accepts. Automaton has 6454 states and 14500 transitions. Word has length 98 [2018-11-28 19:43:19,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:19,265 INFO L480 AbstractCegarLoop]: Abstraction has 6454 states and 14500 transitions. [2018-11-28 19:43:19,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 19:43:19,266 INFO L276 IsEmpty]: Start isEmpty. Operand 6454 states and 14500 transitions. [2018-11-28 19:43:19,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-28 19:43:19,273 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:19,273 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:19,273 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:19,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:19,274 INFO L82 PathProgramCache]: Analyzing trace with hash -621850937, now seen corresponding path program 1 times [2018-11-28 19:43:19,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:19,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:19,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:19,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:19,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:19,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:20,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:20,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:20,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 19:43:20,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 19:43:20,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 19:43:20,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-28 19:43:20,150 INFO L87 Difference]: Start difference. First operand 6454 states and 14500 transitions. Second operand 9 states. [2018-11-28 19:43:22,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:22,266 INFO L93 Difference]: Finished difference Result 8235 states and 18257 transitions. [2018-11-28 19:43:22,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-28 19:43:22,267 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2018-11-28 19:43:22,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:22,276 INFO L225 Difference]: With dead ends: 8235 [2018-11-28 19:43:22,276 INFO L226 Difference]: Without dead ends: 8235 [2018-11-28 19:43:22,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2018-11-28 19:43:22,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8235 states. [2018-11-28 19:43:22,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8235 to 7030. [2018-11-28 19:43:22,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7030 states. [2018-11-28 19:43:22,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7030 states to 7030 states and 15670 transitions. [2018-11-28 19:43:22,359 INFO L78 Accepts]: Start accepts. Automaton has 7030 states and 15670 transitions. Word has length 98 [2018-11-28 19:43:22,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:22,360 INFO L480 AbstractCegarLoop]: Abstraction has 7030 states and 15670 transitions. [2018-11-28 19:43:22,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 19:43:22,360 INFO L276 IsEmpty]: Start isEmpty. Operand 7030 states and 15670 transitions. [2018-11-28 19:43:22,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-28 19:43:22,367 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:22,367 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:22,368 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:22,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:22,368 INFO L82 PathProgramCache]: Analyzing trace with hash -410500024, now seen corresponding path program 1 times [2018-11-28 19:43:22,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:22,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:22,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:22,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:22,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:22,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:22,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:22,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:22,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 19:43:22,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 19:43:22,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 19:43:22,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-28 19:43:22,639 INFO L87 Difference]: Start difference. First operand 7030 states and 15670 transitions. Second operand 9 states. [2018-11-28 19:43:23,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:23,217 INFO L93 Difference]: Finished difference Result 8246 states and 18329 transitions. [2018-11-28 19:43:23,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-28 19:43:23,219 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2018-11-28 19:43:23,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:23,230 INFO L225 Difference]: With dead ends: 8246 [2018-11-28 19:43:23,230 INFO L226 Difference]: Without dead ends: 8159 [2018-11-28 19:43:23,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2018-11-28 19:43:23,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8159 states. [2018-11-28 19:43:23,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8159 to 6991. [2018-11-28 19:43:23,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6991 states. [2018-11-28 19:43:23,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6991 states to 6991 states and 15582 transitions. [2018-11-28 19:43:23,322 INFO L78 Accepts]: Start accepts. Automaton has 6991 states and 15582 transitions. Word has length 98 [2018-11-28 19:43:23,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:23,322 INFO L480 AbstractCegarLoop]: Abstraction has 6991 states and 15582 transitions. [2018-11-28 19:43:23,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 19:43:23,323 INFO L276 IsEmpty]: Start isEmpty. Operand 6991 states and 15582 transitions. [2018-11-28 19:43:23,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-28 19:43:23,332 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:23,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, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:23,333 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:23,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:23,333 INFO L82 PathProgramCache]: Analyzing trace with hash 477003657, now seen corresponding path program 1 times [2018-11-28 19:43:23,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:23,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:23,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:23,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:23,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:23,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:23,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:23,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:23,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 19:43:23,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 19:43:23,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 19:43:23,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-28 19:43:23,550 INFO L87 Difference]: Start difference. First operand 6991 states and 15582 transitions. Second operand 9 states. [2018-11-28 19:43:24,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:24,616 INFO L93 Difference]: Finished difference Result 11197 states and 24928 transitions. [2018-11-28 19:43:24,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 19:43:24,618 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2018-11-28 19:43:24,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:24,628 INFO L225 Difference]: With dead ends: 11197 [2018-11-28 19:43:24,628 INFO L226 Difference]: Without dead ends: 8089 [2018-11-28 19:43:24,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-11-28 19:43:24,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8089 states. [2018-11-28 19:43:24,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8089 to 7048. [2018-11-28 19:43:24,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7048 states. [2018-11-28 19:43:24,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7048 states to 7048 states and 15699 transitions. [2018-11-28 19:43:24,732 INFO L78 Accepts]: Start accepts. Automaton has 7048 states and 15699 transitions. Word has length 98 [2018-11-28 19:43:24,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:24,732 INFO L480 AbstractCegarLoop]: Abstraction has 7048 states and 15699 transitions. [2018-11-28 19:43:24,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 19:43:24,732 INFO L276 IsEmpty]: Start isEmpty. Operand 7048 states and 15699 transitions. [2018-11-28 19:43:24,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-28 19:43:24,741 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:24,741 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:24,742 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:24,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:24,742 INFO L82 PathProgramCache]: Analyzing trace with hash -543309766, now seen corresponding path program 1 times [2018-11-28 19:43:24,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:24,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:24,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:24,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:24,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:24,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:25,482 WARN L180 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 16 [2018-11-28 19:43:25,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:25,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:25,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 19:43:25,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 19:43:25,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 19:43:25,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 19:43:25,518 INFO L87 Difference]: Start difference. First operand 7048 states and 15699 transitions. Second operand 6 states. [2018-11-28 19:43:25,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:25,844 INFO L93 Difference]: Finished difference Result 7978 states and 17540 transitions. [2018-11-28 19:43:25,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 19:43:25,845 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2018-11-28 19:43:25,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:25,856 INFO L225 Difference]: With dead ends: 7978 [2018-11-28 19:43:25,856 INFO L226 Difference]: Without dead ends: 7926 [2018-11-28 19:43:25,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-28 19:43:25,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7926 states. [2018-11-28 19:43:26,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7926 to 6952. [2018-11-28 19:43:26,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6952 states. [2018-11-28 19:43:26,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6952 states to 6952 states and 15372 transitions. [2018-11-28 19:43:26,017 INFO L78 Accepts]: Start accepts. Automaton has 6952 states and 15372 transitions. Word has length 98 [2018-11-28 19:43:26,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:26,018 INFO L480 AbstractCegarLoop]: Abstraction has 6952 states and 15372 transitions. [2018-11-28 19:43:26,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 19:43:26,018 INFO L276 IsEmpty]: Start isEmpty. Operand 6952 states and 15372 transitions. [2018-11-28 19:43:26,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-28 19:43:26,025 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:26,025 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:26,025 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:26,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:26,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1661772762, now seen corresponding path program 2 times [2018-11-28 19:43:26,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:26,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:26,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:26,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:26,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:26,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:26,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:26,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:26,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 19:43:26,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 19:43:26,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 19:43:26,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 19:43:26,148 INFO L87 Difference]: Start difference. First operand 6952 states and 15372 transitions. Second operand 6 states. [2018-11-28 19:43:26,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:26,369 INFO L93 Difference]: Finished difference Result 7313 states and 16120 transitions. [2018-11-28 19:43:26,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 19:43:26,370 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2018-11-28 19:43:26,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:26,379 INFO L225 Difference]: With dead ends: 7313 [2018-11-28 19:43:26,379 INFO L226 Difference]: Without dead ends: 7313 [2018-11-28 19:43:26,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-28 19:43:26,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7313 states. [2018-11-28 19:43:26,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7313 to 6856. [2018-11-28 19:43:26,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6856 states. [2018-11-28 19:43:26,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6856 states to 6856 states and 15165 transitions. [2018-11-28 19:43:26,457 INFO L78 Accepts]: Start accepts. Automaton has 6856 states and 15165 transitions. Word has length 98 [2018-11-28 19:43:26,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:26,458 INFO L480 AbstractCegarLoop]: Abstraction has 6856 states and 15165 transitions. [2018-11-28 19:43:26,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 19:43:26,458 INFO L276 IsEmpty]: Start isEmpty. Operand 6856 states and 15165 transitions. [2018-11-28 19:43:26,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-28 19:43:26,465 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:26,465 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:26,466 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:26,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:26,466 INFO L82 PathProgramCache]: Analyzing trace with hash -419236519, now seen corresponding path program 2 times [2018-11-28 19:43:26,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:26,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:26,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:26,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 19:43:26,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:26,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:26,904 WARN L180 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 16 [2018-11-28 19:43:27,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:27,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:27,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 19:43:27,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 19:43:27,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 19:43:27,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-28 19:43:27,118 INFO L87 Difference]: Start difference. First operand 6856 states and 15165 transitions. Second operand 10 states. [2018-11-28 19:43:27,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:27,870 INFO L93 Difference]: Finished difference Result 12036 states and 26654 transitions. [2018-11-28 19:43:27,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 19:43:27,871 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 98 [2018-11-28 19:43:27,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:27,882 INFO L225 Difference]: With dead ends: 12036 [2018-11-28 19:43:27,882 INFO L226 Difference]: Without dead ends: 8233 [2018-11-28 19:43:27,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-11-28 19:43:27,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8233 states. [2018-11-28 19:43:27,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8233 to 6837. [2018-11-28 19:43:27,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6837 states. [2018-11-28 19:43:27,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6837 states to 6837 states and 15107 transitions. [2018-11-28 19:43:27,962 INFO L78 Accepts]: Start accepts. Automaton has 6837 states and 15107 transitions. Word has length 98 [2018-11-28 19:43:27,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:27,963 INFO L480 AbstractCegarLoop]: Abstraction has 6837 states and 15107 transitions. [2018-11-28 19:43:27,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 19:43:27,963 INFO L276 IsEmpty]: Start isEmpty. Operand 6837 states and 15107 transitions. [2018-11-28 19:43:27,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-28 19:43:27,970 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:27,970 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:27,971 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:27,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:27,971 INFO L82 PathProgramCache]: Analyzing trace with hash -682671939, now seen corresponding path program 3 times [2018-11-28 19:43:27,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:27,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:27,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:27,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 19:43:27,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:27,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:28,188 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 16 [2018-11-28 19:43:28,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:28,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:28,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 19:43:28,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 19:43:28,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 19:43:28,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-28 19:43:28,254 INFO L87 Difference]: Start difference. First operand 6837 states and 15107 transitions. Second operand 10 states. [2018-11-28 19:43:28,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:28,993 INFO L93 Difference]: Finished difference Result 12084 states and 26746 transitions. [2018-11-28 19:43:28,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 19:43:28,995 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 98 [2018-11-28 19:43:28,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:29,000 INFO L225 Difference]: With dead ends: 12084 [2018-11-28 19:43:29,000 INFO L226 Difference]: Without dead ends: 4267 [2018-11-28 19:43:29,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2018-11-28 19:43:29,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4267 states. [2018-11-28 19:43:29,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4267 to 4267. [2018-11-28 19:43:29,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4267 states. [2018-11-28 19:43:29,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4267 states to 4267 states and 9470 transitions. [2018-11-28 19:43:29,043 INFO L78 Accepts]: Start accepts. Automaton has 4267 states and 9470 transitions. Word has length 98 [2018-11-28 19:43:29,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:29,043 INFO L480 AbstractCegarLoop]: Abstraction has 4267 states and 9470 transitions. [2018-11-28 19:43:29,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 19:43:29,043 INFO L276 IsEmpty]: Start isEmpty. Operand 4267 states and 9470 transitions. [2018-11-28 19:43:29,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-28 19:43:29,048 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:29,048 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:29,048 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:29,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:29,049 INFO L82 PathProgramCache]: Analyzing trace with hash 2121145011, now seen corresponding path program 4 times [2018-11-28 19:43:29,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:29,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:29,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:29,051 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 19:43:29,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:29,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:29,321 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-28 19:43:29,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:29,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:29,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 19:43:29,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 19:43:29,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 19:43:29,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-28 19:43:29,419 INFO L87 Difference]: Start difference. First operand 4267 states and 9470 transitions. Second operand 11 states. [2018-11-28 19:43:30,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:30,843 INFO L93 Difference]: Finished difference Result 8508 states and 19055 transitions. [2018-11-28 19:43:30,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-28 19:43:30,844 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 98 [2018-11-28 19:43:30,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:30,851 INFO L225 Difference]: With dead ends: 8508 [2018-11-28 19:43:30,851 INFO L226 Difference]: Without dead ends: 5551 [2018-11-28 19:43:30,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2018-11-28 19:43:30,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5551 states. [2018-11-28 19:43:30,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5551 to 4300. [2018-11-28 19:43:30,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4300 states. [2018-11-28 19:43:30,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4300 states to 4300 states and 9496 transitions. [2018-11-28 19:43:30,902 INFO L78 Accepts]: Start accepts. Automaton has 4300 states and 9496 transitions. Word has length 98 [2018-11-28 19:43:30,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:30,903 INFO L480 AbstractCegarLoop]: Abstraction has 4300 states and 9496 transitions. [2018-11-28 19:43:30,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 19:43:30,903 INFO L276 IsEmpty]: Start isEmpty. Operand 4300 states and 9496 transitions. [2018-11-28 19:43:30,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-28 19:43:30,908 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:30,908 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:30,908 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:30,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:30,909 INFO L82 PathProgramCache]: Analyzing trace with hash -697818827, now seen corresponding path program 1 times [2018-11-28 19:43:30,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:30,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:30,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:30,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 19:43:30,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:30,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:31,438 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-28 19:43:31,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:31,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:31,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 19:43:31,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 19:43:31,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 19:43:31,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 19:43:31,705 INFO L87 Difference]: Start difference. First operand 4300 states and 9496 transitions. Second operand 8 states. [2018-11-28 19:43:32,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:32,172 INFO L93 Difference]: Finished difference Result 5023 states and 10984 transitions. [2018-11-28 19:43:32,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 19:43:32,174 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 98 [2018-11-28 19:43:32,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:32,180 INFO L225 Difference]: With dead ends: 5023 [2018-11-28 19:43:32,180 INFO L226 Difference]: Without dead ends: 5023 [2018-11-28 19:43:32,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-28 19:43:32,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5023 states. [2018-11-28 19:43:32,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5023 to 4304. [2018-11-28 19:43:32,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4304 states. [2018-11-28 19:43:32,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4304 states to 4304 states and 9506 transitions. [2018-11-28 19:43:32,230 INFO L78 Accepts]: Start accepts. Automaton has 4304 states and 9506 transitions. Word has length 98 [2018-11-28 19:43:32,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:32,231 INFO L480 AbstractCegarLoop]: Abstraction has 4304 states and 9506 transitions. [2018-11-28 19:43:32,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 19:43:32,231 INFO L276 IsEmpty]: Start isEmpty. Operand 4304 states and 9506 transitions. [2018-11-28 19:43:32,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-28 19:43:32,236 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:32,236 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:32,237 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:32,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:32,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1559092180, now seen corresponding path program 1 times [2018-11-28 19:43:32,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:32,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:32,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:32,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:32,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:32,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:32,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:32,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:32,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 19:43:32,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 19:43:32,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 19:43:32,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-28 19:43:32,640 INFO L87 Difference]: Start difference. First operand 4304 states and 9506 transitions. Second operand 7 states. [2018-11-28 19:43:32,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:32,976 INFO L93 Difference]: Finished difference Result 4557 states and 10002 transitions. [2018-11-28 19:43:32,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 19:43:32,978 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2018-11-28 19:43:32,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:32,985 INFO L225 Difference]: With dead ends: 4557 [2018-11-28 19:43:32,985 INFO L226 Difference]: Without dead ends: 4557 [2018-11-28 19:43:32,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-11-28 19:43:32,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4557 states. [2018-11-28 19:43:33,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4557 to 4344. [2018-11-28 19:43:33,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4344 states. [2018-11-28 19:43:33,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4344 states to 4344 states and 9578 transitions. [2018-11-28 19:43:33,031 INFO L78 Accepts]: Start accepts. Automaton has 4344 states and 9578 transitions. Word has length 98 [2018-11-28 19:43:33,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:33,031 INFO L480 AbstractCegarLoop]: Abstraction has 4344 states and 9578 transitions. [2018-11-28 19:43:33,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 19:43:33,032 INFO L276 IsEmpty]: Start isEmpty. Operand 4344 states and 9578 transitions. [2018-11-28 19:43:33,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-28 19:43:33,036 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:33,036 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:33,037 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:33,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:33,037 INFO L82 PathProgramCache]: Analyzing trace with hash 766293748, now seen corresponding path program 1 times [2018-11-28 19:43:33,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:33,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:33,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:33,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:33,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:33,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:33,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:33,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:33,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 19:43:33,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 19:43:33,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 19:43:33,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 19:43:33,386 INFO L87 Difference]: Start difference. First operand 4344 states and 9578 transitions. Second operand 7 states. [2018-11-28 19:43:34,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:34,076 INFO L93 Difference]: Finished difference Result 5452 states and 11772 transitions. [2018-11-28 19:43:34,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 19:43:34,077 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2018-11-28 19:43:34,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:34,084 INFO L225 Difference]: With dead ends: 5452 [2018-11-28 19:43:34,084 INFO L226 Difference]: Without dead ends: 5452 [2018-11-28 19:43:34,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2018-11-28 19:43:34,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5452 states. [2018-11-28 19:43:34,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5452 to 4633. [2018-11-28 19:43:34,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4633 states. [2018-11-28 19:43:34,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4633 states to 4633 states and 10199 transitions. [2018-11-28 19:43:34,136 INFO L78 Accepts]: Start accepts. Automaton has 4633 states and 10199 transitions. Word has length 98 [2018-11-28 19:43:34,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:34,136 INFO L480 AbstractCegarLoop]: Abstraction has 4633 states and 10199 transitions. [2018-11-28 19:43:34,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 19:43:34,136 INFO L276 IsEmpty]: Start isEmpty. Operand 4633 states and 10199 transitions. [2018-11-28 19:43:34,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-28 19:43:34,141 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:34,141 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:34,141 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:34,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:34,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1271762541, now seen corresponding path program 5 times [2018-11-28 19:43:34,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:34,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:34,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:34,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:34,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:34,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 19:43:34,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 19:43:34,222 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 19:43:34,445 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-11-28 19:43:34,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 07:43:34 BasicIcfg [2018-11-28 19:43:34,447 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 19:43:34,448 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 19:43:34,448 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 19:43:34,448 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 19:43:34,449 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 07:42:46" (3/4) ... [2018-11-28 19:43:34,454 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 19:43:34,685 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 19:43:34,688 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 19:43:34,691 INFO L168 Benchmark]: Toolchain (without parser) took 49836.65 ms. Allocated memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: 1.9 GB). Free memory was 951.3 MB in the beginning and 1.3 GB in the end (delta: -377.0 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2018-11-28 19:43:34,691 INFO L168 Benchmark]: CDTParser took 0.18 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. [2018-11-28 19:43:34,691 INFO L168 Benchmark]: CACSL2BoogieTranslator took 800.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -175.1 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. [2018-11-28 19:43:34,692 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-11-28 19:43:34,692 INFO L168 Benchmark]: Boogie Preprocessor took 55.98 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 19:43:34,692 INFO L168 Benchmark]: RCFGBuilder took 1185.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 11.5 GB. [2018-11-28 19:43:34,695 INFO L168 Benchmark]: TraceAbstraction took 47479.15 ms. Allocated memory was 1.2 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -296.0 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-11-28 19:43:34,696 INFO L168 Benchmark]: Witness Printer took 240.21 ms. Allocated memory is still 2.9 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. [2018-11-28 19:43:34,700 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.18 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 800.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -175.1 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 67.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 55.98 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1185.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 47479.15 ms. Allocated memory was 1.2 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -296.0 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 240.21 ms. Allocated memory is still 2.9 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L675] -1 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L677] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L679] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L680] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L681] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L683] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L685] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L687] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L688] -1 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L689] -1 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L690] -1 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L691] -1 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L692] -1 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L693] -1 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0] [L694] -1 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L695] -1 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L696] -1 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0] [L697] -1 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L698] -1 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L699] -1 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L700] -1 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L701] -1 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L702] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L703] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L785] -1 pthread_t t243; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L786] FCALL, FORK -1 pthread_create(&t243, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L707] 0 z$w_buff1 = z$w_buff0 [L708] 0 z$w_buff0 = 1 [L709] 0 z$w_buff1_used = z$w_buff0_used [L710] 0 z$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] -1 pthread_t t244; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] FCALL, FORK -1 pthread_create(&t244, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L712] 0 z$r_buff1_thd0 = z$r_buff0_thd0 [L713] 0 z$r_buff1_thd1 = z$r_buff0_thd1 [L714] 0 z$r_buff1_thd2 = z$r_buff0_thd2 [L715] 0 z$r_buff0_thd1 = (_Bool)1 [L718] 0 x = 1 [L721] 0 __unbuffered_p0_EAX = x [L724] 0 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L741] 1 y = 1 [L744] 1 __unbuffered_p1_EAX = y [L747] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L748] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L749] 1 z$flush_delayed = weak$$choice2 [L750] 1 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L752] EXPR 1 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L727] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] EXPR 1 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L754] EXPR 1 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L755] EXPR 1 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L756] EXPR 1 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L757] EXPR 1 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L727] 0 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L728] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L728] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L729] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L729] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L730] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L759] EXPR 1 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 z = z$flush_delayed ? z$mem_tmp : z [L760] 1 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L763] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L763] EXPR 1 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L763] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L763] 1 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L764] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L764] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L730] 0 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L765] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L765] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L766] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L766] 1 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L767] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L767] 1 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L770] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 0 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L734] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L790] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] EXPR -1 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] -1 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L795] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] -1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L796] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] -1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L797] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L797] -1 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L798] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] -1 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L801] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 225 locations, 3 error locations. UNSAFE Result, 47.2s OverallTime, 36 OverallIterations, 1 TraceHistogramMax, 24.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9423 SDtfs, 10593 SDslu, 22508 SDs, 0 SdLazy, 9465 SolverSat, 458 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 378 GetRequests, 83 SyntacticMatches, 37 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 10.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34809occurred in iteration=0, 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.4s AutomataMinimizationTime, 35 MinimizatonAttempts, 81292 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.5s InterpolantComputationTime, 2832 NumberOfCodeBlocks, 2832 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 2699 ConstructedInterpolants, 0 QuantifiedInterpolants, 625132 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 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...