./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix022_pso.opt_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/mix022_pso.opt_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7f023635c87a3256e501da0baa2258f1eabc71ba ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:52:39,776 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 19:52:39,780 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 19:52:39,797 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 19:52:39,799 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 19:52:39,800 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 19:52:39,802 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 19:52:39,805 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 19:52:39,814 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 19:52:39,815 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 19:52:39,816 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 19:52:39,816 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 19:52:39,821 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 19:52:39,824 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 19:52:39,825 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 19:52:39,830 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 19:52:39,831 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 19:52:39,832 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 19:52:39,834 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 19:52:39,836 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 19:52:39,837 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 19:52:39,839 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 19:52:39,841 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 19:52:39,841 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 19:52:39,842 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 19:52:39,843 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 19:52:39,844 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 19:52:39,845 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 19:52:39,846 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 19:52:39,847 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 19:52:39,848 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 19:52:39,848 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 19:52:39,848 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 19:52:39,849 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 19:52:39,849 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 19:52:39,851 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 19:52:39,851 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:52:39,866 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 19:52:39,866 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 19:52:39,867 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 19:52:39,867 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 19:52:39,868 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 19:52:39,868 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 19:52:39,869 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 19:52:39,869 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 19:52:39,869 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 19:52:39,869 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 19:52:39,869 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 19:52:39,869 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 19:52:39,870 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 19:52:39,870 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 19:52:39,870 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 19:52:39,870 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 19:52:39,870 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 19:52:39,870 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 19:52:39,872 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 19:52:39,872 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 19:52:39,872 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 19:52:39,873 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 19:52:39,873 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 19:52:39,873 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 19:52:39,874 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 19:52:39,874 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 19:52:39,874 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 19:52:39,875 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 19:52:39,875 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 19:52:39,875 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 19:52:39,875 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 -> 7f023635c87a3256e501da0baa2258f1eabc71ba [2018-11-28 19:52:39,939 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 19:52:39,956 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 19:52:39,963 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 19:52:39,965 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 19:52:39,966 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 19:52:39,966 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix022_pso.opt_false-unreach-call.i [2018-11-28 19:52:40,035 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2493f964e/ff0b3b7382a94a1f9676be7f2566cb84/FLAG8888650d8 [2018-11-28 19:52:40,582 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 19:52:40,583 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix022_pso.opt_false-unreach-call.i [2018-11-28 19:52:40,608 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2493f964e/ff0b3b7382a94a1f9676be7f2566cb84/FLAG8888650d8 [2018-11-28 19:52:40,828 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2493f964e/ff0b3b7382a94a1f9676be7f2566cb84 [2018-11-28 19:52:40,832 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 19:52:40,833 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 19:52:40,835 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 19:52:40,835 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 19:52:40,839 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 19:52:40,840 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 07:52:40" (1/1) ... [2018-11-28 19:52:40,844 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12aeca62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:52:40, skipping insertion in model container [2018-11-28 19:52:40,845 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 07:52:40" (1/1) ... [2018-11-28 19:52:40,854 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 19:52:40,916 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 19:52:41,457 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 19:52:41,474 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 19:52:41,724 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 19:52:41,840 INFO L195 MainTranslator]: Completed translation [2018-11-28 19:52:41,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:52:41 WrapperNode [2018-11-28 19:52:41,841 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 19:52:41,842 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 19:52:41,842 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 19:52:41,842 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 19:52:41,854 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:52:41" (1/1) ... [2018-11-28 19:52:41,887 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:52:41" (1/1) ... [2018-11-28 19:52:41,946 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 19:52:41,946 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 19:52:41,946 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 19:52:41,947 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 19:52:41,959 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:52:41" (1/1) ... [2018-11-28 19:52:41,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:52:41" (1/1) ... [2018-11-28 19:52:41,973 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:52:41" (1/1) ... [2018-11-28 19:52:41,973 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:52:41" (1/1) ... [2018-11-28 19:52:41,993 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:52:41" (1/1) ... [2018-11-28 19:52:41,997 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:52:41" (1/1) ... [2018-11-28 19:52:42,001 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:52:41" (1/1) ... [2018-11-28 19:52:42,007 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 19:52:42,008 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 19:52:42,008 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 19:52:42,008 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 19:52:42,009 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:52:41" (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:52:42,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 19:52:42,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 19:52:42,099 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-11-28 19:52:42,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 19:52:42,099 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-11-28 19:52:42,099 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-11-28 19:52:42,100 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-11-28 19:52:42,100 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-11-28 19:52:42,100 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-11-28 19:52:42,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 19:52:42,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 19:52:42,102 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:52:43,259 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 19:52:43,260 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 19:52:43,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 07:52:43 BoogieIcfgContainer [2018-11-28 19:52:43,261 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 19:52:43,262 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 19:52:43,262 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 19:52:43,269 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 19:52:43,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 07:52:40" (1/3) ... [2018-11-28 19:52:43,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea87b65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 07:52:43, skipping insertion in model container [2018-11-28 19:52:43,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:52:41" (2/3) ... [2018-11-28 19:52:43,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea87b65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 07:52:43, skipping insertion in model container [2018-11-28 19:52:43,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 07:52:43" (3/3) ... [2018-11-28 19:52:43,273 INFO L112 eAbstractionObserver]: Analyzing ICFG mix022_pso.opt_false-unreach-call.i [2018-11-28 19:52:43,334 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,334 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,335 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,335 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,335 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,335 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:52:43,336 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,336 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,336 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,336 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,337 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,337 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,338 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,338 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,338 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,339 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,339 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,339 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,339 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,340 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,340 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,340 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,340 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,340 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,341 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,341 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,341 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,341 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,342 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,342 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,342 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,342 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,343 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,343 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,343 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,343 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,343 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,343 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,345 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,345 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,345 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,345 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,345 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,346 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,346 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,346 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,346 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,346 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,346 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,347 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,347 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,347 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,347 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,348 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,348 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,348 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,348 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,348 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,349 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,349 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,349 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,349 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,349 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,350 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,350 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,350 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,350 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,351 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,351 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,351 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,351 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,351 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,352 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,352 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,352 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,352 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,353 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,353 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,353 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,353 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,353 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,354 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,354 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,354 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,354 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,354 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,355 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,355 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,355 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,355 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,356 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,356 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,356 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,356 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,356 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,357 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,357 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,357 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,357 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,357 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,358 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,358 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,358 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,358 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,358 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,359 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,359 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,359 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,359 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,360 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,360 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,360 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,360 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,361 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,361 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,361 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,361 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,361 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,361 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,362 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,362 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,362 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,362 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,363 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,363 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,363 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,363 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,363 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,364 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,364 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,364 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,364 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,364 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,365 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,365 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,365 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,365 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,365 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,366 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,366 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,366 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,366 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,367 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,367 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,367 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,367 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,367 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,368 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,368 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,368 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,368 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,368 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,369 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,369 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,369 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,369 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,370 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,370 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,370 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,370 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,370 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,370 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,371 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,371 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:52:43,393 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-11-28 19:52:43,394 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 19:52:43,402 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-28 19:52:43,419 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-28 19:52:43,455 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 19:52:43,456 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 19:52:43,457 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 19:52:43,457 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 19:52:43,457 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 19:52:43,457 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 19:52:43,457 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 19:52:43,457 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 19:52:43,457 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 19:52:43,478 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 142places, 180 transitions [2018-11-28 19:52:45,634 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34806 states. [2018-11-28 19:52:45,636 INFO L276 IsEmpty]: Start isEmpty. Operand 34806 states. [2018-11-28 19:52:45,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 19:52:45,645 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:52:45,646 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] [2018-11-28 19:52:45,649 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:52:45,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:52:45,656 INFO L82 PathProgramCache]: Analyzing trace with hash 2100747441, now seen corresponding path program 1 times [2018-11-28 19:52:45,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:52:45,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:52:45,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:52:45,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:52:45,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:52:45,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:52:45,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:52:45,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:52:45,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 19:52:45,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 19:52:46,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 19:52:46,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:52:46,021 INFO L87 Difference]: Start difference. First operand 34806 states. Second operand 4 states. [2018-11-28 19:52:47,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:52:47,420 INFO L93 Difference]: Finished difference Result 60790 states and 234493 transitions. [2018-11-28 19:52:47,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 19:52:47,427 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-11-28 19:52:47,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:52:47,779 INFO L225 Difference]: With dead ends: 60790 [2018-11-28 19:52:47,779 INFO L226 Difference]: Without dead ends: 44270 [2018-11-28 19:52:47,782 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:52:48,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44270 states. [2018-11-28 19:52:49,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44270 to 27338. [2018-11-28 19:52:49,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27338 states. [2018-11-28 19:52:49,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27338 states to 27338 states and 105499 transitions. [2018-11-28 19:52:49,499 INFO L78 Accepts]: Start accepts. Automaton has 27338 states and 105499 transitions. Word has length 33 [2018-11-28 19:52:49,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:52:49,500 INFO L480 AbstractCegarLoop]: Abstraction has 27338 states and 105499 transitions. [2018-11-28 19:52:49,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 19:52:49,500 INFO L276 IsEmpty]: Start isEmpty. Operand 27338 states and 105499 transitions. [2018-11-28 19:52:49,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-28 19:52:49,519 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:52:49,519 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] [2018-11-28 19:52:49,520 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:52:49,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:52:49,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1664977985, now seen corresponding path program 1 times [2018-11-28 19:52:49,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:52:49,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:52:49,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:52:49,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:52:49,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:52:49,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:52:49,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:52:49,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:52:49,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 19:52:49,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 19:52:49,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 19:52:49,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:52:49,759 INFO L87 Difference]: Start difference. First operand 27338 states and 105499 transitions. Second operand 4 states. [2018-11-28 19:52:50,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:52:50,130 INFO L93 Difference]: Finished difference Result 8528 states and 28344 transitions. [2018-11-28 19:52:50,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 19:52:50,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-11-28 19:52:50,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:52:50,160 INFO L225 Difference]: With dead ends: 8528 [2018-11-28 19:52:50,160 INFO L226 Difference]: Without dead ends: 7466 [2018-11-28 19:52:50,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:52:50,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7466 states. [2018-11-28 19:52:50,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7466 to 7466. [2018-11-28 19:52:50,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7466 states. [2018-11-28 19:52:50,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7466 states to 7466 states and 24636 transitions. [2018-11-28 19:52:50,368 INFO L78 Accepts]: Start accepts. Automaton has 7466 states and 24636 transitions. Word has length 45 [2018-11-28 19:52:50,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:52:50,368 INFO L480 AbstractCegarLoop]: Abstraction has 7466 states and 24636 transitions. [2018-11-28 19:52:50,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 19:52:50,369 INFO L276 IsEmpty]: Start isEmpty. Operand 7466 states and 24636 transitions. [2018-11-28 19:52:50,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-28 19:52:50,372 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:52:50,372 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] [2018-11-28 19:52:50,372 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:52:50,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:52:50,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1909915460, now seen corresponding path program 1 times [2018-11-28 19:52:50,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:52:50,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:52:50,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:52:50,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:52:50,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:52:50,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:52:50,627 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:52:50,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:52:50,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 19:52:50,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 19:52:50,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 19:52:50,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:52:50,630 INFO L87 Difference]: Start difference. First operand 7466 states and 24636 transitions. Second operand 5 states. [2018-11-28 19:52:51,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:52:51,934 INFO L93 Difference]: Finished difference Result 13998 states and 45805 transitions. [2018-11-28 19:52:51,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 19:52:51,938 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-11-28 19:52:51,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:52:51,990 INFO L225 Difference]: With dead ends: 13998 [2018-11-28 19:52:51,991 INFO L226 Difference]: Without dead ends: 13930 [2018-11-28 19:52:51,991 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:52:52,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13930 states. [2018-11-28 19:52:52,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13930 to 9441. [2018-11-28 19:52:52,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9441 states. [2018-11-28 19:52:52,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9441 states to 9441 states and 30542 transitions. [2018-11-28 19:52:52,258 INFO L78 Accepts]: Start accepts. Automaton has 9441 states and 30542 transitions. Word has length 46 [2018-11-28 19:52:52,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:52:52,260 INFO L480 AbstractCegarLoop]: Abstraction has 9441 states and 30542 transitions. [2018-11-28 19:52:52,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 19:52:52,261 INFO L276 IsEmpty]: Start isEmpty. Operand 9441 states and 30542 transitions. [2018-11-28 19:52:52,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-28 19:52:52,266 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:52:52,266 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:52:52,267 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:52:52,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:52:52,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1845061814, now seen corresponding path program 1 times [2018-11-28 19:52:52,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:52:52,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:52:52,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:52:52,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:52:52,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:52:52,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:52:52,382 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:52:52,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:52:52,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 19:52:52,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 19:52:52,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 19:52:52,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 19:52:52,384 INFO L87 Difference]: Start difference. First operand 9441 states and 30542 transitions. Second operand 3 states. [2018-11-28 19:52:53,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:52:53,023 INFO L93 Difference]: Finished difference Result 13279 states and 42641 transitions. [2018-11-28 19:52:53,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 19:52:53,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-11-28 19:52:53,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:52:53,054 INFO L225 Difference]: With dead ends: 13279 [2018-11-28 19:52:53,054 INFO L226 Difference]: Without dead ends: 13279 [2018-11-28 19:52:53,054 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:52:53,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13279 states. [2018-11-28 19:52:53,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13279 to 9845. [2018-11-28 19:52:53,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9845 states. [2018-11-28 19:52:53,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9845 states to 9845 states and 31508 transitions. [2018-11-28 19:52:53,310 INFO L78 Accepts]: Start accepts. Automaton has 9845 states and 31508 transitions. Word has length 48 [2018-11-28 19:52:53,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:52:53,310 INFO L480 AbstractCegarLoop]: Abstraction has 9845 states and 31508 transitions. [2018-11-28 19:52:53,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 19:52:53,310 INFO L276 IsEmpty]: Start isEmpty. Operand 9845 states and 31508 transitions. [2018-11-28 19:52:53,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-28 19:52:53,313 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:52:53,313 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] [2018-11-28 19:52:53,313 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:52:53,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:52:53,314 INFO L82 PathProgramCache]: Analyzing trace with hash 484350805, now seen corresponding path program 1 times [2018-11-28 19:52:53,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:52:53,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:52:53,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:52:53,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:52:53,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:52:53,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:52:53,642 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-28 19:52:53,817 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:52:53,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:52:53,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 19:52:53,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 19:52:53,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 19:52:53,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 19:52:53,818 INFO L87 Difference]: Start difference. First operand 9845 states and 31508 transitions. Second operand 7 states. [2018-11-28 19:52:54,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:52:54,990 INFO L93 Difference]: Finished difference Result 12285 states and 38673 transitions. [2018-11-28 19:52:54,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 19:52:54,991 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-11-28 19:52:54,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:52:55,016 INFO L225 Difference]: With dead ends: 12285 [2018-11-28 19:52:55,017 INFO L226 Difference]: Without dead ends: 12213 [2018-11-28 19:52:55,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-11-28 19:52:55,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12213 states. [2018-11-28 19:52:55,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12213 to 10849. [2018-11-28 19:52:55,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10849 states. [2018-11-28 19:52:55,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10849 states to 10849 states and 34563 transitions. [2018-11-28 19:52:55,258 INFO L78 Accepts]: Start accepts. Automaton has 10849 states and 34563 transitions. Word has length 52 [2018-11-28 19:52:55,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:52:55,259 INFO L480 AbstractCegarLoop]: Abstraction has 10849 states and 34563 transitions. [2018-11-28 19:52:55,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 19:52:55,260 INFO L276 IsEmpty]: Start isEmpty. Operand 10849 states and 34563 transitions. [2018-11-28 19:52:55,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-28 19:52:55,266 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:52:55,267 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] [2018-11-28 19:52:55,267 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:52:55,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:52:55,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1383304625, now seen corresponding path program 1 times [2018-11-28 19:52:55,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:52:55,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:52:55,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:52:55,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:52:55,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:52:55,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:52:55,485 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:52:55,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:52:55,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 19:52:55,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 19:52:55,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 19:52:55,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:52:55,487 INFO L87 Difference]: Start difference. First operand 10849 states and 34563 transitions. Second operand 4 states. [2018-11-28 19:52:55,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:52:55,839 INFO L93 Difference]: Finished difference Result 12396 states and 39572 transitions. [2018-11-28 19:52:55,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 19:52:55,840 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-11-28 19:52:55,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:52:55,862 INFO L225 Difference]: With dead ends: 12396 [2018-11-28 19:52:55,862 INFO L226 Difference]: Without dead ends: 12396 [2018-11-28 19:52:55,862 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:52:55,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12396 states. [2018-11-28 19:52:56,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12396 to 11369. [2018-11-28 19:52:56,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11369 states. [2018-11-28 19:52:56,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11369 states to 11369 states and 36236 transitions. [2018-11-28 19:52:56,100 INFO L78 Accepts]: Start accepts. Automaton has 11369 states and 36236 transitions. Word has length 60 [2018-11-28 19:52:56,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:52:56,101 INFO L480 AbstractCegarLoop]: Abstraction has 11369 states and 36236 transitions. [2018-11-28 19:52:56,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 19:52:56,101 INFO L276 IsEmpty]: Start isEmpty. Operand 11369 states and 36236 transitions. [2018-11-28 19:52:56,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-28 19:52:56,110 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:52:56,110 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] [2018-11-28 19:52:56,111 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:52:56,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:52:56,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1168852336, now seen corresponding path program 1 times [2018-11-28 19:52:56,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:52:56,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:52:56,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:52:56,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:52:56,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:52:56,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:52:56,308 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:52:56,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:52:56,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 19:52:56,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 19:52:56,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 19:52:56,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 19:52:56,310 INFO L87 Difference]: Start difference. First operand 11369 states and 36236 transitions. Second operand 6 states. [2018-11-28 19:52:57,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:52:57,162 INFO L93 Difference]: Finished difference Result 20969 states and 66486 transitions. [2018-11-28 19:52:57,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 19:52:57,163 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2018-11-28 19:52:57,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:52:57,205 INFO L225 Difference]: With dead ends: 20969 [2018-11-28 19:52:57,205 INFO L226 Difference]: Without dead ends: 20898 [2018-11-28 19:52:57,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-28 19:52:57,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20898 states. [2018-11-28 19:52:57,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20898 to 13755. [2018-11-28 19:52:57,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13755 states. [2018-11-28 19:52:57,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13755 states to 13755 states and 43280 transitions. [2018-11-28 19:52:57,830 INFO L78 Accepts]: Start accepts. Automaton has 13755 states and 43280 transitions. Word has length 60 [2018-11-28 19:52:57,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:52:57,831 INFO L480 AbstractCegarLoop]: Abstraction has 13755 states and 43280 transitions. [2018-11-28 19:52:57,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 19:52:57,831 INFO L276 IsEmpty]: Start isEmpty. Operand 13755 states and 43280 transitions. [2018-11-28 19:52:57,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-28 19:52:57,841 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:52:57,842 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] [2018-11-28 19:52:57,842 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:52:57,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:52:57,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1208126989, now seen corresponding path program 1 times [2018-11-28 19:52:57,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:52:57,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:52:57,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:52:57,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:52:57,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:52:57,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:52:58,060 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:52:58,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:52:58,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 19:52:58,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 19:52:58,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 19:52:58,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:52:58,062 INFO L87 Difference]: Start difference. First operand 13755 states and 43280 transitions. Second operand 4 states. [2018-11-28 19:52:58,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:52:58,675 INFO L93 Difference]: Finished difference Result 23352 states and 74493 transitions. [2018-11-28 19:52:58,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 19:52:58,675 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-11-28 19:52:58,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:52:58,716 INFO L225 Difference]: With dead ends: 23352 [2018-11-28 19:52:58,716 INFO L226 Difference]: Without dead ends: 23352 [2018-11-28 19:52:58,716 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:52:58,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23352 states. [2018-11-28 19:52:58,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23352 to 14523. [2018-11-28 19:52:58,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14523 states. [2018-11-28 19:52:58,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14523 states to 14523 states and 45664 transitions. [2018-11-28 19:52:58,987 INFO L78 Accepts]: Start accepts. Automaton has 14523 states and 45664 transitions. Word has length 64 [2018-11-28 19:52:58,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:52:58,988 INFO L480 AbstractCegarLoop]: Abstraction has 14523 states and 45664 transitions. [2018-11-28 19:52:58,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 19:52:58,988 INFO L276 IsEmpty]: Start isEmpty. Operand 14523 states and 45664 transitions. [2018-11-28 19:52:58,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-28 19:52:58,995 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:52:58,995 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] [2018-11-28 19:52:58,996 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:52:58,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:52:58,996 INFO L82 PathProgramCache]: Analyzing trace with hash -914723982, now seen corresponding path program 1 times [2018-11-28 19:52:58,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:52:58,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:52:58,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:52:58,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:52:58,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:52:59,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:52:59,248 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:52:59,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:52:59,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 19:52:59,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 19:52:59,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 19:52:59,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:52:59,249 INFO L87 Difference]: Start difference. First operand 14523 states and 45664 transitions. Second operand 4 states. [2018-11-28 19:52:59,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:52:59,756 INFO L93 Difference]: Finished difference Result 18411 states and 56991 transitions. [2018-11-28 19:52:59,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 19:52:59,757 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-11-28 19:52:59,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:52:59,786 INFO L225 Difference]: With dead ends: 18411 [2018-11-28 19:52:59,786 INFO L226 Difference]: Without dead ends: 18411 [2018-11-28 19:52:59,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:52:59,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18411 states. [2018-11-28 19:53:00,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18411 to 16569. [2018-11-28 19:53:00,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16569 states. [2018-11-28 19:53:00,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16569 states to 16569 states and 51537 transitions. [2018-11-28 19:53:00,041 INFO L78 Accepts]: Start accepts. Automaton has 16569 states and 51537 transitions. Word has length 64 [2018-11-28 19:53:00,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:53:00,041 INFO L480 AbstractCegarLoop]: Abstraction has 16569 states and 51537 transitions. [2018-11-28 19:53:00,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 19:53:00,041 INFO L276 IsEmpty]: Start isEmpty. Operand 16569 states and 51537 transitions. [2018-11-28 19:53:00,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-28 19:53:00,052 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:53:00,052 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] [2018-11-28 19:53:00,053 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:53:00,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:53:00,053 INFO L82 PathProgramCache]: Analyzing trace with hash 46890035, now seen corresponding path program 1 times [2018-11-28 19:53:00,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:53:00,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:53:00,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:53:00,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:53:00,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:53:00,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:53:00,112 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:53:00,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:53:00,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 19:53:00,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 19:53:00,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 19:53:00,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 19:53:00,113 INFO L87 Difference]: Start difference. First operand 16569 states and 51537 transitions. Second operand 3 states. [2018-11-28 19:53:00,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:53:00,385 INFO L93 Difference]: Finished difference Result 17193 states and 53232 transitions. [2018-11-28 19:53:00,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 19:53:00,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2018-11-28 19:53:00,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:53:00,414 INFO L225 Difference]: With dead ends: 17193 [2018-11-28 19:53:00,414 INFO L226 Difference]: Without dead ends: 17193 [2018-11-28 19:53:00,414 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:53:00,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17193 states. [2018-11-28 19:53:00,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17193 to 16901. [2018-11-28 19:53:00,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16901 states. [2018-11-28 19:53:00,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16901 states to 16901 states and 52431 transitions. [2018-11-28 19:53:00,990 INFO L78 Accepts]: Start accepts. Automaton has 16901 states and 52431 transitions. Word has length 64 [2018-11-28 19:53:00,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:53:00,991 INFO L480 AbstractCegarLoop]: Abstraction has 16901 states and 52431 transitions. [2018-11-28 19:53:00,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 19:53:00,991 INFO L276 IsEmpty]: Start isEmpty. Operand 16901 states and 52431 transitions. [2018-11-28 19:53:01,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 19:53:01,003 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:53:01,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] [2018-11-28 19:53:01,003 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:53:01,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:53:01,003 INFO L82 PathProgramCache]: Analyzing trace with hash -859455011, now seen corresponding path program 1 times [2018-11-28 19:53:01,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:53:01,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:53:01,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:53:01,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:53:01,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:53:01,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:53:01,211 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:53:01,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:53:01,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 19:53:01,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 19:53:01,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 19:53:01,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 19:53:01,213 INFO L87 Difference]: Start difference. First operand 16901 states and 52431 transitions. Second operand 6 states. [2018-11-28 19:53:02,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:53:02,702 INFO L93 Difference]: Finished difference Result 20789 states and 63395 transitions. [2018-11-28 19:53:02,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 19:53:02,703 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-11-28 19:53:02,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:53:02,736 INFO L225 Difference]: With dead ends: 20789 [2018-11-28 19:53:02,736 INFO L226 Difference]: Without dead ends: 20789 [2018-11-28 19:53:02,737 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:53:02,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20789 states. [2018-11-28 19:53:02,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20789 to 19521. [2018-11-28 19:53:02,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19521 states. [2018-11-28 19:53:03,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19521 states to 19521 states and 60007 transitions. [2018-11-28 19:53:03,024 INFO L78 Accepts]: Start accepts. Automaton has 19521 states and 60007 transitions. Word has length 66 [2018-11-28 19:53:03,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:53:03,024 INFO L480 AbstractCegarLoop]: Abstraction has 19521 states and 60007 transitions. [2018-11-28 19:53:03,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 19:53:03,024 INFO L276 IsEmpty]: Start isEmpty. Operand 19521 states and 60007 transitions. [2018-11-28 19:53:03,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 19:53:03,035 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:53:03,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] [2018-11-28 19:53:03,036 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:53:03,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:53:03,036 INFO L82 PathProgramCache]: Analyzing trace with hash 102159006, now seen corresponding path program 1 times [2018-11-28 19:53:03,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:53:03,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:53:03,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:53:03,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:53:03,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:53:03,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:53:03,411 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:53:03,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:53:03,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 19:53:03,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 19:53:03,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 19:53:03,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 19:53:03,413 INFO L87 Difference]: Start difference. First operand 19521 states and 60007 transitions. Second operand 6 states. [2018-11-28 19:53:05,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:53:05,032 INFO L93 Difference]: Finished difference Result 22441 states and 66578 transitions. [2018-11-28 19:53:05,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 19:53:05,033 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-11-28 19:53:05,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:53:05,070 INFO L225 Difference]: With dead ends: 22441 [2018-11-28 19:53:05,070 INFO L226 Difference]: Without dead ends: 22441 [2018-11-28 19:53:05,070 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:53:05,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22441 states. [2018-11-28 19:53:05,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22441 to 20085. [2018-11-28 19:53:05,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20085 states. [2018-11-28 19:53:05,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20085 states to 20085 states and 60622 transitions. [2018-11-28 19:53:05,393 INFO L78 Accepts]: Start accepts. Automaton has 20085 states and 60622 transitions. Word has length 66 [2018-11-28 19:53:05,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:53:05,393 INFO L480 AbstractCegarLoop]: Abstraction has 20085 states and 60622 transitions. [2018-11-28 19:53:05,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 19:53:05,393 INFO L276 IsEmpty]: Start isEmpty. Operand 20085 states and 60622 transitions. [2018-11-28 19:53:05,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 19:53:05,405 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:53:05,405 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] [2018-11-28 19:53:05,405 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:53:05,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:53:05,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1346923487, now seen corresponding path program 1 times [2018-11-28 19:53:05,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:53:05,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:53:05,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:53:05,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:53:05,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:53:05,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:53:05,673 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:53:05,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:53:05,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 19:53:05,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 19:53:05,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 19:53:05,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:53:05,674 INFO L87 Difference]: Start difference. First operand 20085 states and 60622 transitions. Second operand 5 states. [2018-11-28 19:53:06,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:53:06,149 INFO L93 Difference]: Finished difference Result 26432 states and 79262 transitions. [2018-11-28 19:53:06,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 19:53:06,150 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-11-28 19:53:06,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:53:06,194 INFO L225 Difference]: With dead ends: 26432 [2018-11-28 19:53:06,194 INFO L226 Difference]: Without dead ends: 26432 [2018-11-28 19:53:06,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 19:53:06,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26432 states. [2018-11-28 19:53:06,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26432 to 23813. [2018-11-28 19:53:06,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23813 states. [2018-11-28 19:53:06,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23813 states to 23813 states and 71372 transitions. [2018-11-28 19:53:06,644 INFO L78 Accepts]: Start accepts. Automaton has 23813 states and 71372 transitions. Word has length 66 [2018-11-28 19:53:06,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:53:06,644 INFO L480 AbstractCegarLoop]: Abstraction has 23813 states and 71372 transitions. [2018-11-28 19:53:06,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 19:53:06,644 INFO L276 IsEmpty]: Start isEmpty. Operand 23813 states and 71372 transitions. [2018-11-28 19:53:06,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 19:53:06,660 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:53:06,660 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] [2018-11-28 19:53:06,660 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:53:06,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:53:06,661 INFO L82 PathProgramCache]: Analyzing trace with hash 836389310, now seen corresponding path program 1 times [2018-11-28 19:53:06,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:53:06,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:53:06,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:53:06,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:53:06,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:53:06,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:53:07,391 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:53:07,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:53:07,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 19:53:07,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 19:53:07,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 19:53:07,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:53:07,393 INFO L87 Difference]: Start difference. First operand 23813 states and 71372 transitions. Second operand 5 states. [2018-11-28 19:53:08,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:53:08,128 INFO L93 Difference]: Finished difference Result 33063 states and 98211 transitions. [2018-11-28 19:53:08,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 19:53:08,129 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-11-28 19:53:08,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:53:08,185 INFO L225 Difference]: With dead ends: 33063 [2018-11-28 19:53:08,185 INFO L226 Difference]: Without dead ends: 33063 [2018-11-28 19:53:08,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 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:53:08,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33063 states. [2018-11-28 19:53:08,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33063 to 29343. [2018-11-28 19:53:08,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29343 states. [2018-11-28 19:53:08,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29343 states to 29343 states and 87599 transitions. [2018-11-28 19:53:08,656 INFO L78 Accepts]: Start accepts. Automaton has 29343 states and 87599 transitions. Word has length 66 [2018-11-28 19:53:08,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:53:08,656 INFO L480 AbstractCegarLoop]: Abstraction has 29343 states and 87599 transitions. [2018-11-28 19:53:08,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 19:53:08,656 INFO L276 IsEmpty]: Start isEmpty. Operand 29343 states and 87599 transitions. [2018-11-28 19:53:08,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 19:53:08,670 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:53:08,670 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] [2018-11-28 19:53:08,671 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:53:08,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:53:08,671 INFO L82 PathProgramCache]: Analyzing trace with hash -971065153, now seen corresponding path program 1 times [2018-11-28 19:53:08,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:53:08,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:53:08,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:53:08,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:53:08,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:53:08,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:53:08,840 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:53:08,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:53:08,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 19:53:08,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 19:53:08,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 19:53:08,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:53:08,841 INFO L87 Difference]: Start difference. First operand 29343 states and 87599 transitions. Second operand 4 states. [2018-11-28 19:53:09,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:53:09,537 INFO L93 Difference]: Finished difference Result 38903 states and 116585 transitions. [2018-11-28 19:53:09,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 19:53:09,538 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-11-28 19:53:09,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:53:09,606 INFO L225 Difference]: With dead ends: 38903 [2018-11-28 19:53:09,606 INFO L226 Difference]: Without dead ends: 38671 [2018-11-28 19:53:09,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:53:09,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38671 states. [2018-11-28 19:53:10,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38671 to 35807. [2018-11-28 19:53:10,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35807 states. [2018-11-28 19:53:10,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35807 states to 35807 states and 107399 transitions. [2018-11-28 19:53:10,167 INFO L78 Accepts]: Start accepts. Automaton has 35807 states and 107399 transitions. Word has length 66 [2018-11-28 19:53:10,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:53:10,167 INFO L480 AbstractCegarLoop]: Abstraction has 35807 states and 107399 transitions. [2018-11-28 19:53:10,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 19:53:10,167 INFO L276 IsEmpty]: Start isEmpty. Operand 35807 states and 107399 transitions. [2018-11-28 19:53:10,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 19:53:10,182 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:53:10,184 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] [2018-11-28 19:53:10,184 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:53:10,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:53:10,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1526950784, now seen corresponding path program 1 times [2018-11-28 19:53:10,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:53:10,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:53:10,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:53:10,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:53:10,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:53:10,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:53:10,390 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:53:10,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:53:10,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 19:53:10,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 19:53:10,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 19:53:10,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-28 19:53:10,391 INFO L87 Difference]: Start difference. First operand 35807 states and 107399 transitions. Second operand 9 states. [2018-11-28 19:53:11,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:53:11,679 INFO L93 Difference]: Finished difference Result 44023 states and 131291 transitions. [2018-11-28 19:53:11,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 19:53:11,680 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2018-11-28 19:53:11,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:53:12,034 INFO L225 Difference]: With dead ends: 44023 [2018-11-28 19:53:12,034 INFO L226 Difference]: Without dead ends: 44023 [2018-11-28 19:53:12,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-11-28 19:53:12,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44023 states. [2018-11-28 19:53:12,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44023 to 38973. [2018-11-28 19:53:12,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38973 states. [2018-11-28 19:53:12,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38973 states to 38973 states and 116711 transitions. [2018-11-28 19:53:12,616 INFO L78 Accepts]: Start accepts. Automaton has 38973 states and 116711 transitions. Word has length 66 [2018-11-28 19:53:12,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:53:12,616 INFO L480 AbstractCegarLoop]: Abstraction has 38973 states and 116711 transitions. [2018-11-28 19:53:12,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 19:53:12,616 INFO L276 IsEmpty]: Start isEmpty. Operand 38973 states and 116711 transitions. [2018-11-28 19:53:12,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 19:53:12,629 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:53:12,629 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] [2018-11-28 19:53:12,630 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:53:12,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:53:12,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1880512831, now seen corresponding path program 1 times [2018-11-28 19:53:12,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:53:12,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:53:12,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:53:12,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:53:12,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:53:12,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:53:12,862 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:53:12,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:53:12,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 19:53:12,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 19:53:12,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 19:53:12,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:53:12,864 INFO L87 Difference]: Start difference. First operand 38973 states and 116711 transitions. Second operand 5 states. [2018-11-28 19:53:13,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:53:13,237 INFO L93 Difference]: Finished difference Result 9637 states and 23357 transitions. [2018-11-28 19:53:13,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 19:53:13,238 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-11-28 19:53:13,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:53:13,249 INFO L225 Difference]: With dead ends: 9637 [2018-11-28 19:53:13,249 INFO L226 Difference]: Without dead ends: 7669 [2018-11-28 19:53:13,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 19:53:13,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7669 states. [2018-11-28 19:53:13,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7669 to 6276. [2018-11-28 19:53:13,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6276 states. [2018-11-28 19:53:13,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6276 states to 6276 states and 14833 transitions. [2018-11-28 19:53:13,325 INFO L78 Accepts]: Start accepts. Automaton has 6276 states and 14833 transitions. Word has length 66 [2018-11-28 19:53:13,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:53:13,326 INFO L480 AbstractCegarLoop]: Abstraction has 6276 states and 14833 transitions. [2018-11-28 19:53:13,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 19:53:13,326 INFO L276 IsEmpty]: Start isEmpty. Operand 6276 states and 14833 transitions. [2018-11-28 19:53:13,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 19:53:13,331 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:53:13,331 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] [2018-11-28 19:53:13,331 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:53:13,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:53:13,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1184013087, now seen corresponding path program 1 times [2018-11-28 19:53:13,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:53:13,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:53:13,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:53:13,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:53:13,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:53:13,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:53:13,412 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:53:13,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:53:13,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 19:53:13,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 19:53:13,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 19:53:13,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 19:53:13,414 INFO L87 Difference]: Start difference. First operand 6276 states and 14833 transitions. Second operand 3 states. [2018-11-28 19:53:13,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:53:13,572 INFO L93 Difference]: Finished difference Result 8733 states and 20570 transitions. [2018-11-28 19:53:13,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 19:53:13,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-11-28 19:53:13,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:53:13,584 INFO L225 Difference]: With dead ends: 8733 [2018-11-28 19:53:13,584 INFO L226 Difference]: Without dead ends: 8733 [2018-11-28 19:53:13,585 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:53:13,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8733 states. [2018-11-28 19:53:13,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8733 to 6213. [2018-11-28 19:53:13,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6213 states. [2018-11-28 19:53:13,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6213 states to 6213 states and 14371 transitions. [2018-11-28 19:53:13,666 INFO L78 Accepts]: Start accepts. Automaton has 6213 states and 14371 transitions. Word has length 66 [2018-11-28 19:53:13,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:53:13,667 INFO L480 AbstractCegarLoop]: Abstraction has 6213 states and 14371 transitions. [2018-11-28 19:53:13,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 19:53:13,667 INFO L276 IsEmpty]: Start isEmpty. Operand 6213 states and 14371 transitions. [2018-11-28 19:53:13,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-28 19:53:13,672 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:53:13,672 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] [2018-11-28 19:53:13,673 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:53:13,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:53:13,673 INFO L82 PathProgramCache]: Analyzing trace with hash 280585492, now seen corresponding path program 1 times [2018-11-28 19:53:13,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:53:13,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:53:13,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:53:13,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:53:13,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:53:13,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:53:13,844 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:53:13,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:53:13,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 19:53:13,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 19:53:13,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 19:53:13,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:53:13,845 INFO L87 Difference]: Start difference. First operand 6213 states and 14371 transitions. Second operand 5 states. [2018-11-28 19:53:14,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:53:14,719 INFO L93 Difference]: Finished difference Result 7383 states and 17012 transitions. [2018-11-28 19:53:14,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 19:53:14,720 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2018-11-28 19:53:14,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:53:14,731 INFO L225 Difference]: With dead ends: 7383 [2018-11-28 19:53:14,731 INFO L226 Difference]: Without dead ends: 7383 [2018-11-28 19:53:14,732 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:53:14,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7383 states. [2018-11-28 19:53:14,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7383 to 6657. [2018-11-28 19:53:14,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6657 states. [2018-11-28 19:53:14,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6657 states to 6657 states and 15375 transitions. [2018-11-28 19:53:14,835 INFO L78 Accepts]: Start accepts. Automaton has 6657 states and 15375 transitions. Word has length 72 [2018-11-28 19:53:14,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:53:14,836 INFO L480 AbstractCegarLoop]: Abstraction has 6657 states and 15375 transitions. [2018-11-28 19:53:14,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 19:53:14,836 INFO L276 IsEmpty]: Start isEmpty. Operand 6657 states and 15375 transitions. [2018-11-28 19:53:14,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-28 19:53:14,847 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:53:14,847 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] [2018-11-28 19:53:14,848 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:53:14,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:53:14,849 INFO L82 PathProgramCache]: Analyzing trace with hash 2023395827, now seen corresponding path program 1 times [2018-11-28 19:53:14,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:53:14,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:53:14,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:53:14,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:53:14,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:53:14,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:53:15,124 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-28 19:53:15,586 WARN L180 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 6 [2018-11-28 19:53:16,021 WARN L180 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 6 [2018-11-28 19:53:16,502 WARN L180 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 6 [2018-11-28 19:53:16,579 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:53:16,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:53:16,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 19:53:16,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 19:53:16,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 19:53:16,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-28 19:53:16,583 INFO L87 Difference]: Start difference. First operand 6657 states and 15375 transitions. Second operand 9 states. [2018-11-28 19:53:17,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:53:17,241 INFO L93 Difference]: Finished difference Result 8851 states and 20272 transitions. [2018-11-28 19:53:17,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 19:53:17,242 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2018-11-28 19:53:17,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:53:17,253 INFO L225 Difference]: With dead ends: 8851 [2018-11-28 19:53:17,253 INFO L226 Difference]: Without dead ends: 8732 [2018-11-28 19:53:17,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-11-28 19:53:17,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8732 states. [2018-11-28 19:53:17,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8732 to 6746. [2018-11-28 19:53:17,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6746 states. [2018-11-28 19:53:17,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6746 states to 6746 states and 15444 transitions. [2018-11-28 19:53:17,335 INFO L78 Accepts]: Start accepts. Automaton has 6746 states and 15444 transitions. Word has length 72 [2018-11-28 19:53:17,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:53:17,335 INFO L480 AbstractCegarLoop]: Abstraction has 6746 states and 15444 transitions. [2018-11-28 19:53:17,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 19:53:17,336 INFO L276 IsEmpty]: Start isEmpty. Operand 6746 states and 15444 transitions. [2018-11-28 19:53:17,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 19:53:17,343 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:53:17,343 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] [2018-11-28 19:53:17,343 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:53:17,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:53:17,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1917824602, now seen corresponding path program 1 times [2018-11-28 19:53:17,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:53:17,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:53:17,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:53:17,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:53:17,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:53:17,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:53:17,479 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:53:17,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:53:17,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 19:53:17,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 19:53:17,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 19:53:17,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 19:53:17,481 INFO L87 Difference]: Start difference. First operand 6746 states and 15444 transitions. Second operand 3 states. [2018-11-28 19:53:18,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:53:18,028 INFO L93 Difference]: Finished difference Result 8422 states and 18970 transitions. [2018-11-28 19:53:18,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 19:53:18,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2018-11-28 19:53:18,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:53:18,040 INFO L225 Difference]: With dead ends: 8422 [2018-11-28 19:53:18,040 INFO L226 Difference]: Without dead ends: 8422 [2018-11-28 19:53:18,040 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:53:18,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8422 states. [2018-11-28 19:53:18,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8422 to 7857. [2018-11-28 19:53:18,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7857 states. [2018-11-28 19:53:18,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7857 states to 7857 states and 17760 transitions. [2018-11-28 19:53:18,125 INFO L78 Accepts]: Start accepts. Automaton has 7857 states and 17760 transitions. Word has length 91 [2018-11-28 19:53:18,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:53:18,125 INFO L480 AbstractCegarLoop]: Abstraction has 7857 states and 17760 transitions. [2018-11-28 19:53:18,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 19:53:18,126 INFO L276 IsEmpty]: Start isEmpty. Operand 7857 states and 17760 transitions. [2018-11-28 19:53:18,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 19:53:18,134 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:53:18,134 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:53:18,134 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:53:18,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:53:18,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1154554199, now seen corresponding path program 1 times [2018-11-28 19:53:18,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:53:18,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:53:18,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:53:18,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:53:18,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:53:18,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:53:18,308 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:53:18,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:53:18,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 19:53:18,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 19:53:18,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 19:53:18,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:53:18,310 INFO L87 Difference]: Start difference. First operand 7857 states and 17760 transitions. Second operand 4 states. [2018-11-28 19:53:18,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:53:18,437 INFO L93 Difference]: Finished difference Result 8431 states and 19074 transitions. [2018-11-28 19:53:18,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 19:53:18,438 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-11-28 19:53:18,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:53:18,448 INFO L225 Difference]: With dead ends: 8431 [2018-11-28 19:53:18,448 INFO L226 Difference]: Without dead ends: 8431 [2018-11-28 19:53:18,448 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:53:18,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8431 states. [2018-11-28 19:53:18,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8431 to 7772. [2018-11-28 19:53:18,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7772 states. [2018-11-28 19:53:18,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7772 states to 7772 states and 17676 transitions. [2018-11-28 19:53:18,537 INFO L78 Accepts]: Start accepts. Automaton has 7772 states and 17676 transitions. Word has length 91 [2018-11-28 19:53:18,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:53:18,537 INFO L480 AbstractCegarLoop]: Abstraction has 7772 states and 17676 transitions. [2018-11-28 19:53:18,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 19:53:18,538 INFO L276 IsEmpty]: Start isEmpty. Operand 7772 states and 17676 transitions. [2018-11-28 19:53:18,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 19:53:18,548 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:53:18,548 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] [2018-11-28 19:53:18,548 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:53:18,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:53:18,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1775857056, now seen corresponding path program 1 times [2018-11-28 19:53:18,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:53:18,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:53:18,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:53:18,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:53:18,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:53:18,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:53:18,763 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:53:18,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:53:18,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 19:53:18,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 19:53:18,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 19:53:18,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:53:18,764 INFO L87 Difference]: Start difference. First operand 7772 states and 17676 transitions. Second operand 5 states. [2018-11-28 19:53:18,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:53:18,902 INFO L93 Difference]: Finished difference Result 8948 states and 20243 transitions. [2018-11-28 19:53:18,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 19:53:18,904 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-11-28 19:53:18,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:53:18,913 INFO L225 Difference]: With dead ends: 8948 [2018-11-28 19:53:18,914 INFO L226 Difference]: Without dead ends: 8948 [2018-11-28 19:53:18,914 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:53:18,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8948 states. [2018-11-28 19:53:18,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8948 to 6902. [2018-11-28 19:53:18,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6902 states. [2018-11-28 19:53:18,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6902 states to 6902 states and 15741 transitions. [2018-11-28 19:53:18,996 INFO L78 Accepts]: Start accepts. Automaton has 6902 states and 15741 transitions. Word has length 93 [2018-11-28 19:53:18,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:53:18,996 INFO L480 AbstractCegarLoop]: Abstraction has 6902 states and 15741 transitions. [2018-11-28 19:53:18,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 19:53:18,996 INFO L276 IsEmpty]: Start isEmpty. Operand 6902 states and 15741 transitions. [2018-11-28 19:53:19,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 19:53:19,005 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:53:19,005 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] [2018-11-28 19:53:19,006 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:53:19,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:53:19,006 INFO L82 PathProgramCache]: Analyzing trace with hash -2030593601, now seen corresponding path program 1 times [2018-11-28 19:53:19,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:53:19,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:53:19,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:53:19,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:53:19,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:53:19,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:53:19,111 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:53:19,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:53:19,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 19:53:19,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 19:53:19,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 19:53:19,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:53:19,112 INFO L87 Difference]: Start difference. First operand 6902 states and 15741 transitions. Second operand 5 states. [2018-11-28 19:53:19,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:53:19,735 INFO L93 Difference]: Finished difference Result 11458 states and 26340 transitions. [2018-11-28 19:53:19,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 19:53:19,736 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-11-28 19:53:19,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:53:19,750 INFO L225 Difference]: With dead ends: 11458 [2018-11-28 19:53:19,750 INFO L226 Difference]: Without dead ends: 11380 [2018-11-28 19:53:19,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-28 19:53:19,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11380 states. [2018-11-28 19:53:19,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11380 to 8056. [2018-11-28 19:53:19,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8056 states. [2018-11-28 19:53:19,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8056 states to 8056 states and 18403 transitions. [2018-11-28 19:53:19,884 INFO L78 Accepts]: Start accepts. Automaton has 8056 states and 18403 transitions. Word has length 93 [2018-11-28 19:53:19,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:53:19,884 INFO L480 AbstractCegarLoop]: Abstraction has 8056 states and 18403 transitions. [2018-11-28 19:53:19,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 19:53:19,884 INFO L276 IsEmpty]: Start isEmpty. Operand 8056 states and 18403 transitions. [2018-11-28 19:53:19,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 19:53:19,894 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:53:19,894 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] [2018-11-28 19:53:19,895 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:53:19,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:53:19,895 INFO L82 PathProgramCache]: Analyzing trace with hash -785829120, now seen corresponding path program 1 times [2018-11-28 19:53:19,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:53:19,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:53:19,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:53:19,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:53:19,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:53:19,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:53:20,026 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:53:20,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:53:20,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 19:53:20,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 19:53:20,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 19:53:20,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 19:53:20,028 INFO L87 Difference]: Start difference. First operand 8056 states and 18403 transitions. Second operand 6 states. [2018-11-28 19:53:20,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:53:20,413 INFO L93 Difference]: Finished difference Result 10204 states and 23157 transitions. [2018-11-28 19:53:20,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 19:53:20,415 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-11-28 19:53:20,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:53:20,427 INFO L225 Difference]: With dead ends: 10204 [2018-11-28 19:53:20,428 INFO L226 Difference]: Without dead ends: 10125 [2018-11-28 19:53:20,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-28 19:53:20,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10125 states. [2018-11-28 19:53:20,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10125 to 7529. [2018-11-28 19:53:20,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7529 states. [2018-11-28 19:53:20,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7529 states to 7529 states and 17293 transitions. [2018-11-28 19:53:20,525 INFO L78 Accepts]: Start accepts. Automaton has 7529 states and 17293 transitions. Word has length 93 [2018-11-28 19:53:20,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:53:20,525 INFO L480 AbstractCegarLoop]: Abstraction has 7529 states and 17293 transitions. [2018-11-28 19:53:20,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 19:53:20,525 INFO L276 IsEmpty]: Start isEmpty. Operand 7529 states and 17293 transitions. [2018-11-28 19:53:20,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 19:53:20,533 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:53:20,533 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] [2018-11-28 19:53:20,533 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:53:20,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:53:20,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1879438691, now seen corresponding path program 1 times [2018-11-28 19:53:20,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:53:20,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:53:20,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:53:20,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:53:20,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:53:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:53:21,618 WARN L180 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 10 [2018-11-28 19:53:21,660 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:53:21,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:53:21,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 19:53:21,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 19:53:21,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 19:53:21,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-28 19:53:21,661 INFO L87 Difference]: Start difference. First operand 7529 states and 17293 transitions. Second operand 9 states. [2018-11-28 19:53:22,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:53:22,494 INFO L93 Difference]: Finished difference Result 10604 states and 24259 transitions. [2018-11-28 19:53:22,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-28 19:53:22,496 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2018-11-28 19:53:22,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:53:22,508 INFO L225 Difference]: With dead ends: 10604 [2018-11-28 19:53:22,508 INFO L226 Difference]: Without dead ends: 10572 [2018-11-28 19:53:22,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-11-28 19:53:22,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10572 states. [2018-11-28 19:53:22,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10572 to 9100. [2018-11-28 19:53:22,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9100 states. [2018-11-28 19:53:22,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9100 states to 9100 states and 20773 transitions. [2018-11-28 19:53:22,621 INFO L78 Accepts]: Start accepts. Automaton has 9100 states and 20773 transitions. Word has length 93 [2018-11-28 19:53:22,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:53:22,621 INFO L480 AbstractCegarLoop]: Abstraction has 9100 states and 20773 transitions. [2018-11-28 19:53:22,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 19:53:22,621 INFO L276 IsEmpty]: Start isEmpty. Operand 9100 states and 20773 transitions. [2018-11-28 19:53:22,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 19:53:22,631 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:53:22,632 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] [2018-11-28 19:53:22,632 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:53:22,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:53:22,632 INFO L82 PathProgramCache]: Analyzing trace with hash 618577246, now seen corresponding path program 1 times [2018-11-28 19:53:22,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:53:22,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:53:22,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:53:22,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:53:22,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:53:22,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:53:22,824 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:53:22,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:53:22,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 19:53:22,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 19:53:22,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 19:53:22,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-28 19:53:22,825 INFO L87 Difference]: Start difference. First operand 9100 states and 20773 transitions. Second operand 8 states. [2018-11-28 19:53:23,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:53:23,435 INFO L93 Difference]: Finished difference Result 14198 states and 32836 transitions. [2018-11-28 19:53:23,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 19:53:23,436 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2018-11-28 19:53:23,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:53:23,452 INFO L225 Difference]: With dead ends: 14198 [2018-11-28 19:53:23,452 INFO L226 Difference]: Without dead ends: 14198 [2018-11-28 19:53:23,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-11-28 19:53:23,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14198 states. [2018-11-28 19:53:23,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14198 to 9690. [2018-11-28 19:53:23,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9690 states. [2018-11-28 19:53:23,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9690 states to 9690 states and 22304 transitions. [2018-11-28 19:53:23,591 INFO L78 Accepts]: Start accepts. Automaton has 9690 states and 22304 transitions. Word has length 93 [2018-11-28 19:53:23,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:53:23,591 INFO L480 AbstractCegarLoop]: Abstraction has 9690 states and 22304 transitions. [2018-11-28 19:53:23,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 19:53:23,591 INFO L276 IsEmpty]: Start isEmpty. Operand 9690 states and 22304 transitions. [2018-11-28 19:53:23,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 19:53:23,601 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:53:23,602 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] [2018-11-28 19:53:23,602 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:53:23,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:53:23,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1506080927, now seen corresponding path program 1 times [2018-11-28 19:53:23,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:53:23,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:53:23,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:53:23,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:53:23,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:53:23,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:53:23,765 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:53:23,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:53:23,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 19:53:23,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 19:53:23,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 19:53:23,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-28 19:53:23,767 INFO L87 Difference]: Start difference. First operand 9690 states and 22304 transitions. Second operand 10 states. [2018-11-28 19:53:24,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:53:24,795 INFO L93 Difference]: Finished difference Result 13585 states and 31399 transitions. [2018-11-28 19:53:24,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-28 19:53:24,796 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93 [2018-11-28 19:53:24,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:53:24,812 INFO L225 Difference]: With dead ends: 13585 [2018-11-28 19:53:24,812 INFO L226 Difference]: Without dead ends: 13585 [2018-11-28 19:53:24,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2018-11-28 19:53:24,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13585 states. [2018-11-28 19:53:24,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13585 to 10925. [2018-11-28 19:53:24,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10925 states. [2018-11-28 19:53:24,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10925 states to 10925 states and 24988 transitions. [2018-11-28 19:53:24,950 INFO L78 Accepts]: Start accepts. Automaton has 10925 states and 24988 transitions. Word has length 93 [2018-11-28 19:53:24,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:53:24,950 INFO L480 AbstractCegarLoop]: Abstraction has 10925 states and 24988 transitions. [2018-11-28 19:53:24,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 19:53:24,950 INFO L276 IsEmpty]: Start isEmpty. Operand 10925 states and 24988 transitions. [2018-11-28 19:53:24,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 19:53:24,967 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:53:24,967 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] [2018-11-28 19:53:24,967 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:53:24,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:53:24,967 INFO L82 PathProgramCache]: Analyzing trace with hash -225894625, now seen corresponding path program 1 times [2018-11-28 19:53:24,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:53:24,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:53:24,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:53:24,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:53:24,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:53:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:53:25,276 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:53:25,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:53:25,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 19:53:25,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 19:53:25,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 19:53:25,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 19:53:25,277 INFO L87 Difference]: Start difference. First operand 10925 states and 24988 transitions. Second operand 6 states. [2018-11-28 19:53:25,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:53:25,423 INFO L93 Difference]: Finished difference Result 10445 states and 23532 transitions. [2018-11-28 19:53:25,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 19:53:25,424 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-11-28 19:53:25,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:53:25,437 INFO L225 Difference]: With dead ends: 10445 [2018-11-28 19:53:25,437 INFO L226 Difference]: Without dead ends: 10445 [2018-11-28 19:53:25,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-28 19:53:25,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10445 states. [2018-11-28 19:53:25,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10445 to 7076. [2018-11-28 19:53:25,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7076 states. [2018-11-28 19:53:25,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7076 states to 7076 states and 15970 transitions. [2018-11-28 19:53:25,542 INFO L78 Accepts]: Start accepts. Automaton has 7076 states and 15970 transitions. Word has length 93 [2018-11-28 19:53:25,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:53:25,542 INFO L480 AbstractCegarLoop]: Abstraction has 7076 states and 15970 transitions. [2018-11-28 19:53:25,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 19:53:25,542 INFO L276 IsEmpty]: Start isEmpty. Operand 7076 states and 15970 transitions. [2018-11-28 19:53:25,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-28 19:53:25,550 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:53:25,550 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] [2018-11-28 19:53:25,550 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:53:25,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:53:25,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1574972597, now seen corresponding path program 1 times [2018-11-28 19:53:25,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:53:25,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:53:25,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:53:25,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:53:25,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:53:25,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:53:25,891 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:53:25,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:53:25,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 19:53:25,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 19:53:25,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 19:53:25,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-28 19:53:25,892 INFO L87 Difference]: Start difference. First operand 7076 states and 15970 transitions. Second operand 9 states. [2018-11-28 19:53:26,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:53:26,456 INFO L93 Difference]: Finished difference Result 8470 states and 18890 transitions. [2018-11-28 19:53:26,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-28 19:53:26,457 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2018-11-28 19:53:26,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:53:26,468 INFO L225 Difference]: With dead ends: 8470 [2018-11-28 19:53:26,468 INFO L226 Difference]: Without dead ends: 8470 [2018-11-28 19:53:26,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2018-11-28 19:53:26,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8470 states. [2018-11-28 19:53:26,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8470 to 8203. [2018-11-28 19:53:26,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8203 states. [2018-11-28 19:53:26,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8203 states to 8203 states and 18365 transitions. [2018-11-28 19:53:26,557 INFO L78 Accepts]: Start accepts. Automaton has 8203 states and 18365 transitions. Word has length 95 [2018-11-28 19:53:26,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:53:26,558 INFO L480 AbstractCegarLoop]: Abstraction has 8203 states and 18365 transitions. [2018-11-28 19:53:26,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 19:53:26,558 INFO L276 IsEmpty]: Start isEmpty. Operand 8203 states and 18365 transitions. [2018-11-28 19:53:26,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-28 19:53:26,566 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:53:26,566 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] [2018-11-28 19:53:26,567 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:53:26,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:53:26,567 INFO L82 PathProgramCache]: Analyzing trace with hash -687468916, now seen corresponding path program 1 times [2018-11-28 19:53:26,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:53:26,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:53:26,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:53:26,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:53:26,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:53:26,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:53:26,869 WARN L180 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-28 19:53:27,434 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:53:27,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:53:27,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 19:53:27,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 19:53:27,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 19:53:27,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-28 19:53:27,436 INFO L87 Difference]: Start difference. First operand 8203 states and 18365 transitions. Second operand 11 states. [2018-11-28 19:53:29,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:53:29,203 INFO L93 Difference]: Finished difference Result 15169 states and 34143 transitions. [2018-11-28 19:53:29,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 19:53:29,204 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2018-11-28 19:53:29,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:53:29,217 INFO L225 Difference]: With dead ends: 15169 [2018-11-28 19:53:29,217 INFO L226 Difference]: Without dead ends: 10493 [2018-11-28 19:53:29,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-11-28 19:53:29,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10493 states. [2018-11-28 19:53:29,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10493 to 7872. [2018-11-28 19:53:29,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7872 states. [2018-11-28 19:53:29,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7872 states to 7872 states and 17618 transitions. [2018-11-28 19:53:29,314 INFO L78 Accepts]: Start accepts. Automaton has 7872 states and 17618 transitions. Word has length 95 [2018-11-28 19:53:29,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:53:29,314 INFO L480 AbstractCegarLoop]: Abstraction has 7872 states and 17618 transitions. [2018-11-28 19:53:29,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 19:53:29,314 INFO L276 IsEmpty]: Start isEmpty. Operand 7872 states and 17618 transitions. [2018-11-28 19:53:29,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-28 19:53:29,322 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:53:29,322 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] [2018-11-28 19:53:29,323 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:53:29,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:53:29,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1086118301, now seen corresponding path program 1 times [2018-11-28 19:53:29,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:53:29,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:53:29,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:53:29,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:53:29,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:53:29,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:53:29,740 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-11-28 19:53:30,119 WARN L180 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 16 [2018-11-28 19:53:30,132 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:53:30,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:53:30,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 19:53:30,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 19:53:30,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 19:53:30,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 19:53:30,133 INFO L87 Difference]: Start difference. First operand 7872 states and 17618 transitions. Second operand 6 states. [2018-11-28 19:53:30,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:53:30,372 INFO L93 Difference]: Finished difference Result 8841 states and 19530 transitions. [2018-11-28 19:53:30,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 19:53:30,374 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2018-11-28 19:53:30,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:53:30,384 INFO L225 Difference]: With dead ends: 8841 [2018-11-28 19:53:30,385 INFO L226 Difference]: Without dead ends: 8784 [2018-11-28 19:53:30,385 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:53:30,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8784 states. [2018-11-28 19:53:30,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8784 to 7838. [2018-11-28 19:53:30,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7838 states. [2018-11-28 19:53:30,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7838 states to 7838 states and 17402 transitions. [2018-11-28 19:53:30,475 INFO L78 Accepts]: Start accepts. Automaton has 7838 states and 17402 transitions. Word has length 95 [2018-11-28 19:53:30,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:53:30,476 INFO L480 AbstractCegarLoop]: Abstraction has 7838 states and 17402 transitions. [2018-11-28 19:53:30,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 19:53:30,476 INFO L276 IsEmpty]: Start isEmpty. Operand 7838 states and 17402 transitions. [2018-11-28 19:53:30,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-28 19:53:30,483 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:53:30,483 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] [2018-11-28 19:53:30,484 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:53:30,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:53:30,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1904255005, now seen corresponding path program 2 times [2018-11-28 19:53:30,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:53:30,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:53:30,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:53:30,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:53:30,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:53:30,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:53:30,641 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:53:30,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:53:30,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 19:53:30,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 19:53:30,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 19:53:30,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 19:53:30,643 INFO L87 Difference]: Start difference. First operand 7838 states and 17402 transitions. Second operand 6 states. [2018-11-28 19:53:30,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:53:30,867 INFO L93 Difference]: Finished difference Result 8050 states and 17786 transitions. [2018-11-28 19:53:30,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 19:53:30,868 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2018-11-28 19:53:30,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:53:30,877 INFO L225 Difference]: With dead ends: 8050 [2018-11-28 19:53:30,877 INFO L226 Difference]: Without dead ends: 8050 [2018-11-28 19:53:30,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-28 19:53:30,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8050 states. [2018-11-28 19:53:30,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8050 to 7760. [2018-11-28 19:53:30,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7760 states. [2018-11-28 19:53:30,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7760 states to 7760 states and 17185 transitions. [2018-11-28 19:53:30,962 INFO L78 Accepts]: Start accepts. Automaton has 7760 states and 17185 transitions. Word has length 95 [2018-11-28 19:53:30,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:53:30,962 INFO L480 AbstractCegarLoop]: Abstraction has 7760 states and 17185 transitions. [2018-11-28 19:53:30,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 19:53:30,962 INFO L276 IsEmpty]: Start isEmpty. Operand 7760 states and 17185 transitions. [2018-11-28 19:53:30,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-28 19:53:30,971 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:53:30,971 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:30,971 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:53:30,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:53:30,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1415884062, now seen corresponding path program 2 times [2018-11-28 19:53:30,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:53:30,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:53:30,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:53:30,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 19:53:30,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:53:30,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 19:53:31,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 19:53:31,072 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 19:53:31,243 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-11-28 19:53:31,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 07:53:31 BasicIcfg [2018-11-28 19:53:31,245 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 19:53:31,246 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 19:53:31,246 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 19:53:31,246 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 19:53:31,247 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 07:52:43" (3/4) ... [2018-11-28 19:53:31,253 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 19:53:31,465 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 19:53:31,466 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 19:53:31,467 INFO L168 Benchmark]: Toolchain (without parser) took 50634.37 ms. Allocated memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: 1.7 GB). Free memory was 952.7 MB in the beginning and 754.0 MB in the end (delta: 198.7 MB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2018-11-28 19:53:31,468 INFO L168 Benchmark]: CDTParser took 0.46 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:53:31,468 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1007.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 91.8 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -116.2 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2018-11-28 19:53:31,468 INFO L168 Benchmark]: Boogie Procedure Inliner took 103.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2018-11-28 19:53:31,469 INFO L168 Benchmark]: Boogie Preprocessor took 61.24 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 19:53:31,469 INFO L168 Benchmark]: RCFGBuilder took 1253.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 41.9 MB). Peak memory consumption was 41.9 MB. Max. memory is 11.5 GB. [2018-11-28 19:53:31,469 INFO L168 Benchmark]: TraceAbstraction took 47983.66 ms. Allocated memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: 1.6 GB). Free memory was 1.0 GB in the beginning and 789.0 MB in the end (delta: 218.2 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2018-11-28 19:53:31,480 INFO L168 Benchmark]: Witness Printer took 219.63 ms. Allocated memory is still 2.7 GB. Free memory was 789.0 MB in the beginning and 754.0 MB in the end (delta: 35.0 MB). Peak memory consumption was 35.0 MB. Max. memory is 11.5 GB. [2018-11-28 19:53:31,483 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.46 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 1007.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 91.8 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -116.2 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 103.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 61.24 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1253.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 41.9 MB). Peak memory consumption was 41.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 47983.66 ms. Allocated memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: 1.6 GB). Free memory was 1.0 GB in the beginning and 789.0 MB in the end (delta: 218.2 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. * Witness Printer took 219.63 ms. Allocated memory is still 2.7 GB. Free memory was 789.0 MB in the beginning and 754.0 MB in the end (delta: 35.0 MB). Peak memory consumption was 35.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L681] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L682] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L683] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L684] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L685] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L686] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L687] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L688] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L689] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L690] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L691] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L692] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L693] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L694] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L695] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L696] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L697] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L773] -1 pthread_t t593; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] FCALL, FORK -1 pthread_create(&t593, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L701] 0 y$w_buff1 = y$w_buff0 [L702] 0 y$w_buff0 = 1 [L703] 0 y$w_buff1_used = y$w_buff0_used [L704] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L706] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L707] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L708] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L709] 0 y$r_buff0_thd1 = (_Bool)1 [L712] 0 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L715] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L775] -1 pthread_t t594; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L776] FCALL, FORK -1 pthread_create(&t594, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 x = 2 [L732] 1 __unbuffered_p1_EAX = x [L735] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L736] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L737] 1 y$flush_delayed = weak$$choice2 [L738] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L740] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L741] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L742] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L743] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] 1 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L745] EXPR 1 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L745] 1 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L715] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L747] 1 y = y$flush_delayed ? y$mem_tmp : y [L748] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L716] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L716] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L717] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L718] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L718] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L719] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L722] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L751] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L751] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L752] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L753] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L753] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L754] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L755] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L755] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L782] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L782] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L782] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L782] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L783] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L784] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L785] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L786] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L786] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L789] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 222 locations, 3 error locations. UNSAFE Result, 47.8s OverallTime, 34 OverallIterations, 1 TraceHistogramMax, 24.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8837 SDtfs, 10264 SDslu, 21529 SDs, 0 SdLazy, 9963 SolverSat, 483 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 361 GetRequests, 91 SyntacticMatches, 32 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 10.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38973occurred in iteration=16, 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: 8.9s AutomataMinimizationTime, 33 MinimizatonAttempts, 95177 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 10.3s InterpolantComputationTime, 2516 NumberOfCodeBlocks, 2516 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2388 ConstructedInterpolants, 0 QuantifiedInterpolants, 520665 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...