./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix041_tso.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa 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/mix041_tso.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 329b7a48e556584de8d61f30845ded50594e4269 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-2e94e6a [2018-12-31 21:13:30,913 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 21:13:30,915 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 21:13:30,928 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 21:13:30,929 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 21:13:30,930 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 21:13:30,932 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 21:13:30,934 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 21:13:30,936 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 21:13:30,937 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 21:13:30,938 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 21:13:30,938 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 21:13:30,939 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 21:13:30,940 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 21:13:30,942 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 21:13:30,942 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 21:13:30,944 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 21:13:30,949 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 21:13:30,957 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 21:13:30,962 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 21:13:30,963 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 21:13:30,968 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 21:13:30,970 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 21:13:30,973 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 21:13:30,973 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 21:13:30,975 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 21:13:30,975 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 21:13:30,978 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 21:13:30,979 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 21:13:30,982 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 21:13:30,983 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 21:13:30,984 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 21:13:30,984 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 21:13:30,986 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 21:13:30,987 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 21:13:30,988 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 21:13:30,988 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 21:13:31,022 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 21:13:31,022 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 21:13:31,025 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 21:13:31,025 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 21:13:31,026 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 21:13:31,027 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 21:13:31,027 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 21:13:31,027 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 21:13:31,027 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 21:13:31,028 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 21:13:31,028 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 21:13:31,028 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 21:13:31,028 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 21:13:31,028 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 21:13:31,028 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 21:13:31,029 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 21:13:31,029 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 21:13:31,030 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 21:13:31,030 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 21:13:31,030 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 21:13:31,030 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 21:13:31,030 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 21:13:31,031 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 21:13:31,031 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 21:13:31,031 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 21:13:31,031 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 21:13:31,031 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 21:13:31,031 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 21:13:31,032 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 -> 329b7a48e556584de8d61f30845ded50594e4269 [2018-12-31 21:13:31,095 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 21:13:31,114 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 21:13:31,122 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 21:13:31,124 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 21:13:31,124 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 21:13:31,125 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix041_tso.opt_false-unreach-call.i [2018-12-31 21:13:31,206 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68ec124a9/52657af7bbcc4f90a9355c96b617d619/FLAG98e251be2 [2018-12-31 21:13:31,735 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 21:13:31,735 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix041_tso.opt_false-unreach-call.i [2018-12-31 21:13:31,757 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68ec124a9/52657af7bbcc4f90a9355c96b617d619/FLAG98e251be2 [2018-12-31 21:13:31,998 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68ec124a9/52657af7bbcc4f90a9355c96b617d619 [2018-12-31 21:13:32,004 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 21:13:32,006 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 21:13:32,007 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 21:13:32,007 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 21:13:32,012 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 21:13:32,013 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:13:32" (1/1) ... [2018-12-31 21:13:32,016 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12b20f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:13:32, skipping insertion in model container [2018-12-31 21:13:32,017 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:13:32" (1/1) ... [2018-12-31 21:13:32,026 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 21:13:32,089 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 21:13:32,609 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 21:13:32,635 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 21:13:32,812 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 21:13:32,889 INFO L195 MainTranslator]: Completed translation [2018-12-31 21:13:32,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:13:32 WrapperNode [2018-12-31 21:13:32,890 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 21:13:32,891 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 21:13:32,891 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 21:13:32,891 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 21:13:32,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:13:32" (1/1) ... [2018-12-31 21:13:32,935 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:13:32" (1/1) ... [2018-12-31 21:13:32,993 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 21:13:32,993 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 21:13:32,994 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 21:13:32,994 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 21:13:33,017 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:13:32" (1/1) ... [2018-12-31 21:13:33,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:13:32" (1/1) ... [2018-12-31 21:13:33,033 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:13:32" (1/1) ... [2018-12-31 21:13:33,033 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:13:32" (1/1) ... [2018-12-31 21:13:33,052 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:13:32" (1/1) ... [2018-12-31 21:13:33,057 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:13:32" (1/1) ... [2018-12-31 21:13:33,061 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:13:32" (1/1) ... [2018-12-31 21:13:33,066 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 21:13:33,067 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 21:13:33,068 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 21:13:33,068 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 21:13:33,069 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:13:32" (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-12-31 21:13:33,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 21:13:33,153 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-31 21:13:33,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 21:13:33,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 21:13:33,153 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-31 21:13:33,153 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-31 21:13:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-31 21:13:33,154 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-31 21:13:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-31 21:13:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 21:13:33,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 21:13:33,156 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-31 21:13:34,388 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 21:13:34,389 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-31 21:13:34,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:13:34 BoogieIcfgContainer [2018-12-31 21:13:34,389 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 21:13:34,391 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 21:13:34,392 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 21:13:34,396 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 21:13:34,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 09:13:32" (1/3) ... [2018-12-31 21:13:34,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ec12c7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:13:34, skipping insertion in model container [2018-12-31 21:13:34,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:13:32" (2/3) ... [2018-12-31 21:13:34,399 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ec12c7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:13:34, skipping insertion in model container [2018-12-31 21:13:34,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:13:34" (3/3) ... [2018-12-31 21:13:34,402 INFO L112 eAbstractionObserver]: Analyzing ICFG mix041_tso.opt_false-unreach-call.i [2018-12-31 21:13:34,448 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,448 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,449 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,449 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,450 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,450 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,450 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,450 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,451 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,451 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,451 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,451 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,452 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,452 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,452 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,452 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,452 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,453 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,453 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,453 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,453 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,454 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,455 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,455 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,455 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,456 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,456 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,456 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,456 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,456 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,457 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,457 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,457 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,457 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,458 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,458 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,458 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,458 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,459 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,460 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,460 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,461 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,467 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,468 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,468 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,468 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,468 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,468 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,469 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,469 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,469 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,469 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,474 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,475 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,475 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,475 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,476 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,476 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,477 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,477 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,477 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,477 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,477 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,478 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,478 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,478 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,478 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,478 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,482 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,482 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,482 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,482 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:13:34,503 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-31 21:13:34,504 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 21:13:34,513 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 21:13:34,533 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 21:13:34,560 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 21:13:34,560 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 21:13:34,561 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 21:13:34,561 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 21:13:34,561 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 21:13:34,561 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 21:13:34,561 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 21:13:34,561 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 21:13:34,562 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 21:13:34,577 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2018-12-31 21:13:36,297 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25089 states. [2018-12-31 21:13:36,300 INFO L276 IsEmpty]: Start isEmpty. Operand 25089 states. [2018-12-31 21:13:36,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-31 21:13:36,310 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:13:36,312 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] [2018-12-31 21:13:36,315 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:13:36,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:13:36,322 INFO L82 PathProgramCache]: Analyzing trace with hash 224065163, now seen corresponding path program 1 times [2018-12-31 21:13:36,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:13:36,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:13:36,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:36,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:13:36,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:36,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:13:36,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:13:36,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:13:36,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 21:13:36,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 21:13:36,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 21:13:36,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:13:36,689 INFO L87 Difference]: Start difference. First operand 25089 states. Second operand 4 states. [2018-12-31 21:13:37,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:13:37,951 INFO L93 Difference]: Finished difference Result 45389 states and 177627 transitions. [2018-12-31 21:13:37,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 21:13:37,954 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-12-31 21:13:37,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:13:38,304 INFO L225 Difference]: With dead ends: 45389 [2018-12-31 21:13:38,304 INFO L226 Difference]: Without dead ends: 40629 [2018-12-31 21:13:38,307 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-12-31 21:13:38,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40629 states. [2018-12-31 21:13:39,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40629 to 23663. [2018-12-31 21:13:39,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23663 states. [2018-12-31 21:13:40,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23663 states to 23663 states and 92544 transitions. [2018-12-31 21:13:40,085 INFO L78 Accepts]: Start accepts. Automaton has 23663 states and 92544 transitions. Word has length 38 [2018-12-31 21:13:40,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:13:40,086 INFO L480 AbstractCegarLoop]: Abstraction has 23663 states and 92544 transitions. [2018-12-31 21:13:40,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 21:13:40,087 INFO L276 IsEmpty]: Start isEmpty. Operand 23663 states and 92544 transitions. [2018-12-31 21:13:40,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-31 21:13:40,094 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:13:40,095 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-12-31 21:13:40,095 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:13:40,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:13:40,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1632937034, now seen corresponding path program 1 times [2018-12-31 21:13:40,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:13:40,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:13:40,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:40,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:13:40,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:40,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:13:40,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:13:40,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:13:40,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 21:13:40,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 21:13:40,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 21:13:40,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 21:13:40,224 INFO L87 Difference]: Start difference. First operand 23663 states and 92544 transitions. Second operand 3 states. [2018-12-31 21:13:40,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:13:40,894 INFO L93 Difference]: Finished difference Result 23663 states and 92160 transitions. [2018-12-31 21:13:40,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 21:13:40,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-12-31 21:13:40,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:13:41,022 INFO L225 Difference]: With dead ends: 23663 [2018-12-31 21:13:41,022 INFO L226 Difference]: Without dead ends: 23663 [2018-12-31 21:13:41,023 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-12-31 21:13:41,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23663 states. [2018-12-31 21:13:42,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23663 to 23663. [2018-12-31 21:13:42,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23663 states. [2018-12-31 21:13:42,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23663 states to 23663 states and 92160 transitions. [2018-12-31 21:13:42,236 INFO L78 Accepts]: Start accepts. Automaton has 23663 states and 92160 transitions. Word has length 45 [2018-12-31 21:13:42,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:13:42,236 INFO L480 AbstractCegarLoop]: Abstraction has 23663 states and 92160 transitions. [2018-12-31 21:13:42,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 21:13:42,237 INFO L276 IsEmpty]: Start isEmpty. Operand 23663 states and 92160 transitions. [2018-12-31 21:13:42,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-31 21:13:42,241 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:13:42,241 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-12-31 21:13:42,241 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:13:42,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:13:42,242 INFO L82 PathProgramCache]: Analyzing trace with hash -164014325, now seen corresponding path program 1 times [2018-12-31 21:13:42,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:13:42,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:13:42,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:42,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:13:42,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:42,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:13:42,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:13:42,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:13:42,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 21:13:42,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 21:13:42,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 21:13:42,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:13:42,361 INFO L87 Difference]: Start difference. First operand 23663 states and 92160 transitions. Second operand 5 states. [2018-12-31 21:13:44,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:13:44,754 INFO L93 Difference]: Finished difference Result 64831 states and 240932 transitions. [2018-12-31 21:13:44,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 21:13:44,755 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-12-31 21:13:44,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:13:45,078 INFO L225 Difference]: With dead ends: 64831 [2018-12-31 21:13:45,078 INFO L226 Difference]: Without dead ends: 64671 [2018-12-31 21:13:45,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 21:13:45,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64671 states. [2018-12-31 21:13:46,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64671 to 37143. [2018-12-31 21:13:46,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37143 states. [2018-12-31 21:13:46,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37143 states to 37143 states and 137901 transitions. [2018-12-31 21:13:46,694 INFO L78 Accepts]: Start accepts. Automaton has 37143 states and 137901 transitions. Word has length 45 [2018-12-31 21:13:46,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:13:46,696 INFO L480 AbstractCegarLoop]: Abstraction has 37143 states and 137901 transitions. [2018-12-31 21:13:46,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 21:13:46,696 INFO L276 IsEmpty]: Start isEmpty. Operand 37143 states and 137901 transitions. [2018-12-31 21:13:46,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-31 21:13:46,702 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:13:46,702 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-12-31 21:13:46,703 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:13:46,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:13:46,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1508997083, now seen corresponding path program 1 times [2018-12-31 21:13:46,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:13:46,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:13:46,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:46,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:13:46,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:46,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:13:46,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:13:46,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:13:46,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 21:13:46,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 21:13:46,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 21:13:46,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:13:46,894 INFO L87 Difference]: Start difference. First operand 37143 states and 137901 transitions. Second operand 4 states. [2018-12-31 21:13:47,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:13:47,091 INFO L93 Difference]: Finished difference Result 12365 states and 41168 transitions. [2018-12-31 21:13:47,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 21:13:47,092 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-12-31 21:13:47,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:13:47,134 INFO L225 Difference]: With dead ends: 12365 [2018-12-31 21:13:47,135 INFO L226 Difference]: Without dead ends: 11844 [2018-12-31 21:13:47,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:13:47,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11844 states. [2018-12-31 21:13:47,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11844 to 11844. [2018-12-31 21:13:47,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11844 states. [2018-12-31 21:13:47,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11844 states to 11844 states and 39616 transitions. [2018-12-31 21:13:47,905 INFO L78 Accepts]: Start accepts. Automaton has 11844 states and 39616 transitions. Word has length 46 [2018-12-31 21:13:47,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:13:47,906 INFO L480 AbstractCegarLoop]: Abstraction has 11844 states and 39616 transitions. [2018-12-31 21:13:47,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 21:13:47,906 INFO L276 IsEmpty]: Start isEmpty. Operand 11844 states and 39616 transitions. [2018-12-31 21:13:47,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-31 21:13:47,913 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:13:47,914 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] [2018-12-31 21:13:47,914 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:13:47,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:13:47,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1496318134, now seen corresponding path program 1 times [2018-12-31 21:13:47,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:13:47,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:13:47,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:47,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:13:47,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:47,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:13:48,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:13:48,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:13:48,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 21:13:48,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 21:13:48,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 21:13:48,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:13:48,199 INFO L87 Difference]: Start difference. First operand 11844 states and 39616 transitions. Second operand 4 states. [2018-12-31 21:13:48,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:13:48,540 INFO L93 Difference]: Finished difference Result 17020 states and 55692 transitions. [2018-12-31 21:13:48,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 21:13:48,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-12-31 21:13:48,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:13:48,580 INFO L225 Difference]: With dead ends: 17020 [2018-12-31 21:13:48,580 INFO L226 Difference]: Without dead ends: 17020 [2018-12-31 21:13:48,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-12-31 21:13:48,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17020 states. [2018-12-31 21:13:48,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17020 to 12880. [2018-12-31 21:13:48,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12880 states. [2018-12-31 21:13:48,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12880 states to 12880 states and 42719 transitions. [2018-12-31 21:13:48,913 INFO L78 Accepts]: Start accepts. Automaton has 12880 states and 42719 transitions. Word has length 59 [2018-12-31 21:13:48,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:13:48,914 INFO L480 AbstractCegarLoop]: Abstraction has 12880 states and 42719 transitions. [2018-12-31 21:13:48,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 21:13:48,914 INFO L276 IsEmpty]: Start isEmpty. Operand 12880 states and 42719 transitions. [2018-12-31 21:13:48,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-31 21:13:48,923 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:13:48,923 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] [2018-12-31 21:13:48,923 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:13:48,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:13:48,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1055838827, now seen corresponding path program 1 times [2018-12-31 21:13:48,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:13:48,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:13:48,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:48,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:13:48,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:48,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:13:49,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:13:49,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:13:49,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 21:13:49,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 21:13:49,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 21:13:49,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 21:13:49,140 INFO L87 Difference]: Start difference. First operand 12880 states and 42719 transitions. Second operand 6 states. [2018-12-31 21:13:50,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:13:50,089 INFO L93 Difference]: Finished difference Result 18600 states and 60829 transitions. [2018-12-31 21:13:50,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 21:13:50,090 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2018-12-31 21:13:50,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:13:50,128 INFO L225 Difference]: With dead ends: 18600 [2018-12-31 21:13:50,128 INFO L226 Difference]: Without dead ends: 18568 [2018-12-31 21:13:50,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-31 21:13:50,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18568 states. [2018-12-31 21:13:50,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18568 to 14412. [2018-12-31 21:13:50,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14412 states. [2018-12-31 21:13:50,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14412 states to 14412 states and 47548 transitions. [2018-12-31 21:13:50,472 INFO L78 Accepts]: Start accepts. Automaton has 14412 states and 47548 transitions. Word has length 59 [2018-12-31 21:13:50,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:13:50,472 INFO L480 AbstractCegarLoop]: Abstraction has 14412 states and 47548 transitions. [2018-12-31 21:13:50,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 21:13:50,473 INFO L276 IsEmpty]: Start isEmpty. Operand 14412 states and 47548 transitions. [2018-12-31 21:13:50,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-31 21:13:50,502 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:13:50,502 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] [2018-12-31 21:13:50,503 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:13:50,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:13:50,503 INFO L82 PathProgramCache]: Analyzing trace with hash 157562495, now seen corresponding path program 1 times [2018-12-31 21:13:50,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:13:50,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:13:50,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:50,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:13:50,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:50,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:13:50,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-12-31 21:13:50,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:13:50,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 21:13:50,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 21:13:50,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 21:13:50,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-31 21:13:50,753 INFO L87 Difference]: Start difference. First operand 14412 states and 47548 transitions. Second operand 8 states. [2018-12-31 21:13:52,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:13:52,803 INFO L93 Difference]: Finished difference Result 20800 states and 66979 transitions. [2018-12-31 21:13:52,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-31 21:13:52,804 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 73 [2018-12-31 21:13:52,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:13:52,847 INFO L225 Difference]: With dead ends: 20800 [2018-12-31 21:13:52,847 INFO L226 Difference]: Without dead ends: 20736 [2018-12-31 21:13:52,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2018-12-31 21:13:52,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20736 states. [2018-12-31 21:13:53,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20736 to 16196. [2018-12-31 21:13:53,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16196 states. [2018-12-31 21:13:53,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16196 states to 16196 states and 53058 transitions. [2018-12-31 21:13:53,179 INFO L78 Accepts]: Start accepts. Automaton has 16196 states and 53058 transitions. Word has length 73 [2018-12-31 21:13:53,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:13:53,180 INFO L480 AbstractCegarLoop]: Abstraction has 16196 states and 53058 transitions. [2018-12-31 21:13:53,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 21:13:53,180 INFO L276 IsEmpty]: Start isEmpty. Operand 16196 states and 53058 transitions. [2018-12-31 21:13:53,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-31 21:13:53,207 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:13:53,207 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:13:53,207 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:13:53,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:13:53,208 INFO L82 PathProgramCache]: Analyzing trace with hash -2025339730, now seen corresponding path program 1 times [2018-12-31 21:13:53,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:13:53,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:13:53,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:53,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:13:53,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:53,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:13:53,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:13:53,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:13:53,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 21:13:53,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 21:13:53,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 21:13:53,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 21:13:53,298 INFO L87 Difference]: Start difference. First operand 16196 states and 53058 transitions. Second operand 3 states. [2018-12-31 21:13:53,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:13:53,651 INFO L93 Difference]: Finished difference Result 19284 states and 62126 transitions. [2018-12-31 21:13:53,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 21:13:53,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2018-12-31 21:13:53,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:13:53,685 INFO L225 Difference]: With dead ends: 19284 [2018-12-31 21:13:53,685 INFO L226 Difference]: Without dead ends: 19284 [2018-12-31 21:13:53,686 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-12-31 21:13:53,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19284 states. [2018-12-31 21:13:53,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19284 to 17292. [2018-12-31 21:13:53,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17292 states. [2018-12-31 21:13:53,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17292 states to 17292 states and 56208 transitions. [2018-12-31 21:13:53,990 INFO L78 Accepts]: Start accepts. Automaton has 17292 states and 56208 transitions. Word has length 75 [2018-12-31 21:13:53,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:13:53,990 INFO L480 AbstractCegarLoop]: Abstraction has 17292 states and 56208 transitions. [2018-12-31 21:13:53,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 21:13:53,991 INFO L276 IsEmpty]: Start isEmpty. Operand 17292 states and 56208 transitions. [2018-12-31 21:13:54,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-31 21:13:54,012 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:13:54,012 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:13:54,012 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:13:54,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:13:54,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1761530451, now seen corresponding path program 1 times [2018-12-31 21:13:54,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:13:54,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:13:54,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:54,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:13:54,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:54,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:13:54,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:13:54,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:13:54,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-31 21:13:54,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 21:13:54,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 21:13:54,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-31 21:13:54,293 INFO L87 Difference]: Start difference. First operand 17292 states and 56208 transitions. Second operand 10 states. [2018-12-31 21:13:56,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:13:56,509 INFO L93 Difference]: Finished difference Result 25448 states and 79949 transitions. [2018-12-31 21:13:56,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-31 21:13:56,509 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 79 [2018-12-31 21:13:56,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:13:56,559 INFO L225 Difference]: With dead ends: 25448 [2018-12-31 21:13:56,560 INFO L226 Difference]: Without dead ends: 25384 [2018-12-31 21:13:56,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=277, Invalid=1055, Unknown=0, NotChecked=0, Total=1332 [2018-12-31 21:13:56,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25384 states. [2018-12-31 21:13:56,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25384 to 19360. [2018-12-31 21:13:56,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19360 states. [2018-12-31 21:13:56,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19360 states to 19360 states and 62259 transitions. [2018-12-31 21:13:56,989 INFO L78 Accepts]: Start accepts. Automaton has 19360 states and 62259 transitions. Word has length 79 [2018-12-31 21:13:56,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:13:56,989 INFO L480 AbstractCegarLoop]: Abstraction has 19360 states and 62259 transitions. [2018-12-31 21:13:56,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 21:13:56,989 INFO L276 IsEmpty]: Start isEmpty. Operand 19360 states and 62259 transitions. [2018-12-31 21:13:57,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-31 21:13:57,015 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:13:57,015 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] [2018-12-31 21:13:57,016 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:13:57,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:13:57,017 INFO L82 PathProgramCache]: Analyzing trace with hash -2114686996, now seen corresponding path program 1 times [2018-12-31 21:13:57,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:13:57,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:13:57,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:57,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:13:57,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:57,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:13:57,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:13:57,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:13:57,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 21:13:57,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 21:13:57,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 21:13:57,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 21:13:57,137 INFO L87 Difference]: Start difference. First operand 19360 states and 62259 transitions. Second operand 3 states. [2018-12-31 21:13:57,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:13:57,516 INFO L93 Difference]: Finished difference Result 20622 states and 66126 transitions. [2018-12-31 21:13:57,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 21:13:57,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2018-12-31 21:13:57,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:13:57,556 INFO L225 Difference]: With dead ends: 20622 [2018-12-31 21:13:57,556 INFO L226 Difference]: Without dead ends: 20622 [2018-12-31 21:13:57,557 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-12-31 21:13:57,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20622 states. [2018-12-31 21:13:57,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20622 to 19972. [2018-12-31 21:13:57,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19972 states. [2018-12-31 21:13:58,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19972 states to 19972 states and 64141 transitions. [2018-12-31 21:13:58,336 INFO L78 Accepts]: Start accepts. Automaton has 19972 states and 64141 transitions. Word has length 80 [2018-12-31 21:13:58,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:13:58,337 INFO L480 AbstractCegarLoop]: Abstraction has 19972 states and 64141 transitions. [2018-12-31 21:13:58,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 21:13:58,338 INFO L276 IsEmpty]: Start isEmpty. Operand 19972 states and 64141 transitions. [2018-12-31 21:13:58,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-31 21:13:58,365 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:13:58,366 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] [2018-12-31 21:13:58,366 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:13:58,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:13:58,366 INFO L82 PathProgramCache]: Analyzing trace with hash -341105651, now seen corresponding path program 1 times [2018-12-31 21:13:58,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:13:58,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:13:58,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:58,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:13:58,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:58,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:13:58,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:13:58,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:13:58,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 21:13:58,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 21:13:58,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 21:13:58,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:13:58,626 INFO L87 Difference]: Start difference. First operand 19972 states and 64141 transitions. Second operand 4 states. [2018-12-31 21:13:59,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:13:59,143 INFO L93 Difference]: Finished difference Result 24354 states and 77143 transitions. [2018-12-31 21:13:59,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 21:13:59,144 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-31 21:13:59,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:13:59,190 INFO L225 Difference]: With dead ends: 24354 [2018-12-31 21:13:59,191 INFO L226 Difference]: Without dead ends: 24354 [2018-12-31 21:13:59,191 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-12-31 21:13:59,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24354 states. [2018-12-31 21:13:59,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24354 to 22838. [2018-12-31 21:13:59,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22838 states. [2018-12-31 21:13:59,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22838 states to 22838 states and 72762 transitions. [2018-12-31 21:13:59,568 INFO L78 Accepts]: Start accepts. Automaton has 22838 states and 72762 transitions. Word has length 81 [2018-12-31 21:13:59,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:13:59,568 INFO L480 AbstractCegarLoop]: Abstraction has 22838 states and 72762 transitions. [2018-12-31 21:13:59,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 21:13:59,569 INFO L276 IsEmpty]: Start isEmpty. Operand 22838 states and 72762 transitions. [2018-12-31 21:13:59,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-31 21:13:59,593 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:13:59,593 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:13:59,593 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:13:59,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:13:59,594 INFO L82 PathProgramCache]: Analyzing trace with hash 2018201358, now seen corresponding path program 1 times [2018-12-31 21:13:59,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:13:59,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:13:59,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:59,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:13:59,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:59,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:13:59,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:13:59,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:13:59,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 21:13:59,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 21:13:59,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 21:13:59,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 21:13:59,712 INFO L87 Difference]: Start difference. First operand 22838 states and 72762 transitions. Second operand 3 states. [2018-12-31 21:14:00,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:14:00,397 INFO L93 Difference]: Finished difference Result 24180 states and 76858 transitions. [2018-12-31 21:14:00,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 21:14:00,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2018-12-31 21:14:00,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:14:00,447 INFO L225 Difference]: With dead ends: 24180 [2018-12-31 21:14:00,448 INFO L226 Difference]: Without dead ends: 24180 [2018-12-31 21:14:00,448 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-12-31 21:14:00,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24180 states. [2018-12-31 21:14:00,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24180 to 23520. [2018-12-31 21:14:00,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23520 states. [2018-12-31 21:14:00,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23520 states to 23520 states and 74838 transitions. [2018-12-31 21:14:00,879 INFO L78 Accepts]: Start accepts. Automaton has 23520 states and 74838 transitions. Word has length 81 [2018-12-31 21:14:00,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:14:00,879 INFO L480 AbstractCegarLoop]: Abstraction has 23520 states and 74838 transitions. [2018-12-31 21:14:00,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 21:14:00,879 INFO L276 IsEmpty]: Start isEmpty. Operand 23520 states and 74838 transitions. [2018-12-31 21:14:00,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-31 21:14:00,907 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:14:00,907 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] [2018-12-31 21:14:00,907 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:14:00,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:14:00,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1829258324, now seen corresponding path program 1 times [2018-12-31 21:14:00,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:14:00,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:14:00,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:14:00,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:14:00,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:14:00,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:14:01,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:14:01,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:14:01,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 21:14:01,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 21:14:01,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 21:14:01,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 21:14:01,096 INFO L87 Difference]: Start difference. First operand 23520 states and 74838 transitions. Second operand 6 states. [2018-12-31 21:14:02,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:14:02,053 INFO L93 Difference]: Finished difference Result 40504 states and 126752 transitions. [2018-12-31 21:14:02,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 21:14:02,054 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-12-31 21:14:02,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:14:02,132 INFO L225 Difference]: With dead ends: 40504 [2018-12-31 21:14:02,132 INFO L226 Difference]: Without dead ends: 40048 [2018-12-31 21:14:02,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-31 21:14:02,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40048 states. [2018-12-31 21:14:02,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40048 to 31632. [2018-12-31 21:14:02,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31632 states. [2018-12-31 21:14:02,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31632 states to 31632 states and 100634 transitions. [2018-12-31 21:14:02,750 INFO L78 Accepts]: Start accepts. Automaton has 31632 states and 100634 transitions. Word has length 82 [2018-12-31 21:14:02,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:14:02,751 INFO L480 AbstractCegarLoop]: Abstraction has 31632 states and 100634 transitions. [2018-12-31 21:14:02,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 21:14:02,751 INFO L276 IsEmpty]: Start isEmpty. Operand 31632 states and 100634 transitions. [2018-12-31 21:14:02,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-31 21:14:02,790 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:14:02,791 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] [2018-12-31 21:14:02,791 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:14:02,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:14:02,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1504094955, now seen corresponding path program 1 times [2018-12-31 21:14:02,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:14:02,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:14:02,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:14:02,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:14:02,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:14:02,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:14:03,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:14:03,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:14:03,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 21:14:03,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 21:14:03,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 21:14:03,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-31 21:14:03,231 INFO L87 Difference]: Start difference. First operand 31632 states and 100634 transitions. Second operand 7 states. [2018-12-31 21:14:05,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:14:05,104 INFO L93 Difference]: Finished difference Result 57226 states and 176187 transitions. [2018-12-31 21:14:05,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-31 21:14:05,105 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2018-12-31 21:14:05,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:14:05,223 INFO L225 Difference]: With dead ends: 57226 [2018-12-31 21:14:05,223 INFO L226 Difference]: Without dead ends: 57114 [2018-12-31 21:14:05,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2018-12-31 21:14:05,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57114 states. [2018-12-31 21:14:05,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57114 to 34165. [2018-12-31 21:14:05,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34165 states. [2018-12-31 21:14:05,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34165 states to 34165 states and 107081 transitions. [2018-12-31 21:14:05,987 INFO L78 Accepts]: Start accepts. Automaton has 34165 states and 107081 transitions. Word has length 82 [2018-12-31 21:14:05,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:14:05,988 INFO L480 AbstractCegarLoop]: Abstraction has 34165 states and 107081 transitions. [2018-12-31 21:14:05,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 21:14:05,988 INFO L276 IsEmpty]: Start isEmpty. Operand 34165 states and 107081 transitions. [2018-12-31 21:14:06,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-31 21:14:06,035 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:14:06,035 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] [2018-12-31 21:14:06,035 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:14:06,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:14:06,036 INFO L82 PathProgramCache]: Analyzing trace with hash 70435287, now seen corresponding path program 1 times [2018-12-31 21:14:06,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:14:06,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:14:06,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:14:06,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:14:06,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:14:06,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:14:06,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:14:06,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:14:06,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 21:14:06,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 21:14:06,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 21:14:06,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-31 21:14:06,227 INFO L87 Difference]: Start difference. First operand 34165 states and 107081 transitions. Second operand 7 states. [2018-12-31 21:14:09,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:14:09,717 INFO L93 Difference]: Finished difference Result 63393 states and 195167 transitions. [2018-12-31 21:14:09,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 21:14:09,718 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2018-12-31 21:14:09,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:14:09,844 INFO L225 Difference]: With dead ends: 63393 [2018-12-31 21:14:09,844 INFO L226 Difference]: Without dead ends: 62537 [2018-12-31 21:14:09,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-31 21:14:09,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62537 states. [2018-12-31 21:14:10,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62537 to 37210. [2018-12-31 21:14:10,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37210 states. [2018-12-31 21:14:10,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37210 states to 37210 states and 116142 transitions. [2018-12-31 21:14:10,667 INFO L78 Accepts]: Start accepts. Automaton has 37210 states and 116142 transitions. Word has length 82 [2018-12-31 21:14:10,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:14:10,667 INFO L480 AbstractCegarLoop]: Abstraction has 37210 states and 116142 transitions. [2018-12-31 21:14:10,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 21:14:10,667 INFO L276 IsEmpty]: Start isEmpty. Operand 37210 states and 116142 transitions. [2018-12-31 21:14:10,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-31 21:14:10,715 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:14:10,715 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] [2018-12-31 21:14:10,715 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:14:10,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:14:10,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1236340502, now seen corresponding path program 1 times [2018-12-31 21:14:10,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:14:10,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:14:10,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:14:10,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:14:10,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:14:10,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:14:11,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:14:11,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:14:11,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 21:14:11,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 21:14:11,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 21:14:11,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-31 21:14:11,202 INFO L87 Difference]: Start difference. First operand 37210 states and 116142 transitions. Second operand 8 states. [2018-12-31 21:14:13,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:14:13,451 INFO L93 Difference]: Finished difference Result 58205 states and 176400 transitions. [2018-12-31 21:14:13,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-31 21:14:13,452 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2018-12-31 21:14:13,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:14:13,567 INFO L225 Difference]: With dead ends: 58205 [2018-12-31 21:14:13,567 INFO L226 Difference]: Without dead ends: 57477 [2018-12-31 21:14:13,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2018-12-31 21:14:13,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57477 states. [2018-12-31 21:14:14,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57477 to 36708. [2018-12-31 21:14:14,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36708 states. [2018-12-31 21:14:14,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36708 states to 36708 states and 113842 transitions. [2018-12-31 21:14:14,781 INFO L78 Accepts]: Start accepts. Automaton has 36708 states and 113842 transitions. Word has length 82 [2018-12-31 21:14:14,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:14:14,781 INFO L480 AbstractCegarLoop]: Abstraction has 36708 states and 113842 transitions. [2018-12-31 21:14:14,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 21:14:14,782 INFO L276 IsEmpty]: Start isEmpty. Operand 36708 states and 113842 transitions. [2018-12-31 21:14:14,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-31 21:14:14,829 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:14:14,829 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-31 21:14:14,830 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:14:14,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:14:14,830 INFO L82 PathProgramCache]: Analyzing trace with hash -852248296, now seen corresponding path program 1 times [2018-12-31 21:14:14,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:14:14,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:14:14,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:14:14,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:14:14,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:14:14,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:14:15,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-12-31 21:14:15,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:14:15,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 21:14:15,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 21:14:15,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 21:14:15,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-31 21:14:15,061 INFO L87 Difference]: Start difference. First operand 36708 states and 113842 transitions. Second operand 8 states. [2018-12-31 21:14:16,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:14:16,569 INFO L93 Difference]: Finished difference Result 45624 states and 139530 transitions. [2018-12-31 21:14:16,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-31 21:14:16,570 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2018-12-31 21:14:16,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:14:16,656 INFO L225 Difference]: With dead ends: 45624 [2018-12-31 21:14:16,657 INFO L226 Difference]: Without dead ends: 45624 [2018-12-31 21:14:16,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2018-12-31 21:14:16,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45624 states. [2018-12-31 21:14:17,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45624 to 31576. [2018-12-31 21:14:17,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31576 states. [2018-12-31 21:14:17,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31576 states to 31576 states and 98025 transitions. [2018-12-31 21:14:17,305 INFO L78 Accepts]: Start accepts. Automaton has 31576 states and 98025 transitions. Word has length 82 [2018-12-31 21:14:17,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:14:17,306 INFO L480 AbstractCegarLoop]: Abstraction has 31576 states and 98025 transitions. [2018-12-31 21:14:17,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 21:14:17,306 INFO L276 IsEmpty]: Start isEmpty. Operand 31576 states and 98025 transitions. [2018-12-31 21:14:17,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-31 21:14:17,338 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:14:17,338 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] [2018-12-31 21:14:17,338 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:14:17,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:14:17,339 INFO L82 PathProgramCache]: Analyzing trace with hash -371531880, now seen corresponding path program 1 times [2018-12-31 21:14:17,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:14:17,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:14:17,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:14:17,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:14:17,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:14:17,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:14:17,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:14:17,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:14:17,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 21:14:17,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 21:14:17,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 21:14:17,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-31 21:14:17,525 INFO L87 Difference]: Start difference. First operand 31576 states and 98025 transitions. Second operand 9 states. [2018-12-31 21:14:19,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:14:19,611 INFO L93 Difference]: Finished difference Result 47908 states and 144238 transitions. [2018-12-31 21:14:19,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-31 21:14:19,612 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2018-12-31 21:14:19,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:14:19,702 INFO L225 Difference]: With dead ends: 47908 [2018-12-31 21:14:19,702 INFO L226 Difference]: Without dead ends: 47908 [2018-12-31 21:14:19,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2018-12-31 21:14:19,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47908 states. [2018-12-31 21:14:20,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47908 to 34672. [2018-12-31 21:14:20,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34672 states. [2018-12-31 21:14:20,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34672 states to 34672 states and 107255 transitions. [2018-12-31 21:14:20,390 INFO L78 Accepts]: Start accepts. Automaton has 34672 states and 107255 transitions. Word has length 82 [2018-12-31 21:14:20,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:14:20,391 INFO L480 AbstractCegarLoop]: Abstraction has 34672 states and 107255 transitions. [2018-12-31 21:14:20,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 21:14:20,391 INFO L276 IsEmpty]: Start isEmpty. Operand 34672 states and 107255 transitions. [2018-12-31 21:14:20,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-31 21:14:20,426 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:14:20,426 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] [2018-12-31 21:14:20,427 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:14:20,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:14:20,427 INFO L82 PathProgramCache]: Analyzing trace with hash 873232601, now seen corresponding path program 1 times [2018-12-31 21:14:20,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:14:20,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:14:20,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:14:20,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:14:20,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:14:20,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:14:20,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:14:20,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:14:20,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 21:14:20,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 21:14:20,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 21:14:20,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 21:14:20,562 INFO L87 Difference]: Start difference. First operand 34672 states and 107255 transitions. Second operand 3 states. [2018-12-31 21:14:20,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:14:20,765 INFO L93 Difference]: Finished difference Result 29584 states and 91183 transitions. [2018-12-31 21:14:20,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 21:14:20,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2018-12-31 21:14:20,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:14:20,820 INFO L225 Difference]: With dead ends: 29584 [2018-12-31 21:14:20,820 INFO L226 Difference]: Without dead ends: 29472 [2018-12-31 21:14:20,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 21:14:20,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29472 states. [2018-12-31 21:14:21,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29472 to 27747. [2018-12-31 21:14:21,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27747 states. [2018-12-31 21:14:21,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27747 states to 27747 states and 85798 transitions. [2018-12-31 21:14:21,647 INFO L78 Accepts]: Start accepts. Automaton has 27747 states and 85798 transitions. Word has length 82 [2018-12-31 21:14:21,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:14:21,648 INFO L480 AbstractCegarLoop]: Abstraction has 27747 states and 85798 transitions. [2018-12-31 21:14:21,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 21:14:21,648 INFO L276 IsEmpty]: Start isEmpty. Operand 27747 states and 85798 transitions. [2018-12-31 21:14:21,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-31 21:14:21,675 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:14:21,675 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] [2018-12-31 21:14:21,676 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:14:21,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:14:21,676 INFO L82 PathProgramCache]: Analyzing trace with hash 959656391, now seen corresponding path program 1 times [2018-12-31 21:14:21,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:14:21,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:14:21,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:14:21,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:14:21,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:14:21,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:14:22,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:14:22,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:14:22,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 21:14:22,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 21:14:22,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 21:14:22,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 21:14:22,022 INFO L87 Difference]: Start difference. First operand 27747 states and 85798 transitions. Second operand 6 states. [2018-12-31 21:14:22,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:14:22,875 INFO L93 Difference]: Finished difference Result 50395 states and 153785 transitions. [2018-12-31 21:14:22,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 21:14:22,876 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-12-31 21:14:22,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:14:22,988 INFO L225 Difference]: With dead ends: 50395 [2018-12-31 21:14:22,988 INFO L226 Difference]: Without dead ends: 50187 [2018-12-31 21:14:22,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-12-31 21:14:23,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50187 states. [2018-12-31 21:14:23,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50187 to 37051. [2018-12-31 21:14:23,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37051 states. [2018-12-31 21:14:23,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37051 states to 37051 states and 115149 transitions. [2018-12-31 21:14:23,659 INFO L78 Accepts]: Start accepts. Automaton has 37051 states and 115149 transitions. Word has length 83 [2018-12-31 21:14:23,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:14:23,660 INFO L480 AbstractCegarLoop]: Abstraction has 37051 states and 115149 transitions. [2018-12-31 21:14:23,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 21:14:23,660 INFO L276 IsEmpty]: Start isEmpty. Operand 37051 states and 115149 transitions. [2018-12-31 21:14:23,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-31 21:14:23,695 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:14:23,695 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] [2018-12-31 21:14:23,696 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:14:23,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:14:23,696 INFO L82 PathProgramCache]: Analyzing trace with hash -2090546424, now seen corresponding path program 1 times [2018-12-31 21:14:23,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:14:23,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:14:23,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:14:23,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:14:23,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:14:23,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:14:23,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:14:23,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:14:23,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 21:14:23,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 21:14:23,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 21:14:23,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:14:23,926 INFO L87 Difference]: Start difference. First operand 37051 states and 115149 transitions. Second operand 5 states. [2018-12-31 21:14:24,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:14:24,009 INFO L93 Difference]: Finished difference Result 5071 states and 13024 transitions. [2018-12-31 21:14:24,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 21:14:24,010 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2018-12-31 21:14:24,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:14:24,015 INFO L225 Difference]: With dead ends: 5071 [2018-12-31 21:14:24,016 INFO L226 Difference]: Without dead ends: 4539 [2018-12-31 21:14:24,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 21:14:24,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4539 states. [2018-12-31 21:14:24,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4539 to 4399. [2018-12-31 21:14:24,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4399 states. [2018-12-31 21:14:24,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4399 states to 4399 states and 11306 transitions. [2018-12-31 21:14:24,067 INFO L78 Accepts]: Start accepts. Automaton has 4399 states and 11306 transitions. Word has length 83 [2018-12-31 21:14:24,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:14:24,067 INFO L480 AbstractCegarLoop]: Abstraction has 4399 states and 11306 transitions. [2018-12-31 21:14:24,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 21:14:24,068 INFO L276 IsEmpty]: Start isEmpty. Operand 4399 states and 11306 transitions. [2018-12-31 21:14:24,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 21:14:24,073 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:14:24,073 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:14:24,073 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:14:24,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:14:24,073 INFO L82 PathProgramCache]: Analyzing trace with hash 473934761, now seen corresponding path program 1 times [2018-12-31 21:14:24,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:14:24,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:14:24,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:14:24,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:14:24,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:14:24,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:14:24,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:14:24,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:14:24,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 21:14:24,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 21:14:24,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 21:14:24,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 21:14:24,251 INFO L87 Difference]: Start difference. First operand 4399 states and 11306 transitions. Second operand 6 states. [2018-12-31 21:14:24,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:14:24,698 INFO L93 Difference]: Finished difference Result 4694 states and 11876 transitions. [2018-12-31 21:14:24,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 21:14:24,700 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-31 21:14:24,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:14:24,707 INFO L225 Difference]: With dead ends: 4694 [2018-12-31 21:14:24,707 INFO L226 Difference]: Without dead ends: 4647 [2018-12-31 21:14:24,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-12-31 21:14:24,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4647 states. [2018-12-31 21:14:24,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4647 to 4575. [2018-12-31 21:14:24,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4575 states. [2018-12-31 21:14:24,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4575 states to 4575 states and 11661 transitions. [2018-12-31 21:14:24,760 INFO L78 Accepts]: Start accepts. Automaton has 4575 states and 11661 transitions. Word has length 96 [2018-12-31 21:14:24,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:14:24,760 INFO L480 AbstractCegarLoop]: Abstraction has 4575 states and 11661 transitions. [2018-12-31 21:14:24,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 21:14:24,760 INFO L276 IsEmpty]: Start isEmpty. Operand 4575 states and 11661 transitions. [2018-12-31 21:14:24,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 21:14:24,766 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:14:24,766 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:14:24,766 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:14:24,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:14:24,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1097222121, now seen corresponding path program 2 times [2018-12-31 21:14:24,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:14:24,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:14:24,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:14:24,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:14:24,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:14:24,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:14:24,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:14:24,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:14:24,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 21:14:24,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 21:14:24,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 21:14:24,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 21:14:24,904 INFO L87 Difference]: Start difference. First operand 4575 states and 11661 transitions. Second operand 7 states. [2018-12-31 21:14:25,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:14:25,376 INFO L93 Difference]: Finished difference Result 4865 states and 12347 transitions. [2018-12-31 21:14:25,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 21:14:25,377 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-31 21:14:25,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:14:25,384 INFO L225 Difference]: With dead ends: 4865 [2018-12-31 21:14:25,384 INFO L226 Difference]: Without dead ends: 4865 [2018-12-31 21:14:25,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 21:14:25,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4865 states. [2018-12-31 21:14:25,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4865 to 4559. [2018-12-31 21:14:25,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4559 states. [2018-12-31 21:14:25,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4559 states to 4559 states and 11628 transitions. [2018-12-31 21:14:25,441 INFO L78 Accepts]: Start accepts. Automaton has 4559 states and 11628 transitions. Word has length 96 [2018-12-31 21:14:25,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:14:25,442 INFO L480 AbstractCegarLoop]: Abstraction has 4559 states and 11628 transitions. [2018-12-31 21:14:25,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 21:14:25,442 INFO L276 IsEmpty]: Start isEmpty. Operand 4559 states and 11628 transitions. [2018-12-31 21:14:25,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 21:14:25,447 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:14:25,447 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:14:25,448 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:14:25,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:14:25,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1443515784, now seen corresponding path program 1 times [2018-12-31 21:14:25,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:14:25,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:14:25,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:14:25,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 21:14:25,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:14:25,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:14:25,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:14:25,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:14:25,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 21:14:25,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 21:14:25,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 21:14:25,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:14:25,713 INFO L87 Difference]: Start difference. First operand 4559 states and 11628 transitions. Second operand 5 states. [2018-12-31 21:14:25,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:14:25,857 INFO L93 Difference]: Finished difference Result 4440 states and 11324 transitions. [2018-12-31 21:14:25,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 21:14:25,859 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-31 21:14:25,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:14:25,866 INFO L225 Difference]: With dead ends: 4440 [2018-12-31 21:14:25,866 INFO L226 Difference]: Without dead ends: 4440 [2018-12-31 21:14:25,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 21:14:25,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4440 states. [2018-12-31 21:14:25,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4440 to 4350. [2018-12-31 21:14:25,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4350 states. [2018-12-31 21:14:25,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4350 states to 4350 states and 11120 transitions. [2018-12-31 21:14:25,924 INFO L78 Accepts]: Start accepts. Automaton has 4350 states and 11120 transitions. Word has length 96 [2018-12-31 21:14:25,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:14:25,924 INFO L480 AbstractCegarLoop]: Abstraction has 4350 states and 11120 transitions. [2018-12-31 21:14:25,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 21:14:25,924 INFO L276 IsEmpty]: Start isEmpty. Operand 4350 states and 11120 transitions. [2018-12-31 21:14:25,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 21:14:25,931 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:14:25,931 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:14:25,931 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:14:25,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:14:25,932 INFO L82 PathProgramCache]: Analyzing trace with hash -928081568, now seen corresponding path program 1 times [2018-12-31 21:14:25,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:14:25,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:14:25,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:14:25,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:14:25,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:14:25,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:14:26,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:14:26,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:14:26,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 21:14:26,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 21:14:26,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 21:14:26,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:14:26,108 INFO L87 Difference]: Start difference. First operand 4350 states and 11120 transitions. Second operand 4 states. [2018-12-31 21:14:26,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:14:26,363 INFO L93 Difference]: Finished difference Result 4286 states and 10896 transitions. [2018-12-31 21:14:26,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 21:14:26,364 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2018-12-31 21:14:26,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:14:26,371 INFO L225 Difference]: With dead ends: 4286 [2018-12-31 21:14:26,371 INFO L226 Difference]: Without dead ends: 4286 [2018-12-31 21:14:26,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:14:26,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4286 states. [2018-12-31 21:14:26,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4286 to 3955. [2018-12-31 21:14:26,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3955 states. [2018-12-31 21:14:26,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3955 states to 3955 states and 10089 transitions. [2018-12-31 21:14:26,417 INFO L78 Accepts]: Start accepts. Automaton has 3955 states and 10089 transitions. Word has length 96 [2018-12-31 21:14:26,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:14:26,417 INFO L480 AbstractCegarLoop]: Abstraction has 3955 states and 10089 transitions. [2018-12-31 21:14:26,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 21:14:26,417 INFO L276 IsEmpty]: Start isEmpty. Operand 3955 states and 10089 transitions. [2018-12-31 21:14:26,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 21:14:26,422 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:14:26,422 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:14:26,422 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:14:26,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:14:26,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1073631423, now seen corresponding path program 1 times [2018-12-31 21:14:26,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:14:26,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:14:26,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:14:26,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:14:26,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:14:26,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:14:26,933 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 10 [2018-12-31 21:14:27,227 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 9 [2018-12-31 21:14:27,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:14:27,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:14:27,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 21:14:27,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 21:14:27,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 21:14:27,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-31 21:14:27,509 INFO L87 Difference]: Start difference. First operand 3955 states and 10089 transitions. Second operand 8 states. [2018-12-31 21:14:28,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:14:28,214 INFO L93 Difference]: Finished difference Result 4735 states and 11998 transitions. [2018-12-31 21:14:28,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 21:14:28,215 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2018-12-31 21:14:28,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:14:28,222 INFO L225 Difference]: With dead ends: 4735 [2018-12-31 21:14:28,222 INFO L226 Difference]: Without dead ends: 4703 [2018-12-31 21:14:28,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-31 21:14:28,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4703 states. [2018-12-31 21:14:28,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4703 to 4202. [2018-12-31 21:14:28,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4202 states. [2018-12-31 21:14:28,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4202 states to 4202 states and 10689 transitions. [2018-12-31 21:14:28,272 INFO L78 Accepts]: Start accepts. Automaton has 4202 states and 10689 transitions. Word has length 96 [2018-12-31 21:14:28,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:14:28,272 INFO L480 AbstractCegarLoop]: Abstraction has 4202 states and 10689 transitions. [2018-12-31 21:14:28,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 21:14:28,272 INFO L276 IsEmpty]: Start isEmpty. Operand 4202 states and 10689 transitions. [2018-12-31 21:14:28,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 21:14:28,277 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:14:28,277 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:14:28,277 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:14:28,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:14:28,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1976571392, now seen corresponding path program 1 times [2018-12-31 21:14:28,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:14:28,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:14:28,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:14:28,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:14:28,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:14:28,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:14:28,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:14:28,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:14:28,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 21:14:28,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 21:14:28,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 21:14:28,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-31 21:14:28,664 INFO L87 Difference]: Start difference. First operand 4202 states and 10689 transitions. Second operand 7 states. [2018-12-31 21:14:28,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:14:28,937 INFO L93 Difference]: Finished difference Result 4211 states and 10692 transitions. [2018-12-31 21:14:28,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 21:14:28,939 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-31 21:14:28,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:14:28,946 INFO L225 Difference]: With dead ends: 4211 [2018-12-31 21:14:28,946 INFO L226 Difference]: Without dead ends: 4211 [2018-12-31 21:14:28,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-31 21:14:28,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4211 states. [2018-12-31 21:14:28,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4211 to 4167. [2018-12-31 21:14:28,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4167 states. [2018-12-31 21:14:28,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4167 states to 4167 states and 10608 transitions. [2018-12-31 21:14:28,996 INFO L78 Accepts]: Start accepts. Automaton has 4167 states and 10608 transitions. Word has length 96 [2018-12-31 21:14:28,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:14:28,996 INFO L480 AbstractCegarLoop]: Abstraction has 4167 states and 10608 transitions. [2018-12-31 21:14:28,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 21:14:28,996 INFO L276 IsEmpty]: Start isEmpty. Operand 4167 states and 10608 transitions. [2018-12-31 21:14:29,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 21:14:29,001 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:14:29,001 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:14:29,001 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:14:29,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:14:29,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1403397184, now seen corresponding path program 1 times [2018-12-31 21:14:29,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:14:29,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:14:29,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:14:29,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:14:29,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:14:29,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:14:29,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:14:29,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:14:29,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 21:14:29,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 21:14:29,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 21:14:29,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:14:29,293 INFO L87 Difference]: Start difference. First operand 4167 states and 10608 transitions. Second operand 5 states. [2018-12-31 21:14:29,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:14:29,509 INFO L93 Difference]: Finished difference Result 4711 states and 11952 transitions. [2018-12-31 21:14:29,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 21:14:29,510 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-31 21:14:29,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:14:29,518 INFO L225 Difference]: With dead ends: 4711 [2018-12-31 21:14:29,518 INFO L226 Difference]: Without dead ends: 4679 [2018-12-31 21:14:29,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 21:14:29,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4679 states. [2018-12-31 21:14:29,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4679 to 3983. [2018-12-31 21:14:29,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3983 states. [2018-12-31 21:14:29,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3983 states to 3983 states and 10149 transitions. [2018-12-31 21:14:29,570 INFO L78 Accepts]: Start accepts. Automaton has 3983 states and 10149 transitions. Word has length 96 [2018-12-31 21:14:29,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:14:29,571 INFO L480 AbstractCegarLoop]: Abstraction has 3983 states and 10149 transitions. [2018-12-31 21:14:29,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 21:14:29,571 INFO L276 IsEmpty]: Start isEmpty. Operand 3983 states and 10149 transitions. [2018-12-31 21:14:29,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 21:14:29,576 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:14:29,576 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:14:29,576 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:14:29,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:14:29,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1646805631, now seen corresponding path program 1 times [2018-12-31 21:14:29,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:14:29,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:14:29,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:14:29,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:14:29,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:14:29,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:14:29,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:14:29,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:14:29,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-31 21:14:29,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 21:14:29,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 21:14:29,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-31 21:14:29,782 INFO L87 Difference]: Start difference. First operand 3983 states and 10149 transitions. Second operand 10 states. [2018-12-31 21:14:30,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:14:30,377 INFO L93 Difference]: Finished difference Result 6005 states and 15448 transitions. [2018-12-31 21:14:30,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 21:14:30,378 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2018-12-31 21:14:30,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:14:30,381 INFO L225 Difference]: With dead ends: 6005 [2018-12-31 21:14:30,382 INFO L226 Difference]: Without dead ends: 2036 [2018-12-31 21:14:30,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-12-31 21:14:30,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2036 states. [2018-12-31 21:14:30,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2036 to 2036. [2018-12-31 21:14:30,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2036 states. [2018-12-31 21:14:30,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2036 states to 2036 states and 5298 transitions. [2018-12-31 21:14:30,406 INFO L78 Accepts]: Start accepts. Automaton has 2036 states and 5298 transitions. Word has length 96 [2018-12-31 21:14:30,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:14:30,406 INFO L480 AbstractCegarLoop]: Abstraction has 2036 states and 5298 transitions. [2018-12-31 21:14:30,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 21:14:30,406 INFO L276 IsEmpty]: Start isEmpty. Operand 2036 states and 5298 transitions. [2018-12-31 21:14:30,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 21:14:30,409 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:14:30,409 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:14:30,409 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:14:30,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:14:30,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1343180800, now seen corresponding path program 2 times [2018-12-31 21:14:30,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:14:30,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:14:30,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:14:30,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:14:30,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:14:30,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:14:30,907 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 6 [2018-12-31 21:14:30,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:14:30,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:14:30,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 21:14:30,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 21:14:30,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 21:14:30,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:14:30,999 INFO L87 Difference]: Start difference. First operand 2036 states and 5298 transitions. Second operand 5 states. [2018-12-31 21:14:31,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:14:31,089 INFO L93 Difference]: Finished difference Result 2036 states and 5288 transitions. [2018-12-31 21:14:31,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 21:14:31,090 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-31 21:14:31,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:14:31,093 INFO L225 Difference]: With dead ends: 2036 [2018-12-31 21:14:31,093 INFO L226 Difference]: Without dead ends: 2036 [2018-12-31 21:14:31,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-31 21:14:31,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2036 states. [2018-12-31 21:14:31,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2036 to 1996. [2018-12-31 21:14:31,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1996 states. [2018-12-31 21:14:31,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1996 states to 1996 states and 5204 transitions. [2018-12-31 21:14:31,118 INFO L78 Accepts]: Start accepts. Automaton has 1996 states and 5204 transitions. Word has length 96 [2018-12-31 21:14:31,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:14:31,118 INFO L480 AbstractCegarLoop]: Abstraction has 1996 states and 5204 transitions. [2018-12-31 21:14:31,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 21:14:31,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1996 states and 5204 transitions. [2018-12-31 21:14:31,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 21:14:31,121 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:14:31,121 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:14:31,121 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:14:31,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:14:31,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1013415039, now seen corresponding path program 2 times [2018-12-31 21:14:31,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:14:31,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:14:31,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:14:31,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 21:14:31,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:14:31,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:14:31,347 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-31 21:14:31,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:14:31,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:14:31,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-31 21:14:31,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-31 21:14:31,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-31 21:14:31,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-31 21:14:31,443 INFO L87 Difference]: Start difference. First operand 1996 states and 5204 transitions. Second operand 12 states. [2018-12-31 21:14:32,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:14:32,232 INFO L93 Difference]: Finished difference Result 3810 states and 10026 transitions. [2018-12-31 21:14:32,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-31 21:14:32,233 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2018-12-31 21:14:32,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:14:32,237 INFO L225 Difference]: With dead ends: 3810 [2018-12-31 21:14:32,237 INFO L226 Difference]: Without dead ends: 2674 [2018-12-31 21:14:32,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-31 21:14:32,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2018-12-31 21:14:32,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 2512. [2018-12-31 21:14:32,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2512 states. [2018-12-31 21:14:32,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2512 states to 2512 states and 6424 transitions. [2018-12-31 21:14:32,268 INFO L78 Accepts]: Start accepts. Automaton has 2512 states and 6424 transitions. Word has length 96 [2018-12-31 21:14:32,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:14:32,269 INFO L480 AbstractCegarLoop]: Abstraction has 2512 states and 6424 transitions. [2018-12-31 21:14:32,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-31 21:14:32,269 INFO L276 IsEmpty]: Start isEmpty. Operand 2512 states and 6424 transitions. [2018-12-31 21:14:32,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 21:14:32,272 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:14:32,272 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:14:32,272 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:14:32,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:14:32,273 INFO L82 PathProgramCache]: Analyzing trace with hash -2137183355, now seen corresponding path program 3 times [2018-12-31 21:14:32,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:14:32,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:14:32,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:14:32,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 21:14:32,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:14:32,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 21:14:32,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 21:14:32,358 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 21:14:32,552 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-31 21:14:32,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 09:14:32 BasicIcfg [2018-12-31 21:14:32,554 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 21:14:32,555 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 21:14:32,555 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 21:14:32,555 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 21:14:32,557 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:13:34" (3/4) ... [2018-12-31 21:14:32,561 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 21:14:32,771 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 21:14:32,775 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 21:14:32,776 INFO L168 Benchmark]: Toolchain (without parser) took 60771.34 ms. Allocated memory was 1.0 GB in the beginning and 3.9 GB in the end (delta: 2.9 GB). Free memory was 954.0 MB in the beginning and 1.4 GB in the end (delta: -417.1 MB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2018-12-31 21:14:32,777 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 21:14:32,777 INFO L168 Benchmark]: CACSL2BoogieTranslator took 883.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -164.7 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. [2018-12-31 21:14:32,777 INFO L168 Benchmark]: Boogie Procedure Inliner took 102.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-31 21:14:32,778 INFO L168 Benchmark]: Boogie Preprocessor took 73.64 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 21:14:32,778 INFO L168 Benchmark]: RCFGBuilder took 1322.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.4 MB). Peak memory consumption was 45.4 MB. Max. memory is 11.5 GB. [2018-12-31 21:14:32,778 INFO L168 Benchmark]: TraceAbstraction took 58163.01 ms. Allocated memory was 1.2 GB in the beginning and 3.9 GB in the end (delta: 2.8 GB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -366.6 MB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. [2018-12-31 21:14:32,779 INFO L168 Benchmark]: Witness Printer took 220.01 ms. Allocated memory is still 3.9 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 56.7 MB). Peak memory consumption was 56.7 MB. Max. memory is 11.5 GB. [2018-12-31 21:14:32,783 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 883.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -164.7 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 102.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 73.64 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1322.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.4 MB). Peak memory consumption was 45.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 58163.01 ms. Allocated memory was 1.2 GB in the beginning and 3.9 GB in the end (delta: 2.8 GB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -366.6 MB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. * Witness Printer took 220.01 ms. Allocated memory is still 3.9 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 56.7 MB). Peak memory consumption was 56.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_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] [L680] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L681] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L682] -1 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L683] -1 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L684] -1 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L685] -1 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L686] -1 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L687] -1 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L688] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L689] -1 int *x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L690] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L691] -1 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L692] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L693] -1 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L695] -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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L697] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L698] -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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L699] -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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L765] -1 pthread_t t1105; 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L766] FCALL, FORK -1 pthread_create(&t1105, ((void *)0), P0, ((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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L767] -1 pthread_t t1106; 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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L768] FCALL, FORK -1 pthread_create(&t1106, ((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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L723] 0 x$w_buff1 = x$w_buff0 [L724] 0 x$w_buff0 = 2 [L725] 0 x$w_buff1_used = x$w_buff0_used [L726] 0 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) 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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L728] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L729] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L730] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L731] 0 x$r_buff0_thd2 = (_Bool)1 [L734] 0 y = 1 [L737] 0 __unbuffered_p1_EAX = y [L740] 0 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L743] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L703] 1 z = 1 [L706] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L743] 0 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L744] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L709] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L744] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L709] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=2, y=1, z=1] [L745] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=2, y=1, z=1] [L745] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L709] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)=2, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=2, y=1, z=1] [L709] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L710] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L746] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L710] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L746] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L747] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L747] 0 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L750] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L711] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L711] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L712] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L712] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L713] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L713] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L716] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L770] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L774] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L774] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L774] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L774] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L775] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L775] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L776] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L776] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L777] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L778] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L778] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L781] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L782] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L783] -1 x$flush_delayed = weak$$choice2 [L784] -1 x$mem_tmp = x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L785] EXPR -1 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L785] -1 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L786] EXPR -1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L786] -1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L787] EXPR -1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L787] -1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L788] EXPR -1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L788] -1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L789] EXPR -1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L789] -1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L790] EXPR -1 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L790] -1 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L791] EXPR -1 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L791] -1 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L792] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L793] EXPR -1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L793] -1 x = x$flush_delayed ? x$mem_tmp : x [L794] -1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 181 locations, 3 error locations. UNSAFE Result, 58.0s OverallTime, 32 OverallIterations, 1 TraceHistogramMax, 31.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9596 SDtfs, 10679 SDslu, 26072 SDs, 0 SdLazy, 13043 SolverSat, 627 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 387 GetRequests, 98 SyntacticMatches, 25 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 734 ImplicationChecksByTransitivity, 8.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37210occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 15.4s AutomataMinimizationTime, 31 MinimizatonAttempts, 190160 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 2557 NumberOfCodeBlocks, 2557 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2430 ConstructedInterpolants, 0 QuantifiedInterpolants, 492169 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...