./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/safe029_power.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/safe029_power.oepc_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 310137b68016bca6db925b36630c05d75ac56ea2 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 20:37:37,045 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 20:37:37,047 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 20:37:37,060 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 20:37:37,061 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 20:37:37,062 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 20:37:37,063 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 20:37:37,065 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 20:37:37,067 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 20:37:37,068 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 20:37:37,070 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 20:37:37,070 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 20:37:37,071 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 20:37:37,072 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 20:37:37,074 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 20:37:37,075 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 20:37:37,075 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 20:37:37,078 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 20:37:37,080 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 20:37:37,082 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 20:37:37,083 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 20:37:37,084 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 20:37:37,087 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 20:37:37,087 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 20:37:37,087 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 20:37:37,089 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 20:37:37,091 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 20:37:37,092 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 20:37:37,096 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 20:37:37,099 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 20:37:37,099 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 20:37:37,100 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 20:37:37,101 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 20:37:37,101 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 20:37:37,102 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 20:37:37,103 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 20:37:37,103 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 20:37:37,136 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 20:37:37,136 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 20:37:37,138 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 20:37:37,139 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 20:37:37,140 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 20:37:37,141 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 20:37:37,141 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 20:37:37,142 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 20:37:37,142 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 20:37:37,142 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 20:37:37,142 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 20:37:37,142 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 20:37:37,142 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 20:37:37,143 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 20:37:37,143 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 20:37:37,143 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 20:37:37,143 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 20:37:37,143 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 20:37:37,143 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 20:37:37,146 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 20:37:37,146 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 20:37:37,147 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 20:37:37,147 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 20:37:37,147 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 20:37:37,147 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 20:37:37,147 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 20:37:37,148 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 20:37:37,148 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 20:37:37,149 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 20:37:37,149 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 20:37:37,149 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 310137b68016bca6db925b36630c05d75ac56ea2 [2018-11-28 20:37:37,209 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 20:37:37,221 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 20:37:37,225 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 20:37:37,227 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 20:37:37,227 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 20:37:37,228 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/safe029_power.oepc_false-unreach-call.i [2018-11-28 20:37:37,286 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7032886a8/e88a0aae821a4d0eaf2ce3d0325ca282/FLAGd12dbab7b [2018-11-28 20:37:37,777 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 20:37:37,778 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/safe029_power.oepc_false-unreach-call.i [2018-11-28 20:37:37,802 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7032886a8/e88a0aae821a4d0eaf2ce3d0325ca282/FLAGd12dbab7b [2018-11-28 20:37:38,058 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7032886a8/e88a0aae821a4d0eaf2ce3d0325ca282 [2018-11-28 20:37:38,061 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 20:37:38,063 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 20:37:38,064 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 20:37:38,070 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 20:37:38,074 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 20:37:38,075 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:37:38" (1/1) ... [2018-11-28 20:37:38,078 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2de505c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:38, skipping insertion in model container [2018-11-28 20:37:38,078 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:37:38" (1/1) ... [2018-11-28 20:37:38,086 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 20:37:38,152 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 20:37:38,642 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 20:37:38,657 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 20:37:38,824 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 20:37:38,912 INFO L195 MainTranslator]: Completed translation [2018-11-28 20:37:38,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:38 WrapperNode [2018-11-28 20:37:38,913 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 20:37:38,914 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 20:37:38,914 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 20:37:38,914 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 20:37:38,922 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:38" (1/1) ... [2018-11-28 20:37:38,940 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:38" (1/1) ... [2018-11-28 20:37:38,981 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 20:37:38,982 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 20:37:38,982 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 20:37:38,982 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 20:37:38,992 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:38" (1/1) ... [2018-11-28 20:37:38,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:38" (1/1) ... [2018-11-28 20:37:38,998 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:38" (1/1) ... [2018-11-28 20:37:38,998 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:38" (1/1) ... [2018-11-28 20:37:39,011 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:38" (1/1) ... [2018-11-28 20:37:39,016 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:38" (1/1) ... [2018-11-28 20:37:39,019 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:38" (1/1) ... [2018-11-28 20:37:39,024 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 20:37:39,025 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 20:37:39,025 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 20:37:39,025 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 20:37:39,026 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 20:37:39,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 20:37:39,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 20:37:39,114 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-11-28 20:37:39,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 20:37:39,114 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-11-28 20:37:39,114 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-11-28 20:37:39,114 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-11-28 20:37:39,115 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-11-28 20:37:39,115 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-11-28 20:37:39,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 20:37:39,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 20:37:39,117 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-11-28 20:37:40,232 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 20:37:40,232 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 20:37:40,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:37:40 BoogieIcfgContainer [2018-11-28 20:37:40,234 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 20:37:40,235 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 20:37:40,235 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 20:37:40,238 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 20:37:40,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:37:38" (1/3) ... [2018-11-28 20:37:40,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5de95b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:37:40, skipping insertion in model container [2018-11-28 20:37:40,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:38" (2/3) ... [2018-11-28 20:37:40,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5de95b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:37:40, skipping insertion in model container [2018-11-28 20:37:40,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:37:40" (3/3) ... [2018-11-28 20:37:40,242 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.oepc_false-unreach-call.i [2018-11-28 20:37:40,284 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,284 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,285 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,285 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,286 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,286 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,286 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,286 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,287 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,287 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,287 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,287 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,288 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,288 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,288 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,288 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,289 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,289 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,289 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,289 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,289 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,290 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,290 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,290 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,290 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,291 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,291 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,291 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,291 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,292 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,292 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,292 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,292 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,292 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,293 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,293 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,293 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,293 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,294 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,294 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,294 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,294 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,295 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,295 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,295 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,295 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,296 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,296 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,296 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,296 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,297 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,297 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,297 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,297 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,297 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,298 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,298 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,298 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,298 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,299 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,299 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,299 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,299 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,300 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,300 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,300 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,300 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,301 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,301 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,301 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,301 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,301 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:40,331 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-11-28 20:37:40,332 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 20:37:40,341 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-28 20:37:40,362 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-28 20:37:40,391 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 20:37:40,392 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 20:37:40,392 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 20:37:40,392 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 20:37:40,392 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 20:37:40,392 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 20:37:40,392 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 20:37:40,393 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 20:37:40,393 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 20:37:40,407 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 140places, 178 transitions [2018-11-28 20:37:42,013 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25102 states. [2018-11-28 20:37:42,016 INFO L276 IsEmpty]: Start isEmpty. Operand 25102 states. [2018-11-28 20:37:42,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 20:37:42,023 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:37:42,024 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] [2018-11-28 20:37:42,026 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:37:42,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:37:42,034 INFO L82 PathProgramCache]: Analyzing trace with hash 2024635459, now seen corresponding path program 1 times [2018-11-28 20:37:42,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:37:42,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:37:42,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:37:42,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:37:42,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:37:42,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:37:42,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:37:42,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:37:42,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:37:42,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:37:42,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:37:42,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:37:42,467 INFO L87 Difference]: Start difference. First operand 25102 states. Second operand 4 states. [2018-11-28 20:37:43,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:37:43,899 INFO L93 Difference]: Finished difference Result 45394 states and 177648 transitions. [2018-11-28 20:37:43,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:37:43,901 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-11-28 20:37:43,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:37:44,287 INFO L225 Difference]: With dead ends: 45394 [2018-11-28 20:37:44,287 INFO L226 Difference]: Without dead ends: 40634 [2018-11-28 20:37:44,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:37:45,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40634 states. [2018-11-28 20:37:45,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40634 to 23668. [2018-11-28 20:37:45,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23668 states. [2018-11-28 20:37:46,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23668 states to 23668 states and 92565 transitions. [2018-11-28 20:37:46,139 INFO L78 Accepts]: Start accepts. Automaton has 23668 states and 92565 transitions. Word has length 31 [2018-11-28 20:37:46,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:37:46,140 INFO L480 AbstractCegarLoop]: Abstraction has 23668 states and 92565 transitions. [2018-11-28 20:37:46,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:37:46,140 INFO L276 IsEmpty]: Start isEmpty. Operand 23668 states and 92565 transitions. [2018-11-28 20:37:46,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-28 20:37:46,157 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:37:46,157 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] [2018-11-28 20:37:46,157 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:37:46,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:37:46,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1263924681, now seen corresponding path program 1 times [2018-11-28 20:37:46,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:37:46,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:37:46,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:37:46,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:37:46,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:37:46,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:37:46,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:37:46,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:37:46,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:37:46,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:37:46,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:37:46,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:37:46,369 INFO L87 Difference]: Start difference. First operand 23668 states and 92565 transitions. Second operand 5 states. [2018-11-28 20:37:49,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:37:49,976 INFO L93 Difference]: Finished difference Result 64836 states and 241395 transitions. [2018-11-28 20:37:49,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:37:49,981 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-11-28 20:37:49,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:37:50,333 INFO L225 Difference]: With dead ends: 64836 [2018-11-28 20:37:50,334 INFO L226 Difference]: Without dead ends: 64676 [2018-11-28 20:37:50,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:37:50,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64676 states. [2018-11-28 20:37:52,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64676 to 37148. [2018-11-28 20:37:52,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37148 states. [2018-11-28 20:37:52,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37148 states to 37148 states and 138310 transitions. [2018-11-28 20:37:52,260 INFO L78 Accepts]: Start accepts. Automaton has 37148 states and 138310 transitions. Word has length 42 [2018-11-28 20:37:52,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:37:52,261 INFO L480 AbstractCegarLoop]: Abstraction has 37148 states and 138310 transitions. [2018-11-28 20:37:52,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:37:52,261 INFO L276 IsEmpty]: Start isEmpty. Operand 37148 states and 138310 transitions. [2018-11-28 20:37:52,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-28 20:37:52,266 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:37:52,266 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:37:52,266 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:37:52,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:37:52,267 INFO L82 PathProgramCache]: Analyzing trace with hash 555727520, now seen corresponding path program 1 times [2018-11-28 20:37:52,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:37:52,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:37:52,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:37:52,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:37:52,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:37:52,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:37:52,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:37:52,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:37:52,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:37:52,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:37:52,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:37:52,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:37:52,390 INFO L87 Difference]: Start difference. First operand 37148 states and 138310 transitions. Second operand 4 states. [2018-11-28 20:37:52,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:37:52,497 INFO L93 Difference]: Finished difference Result 12370 states and 41203 transitions. [2018-11-28 20:37:52,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:37:52,497 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-11-28 20:37:52,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:37:52,536 INFO L225 Difference]: With dead ends: 12370 [2018-11-28 20:37:52,536 INFO L226 Difference]: Without dead ends: 11849 [2018-11-28 20:37:52,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:37:52,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11849 states. [2018-11-28 20:37:52,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11849 to 11849. [2018-11-28 20:37:52,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11849 states. [2018-11-28 20:37:52,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11849 states to 11849 states and 39648 transitions. [2018-11-28 20:37:52,820 INFO L78 Accepts]: Start accepts. Automaton has 11849 states and 39648 transitions. Word has length 43 [2018-11-28 20:37:52,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:37:52,820 INFO L480 AbstractCegarLoop]: Abstraction has 11849 states and 39648 transitions. [2018-11-28 20:37:52,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:37:52,821 INFO L276 IsEmpty]: Start isEmpty. Operand 11849 states and 39648 transitions. [2018-11-28 20:37:52,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-28 20:37:52,827 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:37:52,828 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] [2018-11-28 20:37:52,828 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:37:52,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:37:52,829 INFO L82 PathProgramCache]: Analyzing trace with hash -2022717967, now seen corresponding path program 1 times [2018-11-28 20:37:52,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:37:52,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:37:52,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:37:52,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:37:52,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:37:52,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:37:52,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:37:52,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:37:52,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:37:52,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:37:52,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:37:52,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:37:52,987 INFO L87 Difference]: Start difference. First operand 11849 states and 39648 transitions. Second operand 4 states. [2018-11-28 20:37:53,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:37:53,550 INFO L93 Difference]: Finished difference Result 17025 states and 55723 transitions. [2018-11-28 20:37:53,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:37:53,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-11-28 20:37:53,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:37:53,586 INFO L225 Difference]: With dead ends: 17025 [2018-11-28 20:37:53,586 INFO L226 Difference]: Without dead ends: 17025 [2018-11-28 20:37:53,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:37:53,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17025 states. [2018-11-28 20:37:53,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17025 to 12885. [2018-11-28 20:37:53,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12885 states. [2018-11-28 20:37:53,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12885 states to 12885 states and 42750 transitions. [2018-11-28 20:37:53,968 INFO L78 Accepts]: Start accepts. Automaton has 12885 states and 42750 transitions. Word has length 56 [2018-11-28 20:37:53,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:37:53,969 INFO L480 AbstractCegarLoop]: Abstraction has 12885 states and 42750 transitions. [2018-11-28 20:37:53,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:37:53,969 INFO L276 IsEmpty]: Start isEmpty. Operand 12885 states and 42750 transitions. [2018-11-28 20:37:53,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-28 20:37:53,977 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:37:53,977 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] [2018-11-28 20:37:53,978 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:37:53,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:37:53,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1977003375, now seen corresponding path program 1 times [2018-11-28 20:37:53,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:37:53,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:37:53,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:37:53,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:37:53,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:37:53,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:37:54,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:37:54,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:37:54,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:37:54,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:37:54,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:37:54,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:37:54,218 INFO L87 Difference]: Start difference. First operand 12885 states and 42750 transitions. Second operand 4 states. [2018-11-28 20:37:55,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:37:55,628 INFO L93 Difference]: Finished difference Result 18380 states and 60007 transitions. [2018-11-28 20:37:55,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:37:55,630 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-11-28 20:37:55,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:37:55,666 INFO L225 Difference]: With dead ends: 18380 [2018-11-28 20:37:55,667 INFO L226 Difference]: Without dead ends: 18380 [2018-11-28 20:37:55,667 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-11-28 20:37:55,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18380 states. [2018-11-28 20:37:55,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18380 to 16341. [2018-11-28 20:37:55,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16341 states. [2018-11-28 20:37:56,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16341 states to 16341 states and 53832 transitions. [2018-11-28 20:37:56,011 INFO L78 Accepts]: Start accepts. Automaton has 16341 states and 53832 transitions. Word has length 56 [2018-11-28 20:37:56,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:37:56,012 INFO L480 AbstractCegarLoop]: Abstraction has 16341 states and 53832 transitions. [2018-11-28 20:37:56,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:37:56,012 INFO L276 IsEmpty]: Start isEmpty. Operand 16341 states and 53832 transitions. [2018-11-28 20:37:56,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-28 20:37:56,021 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:37:56,021 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] [2018-11-28 20:37:56,021 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:37:56,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:37:56,022 INFO L82 PathProgramCache]: Analyzing trace with hash -964654224, now seen corresponding path program 1 times [2018-11-28 20:37:56,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:37:56,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:37:56,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:37:56,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:37:56,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:37:56,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:37:56,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:37:56,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:37:56,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:37:56,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:37:56,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:37:56,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:37:56,253 INFO L87 Difference]: Start difference. First operand 16341 states and 53832 transitions. Second operand 6 states. [2018-11-28 20:37:56,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:37:56,966 INFO L93 Difference]: Finished difference Result 17857 states and 58003 transitions. [2018-11-28 20:37:56,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:37:56,967 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-11-28 20:37:56,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:37:57,000 INFO L225 Difference]: With dead ends: 17857 [2018-11-28 20:37:57,001 INFO L226 Difference]: Without dead ends: 17857 [2018-11-28 20:37:57,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:37:57,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17857 states. [2018-11-28 20:37:57,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17857 to 16903. [2018-11-28 20:37:57,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16903 states. [2018-11-28 20:37:57,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16903 states to 16903 states and 55361 transitions. [2018-11-28 20:37:57,299 INFO L78 Accepts]: Start accepts. Automaton has 16903 states and 55361 transitions. Word has length 56 [2018-11-28 20:37:57,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:37:57,299 INFO L480 AbstractCegarLoop]: Abstraction has 16903 states and 55361 transitions. [2018-11-28 20:37:57,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:37:57,299 INFO L276 IsEmpty]: Start isEmpty. Operand 16903 states and 55361 transitions. [2018-11-28 20:37:57,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-28 20:37:57,309 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:37:57,309 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] [2018-11-28 20:37:57,310 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:37:57,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:37:57,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1258057231, now seen corresponding path program 1 times [2018-11-28 20:37:57,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:37:57,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:37:57,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:37:57,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:37:57,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:37:57,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:37:57,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:37:57,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:37:57,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:37:57,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:37:57,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:37:57,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:37:57,475 INFO L87 Difference]: Start difference. First operand 16903 states and 55361 transitions. Second operand 6 states. [2018-11-28 20:37:58,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:37:58,540 INFO L93 Difference]: Finished difference Result 23475 states and 75946 transitions. [2018-11-28 20:37:58,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 20:37:58,541 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-11-28 20:37:58,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:37:58,588 INFO L225 Difference]: With dead ends: 23475 [2018-11-28 20:37:58,589 INFO L226 Difference]: Without dead ends: 23443 [2018-11-28 20:37:58,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-11-28 20:37:58,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23443 states. [2018-11-28 20:37:59,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23443 to 18807. [2018-11-28 20:37:59,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18807 states. [2018-11-28 20:37:59,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18807 states to 18807 states and 61305 transitions. [2018-11-28 20:37:59,329 INFO L78 Accepts]: Start accepts. Automaton has 18807 states and 61305 transitions. Word has length 56 [2018-11-28 20:37:59,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:37:59,329 INFO L480 AbstractCegarLoop]: Abstraction has 18807 states and 61305 transitions. [2018-11-28 20:37:59,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:37:59,330 INFO L276 IsEmpty]: Start isEmpty. Operand 18807 states and 61305 transitions. [2018-11-28 20:37:59,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-28 20:37:59,365 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:37:59,365 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] [2018-11-28 20:37:59,365 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:37:59,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:37:59,366 INFO L82 PathProgramCache]: Analyzing trace with hash -2076609247, now seen corresponding path program 1 times [2018-11-28 20:37:59,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:37:59,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:37:59,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:37:59,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:37:59,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:37:59,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:37:59,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:37:59,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:37:59,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:37:59,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:37:59,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:37:59,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:37:59,554 INFO L87 Difference]: Start difference. First operand 18807 states and 61305 transitions. Second operand 7 states. [2018-11-28 20:38:00,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:00,526 INFO L93 Difference]: Finished difference Result 24535 states and 79153 transitions. [2018-11-28 20:38:00,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 20:38:00,530 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2018-11-28 20:38:00,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:00,579 INFO L225 Difference]: With dead ends: 24535 [2018-11-28 20:38:00,579 INFO L226 Difference]: Without dead ends: 24471 [2018-11-28 20:38:00,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-11-28 20:38:00,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24471 states. [2018-11-28 20:38:00,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24471 to 20899. [2018-11-28 20:38:00,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20899 states. [2018-11-28 20:38:00,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20899 states to 20899 states and 67710 transitions. [2018-11-28 20:38:00,911 INFO L78 Accepts]: Start accepts. Automaton has 20899 states and 67710 transitions. Word has length 70 [2018-11-28 20:38:00,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:00,912 INFO L480 AbstractCegarLoop]: Abstraction has 20899 states and 67710 transitions. [2018-11-28 20:38:00,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:38:00,912 INFO L276 IsEmpty]: Start isEmpty. Operand 20899 states and 67710 transitions. [2018-11-28 20:38:00,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-28 20:38:00,943 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:00,943 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:38:00,944 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:00,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:00,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1643744653, now seen corresponding path program 1 times [2018-11-28 20:38:00,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:00,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:00,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:00,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:00,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:00,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:01,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:38:01,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:01,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:38:01,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:38:01,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:38:01,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:38:01,047 INFO L87 Difference]: Start difference. First operand 20899 states and 67710 transitions. Second operand 3 states. [2018-11-28 20:38:01,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:01,274 INFO L93 Difference]: Finished difference Result 24947 states and 79522 transitions. [2018-11-28 20:38:01,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:38:01,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2018-11-28 20:38:01,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:01,322 INFO L225 Difference]: With dead ends: 24947 [2018-11-28 20:38:01,323 INFO L226 Difference]: Without dead ends: 24947 [2018-11-28 20:38:01,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:38:01,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24947 states. [2018-11-28 20:38:01,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24947 to 22467. [2018-11-28 20:38:01,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22467 states. [2018-11-28 20:38:01,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22467 states to 22467 states and 72190 transitions. [2018-11-28 20:38:01,725 INFO L78 Accepts]: Start accepts. Automaton has 22467 states and 72190 transitions. Word has length 72 [2018-11-28 20:38:01,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:01,725 INFO L480 AbstractCegarLoop]: Abstraction has 22467 states and 72190 transitions. [2018-11-28 20:38:01,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:38:01,725 INFO L276 IsEmpty]: Start isEmpty. Operand 22467 states and 72190 transitions. [2018-11-28 20:38:01,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-28 20:38:01,755 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:01,756 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] [2018-11-28 20:38:01,756 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:01,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:01,756 INFO L82 PathProgramCache]: Analyzing trace with hash -671189007, now seen corresponding path program 1 times [2018-11-28 20:38:01,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:01,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:01,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:01,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:01,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:01,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:02,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:38:02,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:02,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:38:02,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:38:02,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:38:02,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:38:02,028 INFO L87 Difference]: Start difference. First operand 22467 states and 72190 transitions. Second operand 4 states. [2018-11-28 20:38:02,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:02,829 INFO L93 Difference]: Finished difference Result 34667 states and 110116 transitions. [2018-11-28 20:38:02,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:38:02,830 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2018-11-28 20:38:02,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:02,898 INFO L225 Difference]: With dead ends: 34667 [2018-11-28 20:38:02,898 INFO L226 Difference]: Without dead ends: 34471 [2018-11-28 20:38:02,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:38:02,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34471 states. [2018-11-28 20:38:03,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34471 to 29099. [2018-11-28 20:38:03,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29099 states. [2018-11-28 20:38:03,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29099 states to 29099 states and 93336 transitions. [2018-11-28 20:38:03,480 INFO L78 Accepts]: Start accepts. Automaton has 29099 states and 93336 transitions. Word has length 76 [2018-11-28 20:38:03,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:03,481 INFO L480 AbstractCegarLoop]: Abstraction has 29099 states and 93336 transitions. [2018-11-28 20:38:03,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:38:03,481 INFO L276 IsEmpty]: Start isEmpty. Operand 29099 states and 93336 transitions. [2018-11-28 20:38:03,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-28 20:38:03,525 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:03,525 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:38:03,525 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:03,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:03,526 INFO L82 PathProgramCache]: Analyzing trace with hash 573575474, now seen corresponding path program 1 times [2018-11-28 20:38:03,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:03,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:03,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:03,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:03,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:03,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:04,672 WARN L180 SmtUtils]: Spent 731.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 16 [2018-11-28 20:38:04,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:38:04,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:04,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:38:04,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:38:04,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:38:04,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:38:04,695 INFO L87 Difference]: Start difference. First operand 29099 states and 93336 transitions. Second operand 6 states. [2018-11-28 20:38:05,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:05,805 INFO L93 Difference]: Finished difference Result 52152 states and 164833 transitions. [2018-11-28 20:38:05,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 20:38:05,806 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2018-11-28 20:38:05,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:05,899 INFO L225 Difference]: With dead ends: 52152 [2018-11-28 20:38:05,899 INFO L226 Difference]: Without dead ends: 51912 [2018-11-28 20:38:05,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-11-28 20:38:05,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51912 states. [2018-11-28 20:38:06,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51912 to 43712. [2018-11-28 20:38:06,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43712 states. [2018-11-28 20:38:06,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43712 states to 43712 states and 140003 transitions. [2018-11-28 20:38:06,584 INFO L78 Accepts]: Start accepts. Automaton has 43712 states and 140003 transitions. Word has length 76 [2018-11-28 20:38:06,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:06,584 INFO L480 AbstractCegarLoop]: Abstraction has 43712 states and 140003 transitions. [2018-11-28 20:38:06,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:38:06,584 INFO L276 IsEmpty]: Start isEmpty. Operand 43712 states and 140003 transitions. [2018-11-28 20:38:06,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-28 20:38:06,628 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:06,629 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:38:06,629 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:06,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:06,629 INFO L82 PathProgramCache]: Analyzing trace with hash -270896397, now seen corresponding path program 1 times [2018-11-28 20:38:06,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:06,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:06,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:06,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:06,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:06,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:06,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:38:06,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:06,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:38:06,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:38:06,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:38:06,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:38:06,808 INFO L87 Difference]: Start difference. First operand 43712 states and 140003 transitions. Second operand 5 states. [2018-11-28 20:38:06,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:06,964 INFO L93 Difference]: Finished difference Result 5456 states and 14431 transitions. [2018-11-28 20:38:06,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 20:38:06,964 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2018-11-28 20:38:06,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:06,972 INFO L225 Difference]: With dead ends: 5456 [2018-11-28 20:38:06,972 INFO L226 Difference]: Without dead ends: 4832 [2018-11-28 20:38:06,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:38:06,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4832 states. [2018-11-28 20:38:07,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4832 to 4684. [2018-11-28 20:38:07,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4684 states. [2018-11-28 20:38:07,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4684 states to 4684 states and 12409 transitions. [2018-11-28 20:38:07,042 INFO L78 Accepts]: Start accepts. Automaton has 4684 states and 12409 transitions. Word has length 76 [2018-11-28 20:38:07,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:07,042 INFO L480 AbstractCegarLoop]: Abstraction has 4684 states and 12409 transitions. [2018-11-28 20:38:07,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:38:07,043 INFO L276 IsEmpty]: Start isEmpty. Operand 4684 states and 12409 transitions. [2018-11-28 20:38:07,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-28 20:38:07,050 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:07,050 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] [2018-11-28 20:38:07,050 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:07,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:07,051 INFO L82 PathProgramCache]: Analyzing trace with hash 127044203, now seen corresponding path program 1 times [2018-11-28 20:38:07,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:07,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:07,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:07,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:07,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:07,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:07,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:38:07,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:07,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:38:07,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:38:07,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:38:07,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:38:07,215 INFO L87 Difference]: Start difference. First operand 4684 states and 12409 transitions. Second operand 5 states. [2018-11-28 20:38:07,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:07,483 INFO L93 Difference]: Finished difference Result 5468 states and 14247 transitions. [2018-11-28 20:38:07,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:38:07,484 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2018-11-28 20:38:07,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:07,492 INFO L225 Difference]: With dead ends: 5468 [2018-11-28 20:38:07,492 INFO L226 Difference]: Without dead ends: 5440 [2018-11-28 20:38:07,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:38:07,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5440 states. [2018-11-28 20:38:07,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5440 to 5316. [2018-11-28 20:38:07,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5316 states. [2018-11-28 20:38:07,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5316 states to 5316 states and 13901 transitions. [2018-11-28 20:38:07,558 INFO L78 Accepts]: Start accepts. Automaton has 5316 states and 13901 transitions. Word has length 89 [2018-11-28 20:38:07,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:07,558 INFO L480 AbstractCegarLoop]: Abstraction has 5316 states and 13901 transitions. [2018-11-28 20:38:07,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:38:07,558 INFO L276 IsEmpty]: Start isEmpty. Operand 5316 states and 13901 transitions. [2018-11-28 20:38:07,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-28 20:38:07,565 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:07,565 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] [2018-11-28 20:38:07,565 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:07,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:07,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1765089868, now seen corresponding path program 1 times [2018-11-28 20:38:07,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:07,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:07,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:07,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:07,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:07,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:07,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:38:07,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:07,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:38:07,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:38:07,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:38:07,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:38:07,709 INFO L87 Difference]: Start difference. First operand 5316 states and 13901 transitions. Second operand 3 states. [2018-11-28 20:38:07,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:07,886 INFO L93 Difference]: Finished difference Result 5440 states and 14174 transitions. [2018-11-28 20:38:07,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:38:07,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2018-11-28 20:38:07,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:07,895 INFO L225 Difference]: With dead ends: 5440 [2018-11-28 20:38:07,895 INFO L226 Difference]: Without dead ends: 5440 [2018-11-28 20:38:07,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:38:07,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5440 states. [2018-11-28 20:38:07,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5440 to 5384. [2018-11-28 20:38:07,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5384 states. [2018-11-28 20:38:07,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5384 states to 5384 states and 14051 transitions. [2018-11-28 20:38:07,951 INFO L78 Accepts]: Start accepts. Automaton has 5384 states and 14051 transitions. Word has length 89 [2018-11-28 20:38:07,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:07,951 INFO L480 AbstractCegarLoop]: Abstraction has 5384 states and 14051 transitions. [2018-11-28 20:38:07,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:38:07,951 INFO L276 IsEmpty]: Start isEmpty. Operand 5384 states and 14051 transitions. [2018-11-28 20:38:07,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 20:38:07,959 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:07,959 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:38:07,960 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:07,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:07,960 INFO L82 PathProgramCache]: Analyzing trace with hash -602105678, now seen corresponding path program 1 times [2018-11-28 20:38:07,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:07,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:07,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:07,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:07,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:07,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:08,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:38:08,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:08,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:38:08,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:38:08,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:38:08,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:38:08,131 INFO L87 Difference]: Start difference. First operand 5384 states and 14051 transitions. Second operand 5 states. [2018-11-28 20:38:08,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:08,524 INFO L93 Difference]: Finished difference Result 5683 states and 14775 transitions. [2018-11-28 20:38:08,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:38:08,525 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-11-28 20:38:08,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:08,534 INFO L225 Difference]: With dead ends: 5683 [2018-11-28 20:38:08,534 INFO L226 Difference]: Without dead ends: 5683 [2018-11-28 20:38:08,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:38:08,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5683 states. [2018-11-28 20:38:08,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5683 to 5398. [2018-11-28 20:38:08,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5398 states. [2018-11-28 20:38:08,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5398 states to 5398 states and 14084 transitions. [2018-11-28 20:38:08,600 INFO L78 Accepts]: Start accepts. Automaton has 5398 states and 14084 transitions. Word has length 91 [2018-11-28 20:38:08,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:08,600 INFO L480 AbstractCegarLoop]: Abstraction has 5398 states and 14084 transitions. [2018-11-28 20:38:08,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:38:08,600 INFO L276 IsEmpty]: Start isEmpty. Operand 5398 states and 14084 transitions. [2018-11-28 20:38:08,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 20:38:08,606 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:08,606 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:38:08,607 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:08,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:08,607 INFO L82 PathProgramCache]: Analyzing trace with hash 531084915, now seen corresponding path program 1 times [2018-11-28 20:38:08,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:08,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:08,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:08,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:08,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:08,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:08,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:38:08,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:08,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:38:08,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:38:08,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:38:08,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:38:08,749 INFO L87 Difference]: Start difference. First operand 5398 states and 14084 transitions. Second operand 4 states. [2018-11-28 20:38:09,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:09,161 INFO L93 Difference]: Finished difference Result 11568 states and 30967 transitions. [2018-11-28 20:38:09,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:38:09,162 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-11-28 20:38:09,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:09,180 INFO L225 Difference]: With dead ends: 11568 [2018-11-28 20:38:09,180 INFO L226 Difference]: Without dead ends: 11519 [2018-11-28 20:38:09,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:38:09,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11519 states. [2018-11-28 20:38:09,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11519 to 5140. [2018-11-28 20:38:09,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5140 states. [2018-11-28 20:38:09,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5140 states to 5140 states and 13373 transitions. [2018-11-28 20:38:09,290 INFO L78 Accepts]: Start accepts. Automaton has 5140 states and 13373 transitions. Word has length 91 [2018-11-28 20:38:09,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:09,290 INFO L480 AbstractCegarLoop]: Abstraction has 5140 states and 13373 transitions. [2018-11-28 20:38:09,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:38:09,291 INFO L276 IsEmpty]: Start isEmpty. Operand 5140 states and 13373 transitions. [2018-11-28 20:38:09,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 20:38:09,297 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:09,297 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:38:09,297 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:09,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:09,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1618352203, now seen corresponding path program 1 times [2018-11-28 20:38:09,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:09,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:09,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:09,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:09,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:09,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:09,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:38:09,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:09,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:38:09,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:38:09,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:38:09,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:38:09,475 INFO L87 Difference]: Start difference. First operand 5140 states and 13373 transitions. Second operand 6 states. [2018-11-28 20:38:09,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:09,782 INFO L93 Difference]: Finished difference Result 6850 states and 17496 transitions. [2018-11-28 20:38:09,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:38:09,783 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-11-28 20:38:09,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:09,793 INFO L225 Difference]: With dead ends: 6850 [2018-11-28 20:38:09,793 INFO L226 Difference]: Without dead ends: 6818 [2018-11-28 20:38:09,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:38:09,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6818 states. [2018-11-28 20:38:09,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6818 to 5615. [2018-11-28 20:38:09,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5615 states. [2018-11-28 20:38:09,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5615 states to 5615 states and 14463 transitions. [2018-11-28 20:38:09,929 INFO L78 Accepts]: Start accepts. Automaton has 5615 states and 14463 transitions. Word has length 91 [2018-11-28 20:38:09,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:09,929 INFO L480 AbstractCegarLoop]: Abstraction has 5615 states and 14463 transitions. [2018-11-28 20:38:09,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:38:09,930 INFO L276 IsEmpty]: Start isEmpty. Operand 5615 states and 14463 transitions. [2018-11-28 20:38:09,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 20:38:09,936 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:09,936 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:38:09,938 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:09,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:09,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1901502667, now seen corresponding path program 1 times [2018-11-28 20:38:09,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:09,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:09,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:09,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:09,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:09,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:10,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:38:10,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:10,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:38:10,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:38:10,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:38:10,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:38:10,423 INFO L87 Difference]: Start difference. First operand 5615 states and 14463 transitions. Second operand 7 states. [2018-11-28 20:38:11,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:11,041 INFO L93 Difference]: Finished difference Result 11651 states and 30335 transitions. [2018-11-28 20:38:11,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 20:38:11,042 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-11-28 20:38:11,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:11,059 INFO L225 Difference]: With dead ends: 11651 [2018-11-28 20:38:11,059 INFO L226 Difference]: Without dead ends: 11651 [2018-11-28 20:38:11,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-11-28 20:38:11,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11651 states. [2018-11-28 20:38:11,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11651 to 6113. [2018-11-28 20:38:11,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6113 states. [2018-11-28 20:38:11,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6113 states to 6113 states and 15768 transitions. [2018-11-28 20:38:11,172 INFO L78 Accepts]: Start accepts. Automaton has 6113 states and 15768 transitions. Word has length 91 [2018-11-28 20:38:11,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:11,172 INFO L480 AbstractCegarLoop]: Abstraction has 6113 states and 15768 transitions. [2018-11-28 20:38:11,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:38:11,172 INFO L276 IsEmpty]: Start isEmpty. Operand 6113 states and 15768 transitions. [2018-11-28 20:38:11,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 20:38:11,180 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:11,180 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:38:11,180 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:11,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:11,180 INFO L82 PathProgramCache]: Analyzing trace with hash -656738186, now seen corresponding path program 1 times [2018-11-28 20:38:11,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:11,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:11,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:11,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:11,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:11,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:11,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:38:11,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:11,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:38:11,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:38:11,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:38:11,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:38:11,359 INFO L87 Difference]: Start difference. First operand 6113 states and 15768 transitions. Second operand 5 states. [2018-11-28 20:38:11,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:11,419 INFO L93 Difference]: Finished difference Result 9700 states and 25509 transitions. [2018-11-28 20:38:11,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:38:11,420 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-11-28 20:38:11,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:11,433 INFO L225 Difference]: With dead ends: 9700 [2018-11-28 20:38:11,433 INFO L226 Difference]: Without dead ends: 9700 [2018-11-28 20:38:11,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:38:11,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9700 states. [2018-11-28 20:38:11,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9700 to 5539. [2018-11-28 20:38:11,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5539 states. [2018-11-28 20:38:11,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5539 states to 5539 states and 14328 transitions. [2018-11-28 20:38:11,512 INFO L78 Accepts]: Start accepts. Automaton has 5539 states and 14328 transitions. Word has length 91 [2018-11-28 20:38:11,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:11,513 INFO L480 AbstractCegarLoop]: Abstraction has 5539 states and 14328 transitions. [2018-11-28 20:38:11,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:38:11,513 INFO L276 IsEmpty]: Start isEmpty. Operand 5539 states and 14328 transitions. [2018-11-28 20:38:11,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 20:38:11,519 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:11,519 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:38:11,520 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:11,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:11,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1702568823, now seen corresponding path program 1 times [2018-11-28 20:38:11,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:11,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:11,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:11,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:11,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:11,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:11,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:38:11,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:11,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:38:11,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:38:11,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:38:11,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:38:11,855 INFO L87 Difference]: Start difference. First operand 5539 states and 14328 transitions. Second operand 6 states. [2018-11-28 20:38:11,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:11,958 INFO L93 Difference]: Finished difference Result 8960 states and 23608 transitions. [2018-11-28 20:38:11,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 20:38:11,959 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-11-28 20:38:11,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:11,972 INFO L225 Difference]: With dead ends: 8960 [2018-11-28 20:38:11,972 INFO L226 Difference]: Without dead ends: 8960 [2018-11-28 20:38:11,973 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-11-28 20:38:11,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8960 states. [2018-11-28 20:38:12,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8960 to 5227. [2018-11-28 20:38:12,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5227 states. [2018-11-28 20:38:12,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5227 states to 5227 states and 13455 transitions. [2018-11-28 20:38:12,054 INFO L78 Accepts]: Start accepts. Automaton has 5227 states and 13455 transitions. Word has length 91 [2018-11-28 20:38:12,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:12,054 INFO L480 AbstractCegarLoop]: Abstraction has 5227 states and 13455 transitions. [2018-11-28 20:38:12,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:38:12,055 INFO L276 IsEmpty]: Start isEmpty. Operand 5227 states and 13455 transitions. [2018-11-28 20:38:12,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 20:38:12,060 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:12,061 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:38:12,061 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:12,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:12,061 INFO L82 PathProgramCache]: Analyzing trace with hash -2111682057, now seen corresponding path program 1 times [2018-11-28 20:38:12,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:12,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:12,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:12,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:12,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:12,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:12,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:38:12,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:12,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:38:12,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:38:12,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:38:12,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:38:12,273 INFO L87 Difference]: Start difference. First operand 5227 states and 13455 transitions. Second operand 6 states. [2018-11-28 20:38:12,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:12,493 INFO L93 Difference]: Finished difference Result 4523 states and 11391 transitions. [2018-11-28 20:38:12,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:38:12,495 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-11-28 20:38:12,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:12,502 INFO L225 Difference]: With dead ends: 4523 [2018-11-28 20:38:12,502 INFO L226 Difference]: Without dead ends: 4523 [2018-11-28 20:38:12,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:38:12,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4523 states. [2018-11-28 20:38:12,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4523 to 3659. [2018-11-28 20:38:12,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3659 states. [2018-11-28 20:38:12,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3659 states to 3659 states and 9437 transitions. [2018-11-28 20:38:12,547 INFO L78 Accepts]: Start accepts. Automaton has 3659 states and 9437 transitions. Word has length 91 [2018-11-28 20:38:12,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:12,547 INFO L480 AbstractCegarLoop]: Abstraction has 3659 states and 9437 transitions. [2018-11-28 20:38:12,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:38:12,547 INFO L276 IsEmpty]: Start isEmpty. Operand 3659 states and 9437 transitions. [2018-11-28 20:38:12,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 20:38:12,552 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:12,552 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:38:12,552 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:12,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:12,553 INFO L82 PathProgramCache]: Analyzing trace with hash -879974516, now seen corresponding path program 1 times [2018-11-28 20:38:12,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:12,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:12,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:12,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:12,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:12,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:12,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:38:12,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:12,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 20:38:12,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 20:38:12,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 20:38:12,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:38:12,707 INFO L87 Difference]: Start difference. First operand 3659 states and 9437 transitions. Second operand 8 states. [2018-11-28 20:38:13,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:13,273 INFO L93 Difference]: Finished difference Result 5920 states and 14721 transitions. [2018-11-28 20:38:13,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 20:38:13,274 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2018-11-28 20:38:13,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:13,283 INFO L225 Difference]: With dead ends: 5920 [2018-11-28 20:38:13,283 INFO L226 Difference]: Without dead ends: 5888 [2018-11-28 20:38:13,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-11-28 20:38:13,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5888 states. [2018-11-28 20:38:13,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5888 to 4271. [2018-11-28 20:38:13,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4271 states. [2018-11-28 20:38:13,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4271 states to 4271 states and 10898 transitions. [2018-11-28 20:38:13,341 INFO L78 Accepts]: Start accepts. Automaton has 4271 states and 10898 transitions. Word has length 93 [2018-11-28 20:38:13,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:13,341 INFO L480 AbstractCegarLoop]: Abstraction has 4271 states and 10898 transitions. [2018-11-28 20:38:13,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 20:38:13,342 INFO L276 IsEmpty]: Start isEmpty. Operand 4271 states and 10898 transitions. [2018-11-28 20:38:13,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 20:38:13,346 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:13,347 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:38:13,347 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:13,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:13,347 INFO L82 PathProgramCache]: Analyzing trace with hash 364789965, now seen corresponding path program 1 times [2018-11-28 20:38:13,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:13,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:13,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:13,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:13,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:13,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:13,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:38:13,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:13,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:38:13,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:38:13,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:38:13,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:38:13,601 INFO L87 Difference]: Start difference. First operand 4271 states and 10898 transitions. Second operand 7 states. [2018-11-28 20:38:13,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:13,789 INFO L93 Difference]: Finished difference Result 3981 states and 10019 transitions. [2018-11-28 20:38:13,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 20:38:13,790 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-11-28 20:38:13,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:13,795 INFO L225 Difference]: With dead ends: 3981 [2018-11-28 20:38:13,796 INFO L226 Difference]: Without dead ends: 3981 [2018-11-28 20:38:13,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-28 20:38:13,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3981 states. [2018-11-28 20:38:13,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3981 to 3690. [2018-11-28 20:38:13,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3690 states. [2018-11-28 20:38:13,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3690 states to 3690 states and 9463 transitions. [2018-11-28 20:38:13,838 INFO L78 Accepts]: Start accepts. Automaton has 3690 states and 9463 transitions. Word has length 93 [2018-11-28 20:38:13,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:13,838 INFO L480 AbstractCegarLoop]: Abstraction has 3690 states and 9463 transitions. [2018-11-28 20:38:13,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:38:13,838 INFO L276 IsEmpty]: Start isEmpty. Operand 3690 states and 9463 transitions. [2018-11-28 20:38:13,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 20:38:13,842 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:13,842 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:38:13,843 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:13,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:13,843 INFO L82 PathProgramCache]: Analyzing trace with hash -550208755, now seen corresponding path program 1 times [2018-11-28 20:38:13,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:13,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:13,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:13,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:13,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:13,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:14,652 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2018-11-28 20:38:14,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:38:14,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:14,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:38:14,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:38:14,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:38:14,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:38:14,671 INFO L87 Difference]: Start difference. First operand 3690 states and 9463 transitions. Second operand 7 states. [2018-11-28 20:38:16,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:16,688 INFO L93 Difference]: Finished difference Result 4149 states and 10417 transitions. [2018-11-28 20:38:16,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:38:16,690 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-11-28 20:38:16,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:16,698 INFO L225 Difference]: With dead ends: 4149 [2018-11-28 20:38:16,698 INFO L226 Difference]: Without dead ends: 4149 [2018-11-28 20:38:16,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:38:16,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4149 states. [2018-11-28 20:38:16,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4149 to 3764. [2018-11-28 20:38:16,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3764 states. [2018-11-28 20:38:16,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3764 states to 3764 states and 9602 transitions. [2018-11-28 20:38:16,765 INFO L78 Accepts]: Start accepts. Automaton has 3764 states and 9602 transitions. Word has length 93 [2018-11-28 20:38:16,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:16,765 INFO L480 AbstractCegarLoop]: Abstraction has 3764 states and 9602 transitions. [2018-11-28 20:38:16,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:38:16,765 INFO L276 IsEmpty]: Start isEmpty. Operand 3764 states and 9602 transitions. [2018-11-28 20:38:16,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 20:38:16,774 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:16,774 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:38:16,774 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:16,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:16,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1650479819, now seen corresponding path program 2 times [2018-11-28 20:38:16,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:16,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:16,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:16,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:16,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:16,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:17,233 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-11-28 20:38:17,605 WARN L180 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2018-11-28 20:38:17,852 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 16 [2018-11-28 20:38:17,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:38:17,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:17,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:38:17,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:38:17,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:38:17,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:38:17,864 INFO L87 Difference]: Start difference. First operand 3764 states and 9602 transitions. Second operand 7 states. [2018-11-28 20:38:18,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:18,008 INFO L93 Difference]: Finished difference Result 3855 states and 9744 transitions. [2018-11-28 20:38:18,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:38:18,010 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-11-28 20:38:18,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:18,015 INFO L225 Difference]: With dead ends: 3855 [2018-11-28 20:38:18,015 INFO L226 Difference]: Without dead ends: 3835 [2018-11-28 20:38:18,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:38:18,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3835 states. [2018-11-28 20:38:18,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3835 to 3710. [2018-11-28 20:38:18,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3710 states. [2018-11-28 20:38:18,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 9456 transitions. [2018-11-28 20:38:18,061 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 9456 transitions. Word has length 93 [2018-11-28 20:38:18,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:18,061 INFO L480 AbstractCegarLoop]: Abstraction has 3710 states and 9456 transitions. [2018-11-28 20:38:18,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:38:18,061 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 9456 transitions. [2018-11-28 20:38:18,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 20:38:18,066 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:18,066 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:38:18,066 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:18,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:18,067 INFO L82 PathProgramCache]: Analyzing trace with hash -285180468, now seen corresponding path program 1 times [2018-11-28 20:38:18,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:18,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:18,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:18,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 20:38:18,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:18,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:18,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:38:18,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:18,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:38:18,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:38:18,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:38:18,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:38:18,323 INFO L87 Difference]: Start difference. First operand 3710 states and 9456 transitions. Second operand 5 states. [2018-11-28 20:38:18,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:18,532 INFO L93 Difference]: Finished difference Result 4254 states and 10800 transitions. [2018-11-28 20:38:18,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:38:18,534 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-11-28 20:38:18,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:18,540 INFO L225 Difference]: With dead ends: 4254 [2018-11-28 20:38:18,540 INFO L226 Difference]: Without dead ends: 4222 [2018-11-28 20:38:18,541 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-11-28 20:38:18,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4222 states. [2018-11-28 20:38:18,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4222 to 3758. [2018-11-28 20:38:18,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3758 states. [2018-11-28 20:38:18,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3758 states to 3758 states and 9560 transitions. [2018-11-28 20:38:18,588 INFO L78 Accepts]: Start accepts. Automaton has 3758 states and 9560 transitions. Word has length 93 [2018-11-28 20:38:18,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:18,588 INFO L480 AbstractCegarLoop]: Abstraction has 3758 states and 9560 transitions. [2018-11-28 20:38:18,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:38:18,588 INFO L276 IsEmpty]: Start isEmpty. Operand 3758 states and 9560 transitions. [2018-11-28 20:38:18,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 20:38:18,593 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:18,593 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:38:18,594 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:18,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:18,594 INFO L82 PathProgramCache]: Analyzing trace with hash 959584013, now seen corresponding path program 1 times [2018-11-28 20:38:18,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:18,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:18,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:18,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:18,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:18,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:18,863 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-28 20:38:19,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:38:19,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:19,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:38:19,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:38:19,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:38:19,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:38:19,036 INFO L87 Difference]: Start difference. First operand 3758 states and 9560 transitions. Second operand 7 states. [2018-11-28 20:38:19,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:19,350 INFO L93 Difference]: Finished difference Result 5845 states and 14925 transitions. [2018-11-28 20:38:19,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:38:19,351 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-11-28 20:38:19,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:19,355 INFO L225 Difference]: With dead ends: 5845 [2018-11-28 20:38:19,355 INFO L226 Difference]: Without dead ends: 2182 [2018-11-28 20:38:19,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-11-28 20:38:19,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2182 states. [2018-11-28 20:38:19,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2182 to 2182. [2018-11-28 20:38:19,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2182 states. [2018-11-28 20:38:19,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 2182 states and 5546 transitions. [2018-11-28 20:38:19,382 INFO L78 Accepts]: Start accepts. Automaton has 2182 states and 5546 transitions. Word has length 93 [2018-11-28 20:38:19,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:19,383 INFO L480 AbstractCegarLoop]: Abstraction has 2182 states and 5546 transitions. [2018-11-28 20:38:19,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:38:19,383 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 5546 transitions. [2018-11-28 20:38:19,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 20:38:19,385 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:19,385 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:38:19,386 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:19,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:19,386 INFO L82 PathProgramCache]: Analyzing trace with hash -777910515, now seen corresponding path program 2 times [2018-11-28 20:38:19,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:19,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:19,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:19,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:19,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:19,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:19,621 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-28 20:38:20,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:38:20,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:20,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-28 20:38:20,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 20:38:20,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 20:38:20,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-28 20:38:20,267 INFO L87 Difference]: Start difference. First operand 2182 states and 5546 transitions. Second operand 12 states. [2018-11-28 20:38:21,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:21,001 INFO L93 Difference]: Finished difference Result 4039 states and 10414 transitions. [2018-11-28 20:38:21,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-28 20:38:21,002 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 93 [2018-11-28 20:38:21,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:21,007 INFO L225 Difference]: With dead ends: 4039 [2018-11-28 20:38:21,008 INFO L226 Difference]: Without dead ends: 2903 [2018-11-28 20:38:21,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-11-28 20:38:21,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2903 states. [2018-11-28 20:38:21,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2903 to 2733. [2018-11-28 20:38:21,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2733 states. [2018-11-28 20:38:21,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2733 states to 2733 states and 6802 transitions. [2018-11-28 20:38:21,038 INFO L78 Accepts]: Start accepts. Automaton has 2733 states and 6802 transitions. Word has length 93 [2018-11-28 20:38:21,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:21,039 INFO L480 AbstractCegarLoop]: Abstraction has 2733 states and 6802 transitions. [2018-11-28 20:38:21,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 20:38:21,039 INFO L276 IsEmpty]: Start isEmpty. Operand 2733 states and 6802 transitions. [2018-11-28 20:38:21,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 20:38:21,042 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:21,042 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:38:21,042 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:21,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:21,043 INFO L82 PathProgramCache]: Analyzing trace with hash 45507955, now seen corresponding path program 3 times [2018-11-28 20:38:21,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:21,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:21,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:21,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 20:38:21,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:21,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 20:38:21,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 20:38:21,127 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 20:38:21,348 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-11-28 20:38:21,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:38:21 BasicIcfg [2018-11-28 20:38:21,352 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 20:38:21,353 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 20:38:21,353 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 20:38:21,353 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 20:38:21,355 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:37:40" (3/4) ... [2018-11-28 20:38:21,359 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 20:38:21,508 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 20:38:21,511 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 20:38:21,512 INFO L168 Benchmark]: Toolchain (without parser) took 43449.92 ms. Allocated memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: 2.0 GB). Free memory was 951.3 MB in the beginning and 1.2 GB in the end (delta: -285.3 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2018-11-28 20:38:21,513 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-11-28 20:38:21,513 INFO L168 Benchmark]: CACSL2BoogieTranslator took 849.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -164.0 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. [2018-11-28 20:38:21,514 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.49 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-11-28 20:38:21,514 INFO L168 Benchmark]: Boogie Preprocessor took 43.14 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 20:38:21,514 INFO L168 Benchmark]: RCFGBuilder took 1209.12 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.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. [2018-11-28 20:38:21,519 INFO L168 Benchmark]: TraceAbstraction took 41117.18 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -218.2 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2018-11-28 20:38:21,522 INFO L168 Benchmark]: Witness Printer took 158.30 ms. Allocated memory is still 3.0 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 39.9 MB). Peak memory consumption was 39.9 MB. Max. memory is 11.5 GB. [2018-11-28 20:38:21,528 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 849.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -164.0 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 67.49 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 43.14 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 1209.12 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.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 41117.18 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -218.2 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. * Witness Printer took 158.30 ms. Allocated memory is still 3.0 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 39.9 MB). Peak memory consumption was 39.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L672] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L673] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L675] -1 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L677] -1 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L678] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L679] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L680] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L681] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L682] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L683] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L684] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L685] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L686] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L687] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L688] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L689] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L690] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L691] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L692] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L693] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L753] -1 pthread_t t2475; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L754] FCALL, FORK -1 pthread_create(&t2475, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L755] -1 pthread_t t2476; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L756] FCALL, FORK -1 pthread_create(&t2476, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L697] 0 y$w_buff1 = y$w_buff0 [L698] 0 y$w_buff0 = 2 [L699] 0 y$w_buff1_used = y$w_buff0_used [L700] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L702] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L703] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L704] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L705] 0 y$r_buff0_thd1 = (_Bool)1 [L708] 0 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L711] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L725] 1 x = 2 [L728] 1 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L711] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L712] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L731] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L712] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L731] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L731] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L731] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L732] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L732] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L733] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L733] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L734] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L735] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L735] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L738] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L713] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L713] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L714] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L714] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L715] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L715] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L718] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L758] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L763] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L763] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L764] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L765] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L766] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L769] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L770] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L771] -1 y$flush_delayed = weak$$choice2 [L772] -1 y$mem_tmp = y VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L773] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L773] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L774] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L775] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L776] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L777] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L778] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L779] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L780] -1 main$tmp_guard1 = !(x == 2 && y == 2) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] -1 y = y$flush_delayed ? y$mem_tmp : y [L782] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 178 locations, 3 error locations. UNSAFE Result, 40.9s OverallTime, 29 OverallIterations, 1 TraceHistogramMax, 20.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6909 SDtfs, 6520 SDslu, 15217 SDs, 0 SdLazy, 6039 SolverSat, 359 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 284 GetRequests, 83 SyntacticMatches, 18 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 8.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43712occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 8.9s AutomataMinimizationTime, 28 MinimizatonAttempts, 101430 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 2269 NumberOfCodeBlocks, 2269 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2148 ConstructedInterpolants, 0 QuantifiedInterpolants, 443734 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...