./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/safe029_power.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/safe029_power.opt_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 47114b7025e0370460384816fc34be8953a40ffc .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 00:33:15,257 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 00:33:15,259 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 00:33:15,276 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 00:33:15,278 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 00:33:15,279 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 00:33:15,284 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 00:33:15,286 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 00:33:15,289 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 00:33:15,293 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 00:33:15,295 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 00:33:15,296 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 00:33:15,297 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 00:33:15,300 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 00:33:15,308 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 00:33:15,309 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 00:33:15,310 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 00:33:15,317 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 00:33:15,319 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 00:33:15,322 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 00:33:15,324 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 00:33:15,328 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 00:33:15,332 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 00:33:15,332 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 00:33:15,332 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 00:33:15,333 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 00:33:15,335 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 00:33:15,336 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 00:33:15,338 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 00:33:15,343 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 00:33:15,344 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 00:33:15,346 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 00:33:15,346 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 00:33:15,346 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 00:33:15,349 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 00:33:15,351 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 00:33:15,352 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-01 00:33:15,379 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 00:33:15,381 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 00:33:15,382 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 00:33:15,384 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 00:33:15,384 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 00:33:15,384 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 00:33:15,384 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 00:33:15,385 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 00:33:15,386 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 00:33:15,386 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 00:33:15,386 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-01 00:33:15,386 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 00:33:15,386 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-01 00:33:15,386 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 00:33:15,387 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 00:33:15,387 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 00:33:15,388 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-01 00:33:15,388 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 00:33:15,388 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 00:33:15,388 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 00:33:15,388 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 00:33:15,389 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 00:33:15,389 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 00:33:15,389 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 00:33:15,389 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-01 00:33:15,389 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 00:33:15,389 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 00:33:15,390 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-01 00:33:15,392 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 -> 47114b7025e0370460384816fc34be8953a40ffc [2019-01-01 00:33:15,467 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 00:33:15,486 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 00:33:15,490 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 00:33:15,492 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 00:33:15,493 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 00:33:15,493 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/safe029_power.opt_false-unreach-call.i [2019-01-01 00:33:15,556 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a946e47c9/6a52396afe1d4db3a75dcca7dc1d1a9b/FLAG704119b7a [2019-01-01 00:33:16,148 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 00:33:16,149 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/safe029_power.opt_false-unreach-call.i [2019-01-01 00:33:16,170 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a946e47c9/6a52396afe1d4db3a75dcca7dc1d1a9b/FLAG704119b7a [2019-01-01 00:33:16,377 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a946e47c9/6a52396afe1d4db3a75dcca7dc1d1a9b [2019-01-01 00:33:16,382 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 00:33:16,383 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 00:33:16,384 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 00:33:16,385 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 00:33:16,390 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 00:33:16,391 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 12:33:16" (1/1) ... [2019-01-01 00:33:16,395 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@556facdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:33:16, skipping insertion in model container [2019-01-01 00:33:16,395 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 12:33:16" (1/1) ... [2019-01-01 00:33:16,405 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 00:33:16,471 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 00:33:16,923 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 00:33:16,957 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 00:33:17,146 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 00:33:17,238 INFO L195 MainTranslator]: Completed translation [2019-01-01 00:33:17,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:33:17 WrapperNode [2019-01-01 00:33:17,239 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 00:33:17,240 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 00:33:17,241 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 00:33:17,241 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 00:33:17,252 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:33:17" (1/1) ... [2019-01-01 00:33:17,275 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:33:17" (1/1) ... [2019-01-01 00:33:17,323 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 00:33:17,324 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 00:33:17,324 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 00:33:17,325 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 00:33:17,335 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:33:17" (1/1) ... [2019-01-01 00:33:17,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:33:17" (1/1) ... [2019-01-01 00:33:17,341 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:33:17" (1/1) ... [2019-01-01 00:33:17,342 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:33:17" (1/1) ... [2019-01-01 00:33:17,354 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:33:17" (1/1) ... [2019-01-01 00:33:17,360 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:33:17" (1/1) ... [2019-01-01 00:33:17,364 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:33:17" (1/1) ... [2019-01-01 00:33:17,370 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 00:33:17,371 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 00:33:17,371 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 00:33:17,371 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 00:33:17,372 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:33:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 00:33:17,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 00:33:17,445 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-01 00:33:17,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 00:33:17,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 00:33:17,445 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-01 00:33:17,446 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-01 00:33:17,446 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-01 00:33:17,446 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-01 00:33:17,446 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-01 00:33:17,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 00:33:17,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 00:33:17,449 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-01 00:33:18,685 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 00:33:18,685 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-01 00:33:18,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 12:33:18 BoogieIcfgContainer [2019-01-01 00:33:18,686 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 00:33:18,687 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 00:33:18,688 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 00:33:18,693 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 00:33:18,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 12:33:16" (1/3) ... [2019-01-01 00:33:18,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74689d7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 12:33:18, skipping insertion in model container [2019-01-01 00:33:18,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:33:17" (2/3) ... [2019-01-01 00:33:18,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74689d7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 12:33:18, skipping insertion in model container [2019-01-01 00:33:18,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 12:33:18" (3/3) ... [2019-01-01 00:33:18,697 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.opt_false-unreach-call.i [2019-01-01 00:33:18,744 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,744 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,744 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,744 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,745 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,745 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,745 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,746 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,746 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,746 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,746 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,747 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,747 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,747 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,747 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,747 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,748 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,748 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,748 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,748 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,749 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,749 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,749 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,749 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,750 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,750 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,750 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,751 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,751 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,751 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,751 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,751 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,752 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,752 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,752 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,753 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,753 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,753 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,753 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,753 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,754 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,754 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,754 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,757 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,757 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,757 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,757 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,758 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,758 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,758 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,758 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,758 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,759 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,759 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,759 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,759 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,760 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,764 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,764 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,765 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,765 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,765 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,765 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,766 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,766 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,766 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,768 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,768 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,768 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,768 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,769 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,769 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:18,794 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-01 00:33:18,795 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 00:33:18,804 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-01 00:33:18,822 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-01 00:33:18,852 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 00:33:18,853 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 00:33:18,853 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-01 00:33:18,853 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 00:33:18,854 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 00:33:18,854 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 00:33:18,854 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 00:33:18,854 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 00:33:18,854 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 00:33:18,869 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 140places, 178 transitions [2019-01-01 00:33:20,817 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25086 states. [2019-01-01 00:33:20,820 INFO L276 IsEmpty]: Start isEmpty. Operand 25086 states. [2019-01-01 00:33:20,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-01 00:33:20,830 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:33:20,831 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] [2019-01-01 00:33:20,833 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:33:20,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:33:20,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1594278667, now seen corresponding path program 1 times [2019-01-01 00:33:20,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:33:20,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:33:20,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:20,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:33:20,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:20,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:33:21,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:33:21,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:33:21,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:33:21,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:33:21,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:33:21,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:33:21,292 INFO L87 Difference]: Start difference. First operand 25086 states. Second operand 4 states. [2019-01-01 00:33:22,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:33:22,386 INFO L93 Difference]: Finished difference Result 45386 states and 177624 transitions. [2019-01-01 00:33:22,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 00:33:22,388 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-01-01 00:33:22,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:33:22,808 INFO L225 Difference]: With dead ends: 45386 [2019-01-01 00:33:22,810 INFO L226 Difference]: Without dead ends: 40626 [2019-01-01 00:33:22,814 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 [2019-01-01 00:33:23,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40626 states. [2019-01-01 00:33:24,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40626 to 23660. [2019-01-01 00:33:24,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23660 states. [2019-01-01 00:33:24,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23660 states to 23660 states and 92541 transitions. [2019-01-01 00:33:24,660 INFO L78 Accepts]: Start accepts. Automaton has 23660 states and 92541 transitions. Word has length 35 [2019-01-01 00:33:24,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:33:24,663 INFO L480 AbstractCegarLoop]: Abstraction has 23660 states and 92541 transitions. [2019-01-01 00:33:24,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:33:24,663 INFO L276 IsEmpty]: Start isEmpty. Operand 23660 states and 92541 transitions. [2019-01-01 00:33:24,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-01 00:33:24,675 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:33:24,676 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:33:24,676 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:33:24,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:33:24,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1049069648, now seen corresponding path program 1 times [2019-01-01 00:33:24,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:33:24,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:33:24,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:24,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:33:24,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:24,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:33:25,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:33:25,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:33:25,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 00:33:25,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 00:33:25,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 00:33:25,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:33:25,006 INFO L87 Difference]: Start difference. First operand 23660 states and 92541 transitions. Second operand 5 states. [2019-01-01 00:33:27,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:33:27,924 INFO L93 Difference]: Finished difference Result 64828 states and 241367 transitions. [2019-01-01 00:33:27,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 00:33:27,925 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-01-01 00:33:27,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:33:28,362 INFO L225 Difference]: With dead ends: 64828 [2019-01-01 00:33:28,363 INFO L226 Difference]: Without dead ends: 64668 [2019-01-01 00:33:28,364 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 [2019-01-01 00:33:28,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64668 states. [2019-01-01 00:33:30,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64668 to 37140. [2019-01-01 00:33:30,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37140 states. [2019-01-01 00:33:30,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37140 states to 37140 states and 138282 transitions. [2019-01-01 00:33:30,247 INFO L78 Accepts]: Start accepts. Automaton has 37140 states and 138282 transitions. Word has length 42 [2019-01-01 00:33:30,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:33:30,249 INFO L480 AbstractCegarLoop]: Abstraction has 37140 states and 138282 transitions. [2019-01-01 00:33:30,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 00:33:30,249 INFO L276 IsEmpty]: Start isEmpty. Operand 37140 states and 138282 transitions. [2019-01-01 00:33:30,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-01 00:33:30,254 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:33:30,254 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:33:30,254 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:33:30,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:33:30,255 INFO L82 PathProgramCache]: Analyzing trace with hash -888651829, now seen corresponding path program 1 times [2019-01-01 00:33:30,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:33:30,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:33:30,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:30,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:33:30,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:30,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:33:30,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:33:30,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:33:30,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:33:30,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:33:30,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:33:30,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:33:30,381 INFO L87 Difference]: Start difference. First operand 37140 states and 138282 transitions. Second operand 4 states. [2019-01-01 00:33:30,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:33:30,470 INFO L93 Difference]: Finished difference Result 12362 states and 41175 transitions. [2019-01-01 00:33:30,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 00:33:30,470 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-01-01 00:33:30,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:33:30,505 INFO L225 Difference]: With dead ends: 12362 [2019-01-01 00:33:30,505 INFO L226 Difference]: Without dead ends: 11841 [2019-01-01 00:33:30,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:33:30,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11841 states. [2019-01-01 00:33:30,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11841 to 11841. [2019-01-01 00:33:30,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11841 states. [2019-01-01 00:33:30,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11841 states to 11841 states and 39620 transitions. [2019-01-01 00:33:30,785 INFO L78 Accepts]: Start accepts. Automaton has 11841 states and 39620 transitions. Word has length 43 [2019-01-01 00:33:30,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:33:30,786 INFO L480 AbstractCegarLoop]: Abstraction has 11841 states and 39620 transitions. [2019-01-01 00:33:30,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:33:30,786 INFO L276 IsEmpty]: Start isEmpty. Operand 11841 states and 39620 transitions. [2019-01-01 00:33:30,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-01 00:33:30,791 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:33:30,793 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:33:30,793 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:33:30,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:33:30,794 INFO L82 PathProgramCache]: Analyzing trace with hash 727038507, now seen corresponding path program 1 times [2019-01-01 00:33:30,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:33:30,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:33:30,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:30,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:33:30,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:30,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:33:31,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:33:31,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:33:31,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:33:31,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:33:31,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:33:31,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:33:31,060 INFO L87 Difference]: Start difference. First operand 11841 states and 39620 transitions. Second operand 4 states. [2019-01-01 00:33:31,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:33:31,451 INFO L93 Difference]: Finished difference Result 17017 states and 55691 transitions. [2019-01-01 00:33:31,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 00:33:31,452 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-01-01 00:33:31,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:33:31,493 INFO L225 Difference]: With dead ends: 17017 [2019-01-01 00:33:31,494 INFO L226 Difference]: Without dead ends: 17017 [2019-01-01 00:33:31,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:33:31,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17017 states. [2019-01-01 00:33:31,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17017 to 12877. [2019-01-01 00:33:31,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12877 states. [2019-01-01 00:33:31,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12877 states to 12877 states and 42718 transitions. [2019-01-01 00:33:31,885 INFO L78 Accepts]: Start accepts. Automaton has 12877 states and 42718 transitions. Word has length 56 [2019-01-01 00:33:31,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:33:31,885 INFO L480 AbstractCegarLoop]: Abstraction has 12877 states and 42718 transitions. [2019-01-01 00:33:31,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:33:31,886 INFO L276 IsEmpty]: Start isEmpty. Operand 12877 states and 42718 transitions. [2019-01-01 00:33:31,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-01 00:33:31,893 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:33:31,893 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:33:31,894 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:33:31,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:33:31,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1892125207, now seen corresponding path program 1 times [2019-01-01 00:33:31,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:33:31,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:33:31,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:31,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:33:31,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:31,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:33:32,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:33:32,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:33:32,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:33:32,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:33:32,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:33:32,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:33:32,199 INFO L87 Difference]: Start difference. First operand 12877 states and 42718 transitions. Second operand 6 states. [2019-01-01 00:33:33,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:33:33,190 INFO L93 Difference]: Finished difference Result 18597 states and 60828 transitions. [2019-01-01 00:33:33,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 00:33:33,196 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-01-01 00:33:33,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:33:33,698 INFO L225 Difference]: With dead ends: 18597 [2019-01-01 00:33:33,698 INFO L226 Difference]: Without dead ends: 18565 [2019-01-01 00:33:33,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-01-01 00:33:33,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18565 states. [2019-01-01 00:33:34,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18565 to 14409. [2019-01-01 00:33:34,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14409 states. [2019-01-01 00:33:34,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14409 states to 14409 states and 47547 transitions. [2019-01-01 00:33:34,051 INFO L78 Accepts]: Start accepts. Automaton has 14409 states and 47547 transitions. Word has length 56 [2019-01-01 00:33:34,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:33:34,051 INFO L480 AbstractCegarLoop]: Abstraction has 14409 states and 47547 transitions. [2019-01-01 00:33:34,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:33:34,052 INFO L276 IsEmpty]: Start isEmpty. Operand 14409 states and 47547 transitions. [2019-01-01 00:33:34,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-01 00:33:34,077 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:33:34,077 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:33:34,078 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:33:34,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:33:34,078 INFO L82 PathProgramCache]: Analyzing trace with hash 315883094, now seen corresponding path program 1 times [2019-01-01 00:33:34,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:33:34,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:33:34,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:34,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:33:34,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:34,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:33:34,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:33:34,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:33:34,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 00:33:34,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 00:33:34,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 00:33:34,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:33:34,240 INFO L87 Difference]: Start difference. First operand 14409 states and 47547 transitions. Second operand 5 states. [2019-01-01 00:33:35,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:33:35,017 INFO L93 Difference]: Finished difference Result 23941 states and 78280 transitions. [2019-01-01 00:33:35,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 00:33:35,018 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-01-01 00:33:35,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:33:35,065 INFO L225 Difference]: With dead ends: 23941 [2019-01-01 00:33:35,065 INFO L226 Difference]: Without dead ends: 23845 [2019-01-01 00:33:35,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:33:35,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23845 states. [2019-01-01 00:33:35,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23845 to 22789. [2019-01-01 00:33:35,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22789 states. [2019-01-01 00:33:35,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22789 states to 22789 states and 74768 transitions. [2019-01-01 00:33:35,560 INFO L78 Accepts]: Start accepts. Automaton has 22789 states and 74768 transitions. Word has length 70 [2019-01-01 00:33:35,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:33:35,560 INFO L480 AbstractCegarLoop]: Abstraction has 22789 states and 74768 transitions. [2019-01-01 00:33:35,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 00:33:35,561 INFO L276 IsEmpty]: Start isEmpty. Operand 22789 states and 74768 transitions. [2019-01-01 00:33:35,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-01 00:33:35,619 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:33:35,619 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:33:35,620 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:33:35,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:33:35,622 INFO L82 PathProgramCache]: Analyzing trace with hash 22480087, now seen corresponding path program 1 times [2019-01-01 00:33:35,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:33:35,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:33:35,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:35,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:33:35,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:35,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:33:35,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:33:35,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:33:35,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:33:35,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:33:35,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:33:35,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:33:35,786 INFO L87 Difference]: Start difference. First operand 22789 states and 74768 transitions. Second operand 4 states. [2019-01-01 00:33:36,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:33:36,720 INFO L93 Difference]: Finished difference Result 32264 states and 104461 transitions. [2019-01-01 00:33:36,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 00:33:36,721 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-01-01 00:33:36,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:33:36,783 INFO L225 Difference]: With dead ends: 32264 [2019-01-01 00:33:36,783 INFO L226 Difference]: Without dead ends: 32264 [2019-01-01 00:33:36,783 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 [2019-01-01 00:33:36,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32264 states. [2019-01-01 00:33:37,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32264 to 29029. [2019-01-01 00:33:37,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29029 states. [2019-01-01 00:33:37,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29029 states to 29029 states and 94668 transitions. [2019-01-01 00:33:37,788 INFO L78 Accepts]: Start accepts. Automaton has 29029 states and 94668 transitions. Word has length 70 [2019-01-01 00:33:37,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:33:37,788 INFO L480 AbstractCegarLoop]: Abstraction has 29029 states and 94668 transitions. [2019-01-01 00:33:37,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:33:37,789 INFO L276 IsEmpty]: Start isEmpty. Operand 29029 states and 94668 transitions. [2019-01-01 00:33:37,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-01 00:33:37,827 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:33:37,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:33:37,828 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:33:37,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:33:37,828 INFO L82 PathProgramCache]: Analyzing trace with hash 2133770456, now seen corresponding path program 1 times [2019-01-01 00:33:37,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:33:37,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:33:37,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:37,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:33:37,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:37,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:33:37,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:33:37,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:33:37,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:33:37,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:33:37,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:33:37,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:33:37,939 INFO L87 Difference]: Start difference. First operand 29029 states and 94668 transitions. Second operand 4 states. [2019-01-01 00:33:38,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:33:38,635 INFO L93 Difference]: Finished difference Result 41177 states and 132363 transitions. [2019-01-01 00:33:38,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 00:33:38,636 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-01-01 00:33:38,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:33:38,716 INFO L225 Difference]: With dead ends: 41177 [2019-01-01 00:33:38,716 INFO L226 Difference]: Without dead ends: 40929 [2019-01-01 00:33:38,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:33:38,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40929 states. [2019-01-01 00:33:39,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40929 to 35657. [2019-01-01 00:33:39,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35657 states. [2019-01-01 00:33:39,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35657 states to 35657 states and 115827 transitions. [2019-01-01 00:33:39,341 INFO L78 Accepts]: Start accepts. Automaton has 35657 states and 115827 transitions. Word has length 70 [2019-01-01 00:33:39,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:33:39,342 INFO L480 AbstractCegarLoop]: Abstraction has 35657 states and 115827 transitions. [2019-01-01 00:33:39,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:33:39,342 INFO L276 IsEmpty]: Start isEmpty. Operand 35657 states and 115827 transitions. [2019-01-01 00:33:39,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-01 00:33:39,380 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:33:39,380 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:33:39,381 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:33:39,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:33:39,381 INFO L82 PathProgramCache]: Analyzing trace with hash -514484136, now seen corresponding path program 1 times [2019-01-01 00:33:39,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:33:39,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:33:39,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:39,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:33:39,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:39,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:33:39,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:33:39,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:33:39,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-01 00:33:39,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 00:33:39,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 00:33:39,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-01-01 00:33:39,808 INFO L87 Difference]: Start difference. First operand 35657 states and 115827 transitions. Second operand 8 states. [2019-01-01 00:33:41,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:33:41,881 INFO L93 Difference]: Finished difference Result 51571 states and 162646 transitions. [2019-01-01 00:33:41,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-01 00:33:41,882 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2019-01-01 00:33:41,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:33:42,014 INFO L225 Difference]: With dead ends: 51571 [2019-01-01 00:33:42,014 INFO L226 Difference]: Without dead ends: 51323 [2019-01-01 00:33:42,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-01-01 00:33:42,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51323 states. [2019-01-01 00:33:43,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51323 to 38086. [2019-01-01 00:33:43,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38086 states. [2019-01-01 00:33:43,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38086 states to 38086 states and 123157 transitions. [2019-01-01 00:33:43,350 INFO L78 Accepts]: Start accepts. Automaton has 38086 states and 123157 transitions. Word has length 70 [2019-01-01 00:33:43,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:33:43,351 INFO L480 AbstractCegarLoop]: Abstraction has 38086 states and 123157 transitions. [2019-01-01 00:33:43,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 00:33:43,351 INFO L276 IsEmpty]: Start isEmpty. Operand 38086 states and 123157 transitions. [2019-01-01 00:33:43,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-01 00:33:43,384 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:33:43,384 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:33:43,385 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:33:43,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:33:43,385 INFO L82 PathProgramCache]: Analyzing trace with hash -807887143, now seen corresponding path program 1 times [2019-01-01 00:33:43,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:33:43,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:33:43,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:43,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:33:43,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:43,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:33:43,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:33:43,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:33:43,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 00:33:43,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 00:33:43,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 00:33:43,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:33:43,553 INFO L87 Difference]: Start difference. First operand 38086 states and 123157 transitions. Second operand 5 states. [2019-01-01 00:33:43,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:33:43,605 INFO L93 Difference]: Finished difference Result 5418 states and 14328 transitions. [2019-01-01 00:33:43,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 00:33:43,605 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-01-01 00:33:43,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:33:43,611 INFO L225 Difference]: With dead ends: 5418 [2019-01-01 00:33:43,612 INFO L226 Difference]: Without dead ends: 4696 [2019-01-01 00:33:43,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:33:43,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4696 states. [2019-01-01 00:33:43,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4696 to 4448. [2019-01-01 00:33:43,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4448 states. [2019-01-01 00:33:43,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4448 states to 4448 states and 11840 transitions. [2019-01-01 00:33:43,662 INFO L78 Accepts]: Start accepts. Automaton has 4448 states and 11840 transitions. Word has length 70 [2019-01-01 00:33:43,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:33:43,662 INFO L480 AbstractCegarLoop]: Abstraction has 4448 states and 11840 transitions. [2019-01-01 00:33:43,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 00:33:43,662 INFO L276 IsEmpty]: Start isEmpty. Operand 4448 states and 11840 transitions. [2019-01-01 00:33:43,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-01 00:33:43,667 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:33:43,668 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:33:43,668 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:33:43,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:33:43,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1160314703, now seen corresponding path program 1 times [2019-01-01 00:33:43,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:33:43,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:33:43,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:43,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:33:43,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:43,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:33:43,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:33:43,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:33:43,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 00:33:43,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 00:33:43,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 00:33:43,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 00:33:43,804 INFO L87 Difference]: Start difference. First operand 4448 states and 11840 transitions. Second operand 3 states. [2019-01-01 00:33:44,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:33:44,057 INFO L93 Difference]: Finished difference Result 4573 states and 12119 transitions. [2019-01-01 00:33:44,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 00:33:44,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-01-01 00:33:44,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:33:44,064 INFO L225 Difference]: With dead ends: 4573 [2019-01-01 00:33:44,064 INFO L226 Difference]: Without dead ends: 4573 [2019-01-01 00:33:44,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 00:33:44,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4573 states. [2019-01-01 00:33:44,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4573 to 4506. [2019-01-01 00:33:44,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4506 states. [2019-01-01 00:33:44,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4506 states to 4506 states and 11970 transitions. [2019-01-01 00:33:44,115 INFO L78 Accepts]: Start accepts. Automaton has 4506 states and 11970 transitions. Word has length 89 [2019-01-01 00:33:44,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:33:44,115 INFO L480 AbstractCegarLoop]: Abstraction has 4506 states and 11970 transitions. [2019-01-01 00:33:44,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 00:33:44,116 INFO L276 IsEmpty]: Start isEmpty. Operand 4506 states and 11970 transitions. [2019-01-01 00:33:44,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-01 00:33:44,121 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:33:44,121 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:33:44,122 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:33:44,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:33:44,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1012155850, now seen corresponding path program 1 times [2019-01-01 00:33:44,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:33:44,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:33:44,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:44,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:33:44,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:44,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:33:44,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:33:44,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:33:44,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 00:33:44,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 00:33:44,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 00:33:44,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:33:44,361 INFO L87 Difference]: Start difference. First operand 4506 states and 11970 transitions. Second operand 5 states. [2019-01-01 00:33:44,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:33:44,629 INFO L93 Difference]: Finished difference Result 5158 states and 13499 transitions. [2019-01-01 00:33:44,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 00:33:44,631 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-01-01 00:33:44,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:33:44,637 INFO L225 Difference]: With dead ends: 5158 [2019-01-01 00:33:44,638 INFO L226 Difference]: Without dead ends: 5130 [2019-01-01 00:33:44,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-01 00:33:44,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5130 states. [2019-01-01 00:33:44,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5130 to 5038. [2019-01-01 00:33:44,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5038 states. [2019-01-01 00:33:44,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5038 states to 5038 states and 13233 transitions. [2019-01-01 00:33:44,695 INFO L78 Accepts]: Start accepts. Automaton has 5038 states and 13233 transitions. Word has length 89 [2019-01-01 00:33:44,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:33:44,695 INFO L480 AbstractCegarLoop]: Abstraction has 5038 states and 13233 transitions. [2019-01-01 00:33:44,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 00:33:44,695 INFO L276 IsEmpty]: Start isEmpty. Operand 5038 states and 13233 transitions. [2019-01-01 00:33:44,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-01 00:33:44,702 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:33:44,702 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:33:44,703 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:33:44,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:33:44,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1509856129, now seen corresponding path program 1 times [2019-01-01 00:33:44,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:33:44,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:33:44,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:44,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:33:44,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:44,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:33:44,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:33:44,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:33:44,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:33:44,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:33:44,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:33:44,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:33:44,902 INFO L87 Difference]: Start difference. First operand 5038 states and 13233 transitions. Second operand 4 states. [2019-01-01 00:33:45,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:33:45,064 INFO L93 Difference]: Finished difference Result 9234 states and 24456 transitions. [2019-01-01 00:33:45,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 00:33:45,065 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-01-01 00:33:45,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:33:45,078 INFO L225 Difference]: With dead ends: 9234 [2019-01-01 00:33:45,078 INFO L226 Difference]: Without dead ends: 9206 [2019-01-01 00:33:45,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:33:45,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9206 states. [2019-01-01 00:33:45,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9206 to 4900. [2019-01-01 00:33:45,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4900 states. [2019-01-01 00:33:45,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4900 states to 4900 states and 12810 transitions. [2019-01-01 00:33:45,176 INFO L78 Accepts]: Start accepts. Automaton has 4900 states and 12810 transitions. Word has length 91 [2019-01-01 00:33:45,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:33:45,176 INFO L480 AbstractCegarLoop]: Abstraction has 4900 states and 12810 transitions. [2019-01-01 00:33:45,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:33:45,176 INFO L276 IsEmpty]: Start isEmpty. Operand 4900 states and 12810 transitions. [2019-01-01 00:33:45,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-01 00:33:45,183 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:33:45,184 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:33:45,184 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:33:45,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:33:45,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1082731118, now seen corresponding path program 1 times [2019-01-01 00:33:45,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:33:45,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:33:45,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:45,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:33:45,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:45,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:33:45,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:33:45,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:33:45,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:33:45,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:33:45,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:33:45,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:33:45,393 INFO L87 Difference]: Start difference. First operand 4900 states and 12810 transitions. Second operand 6 states. [2019-01-01 00:33:45,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:33:45,688 INFO L93 Difference]: Finished difference Result 5421 states and 14010 transitions. [2019-01-01 00:33:45,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 00:33:45,689 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-01-01 00:33:45,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:33:45,697 INFO L225 Difference]: With dead ends: 5421 [2019-01-01 00:33:45,697 INFO L226 Difference]: Without dead ends: 5421 [2019-01-01 00:33:45,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:33:45,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5421 states. [2019-01-01 00:33:45,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5421 to 4982. [2019-01-01 00:33:45,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4982 states. [2019-01-01 00:33:45,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4982 states to 4982 states and 13010 transitions. [2019-01-01 00:33:45,757 INFO L78 Accepts]: Start accepts. Automaton has 4982 states and 13010 transitions. Word has length 91 [2019-01-01 00:33:45,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:33:45,758 INFO L480 AbstractCegarLoop]: Abstraction has 4982 states and 13010 transitions. [2019-01-01 00:33:45,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:33:45,758 INFO L276 IsEmpty]: Start isEmpty. Operand 4982 states and 13010 transitions. [2019-01-01 00:33:45,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-01 00:33:45,764 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:33:45,764 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:33:45,764 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:33:45,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:33:45,765 INFO L82 PathProgramCache]: Analyzing trace with hash 2052312141, now seen corresponding path program 1 times [2019-01-01 00:33:45,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:33:45,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:33:45,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:45,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:33:45,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:45,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:33:46,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:33:46,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:33:46,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:33:46,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:33:46,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:33:46,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:33:46,011 INFO L87 Difference]: Start difference. First operand 4982 states and 13010 transitions. Second operand 6 states. [2019-01-01 00:33:46,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:33:46,405 INFO L93 Difference]: Finished difference Result 6685 states and 17135 transitions. [2019-01-01 00:33:46,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:33:46,407 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-01-01 00:33:46,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:33:46,416 INFO L225 Difference]: With dead ends: 6685 [2019-01-01 00:33:46,416 INFO L226 Difference]: Without dead ends: 6653 [2019-01-01 00:33:46,416 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 [2019-01-01 00:33:46,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6653 states. [2019-01-01 00:33:46,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6653 to 5220. [2019-01-01 00:33:46,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5220 states. [2019-01-01 00:33:46,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5220 states to 5220 states and 13566 transitions. [2019-01-01 00:33:46,488 INFO L78 Accepts]: Start accepts. Automaton has 5220 states and 13566 transitions. Word has length 91 [2019-01-01 00:33:46,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:33:46,489 INFO L480 AbstractCegarLoop]: Abstraction has 5220 states and 13566 transitions. [2019-01-01 00:33:46,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:33:46,489 INFO L276 IsEmpty]: Start isEmpty. Operand 5220 states and 13566 transitions. [2019-01-01 00:33:46,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-01 00:33:46,497 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:33:46,497 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:33:46,497 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:33:46,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:33:46,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1769161677, now seen corresponding path program 1 times [2019-01-01 00:33:46,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:33:46,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:33:46,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:46,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:33:46,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:46,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:33:46,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:33:46,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:33:46,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 00:33:46,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 00:33:46,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 00:33:46,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:33:46,686 INFO L87 Difference]: Start difference. First operand 5220 states and 13566 transitions. Second operand 7 states. [2019-01-01 00:33:47,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:33:47,310 INFO L93 Difference]: Finished difference Result 10836 states and 28363 transitions. [2019-01-01 00:33:47,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-01 00:33:47,311 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2019-01-01 00:33:47,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:33:47,327 INFO L225 Difference]: With dead ends: 10836 [2019-01-01 00:33:47,327 INFO L226 Difference]: Without dead ends: 10836 [2019-01-01 00:33:47,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-01-01 00:33:47,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10836 states. [2019-01-01 00:33:47,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10836 to 5696. [2019-01-01 00:33:47,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5696 states. [2019-01-01 00:33:47,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5696 states to 5696 states and 14820 transitions. [2019-01-01 00:33:47,426 INFO L78 Accepts]: Start accepts. Automaton has 5696 states and 14820 transitions. Word has length 91 [2019-01-01 00:33:47,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:33:47,426 INFO L480 AbstractCegarLoop]: Abstraction has 5696 states and 14820 transitions. [2019-01-01 00:33:47,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 00:33:47,427 INFO L276 IsEmpty]: Start isEmpty. Operand 5696 states and 14820 transitions. [2019-01-01 00:33:47,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-01 00:33:47,435 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:33:47,435 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:33:47,436 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:33:47,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:33:47,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1281041138, now seen corresponding path program 1 times [2019-01-01 00:33:47,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:33:47,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:33:47,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:47,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:33:47,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:47,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:33:48,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:33:48,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:33:48,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 00:33:48,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 00:33:48,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 00:33:48,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:33:48,032 INFO L87 Difference]: Start difference. First operand 5696 states and 14820 transitions. Second operand 7 states. [2019-01-01 00:33:48,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:33:48,392 INFO L93 Difference]: Finished difference Result 5443 states and 14126 transitions. [2019-01-01 00:33:48,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 00:33:48,393 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2019-01-01 00:33:48,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:33:48,401 INFO L225 Difference]: With dead ends: 5443 [2019-01-01 00:33:48,401 INFO L226 Difference]: Without dead ends: 5443 [2019-01-01 00:33:48,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-01-01 00:33:48,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5443 states. [2019-01-01 00:33:48,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5443 to 5297. [2019-01-01 00:33:48,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5297 states. [2019-01-01 00:33:48,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5297 states to 5297 states and 13794 transitions. [2019-01-01 00:33:48,465 INFO L78 Accepts]: Start accepts. Automaton has 5297 states and 13794 transitions. Word has length 91 [2019-01-01 00:33:48,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:33:48,465 INFO L480 AbstractCegarLoop]: Abstraction has 5297 states and 13794 transitions. [2019-01-01 00:33:48,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 00:33:48,466 INFO L276 IsEmpty]: Start isEmpty. Operand 5297 states and 13794 transitions. [2019-01-01 00:33:48,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-01 00:33:48,472 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:33:48,472 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:33:48,473 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:33:48,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:33:48,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1059282431, now seen corresponding path program 1 times [2019-01-01 00:33:48,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:33:48,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:33:48,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:48,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:33:48,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:48,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:33:48,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:33:48,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:33:48,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 00:33:48,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 00:33:48,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 00:33:48,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:33:48,838 INFO L87 Difference]: Start difference. First operand 5297 states and 13794 transitions. Second operand 7 states. [2019-01-01 00:33:49,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:33:49,503 INFO L93 Difference]: Finished difference Result 5672 states and 14670 transitions. [2019-01-01 00:33:49,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:33:49,504 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2019-01-01 00:33:49,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:33:49,512 INFO L225 Difference]: With dead ends: 5672 [2019-01-01 00:33:49,512 INFO L226 Difference]: Without dead ends: 5672 [2019-01-01 00:33:49,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:33:49,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5672 states. [2019-01-01 00:33:49,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5672 to 5351. [2019-01-01 00:33:49,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5351 states. [2019-01-01 00:33:49,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5351 states to 5351 states and 13883 transitions. [2019-01-01 00:33:49,577 INFO L78 Accepts]: Start accepts. Automaton has 5351 states and 13883 transitions. Word has length 91 [2019-01-01 00:33:49,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:33:49,577 INFO L480 AbstractCegarLoop]: Abstraction has 5351 states and 13883 transitions. [2019-01-01 00:33:49,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 00:33:49,578 INFO L276 IsEmpty]: Start isEmpty. Operand 5351 states and 13883 transitions. [2019-01-01 00:33:49,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-01 00:33:49,584 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:33:49,584 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:33:49,584 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:33:49,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:33:49,585 INFO L82 PathProgramCache]: Analyzing trace with hash -124064866, now seen corresponding path program 1 times [2019-01-01 00:33:49,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:33:49,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:33:49,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:49,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:33:49,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:49,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:33:49,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:33:49,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:33:49,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 00:33:49,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 00:33:49,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 00:33:49,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:33:49,744 INFO L87 Difference]: Start difference. First operand 5351 states and 13883 transitions. Second operand 5 states. [2019-01-01 00:33:50,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:33:50,657 INFO L93 Difference]: Finished difference Result 5056 states and 13128 transitions. [2019-01-01 00:33:50,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 00:33:50,658 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-01-01 00:33:50,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:33:50,668 INFO L225 Difference]: With dead ends: 5056 [2019-01-01 00:33:50,669 INFO L226 Difference]: Without dead ends: 5056 [2019-01-01 00:33:50,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:33:50,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5056 states. [2019-01-01 00:33:50,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5056 to 4930. [2019-01-01 00:33:50,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4930 states. [2019-01-01 00:33:50,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4930 states to 4930 states and 12875 transitions. [2019-01-01 00:33:50,864 INFO L78 Accepts]: Start accepts. Automaton has 4930 states and 12875 transitions. Word has length 91 [2019-01-01 00:33:50,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:33:50,864 INFO L480 AbstractCegarLoop]: Abstraction has 4930 states and 12875 transitions. [2019-01-01 00:33:50,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 00:33:50,864 INFO L276 IsEmpty]: Start isEmpty. Operand 4930 states and 12875 transitions. [2019-01-01 00:33:50,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-01 00:33:50,874 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:33:50,875 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:33:50,876 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:33:50,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:33:50,876 INFO L82 PathProgramCache]: Analyzing trace with hash 897735391, now seen corresponding path program 1 times [2019-01-01 00:33:50,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:33:50,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:33:50,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:50,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:33:50,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:50,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:33:51,324 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2019-01-01 00:33:51,812 WARN L181 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 16 [2019-01-01 00:33:51,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:33:51,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:33:51,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:33:51,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:33:51,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:33:51,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:33:51,838 INFO L87 Difference]: Start difference. First operand 4930 states and 12875 transitions. Second operand 6 states. [2019-01-01 00:33:52,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:33:52,090 INFO L93 Difference]: Finished difference Result 3602 states and 9011 transitions. [2019-01-01 00:33:52,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 00:33:52,092 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-01-01 00:33:52,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:33:52,097 INFO L225 Difference]: With dead ends: 3602 [2019-01-01 00:33:52,097 INFO L226 Difference]: Without dead ends: 3602 [2019-01-01 00:33:52,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:33:52,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3602 states. [2019-01-01 00:33:52,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3602 to 2668. [2019-01-01 00:33:52,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2668 states. [2019-01-01 00:33:52,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2668 states to 2668 states and 6811 transitions. [2019-01-01 00:33:52,132 INFO L78 Accepts]: Start accepts. Automaton has 2668 states and 6811 transitions. Word has length 91 [2019-01-01 00:33:52,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:33:52,133 INFO L480 AbstractCegarLoop]: Abstraction has 2668 states and 6811 transitions. [2019-01-01 00:33:52,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:33:52,133 INFO L276 IsEmpty]: Start isEmpty. Operand 2668 states and 6811 transitions. [2019-01-01 00:33:52,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-01 00:33:52,136 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:33:52,137 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:33:52,137 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:33:52,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:33:52,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1422839622, now seen corresponding path program 1 times [2019-01-01 00:33:52,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:33:52,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:33:52,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:52,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:33:52,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:52,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:33:52,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:33:52,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:33:52,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 00:33:52,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 00:33:52,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 00:33:52,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:33:52,304 INFO L87 Difference]: Start difference. First operand 2668 states and 6811 transitions. Second operand 7 states. [2019-01-01 00:33:52,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:33:52,910 INFO L93 Difference]: Finished difference Result 4255 states and 10595 transitions. [2019-01-01 00:33:52,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-01 00:33:52,911 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-01-01 00:33:52,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:33:52,918 INFO L225 Difference]: With dead ends: 4255 [2019-01-01 00:33:52,918 INFO L226 Difference]: Without dead ends: 4255 [2019-01-01 00:33:52,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-01-01 00:33:52,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4255 states. [2019-01-01 00:33:52,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4255 to 3018. [2019-01-01 00:33:52,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3018 states. [2019-01-01 00:33:52,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 7669 transitions. [2019-01-01 00:33:52,961 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 7669 transitions. Word has length 93 [2019-01-01 00:33:52,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:33:52,961 INFO L480 AbstractCegarLoop]: Abstraction has 3018 states and 7669 transitions. [2019-01-01 00:33:52,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 00:33:52,961 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 7669 transitions. [2019-01-01 00:33:52,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-01 00:33:52,965 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:33:52,965 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:33:52,967 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:33:52,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:33:52,967 INFO L82 PathProgramCache]: Analyzing trace with hash -178075141, now seen corresponding path program 1 times [2019-01-01 00:33:52,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:33:52,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:33:52,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:52,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:33:52,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:52,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:33:53,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:33:53,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:33:53,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 00:33:53,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 00:33:53,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 00:33:53,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:33:53,191 INFO L87 Difference]: Start difference. First operand 3018 states and 7669 transitions. Second operand 7 states. [2019-01-01 00:33:53,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:33:53,537 INFO L93 Difference]: Finished difference Result 3035 states and 7701 transitions. [2019-01-01 00:33:53,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 00:33:53,538 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-01-01 00:33:53,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:33:53,544 INFO L225 Difference]: With dead ends: 3035 [2019-01-01 00:33:53,545 INFO L226 Difference]: Without dead ends: 3035 [2019-01-01 00:33:53,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-01 00:33:53,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3035 states. [2019-01-01 00:33:53,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3035 to 3018. [2019-01-01 00:33:53,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3018 states. [2019-01-01 00:33:53,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 7666 transitions. [2019-01-01 00:33:53,592 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 7666 transitions. Word has length 93 [2019-01-01 00:33:53,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:33:53,592 INFO L480 AbstractCegarLoop]: Abstraction has 3018 states and 7666 transitions. [2019-01-01 00:33:53,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 00:33:53,592 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 7666 transitions. [2019-01-01 00:33:53,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-01 00:33:53,598 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:33:53,599 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:33:53,600 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:33:53,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:33:53,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1963213381, now seen corresponding path program 2 times [2019-01-01 00:33:53,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:33:53,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:33:53,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:53,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:33:53,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:53,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:33:53,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:33:53,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:33:53,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:33:53,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:33:53,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:33:53,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:33:53,832 INFO L87 Difference]: Start difference. First operand 3018 states and 7666 transitions. Second operand 6 states. [2019-01-01 00:33:54,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:33:54,018 INFO L93 Difference]: Finished difference Result 3143 states and 7873 transitions. [2019-01-01 00:33:54,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 00:33:54,020 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-01-01 00:33:54,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:33:54,025 INFO L225 Difference]: With dead ends: 3143 [2019-01-01 00:33:54,025 INFO L226 Difference]: Without dead ends: 3143 [2019-01-01 00:33:54,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-01-01 00:33:54,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3143 states. [2019-01-01 00:33:54,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3143 to 3033. [2019-01-01 00:33:54,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3033 states. [2019-01-01 00:33:54,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3033 states to 3033 states and 7659 transitions. [2019-01-01 00:33:54,060 INFO L78 Accepts]: Start accepts. Automaton has 3033 states and 7659 transitions. Word has length 93 [2019-01-01 00:33:54,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:33:54,060 INFO L480 AbstractCegarLoop]: Abstraction has 3033 states and 7659 transitions. [2019-01-01 00:33:54,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:33:54,060 INFO L276 IsEmpty]: Start isEmpty. Operand 3033 states and 7659 transitions. [2019-01-01 00:33:54,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-01 00:33:54,064 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:33:54,064 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:33:54,064 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:33:54,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:33:54,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1409070332, now seen corresponding path program 1 times [2019-01-01 00:33:54,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:33:54,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:33:54,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:54,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 00:33:54,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:54,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:33:54,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:33:54,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:33:54,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 00:33:54,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 00:33:54,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 00:33:54,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:33:54,335 INFO L87 Difference]: Start difference. First operand 3033 states and 7659 transitions. Second operand 7 states. [2019-01-01 00:33:54,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:33:54,869 INFO L93 Difference]: Finished difference Result 4247 states and 10942 transitions. [2019-01-01 00:33:54,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 00:33:54,870 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-01-01 00:33:54,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:33:54,876 INFO L225 Difference]: With dead ends: 4247 [2019-01-01 00:33:54,876 INFO L226 Difference]: Without dead ends: 4247 [2019-01-01 00:33:54,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-01-01 00:33:54,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4247 states. [2019-01-01 00:33:54,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4247 to 2690. [2019-01-01 00:33:54,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2690 states. [2019-01-01 00:33:54,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2690 states to 2690 states and 6779 transitions. [2019-01-01 00:33:54,911 INFO L78 Accepts]: Start accepts. Automaton has 2690 states and 6779 transitions. Word has length 93 [2019-01-01 00:33:54,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:33:54,912 INFO L480 AbstractCegarLoop]: Abstraction has 2690 states and 6779 transitions. [2019-01-01 00:33:54,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 00:33:54,912 INFO L276 IsEmpty]: Start isEmpty. Operand 2690 states and 6779 transitions. [2019-01-01 00:33:54,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-01 00:33:54,915 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:33:54,915 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:33:54,916 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:33:54,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:33:54,916 INFO L82 PathProgramCache]: Analyzing trace with hash 494071612, now seen corresponding path program 1 times [2019-01-01 00:33:54,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:33:54,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:33:54,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:54,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:33:54,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:54,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:33:55,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:33:55,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:33:55,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 00:33:55,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 00:33:55,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 00:33:55,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:33:55,157 INFO L87 Difference]: Start difference. First operand 2690 states and 6779 transitions. Second operand 5 states. [2019-01-01 00:33:55,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:33:55,363 INFO L93 Difference]: Finished difference Result 3042 states and 7643 transitions. [2019-01-01 00:33:55,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:33:55,365 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-01-01 00:33:55,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:33:55,369 INFO L225 Difference]: With dead ends: 3042 [2019-01-01 00:33:55,370 INFO L226 Difference]: Without dead ends: 3010 [2019-01-01 00:33:55,370 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 [2019-01-01 00:33:55,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3010 states. [2019-01-01 00:33:55,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3010 to 2506. [2019-01-01 00:33:55,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2506 states. [2019-01-01 00:33:55,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 6320 transitions. [2019-01-01 00:33:55,402 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 6320 transitions. Word has length 93 [2019-01-01 00:33:55,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:33:55,403 INFO L480 AbstractCegarLoop]: Abstraction has 2506 states and 6320 transitions. [2019-01-01 00:33:55,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 00:33:55,403 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 6320 transitions. [2019-01-01 00:33:55,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-01 00:33:55,406 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:33:55,407 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:33:55,407 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:33:55,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:33:55,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1738836093, now seen corresponding path program 1 times [2019-01-01 00:33:55,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:33:55,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:33:55,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:55,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:33:55,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:55,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:33:55,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:33:55,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:33:55,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 00:33:55,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 00:33:55,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 00:33:55,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:33:55,585 INFO L87 Difference]: Start difference. First operand 2506 states and 6320 transitions. Second operand 7 states. [2019-01-01 00:33:55,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:33:55,886 INFO L93 Difference]: Finished difference Result 4157 states and 10703 transitions. [2019-01-01 00:33:55,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 00:33:55,887 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-01-01 00:33:55,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:33:55,891 INFO L225 Difference]: With dead ends: 4157 [2019-01-01 00:33:55,891 INFO L226 Difference]: Without dead ends: 1726 [2019-01-01 00:33:55,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-01-01 00:33:55,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2019-01-01 00:33:55,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 1726. [2019-01-01 00:33:55,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2019-01-01 00:33:55,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 4513 transitions. [2019-01-01 00:33:55,911 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 4513 transitions. Word has length 93 [2019-01-01 00:33:55,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:33:55,911 INFO L480 AbstractCegarLoop]: Abstraction has 1726 states and 4513 transitions. [2019-01-01 00:33:55,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 00:33:55,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 4513 transitions. [2019-01-01 00:33:55,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-01 00:33:55,914 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:33:55,914 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:33:55,914 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:33:55,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:33:55,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1752144950, now seen corresponding path program 1 times [2019-01-01 00:33:55,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:33:55,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:33:55,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:55,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:33:55,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:55,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:33:56,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:33:56,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:33:56,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:33:56,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:33:56,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:33:56,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:33:56,093 INFO L87 Difference]: Start difference. First operand 1726 states and 4513 transitions. Second operand 6 states. [2019-01-01 00:33:56,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:33:56,172 INFO L93 Difference]: Finished difference Result 1812 states and 4666 transitions. [2019-01-01 00:33:56,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:33:56,173 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-01-01 00:33:56,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:33:56,176 INFO L225 Difference]: With dead ends: 1812 [2019-01-01 00:33:56,176 INFO L226 Difference]: Without dead ends: 1792 [2019-01-01 00:33:56,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:33:56,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2019-01-01 00:33:56,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 1718. [2019-01-01 00:33:56,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1718 states. [2019-01-01 00:33:56,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1718 states and 4487 transitions. [2019-01-01 00:33:56,197 INFO L78 Accepts]: Start accepts. Automaton has 1718 states and 4487 transitions. Word has length 93 [2019-01-01 00:33:56,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:33:56,197 INFO L480 AbstractCegarLoop]: Abstraction has 1718 states and 4487 transitions. [2019-01-01 00:33:56,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:33:56,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 4487 transitions. [2019-01-01 00:33:56,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-01 00:33:56,200 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:33:56,200 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:33:56,201 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:33:56,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:33:56,201 INFO L82 PathProgramCache]: Analyzing trace with hash 2094125707, now seen corresponding path program 2 times [2019-01-01 00:33:56,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:33:56,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:33:56,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:56,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:33:56,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:56,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:33:56,433 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-01 00:33:56,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:33:56,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:33:56,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-01 00:33:56,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 00:33:56,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 00:33:56,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-01 00:33:56,516 INFO L87 Difference]: Start difference. First operand 1718 states and 4487 transitions. Second operand 12 states. [2019-01-01 00:33:57,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:33:57,221 INFO L93 Difference]: Finished difference Result 3315 states and 8720 transitions. [2019-01-01 00:33:57,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-01 00:33:57,226 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 93 [2019-01-01 00:33:57,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:33:57,230 INFO L225 Difference]: With dead ends: 3315 [2019-01-01 00:33:57,230 INFO L226 Difference]: Without dead ends: 2339 [2019-01-01 00:33:57,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2019-01-01 00:33:57,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2339 states. [2019-01-01 00:33:57,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2339 to 2187. [2019-01-01 00:33:57,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2187 states. [2019-01-01 00:33:57,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2187 states to 2187 states and 5546 transitions. [2019-01-01 00:33:57,256 INFO L78 Accepts]: Start accepts. Automaton has 2187 states and 5546 transitions. Word has length 93 [2019-01-01 00:33:57,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:33:57,256 INFO L480 AbstractCegarLoop]: Abstraction has 2187 states and 5546 transitions. [2019-01-01 00:33:57,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 00:33:57,257 INFO L276 IsEmpty]: Start isEmpty. Operand 2187 states and 5546 transitions. [2019-01-01 00:33:57,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-01 00:33:57,259 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:33:57,260 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:33:57,260 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:33:57,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:33:57,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1369725745, now seen corresponding path program 3 times [2019-01-01 00:33:57,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:33:57,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:33:57,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:57,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 00:33:57,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:57,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 00:33:57,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 00:33:57,348 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-01 00:33:57,533 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-01 00:33:57,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 12:33:57 BasicIcfg [2019-01-01 00:33:57,535 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 00:33:57,535 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 00:33:57,535 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 00:33:57,536 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 00:33:57,537 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 12:33:18" (3/4) ... [2019-01-01 00:33:57,540 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-01 00:33:57,752 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 00:33:57,752 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 00:33:57,753 INFO L168 Benchmark]: Toolchain (without parser) took 41371.25 ms. Allocated memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: 2.1 GB). Free memory was 951.3 MB in the beginning and 1.7 GB in the end (delta: -729.2 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-01-01 00:33:57,755 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 00:33:57,755 INFO L168 Benchmark]: CACSL2BoogieTranslator took 855.06 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -134.6 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2019-01-01 00:33:57,756 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-01-01 00:33:57,756 INFO L168 Benchmark]: Boogie Preprocessor took 46.11 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 00:33:57,756 INFO L168 Benchmark]: RCFGBuilder took 1315.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 11.5 GB. [2019-01-01 00:33:57,757 INFO L168 Benchmark]: TraceAbstraction took 38847.52 ms. Allocated memory was 1.1 GB in the beginning and 3.1 GB in the end (delta: 1.9 GB). Free memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: -693.9 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-01-01 00:33:57,757 INFO L168 Benchmark]: Witness Printer took 217.20 ms. Allocated memory is still 3.1 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 40.9 MB). Peak memory consumption was 40.9 MB. Max. memory is 11.5 GB. [2019-01-01 00:33:57,760 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.17 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 855.06 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -134.6 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 83.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.11 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1315.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 38847.52 ms. Allocated memory was 1.1 GB in the beginning and 3.1 GB in the end (delta: 1.9 GB). Free memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: -693.9 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 217.20 ms. Allocated memory is still 3.1 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 40.9 MB). Peak memory consumption was 40.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] [L676] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L677] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L678] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L679] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L680] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L681] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L682] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L683] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L684] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L685] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L686] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L687] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L688] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L689] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L691] -1 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L692] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L753] -1 pthread_t t2477; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L754] FCALL, FORK -1 pthread_create(&t2477, ((void *)0), P0, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L755] -1 pthread_t t2478; VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] FCALL, FORK -1 pthread_create(&t2478, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L717] 0 x$w_buff1 = x$w_buff0 [L718] 0 x$w_buff0 = 2 [L719] 0 x$w_buff1_used = x$w_buff0_used [L720] 0 x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L722] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L723] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L724] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L725] 0 x$r_buff0_thd2 = (_Bool)1 [L728] 0 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L731] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L697] 1 y = 2 [L700] 1 x = 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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L703] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L703] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x 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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=2] [L703] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=2] [L703] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L704] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L704] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L705] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L705] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L731] 0 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L706] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L706] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L732] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L733] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L734] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L734] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L735] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 0 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L738] 0 __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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L707] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L707] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L710] 1 __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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L763] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L763] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L764] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L764] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L765] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L765] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L766] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L766] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L769] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L770] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L771] -1 x$flush_delayed = weak$$choice2 [L772] -1 x$mem_tmp = x VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L773] EXPR -1 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L773] -1 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L774] EXPR -1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] -1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L775] EXPR -1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] -1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L776] EXPR -1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L776] -1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L777] EXPR -1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L777] -1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L778] EXPR -1 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L778] -1 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L779] EXPR -1 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L779] -1 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [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=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L781] EXPR -1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L781] -1 x = x$flush_delayed ? x$mem_tmp : x [L782] -1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [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=0, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 178 locations, 3 error locations. UNSAFE Result, 38.6s OverallTime, 29 OverallIterations, 1 TraceHistogramMax, 19.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6642 SDtfs, 6168 SDslu, 15213 SDs, 0 SdLazy, 6874 SolverSat, 355 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 284 GetRequests, 84 SyntacticMatches, 13 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 6.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38086occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 9.2s AutomataMinimizationTime, 28 MinimizatonAttempts, 92493 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 2325 NumberOfCodeBlocks, 2325 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2204 ConstructedInterpolants, 0 QuantifiedInterpolants, 452017 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...