./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/rfi004_rmo.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/rfi004_rmo.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 a6f7774a15cefd0813adba8dfa8b75a7f19867db ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 20:20:35,410 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 20:20:35,412 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 20:20:35,424 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 20:20:35,425 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 20:20:35,426 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 20:20:35,427 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 20:20:35,430 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 20:20:35,432 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 20:20:35,433 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 20:20:35,434 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 20:20:35,434 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 20:20:35,435 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 20:20:35,436 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 20:20:35,438 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 20:20:35,438 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 20:20:35,439 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 20:20:35,442 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 20:20:35,444 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 20:20:35,446 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 20:20:35,447 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 20:20:35,449 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 20:20:35,452 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 20:20:35,452 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 20:20:35,452 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 20:20:35,453 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 20:20:35,454 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 20:20:35,456 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 20:20:35,457 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 20:20:35,458 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 20:20:35,458 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 20:20:35,459 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 20:20:35,459 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 20:20:35,460 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 20:20:35,461 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 20:20:35,462 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 20:20:35,462 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 20:20:35,478 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 20:20:35,479 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 20:20:35,479 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 20:20:35,480 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 20:20:35,481 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 20:20:35,481 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 20:20:35,481 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 20:20:35,481 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 20:20:35,481 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 20:20:35,482 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 20:20:35,482 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 20:20:35,483 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 20:20:35,483 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 20:20:35,483 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 20:20:35,483 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 20:20:35,483 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 20:20:35,483 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 20:20:35,484 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 20:20:35,484 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 20:20:35,484 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 20:20:35,484 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 20:20:35,484 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 20:20:35,484 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 20:20:35,486 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 20:20:35,486 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 20:20:35,486 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 20:20:35,487 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 20:20:35,487 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 20:20:35,487 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 20:20:35,488 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 20:20:35,488 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 -> a6f7774a15cefd0813adba8dfa8b75a7f19867db [2018-11-28 20:20:35,523 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 20:20:35,536 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 20:20:35,540 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 20:20:35,542 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 20:20:35,542 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 20:20:35,543 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/rfi004_rmo.opt_false-unreach-call.i [2018-11-28 20:20:35,603 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7d695134/78a564e471c647ad843e2efa240af52e/FLAG6243ded5e [2018-11-28 20:20:36,101 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 20:20:36,102 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/rfi004_rmo.opt_false-unreach-call.i [2018-11-28 20:20:36,133 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7d695134/78a564e471c647ad843e2efa240af52e/FLAG6243ded5e [2018-11-28 20:20:36,390 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7d695134/78a564e471c647ad843e2efa240af52e [2018-11-28 20:20:36,395 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 20:20:36,397 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 20:20:36,399 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 20:20:36,399 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 20:20:36,403 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 20:20:36,404 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:20:36" (1/1) ... [2018-11-28 20:20:36,409 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70070293 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:36, skipping insertion in model container [2018-11-28 20:20:36,410 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:20:36" (1/1) ... [2018-11-28 20:20:36,420 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 20:20:36,482 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 20:20:37,044 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 20:20:37,067 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 20:20:37,254 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 20:20:37,341 INFO L195 MainTranslator]: Completed translation [2018-11-28 20:20:37,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:37 WrapperNode [2018-11-28 20:20:37,341 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 20:20:37,342 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 20:20:37,343 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 20:20:37,343 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 20:20:37,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:37" (1/1) ... [2018-11-28 20:20:37,376 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:37" (1/1) ... [2018-11-28 20:20:37,409 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 20:20:37,409 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 20:20:37,410 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 20:20:37,410 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 20:20:37,419 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:37" (1/1) ... [2018-11-28 20:20:37,420 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:37" (1/1) ... [2018-11-28 20:20:37,425 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:37" (1/1) ... [2018-11-28 20:20:37,425 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:37" (1/1) ... [2018-11-28 20:20:37,441 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:37" (1/1) ... [2018-11-28 20:20:37,445 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:37" (1/1) ... [2018-11-28 20:20:37,449 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:37" (1/1) ... [2018-11-28 20:20:37,453 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 20:20:37,454 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 20:20:37,454 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 20:20:37,454 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 20:20:37,455 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 20:20:37,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 20:20:37,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 20:20:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-11-28 20:20:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 20:20:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-11-28 20:20:37,518 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-11-28 20:20:37,518 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-11-28 20:20:37,518 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-11-28 20:20:37,518 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-11-28 20:20:37,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 20:20:37,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 20:20:37,520 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-11-28 20:20:38,586 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 20:20:38,586 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 20:20:38,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:20:38 BoogieIcfgContainer [2018-11-28 20:20:38,587 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 20:20:38,588 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 20:20:38,588 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 20:20:38,591 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 20:20:38,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:20:36" (1/3) ... [2018-11-28 20:20:38,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@230b9b85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:20:38, skipping insertion in model container [2018-11-28 20:20:38,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:37" (2/3) ... [2018-11-28 20:20:38,593 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@230b9b85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:20:38, skipping insertion in model container [2018-11-28 20:20:38,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:20:38" (3/3) ... [2018-11-28 20:20:38,595 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi004_rmo.opt_false-unreach-call.i [2018-11-28 20:20:38,642 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,642 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,642 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,642 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,643 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,643 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,643 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,643 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,644 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,645 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,645 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,646 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,646 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,646 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,646 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,648 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,648 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,648 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,649 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,649 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,649 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,649 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,650 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,651 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,651 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,651 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,651 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,651 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,652 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,652 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,652 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,652 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,652 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,652 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,654 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,655 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,655 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,655 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,655 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,655 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,656 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,657 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,657 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,657 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,657 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,657 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,657 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,659 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,659 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,659 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,659 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,659 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,660 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,661 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,661 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,661 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,661 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,661 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,662 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,662 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,662 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,662 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,662 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,664 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,664 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,665 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,665 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,665 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,665 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,666 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,667 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,667 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,668 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,668 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,668 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,668 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,669 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,669 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,669 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,669 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,670 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,670 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,670 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,672 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,672 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,673 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,673 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,673 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,673 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,673 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,675 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,675 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,675 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,675 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,675 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,676 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,676 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,676 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,678 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,678 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,679 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,679 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,679 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,679 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,680 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,681 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,681 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,681 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,682 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,682 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,683 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,683 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,683 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,683 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,684 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,684 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,684 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,684 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,684 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,686 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,687 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,687 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,687 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,687 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,688 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,688 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,688 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,688 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,689 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,689 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,689 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,689 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,689 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,690 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,690 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,690 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:38,716 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-11-28 20:20:38,716 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 20:20:38,727 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-28 20:20:38,745 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-28 20:20:38,772 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 20:20:38,773 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 20:20:38,773 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 20:20:38,773 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 20:20:38,773 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 20:20:38,774 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 20:20:38,774 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 20:20:38,774 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 20:20:38,774 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 20:20:38,789 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 132places, 164 transitions [2018-11-28 20:20:40,657 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27856 states. [2018-11-28 20:20:40,659 INFO L276 IsEmpty]: Start isEmpty. Operand 27856 states. [2018-11-28 20:20:40,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-28 20:20:40,669 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:40,670 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:20:40,673 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:40,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:40,680 INFO L82 PathProgramCache]: Analyzing trace with hash -31372928, now seen corresponding path program 1 times [2018-11-28 20:20:40,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:40,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:40,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:40,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:40,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:40,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:41,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:20:41,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:41,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:20:41,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:20:41,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:20:41,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:20:41,135 INFO L87 Difference]: Start difference. First operand 27856 states. Second operand 4 states. [2018-11-28 20:20:42,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:42,318 INFO L93 Difference]: Finished difference Result 47768 states and 183119 transitions. [2018-11-28 20:20:42,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:20:42,321 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-11-28 20:20:42,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:42,950 INFO L225 Difference]: With dead ends: 47768 [2018-11-28 20:20:42,950 INFO L226 Difference]: Without dead ends: 34608 [2018-11-28 20:20:42,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:20:43,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34608 states. [2018-11-28 20:20:44,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34608 to 21756. [2018-11-28 20:20:44,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21756 states. [2018-11-28 20:20:44,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21756 states to 21756 states and 83441 transitions. [2018-11-28 20:20:44,188 INFO L78 Accepts]: Start accepts. Automaton has 21756 states and 83441 transitions. Word has length 39 [2018-11-28 20:20:44,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:44,190 INFO L480 AbstractCegarLoop]: Abstraction has 21756 states and 83441 transitions. [2018-11-28 20:20:44,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:20:44,190 INFO L276 IsEmpty]: Start isEmpty. Operand 21756 states and 83441 transitions. [2018-11-28 20:20:44,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-28 20:20:44,201 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:44,201 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] [2018-11-28 20:20:44,202 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:44,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:44,202 INFO L82 PathProgramCache]: Analyzing trace with hash -954263015, now seen corresponding path program 1 times [2018-11-28 20:20:44,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:44,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:44,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:44,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:44,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:44,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:44,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:20:44,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:44,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:20:44,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:20:44,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:20:44,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:20:44,463 INFO L87 Difference]: Start difference. First operand 21756 states and 83441 transitions. Second operand 4 states. [2018-11-28 20:20:44,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:44,817 INFO L93 Difference]: Finished difference Result 7170 states and 23626 transitions. [2018-11-28 20:20:44,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:20:44,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-11-28 20:20:44,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:44,860 INFO L225 Difference]: With dead ends: 7170 [2018-11-28 20:20:44,860 INFO L226 Difference]: Without dead ends: 6324 [2018-11-28 20:20:44,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:20:44,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6324 states. [2018-11-28 20:20:45,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6324 to 6324. [2018-11-28 20:20:45,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6324 states. [2018-11-28 20:20:45,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6324 states to 6324 states and 20698 transitions. [2018-11-28 20:20:45,076 INFO L78 Accepts]: Start accepts. Automaton has 6324 states and 20698 transitions. Word has length 47 [2018-11-28 20:20:45,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:45,077 INFO L480 AbstractCegarLoop]: Abstraction has 6324 states and 20698 transitions. [2018-11-28 20:20:45,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:20:45,077 INFO L276 IsEmpty]: Start isEmpty. Operand 6324 states and 20698 transitions. [2018-11-28 20:20:45,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-28 20:20:45,081 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:45,082 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:20:45,082 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:45,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:45,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1367871073, now seen corresponding path program 1 times [2018-11-28 20:20:45,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:45,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:45,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:45,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:45,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:45,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:45,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:20:45,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:45,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:20:45,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:20:45,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:20:45,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:20:45,713 INFO L87 Difference]: Start difference. First operand 6324 states and 20698 transitions. Second operand 5 states. [2018-11-28 20:20:46,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:46,870 INFO L93 Difference]: Finished difference Result 12020 states and 38784 transitions. [2018-11-28 20:20:46,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:20:46,879 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-11-28 20:20:46,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:46,924 INFO L225 Difference]: With dead ends: 12020 [2018-11-28 20:20:46,924 INFO L226 Difference]: Without dead ends: 11945 [2018-11-28 20:20:46,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:20:46,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11945 states. [2018-11-28 20:20:47,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11945 to 8289. [2018-11-28 20:20:47,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8289 states. [2018-11-28 20:20:47,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8289 states to 8289 states and 26551 transitions. [2018-11-28 20:20:47,160 INFO L78 Accepts]: Start accepts. Automaton has 8289 states and 26551 transitions. Word has length 48 [2018-11-28 20:20:47,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:47,162 INFO L480 AbstractCegarLoop]: Abstraction has 8289 states and 26551 transitions. [2018-11-28 20:20:47,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:20:47,163 INFO L276 IsEmpty]: Start isEmpty. Operand 8289 states and 26551 transitions. [2018-11-28 20:20:47,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-28 20:20:47,166 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:47,166 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] [2018-11-28 20:20:47,166 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:47,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:47,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1372813561, now seen corresponding path program 1 times [2018-11-28 20:20:47,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:47,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:47,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:47,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:47,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:47,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:47,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:20:47,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:47,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:20:47,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:20:47,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:20:47,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:20:47,290 INFO L87 Difference]: Start difference. First operand 8289 states and 26551 transitions. Second operand 3 states. [2018-11-28 20:20:47,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:47,471 INFO L93 Difference]: Finished difference Result 10985 states and 34706 transitions. [2018-11-28 20:20:47,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:20:47,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-11-28 20:20:47,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:47,505 INFO L225 Difference]: With dead ends: 10985 [2018-11-28 20:20:47,505 INFO L226 Difference]: Without dead ends: 10981 [2018-11-28 20:20:47,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:20:47,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10981 states. [2018-11-28 20:20:47,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10981 to 8507. [2018-11-28 20:20:47,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8507 states. [2018-11-28 20:20:47,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8507 states to 8507 states and 26987 transitions. [2018-11-28 20:20:47,733 INFO L78 Accepts]: Start accepts. Automaton has 8507 states and 26987 transitions. Word has length 50 [2018-11-28 20:20:47,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:47,734 INFO L480 AbstractCegarLoop]: Abstraction has 8507 states and 26987 transitions. [2018-11-28 20:20:47,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:20:47,734 INFO L276 IsEmpty]: Start isEmpty. Operand 8507 states and 26987 transitions. [2018-11-28 20:20:47,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-28 20:20:47,738 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:47,739 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] [2018-11-28 20:20:47,739 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:47,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:47,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1505170194, now seen corresponding path program 1 times [2018-11-28 20:20:47,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:47,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:47,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:47,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:47,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:47,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:47,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:20:47,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:47,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:20:47,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:20:47,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:20:47,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:20:47,963 INFO L87 Difference]: Start difference. First operand 8507 states and 26987 transitions. Second operand 6 states. [2018-11-28 20:20:48,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:48,688 INFO L93 Difference]: Finished difference Result 11923 states and 37198 transitions. [2018-11-28 20:20:48,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 20:20:48,690 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-11-28 20:20:48,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:48,726 INFO L225 Difference]: With dead ends: 11923 [2018-11-28 20:20:48,726 INFO L226 Difference]: Without dead ends: 11826 [2018-11-28 20:20:48,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-11-28 20:20:48,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11826 states. [2018-11-28 20:20:49,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11826 to 9281. [2018-11-28 20:20:49,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9281 states. [2018-11-28 20:20:49,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9281 states to 9281 states and 29431 transitions. [2018-11-28 20:20:49,252 INFO L78 Accepts]: Start accepts. Automaton has 9281 states and 29431 transitions. Word has length 54 [2018-11-28 20:20:49,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:49,253 INFO L480 AbstractCegarLoop]: Abstraction has 9281 states and 29431 transitions. [2018-11-28 20:20:49,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:20:49,254 INFO L276 IsEmpty]: Start isEmpty. Operand 9281 states and 29431 transitions. [2018-11-28 20:20:49,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-28 20:20:49,266 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:49,267 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:20:49,267 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:49,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:49,267 INFO L82 PathProgramCache]: Analyzing trace with hash 2067258406, now seen corresponding path program 1 times [2018-11-28 20:20:49,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:49,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:49,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:49,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:49,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:49,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:49,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:20:49,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:49,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:20:49,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:20:49,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:20:49,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:20:49,449 INFO L87 Difference]: Start difference. First operand 9281 states and 29431 transitions. Second operand 4 states. [2018-11-28 20:20:49,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:49,752 INFO L93 Difference]: Finished difference Result 10900 states and 34382 transitions. [2018-11-28 20:20:49,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:20:49,762 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-11-28 20:20:49,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:49,789 INFO L225 Difference]: With dead ends: 10900 [2018-11-28 20:20:49,789 INFO L226 Difference]: Without dead ends: 10900 [2018-11-28 20:20:49,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:20:49,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10900 states. [2018-11-28 20:20:49,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10900 to 9932. [2018-11-28 20:20:49,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9932 states. [2018-11-28 20:20:50,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9932 states to 9932 states and 31408 transitions. [2018-11-28 20:20:50,021 INFO L78 Accepts]: Start accepts. Automaton has 9932 states and 31408 transitions. Word has length 64 [2018-11-28 20:20:50,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:50,022 INFO L480 AbstractCegarLoop]: Abstraction has 9932 states and 31408 transitions. [2018-11-28 20:20:50,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:20:50,023 INFO L276 IsEmpty]: Start isEmpty. Operand 9932 states and 31408 transitions. [2018-11-28 20:20:50,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-28 20:20:50,035 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:50,035 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:20:50,035 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:50,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:50,036 INFO L82 PathProgramCache]: Analyzing trace with hash -484898555, now seen corresponding path program 1 times [2018-11-28 20:20:50,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:50,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:50,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:50,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:50,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:50,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:50,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:20:50,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:50,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:20:50,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:20:50,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:20:50,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:20:50,301 INFO L87 Difference]: Start difference. First operand 9932 states and 31408 transitions. Second operand 5 states. [2018-11-28 20:20:50,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:50,591 INFO L93 Difference]: Finished difference Result 2984 states and 7669 transitions. [2018-11-28 20:20:50,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 20:20:50,592 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2018-11-28 20:20:50,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:50,596 INFO L225 Difference]: With dead ends: 2984 [2018-11-28 20:20:50,596 INFO L226 Difference]: Without dead ends: 2432 [2018-11-28 20:20:50,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:20:50,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2432 states. [2018-11-28 20:20:50,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2432 to 2314. [2018-11-28 20:20:50,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2314 states. [2018-11-28 20:20:50,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2314 states to 2314 states and 5795 transitions. [2018-11-28 20:20:50,643 INFO L78 Accepts]: Start accepts. Automaton has 2314 states and 5795 transitions. Word has length 64 [2018-11-28 20:20:50,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:50,643 INFO L480 AbstractCegarLoop]: Abstraction has 2314 states and 5795 transitions. [2018-11-28 20:20:50,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:20:50,644 INFO L276 IsEmpty]: Start isEmpty. Operand 2314 states and 5795 transitions. [2018-11-28 20:20:50,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-28 20:20:50,651 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:50,652 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:20:50,652 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:50,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:50,652 INFO L82 PathProgramCache]: Analyzing trace with hash 509538274, now seen corresponding path program 1 times [2018-11-28 20:20:50,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:50,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:50,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:50,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:50,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:50,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:51,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:20:51,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:51,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:20:51,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:20:51,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:20:51,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:20:51,036 INFO L87 Difference]: Start difference. First operand 2314 states and 5795 transitions. Second operand 6 states. [2018-11-28 20:20:51,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:51,925 INFO L93 Difference]: Finished difference Result 3320 states and 8247 transitions. [2018-11-28 20:20:51,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:20:51,926 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-11-28 20:20:51,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:51,931 INFO L225 Difference]: With dead ends: 3320 [2018-11-28 20:20:51,932 INFO L226 Difference]: Without dead ends: 3274 [2018-11-28 20:20:51,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:20:51,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3274 states. [2018-11-28 20:20:51,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3274 to 3070. [2018-11-28 20:20:51,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3070 states. [2018-11-28 20:20:51,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3070 states to 3070 states and 7707 transitions. [2018-11-28 20:20:51,985 INFO L78 Accepts]: Start accepts. Automaton has 3070 states and 7707 transitions. Word has length 83 [2018-11-28 20:20:51,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:51,985 INFO L480 AbstractCegarLoop]: Abstraction has 3070 states and 7707 transitions. [2018-11-28 20:20:51,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:20:51,986 INFO L276 IsEmpty]: Start isEmpty. Operand 3070 states and 7707 transitions. [2018-11-28 20:20:51,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-28 20:20:51,996 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:51,996 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:20:51,996 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:51,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:51,997 INFO L82 PathProgramCache]: Analyzing trace with hash 158738337, now seen corresponding path program 1 times [2018-11-28 20:20:51,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:51,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:52,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:52,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:52,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:52,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:52,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:20:52,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:52,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:20:52,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:20:52,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:20:52,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:20:52,321 INFO L87 Difference]: Start difference. First operand 3070 states and 7707 transitions. Second operand 4 states. [2018-11-28 20:20:52,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:52,666 INFO L93 Difference]: Finished difference Result 3955 states and 9598 transitions. [2018-11-28 20:20:52,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:20:52,667 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-11-28 20:20:52,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:52,673 INFO L225 Difference]: With dead ends: 3955 [2018-11-28 20:20:52,673 INFO L226 Difference]: Without dead ends: 3885 [2018-11-28 20:20:52,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:20:52,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3885 states. [2018-11-28 20:20:52,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3885 to 3448. [2018-11-28 20:20:52,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3448 states. [2018-11-28 20:20:52,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3448 states to 3448 states and 8443 transitions. [2018-11-28 20:20:52,730 INFO L78 Accepts]: Start accepts. Automaton has 3448 states and 8443 transitions. Word has length 83 [2018-11-28 20:20:52,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:52,730 INFO L480 AbstractCegarLoop]: Abstraction has 3448 states and 8443 transitions. [2018-11-28 20:20:52,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:20:52,730 INFO L276 IsEmpty]: Start isEmpty. Operand 3448 states and 8443 transitions. [2018-11-28 20:20:52,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-28 20:20:52,740 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:52,740 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:20:52,740 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:52,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:52,742 INFO L82 PathProgramCache]: Analyzing trace with hash -141001310, now seen corresponding path program 2 times [2018-11-28 20:20:52,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:52,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:52,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:52,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:52,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:52,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:52,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:20:52,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:52,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:20:52,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:20:52,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:20:52,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:20:52,918 INFO L87 Difference]: Start difference. First operand 3448 states and 8443 transitions. Second operand 4 states. [2018-11-28 20:20:53,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:53,432 INFO L93 Difference]: Finished difference Result 4796 states and 11380 transitions. [2018-11-28 20:20:53,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:20:53,433 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-11-28 20:20:53,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:53,440 INFO L225 Difference]: With dead ends: 4796 [2018-11-28 20:20:53,441 INFO L226 Difference]: Without dead ends: 4796 [2018-11-28 20:20:53,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:20:53,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4796 states. [2018-11-28 20:20:53,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4796 to 3375. [2018-11-28 20:20:53,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3375 states. [2018-11-28 20:20:53,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3375 states to 3375 states and 8133 transitions. [2018-11-28 20:20:53,499 INFO L78 Accepts]: Start accepts. Automaton has 3375 states and 8133 transitions. Word has length 83 [2018-11-28 20:20:53,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:53,499 INFO L480 AbstractCegarLoop]: Abstraction has 3375 states and 8133 transitions. [2018-11-28 20:20:53,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:20:53,499 INFO L276 IsEmpty]: Start isEmpty. Operand 3375 states and 8133 transitions. [2018-11-28 20:20:53,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-28 20:20:53,508 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:53,508 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:20:53,508 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:53,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:53,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1672331041, now seen corresponding path program 2 times [2018-11-28 20:20:53,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:53,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:53,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:53,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 20:20:53,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:53,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:53,677 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-28 20:20:53,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:20:53,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:53,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:20:53,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:20:53,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:20:53,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:20:53,892 INFO L87 Difference]: Start difference. First operand 3375 states and 8133 transitions. Second operand 7 states. [2018-11-28 20:20:54,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:54,604 INFO L93 Difference]: Finished difference Result 4714 states and 11247 transitions. [2018-11-28 20:20:54,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:20:54,605 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2018-11-28 20:20:54,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:54,613 INFO L225 Difference]: With dead ends: 4714 [2018-11-28 20:20:54,614 INFO L226 Difference]: Without dead ends: 4714 [2018-11-28 20:20:54,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:20:54,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4714 states. [2018-11-28 20:20:54,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4714 to 3566. [2018-11-28 20:20:54,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3566 states. [2018-11-28 20:20:54,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3566 states to 3566 states and 8627 transitions. [2018-11-28 20:20:54,694 INFO L78 Accepts]: Start accepts. Automaton has 3566 states and 8627 transitions. Word has length 83 [2018-11-28 20:20:54,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:54,694 INFO L480 AbstractCegarLoop]: Abstraction has 3566 states and 8627 transitions. [2018-11-28 20:20:54,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:20:54,696 INFO L276 IsEmpty]: Start isEmpty. Operand 3566 states and 8627 transitions. [2018-11-28 20:20:54,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-28 20:20:54,705 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:54,705 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:20:54,705 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:54,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:54,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1674138653, now seen corresponding path program 1 times [2018-11-28 20:20:54,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:54,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:54,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:54,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 20:20:54,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:54,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:55,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:20:55,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:55,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:20:55,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:20:55,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:20:55,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:20:55,022 INFO L87 Difference]: Start difference. First operand 3566 states and 8627 transitions. Second operand 6 states. [2018-11-28 20:20:55,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:55,554 INFO L93 Difference]: Finished difference Result 3936 states and 9293 transitions. [2018-11-28 20:20:55,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 20:20:55,555 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-11-28 20:20:55,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:55,560 INFO L225 Difference]: With dead ends: 3936 [2018-11-28 20:20:55,560 INFO L226 Difference]: Without dead ends: 3936 [2018-11-28 20:20:55,561 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 [2018-11-28 20:20:55,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3936 states. [2018-11-28 20:20:55,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3936 to 3529. [2018-11-28 20:20:55,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3529 states. [2018-11-28 20:20:55,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3529 states to 3529 states and 8382 transitions. [2018-11-28 20:20:55,619 INFO L78 Accepts]: Start accepts. Automaton has 3529 states and 8382 transitions. Word has length 83 [2018-11-28 20:20:55,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:55,619 INFO L480 AbstractCegarLoop]: Abstraction has 3529 states and 8382 transitions. [2018-11-28 20:20:55,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:20:55,619 INFO L276 IsEmpty]: Start isEmpty. Operand 3529 states and 8382 transitions. [2018-11-28 20:20:55,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-28 20:20:55,627 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:55,628 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:20:55,628 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:55,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:55,628 INFO L82 PathProgramCache]: Analyzing trace with hash -981036956, now seen corresponding path program 1 times [2018-11-28 20:20:55,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:55,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:55,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:55,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:55,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:55,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:55,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:20:55,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:55,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:20:55,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:20:55,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:20:55,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:20:55,919 INFO L87 Difference]: Start difference. First operand 3529 states and 8382 transitions. Second operand 5 states. [2018-11-28 20:20:56,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:56,425 INFO L93 Difference]: Finished difference Result 4772 states and 11094 transitions. [2018-11-28 20:20:56,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:20:56,427 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2018-11-28 20:20:56,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:56,433 INFO L225 Difference]: With dead ends: 4772 [2018-11-28 20:20:56,433 INFO L226 Difference]: Without dead ends: 4748 [2018-11-28 20:20:56,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:20:56,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4748 states. [2018-11-28 20:20:56,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4748 to 3792. [2018-11-28 20:20:56,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3792 states. [2018-11-28 20:20:56,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3792 states to 3792 states and 8910 transitions. [2018-11-28 20:20:56,485 INFO L78 Accepts]: Start accepts. Automaton has 3792 states and 8910 transitions. Word has length 83 [2018-11-28 20:20:56,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:56,485 INFO L480 AbstractCegarLoop]: Abstraction has 3792 states and 8910 transitions. [2018-11-28 20:20:56,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:20:56,485 INFO L276 IsEmpty]: Start isEmpty. Operand 3792 states and 8910 transitions. [2018-11-28 20:20:56,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-28 20:20:56,493 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:56,493 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:20:56,493 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:56,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:56,493 INFO L82 PathProgramCache]: Analyzing trace with hash -402444083, now seen corresponding path program 3 times [2018-11-28 20:20:56,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:56,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:56,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:56,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:56,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:56,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:56,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:20:56,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:56,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:20:56,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:20:56,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:20:56,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:20:56,626 INFO L87 Difference]: Start difference. First operand 3792 states and 8910 transitions. Second operand 4 states. [2018-11-28 20:20:56,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:56,767 INFO L93 Difference]: Finished difference Result 4000 states and 9446 transitions. [2018-11-28 20:20:56,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:20:56,768 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-11-28 20:20:56,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:56,774 INFO L225 Difference]: With dead ends: 4000 [2018-11-28 20:20:56,774 INFO L226 Difference]: Without dead ends: 4000 [2018-11-28 20:20:56,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:20:56,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4000 states. [2018-11-28 20:20:56,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4000 to 3856. [2018-11-28 20:20:56,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3856 states. [2018-11-28 20:20:56,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3856 states to 3856 states and 9086 transitions. [2018-11-28 20:20:56,828 INFO L78 Accepts]: Start accepts. Automaton has 3856 states and 9086 transitions. Word has length 83 [2018-11-28 20:20:56,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:56,828 INFO L480 AbstractCegarLoop]: Abstraction has 3856 states and 9086 transitions. [2018-11-28 20:20:56,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:20:56,828 INFO L276 IsEmpty]: Start isEmpty. Operand 3856 states and 9086 transitions. [2018-11-28 20:20:56,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-28 20:20:56,834 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:56,835 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:20:56,835 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:56,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:56,835 INFO L82 PathProgramCache]: Analyzing trace with hash 2085068750, now seen corresponding path program 1 times [2018-11-28 20:20:56,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:56,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:56,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:56,837 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 20:20:56,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:56,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:57,469 WARN L180 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 10 [2018-11-28 20:20:57,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:20:57,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:57,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:20:57,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:20:57,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:20:57,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:20:57,588 INFO L87 Difference]: Start difference. First operand 3856 states and 9086 transitions. Second operand 6 states. [2018-11-28 20:20:58,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:58,414 INFO L93 Difference]: Finished difference Result 5095 states and 11979 transitions. [2018-11-28 20:20:58,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:20:58,415 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-11-28 20:20:58,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:58,422 INFO L225 Difference]: With dead ends: 5095 [2018-11-28 20:20:58,422 INFO L226 Difference]: Without dead ends: 5063 [2018-11-28 20:20:58,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:20:58,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5063 states. [2018-11-28 20:20:58,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5063 to 4647. [2018-11-28 20:20:58,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4647 states. [2018-11-28 20:20:58,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4647 states to 4647 states and 11013 transitions. [2018-11-28 20:20:58,482 INFO L78 Accepts]: Start accepts. Automaton has 4647 states and 11013 transitions. Word has length 83 [2018-11-28 20:20:58,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:58,483 INFO L480 AbstractCegarLoop]: Abstraction has 4647 states and 11013 transitions. [2018-11-28 20:20:58,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:20:58,483 INFO L276 IsEmpty]: Start isEmpty. Operand 4647 states and 11013 transitions. [2018-11-28 20:20:58,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-28 20:20:58,491 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:58,491 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:20:58,491 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:58,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:58,492 INFO L82 PathProgramCache]: Analyzing trace with hash 288117391, now seen corresponding path program 1 times [2018-11-28 20:20:58,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:58,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:58,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:58,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:58,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:58,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:58,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:20:58,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:58,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:20:58,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:20:58,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:20:58,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:20:58,729 INFO L87 Difference]: Start difference. First operand 4647 states and 11013 transitions. Second operand 7 states. [2018-11-28 20:20:59,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:59,354 INFO L93 Difference]: Finished difference Result 7129 states and 17256 transitions. [2018-11-28 20:20:59,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 20:20:59,355 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2018-11-28 20:20:59,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:59,364 INFO L225 Difference]: With dead ends: 7129 [2018-11-28 20:20:59,365 INFO L226 Difference]: Without dead ends: 7129 [2018-11-28 20:20:59,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-11-28 20:20:59,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7129 states. [2018-11-28 20:20:59,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7129 to 5397. [2018-11-28 20:20:59,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5397 states. [2018-11-28 20:20:59,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5397 states to 5397 states and 12944 transitions. [2018-11-28 20:20:59,443 INFO L78 Accepts]: Start accepts. Automaton has 5397 states and 12944 transitions. Word has length 83 [2018-11-28 20:20:59,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:59,443 INFO L480 AbstractCegarLoop]: Abstraction has 5397 states and 12944 transitions. [2018-11-28 20:20:59,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:20:59,443 INFO L276 IsEmpty]: Start isEmpty. Operand 5397 states and 12944 transitions. [2018-11-28 20:20:59,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-28 20:20:59,451 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:59,451 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:20:59,452 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:59,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:59,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1175621072, now seen corresponding path program 1 times [2018-11-28 20:20:59,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:59,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:59,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:59,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:59,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:59,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:59,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:20:59,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:59,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:20:59,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:20:59,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:20:59,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:20:59,552 INFO L87 Difference]: Start difference. First operand 5397 states and 12944 transitions. Second operand 3 states. [2018-11-28 20:20:59,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:59,626 INFO L93 Difference]: Finished difference Result 5045 states and 11840 transitions. [2018-11-28 20:20:59,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:20:59,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-11-28 20:20:59,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:59,636 INFO L225 Difference]: With dead ends: 5045 [2018-11-28 20:20:59,636 INFO L226 Difference]: Without dead ends: 5013 [2018-11-28 20:20:59,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:20:59,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5013 states. [2018-11-28 20:20:59,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5013 to 3841. [2018-11-28 20:20:59,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3841 states. [2018-11-28 20:20:59,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3841 states to 3841 states and 9018 transitions. [2018-11-28 20:20:59,694 INFO L78 Accepts]: Start accepts. Automaton has 3841 states and 9018 transitions. Word has length 83 [2018-11-28 20:20:59,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:59,694 INFO L480 AbstractCegarLoop]: Abstraction has 3841 states and 9018 transitions. [2018-11-28 20:20:59,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:20:59,695 INFO L276 IsEmpty]: Start isEmpty. Operand 3841 states and 9018 transitions. [2018-11-28 20:20:59,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-28 20:20:59,704 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:59,704 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] [2018-11-28 20:20:59,704 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:59,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:59,705 INFO L82 PathProgramCache]: Analyzing trace with hash -901530196, now seen corresponding path program 1 times [2018-11-28 20:20:59,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:59,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:59,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:59,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:59,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:59,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:59,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:20:59,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:59,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:20:59,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:20:59,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:20:59,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:20:59,886 INFO L87 Difference]: Start difference. First operand 3841 states and 9018 transitions. Second operand 4 states. [2018-11-28 20:21:00,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:21:00,041 INFO L93 Difference]: Finished difference Result 3841 states and 8986 transitions. [2018-11-28 20:21:00,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:21:00,042 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2018-11-28 20:21:00,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:21:00,048 INFO L225 Difference]: With dead ends: 3841 [2018-11-28 20:21:00,049 INFO L226 Difference]: Without dead ends: 3841 [2018-11-28 20:21:00,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:21:00,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3841 states. [2018-11-28 20:21:00,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3841 to 3150. [2018-11-28 20:21:00,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3150 states. [2018-11-28 20:21:00,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3150 states to 3150 states and 7370 transitions. [2018-11-28 20:21:00,089 INFO L78 Accepts]: Start accepts. Automaton has 3150 states and 7370 transitions. Word has length 85 [2018-11-28 20:21:00,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:21:00,089 INFO L480 AbstractCegarLoop]: Abstraction has 3150 states and 7370 transitions. [2018-11-28 20:21:00,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:21:00,089 INFO L276 IsEmpty]: Start isEmpty. Operand 3150 states and 7370 transitions. [2018-11-28 20:21:00,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-28 20:21:00,094 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:21:00,095 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:21:00,095 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:21:00,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:21:00,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1085951564, now seen corresponding path program 1 times [2018-11-28 20:21:00,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:21:00,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:21:00,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:21:00,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:21:00,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:21:00,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:21:00,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:21:00,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:21:00,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 20:21:00,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 20:21:00,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 20:21:00,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:21:00,281 INFO L87 Difference]: Start difference. First operand 3150 states and 7370 transitions. Second operand 8 states. [2018-11-28 20:21:00,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:21:00,715 INFO L93 Difference]: Finished difference Result 3990 states and 9196 transitions. [2018-11-28 20:21:00,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 20:21:00,717 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 85 [2018-11-28 20:21:00,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:21:00,722 INFO L225 Difference]: With dead ends: 3990 [2018-11-28 20:21:00,722 INFO L226 Difference]: Without dead ends: 3990 [2018-11-28 20:21:00,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2018-11-28 20:21:00,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3990 states. [2018-11-28 20:21:00,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3990 to 3817. [2018-11-28 20:21:00,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3817 states. [2018-11-28 20:21:00,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3817 states to 3817 states and 8851 transitions. [2018-11-28 20:21:00,768 INFO L78 Accepts]: Start accepts. Automaton has 3817 states and 8851 transitions. Word has length 85 [2018-11-28 20:21:00,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:21:00,769 INFO L480 AbstractCegarLoop]: Abstraction has 3817 states and 8851 transitions. [2018-11-28 20:21:00,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 20:21:00,769 INFO L276 IsEmpty]: Start isEmpty. Operand 3817 states and 8851 transitions. [2018-11-28 20:21:00,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-28 20:21:00,776 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:21:00,776 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] [2018-11-28 20:21:00,776 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:21:00,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:21:00,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1973455245, now seen corresponding path program 1 times [2018-11-28 20:21:00,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:21:00,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:21:00,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:21:00,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:21:00,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:21:00,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:21:00,973 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-28 20:21:01,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:21:01,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:21:01,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 20:21:01,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 20:21:01,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 20:21:01,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-28 20:21:01,046 INFO L87 Difference]: Start difference. First operand 3817 states and 8851 transitions. Second operand 10 states. [2018-11-28 20:21:02,261 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2018-11-28 20:21:02,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:21:02,920 INFO L93 Difference]: Finished difference Result 6518 states and 15118 transitions. [2018-11-28 20:21:02,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 20:21:02,921 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 85 [2018-11-28 20:21:02,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:21:02,927 INFO L225 Difference]: With dead ends: 6518 [2018-11-28 20:21:02,927 INFO L226 Difference]: Without dead ends: 4568 [2018-11-28 20:21:02,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-11-28 20:21:02,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4568 states. [2018-11-28 20:21:02,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4568 to 3903. [2018-11-28 20:21:02,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3903 states. [2018-11-28 20:21:02,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3903 states to 3903 states and 8989 transitions. [2018-11-28 20:21:02,980 INFO L78 Accepts]: Start accepts. Automaton has 3903 states and 8989 transitions. Word has length 85 [2018-11-28 20:21:02,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:21:02,981 INFO L480 AbstractCegarLoop]: Abstraction has 3903 states and 8989 transitions. [2018-11-28 20:21:02,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 20:21:02,981 INFO L276 IsEmpty]: Start isEmpty. Operand 3903 states and 8989 transitions. [2018-11-28 20:21:02,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-28 20:21:02,988 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:21:02,988 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] [2018-11-28 20:21:02,988 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:21:02,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:21:02,989 INFO L82 PathProgramCache]: Analyzing trace with hash -749097736, now seen corresponding path program 1 times [2018-11-28 20:21:02,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:21:02,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:21:02,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:21:02,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:21:02,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:21:03,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:21:03,373 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-11-28 20:21:03,684 WARN L180 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 16 [2018-11-28 20:21:03,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:21:03,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:21:03,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:21:03,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:21:03,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:21:03,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:21:03,695 INFO L87 Difference]: Start difference. First operand 3903 states and 8989 transitions. Second operand 6 states. [2018-11-28 20:21:03,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:21:03,901 INFO L93 Difference]: Finished difference Result 4466 states and 10147 transitions. [2018-11-28 20:21:03,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:21:03,902 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2018-11-28 20:21:03,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:21:03,908 INFO L225 Difference]: With dead ends: 4466 [2018-11-28 20:21:03,908 INFO L226 Difference]: Without dead ends: 4364 [2018-11-28 20:21:03,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:21:03,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4364 states. [2018-11-28 20:21:03,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4364 to 3666. [2018-11-28 20:21:03,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3666 states. [2018-11-28 20:21:03,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3666 states to 3666 states and 8316 transitions. [2018-11-28 20:21:03,952 INFO L78 Accepts]: Start accepts. Automaton has 3666 states and 8316 transitions. Word has length 85 [2018-11-28 20:21:03,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:21:03,952 INFO L480 AbstractCegarLoop]: Abstraction has 3666 states and 8316 transitions. [2018-11-28 20:21:03,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:21:03,953 INFO L276 IsEmpty]: Start isEmpty. Operand 3666 states and 8316 transitions. [2018-11-28 20:21:03,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-28 20:21:03,959 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:21:03,959 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:21:03,959 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:21:03,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:21:03,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1468660217, now seen corresponding path program 2 times [2018-11-28 20:21:03,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:21:03,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:21:03,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:21:03,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:21:03,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:21:03,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:21:04,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:21:04,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:21:04,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 20:21:04,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 20:21:04,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 20:21:04,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-28 20:21:04,176 INFO L87 Difference]: Start difference. First operand 3666 states and 8316 transitions. Second operand 10 states. [2018-11-28 20:21:04,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:21:04,910 INFO L93 Difference]: Finished difference Result 6983 states and 15918 transitions. [2018-11-28 20:21:04,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 20:21:04,911 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 85 [2018-11-28 20:21:04,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:21:04,915 INFO L225 Difference]: With dead ends: 6983 [2018-11-28 20:21:04,915 INFO L226 Difference]: Without dead ends: 2778 [2018-11-28 20:21:04,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-11-28 20:21:04,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2778 states. [2018-11-28 20:21:04,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2778 to 2778. [2018-11-28 20:21:04,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2778 states. [2018-11-28 20:21:04,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2778 states to 2778 states and 6333 transitions. [2018-11-28 20:21:04,948 INFO L78 Accepts]: Start accepts. Automaton has 2778 states and 6333 transitions. Word has length 85 [2018-11-28 20:21:04,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:21:04,949 INFO L480 AbstractCegarLoop]: Abstraction has 2778 states and 6333 transitions. [2018-11-28 20:21:04,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 20:21:04,949 INFO L276 IsEmpty]: Start isEmpty. Operand 2778 states and 6333 transitions. [2018-11-28 20:21:04,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-28 20:21:04,953 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:21:04,953 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] [2018-11-28 20:21:04,953 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:21:04,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:21:04,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1942685255, now seen corresponding path program 3 times [2018-11-28 20:21:04,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:21:04,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:21:04,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:21:04,955 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 20:21:04,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:21:04,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:21:05,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:21:05,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:21:05,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 20:21:05,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 20:21:05,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 20:21:05,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-28 20:21:05,219 INFO L87 Difference]: Start difference. First operand 2778 states and 6333 transitions. Second operand 11 states. [2018-11-28 20:21:07,240 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-28 20:21:07,634 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-28 20:21:07,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:21:07,675 INFO L93 Difference]: Finished difference Result 4789 states and 10990 transitions. [2018-11-28 20:21:07,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 20:21:07,677 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 85 [2018-11-28 20:21:07,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:21:07,683 INFO L225 Difference]: With dead ends: 4789 [2018-11-28 20:21:07,683 INFO L226 Difference]: Without dead ends: 3098 [2018-11-28 20:21:07,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2018-11-28 20:21:07,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3098 states. [2018-11-28 20:21:07,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3098 to 2758. [2018-11-28 20:21:07,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2758 states. [2018-11-28 20:21:07,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2758 states to 2758 states and 6291 transitions. [2018-11-28 20:21:07,730 INFO L78 Accepts]: Start accepts. Automaton has 2758 states and 6291 transitions. Word has length 85 [2018-11-28 20:21:07,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:21:07,730 INFO L480 AbstractCegarLoop]: Abstraction has 2758 states and 6291 transitions. [2018-11-28 20:21:07,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 20:21:07,730 INFO L276 IsEmpty]: Start isEmpty. Operand 2758 states and 6291 transitions. [2018-11-28 20:21:07,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-28 20:21:07,736 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:21:07,736 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:21:07,737 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:21:07,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:21:07,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1542877223, now seen corresponding path program 4 times [2018-11-28 20:21:07,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:21:07,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:21:07,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:21:07,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 20:21:07,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:21:07,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 20:21:07,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 20:21:07,835 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 20:21:08,042 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-11-28 20:21:08,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:21:08 BasicIcfg [2018-11-28 20:21:08,044 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 20:21:08,045 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 20:21:08,045 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 20:21:08,045 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 20:21:08,046 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:20:38" (3/4) ... [2018-11-28 20:21:08,049 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 20:21:08,230 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 20:21:08,230 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 20:21:08,231 INFO L168 Benchmark]: Toolchain (without parser) took 31835.36 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 944.6 MB in the beginning and 1.4 GB in the end (delta: -427.4 MB). Peak memory consumption was 813.1 MB. Max. memory is 11.5 GB. [2018-11-28 20:21:08,238 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 20:21:08,238 INFO L168 Benchmark]: CACSL2BoogieTranslator took 943.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -159.3 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. [2018-11-28 20:21:08,239 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-28 20:21:08,239 INFO L168 Benchmark]: Boogie Preprocessor took 43.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 20:21:08,239 INFO L168 Benchmark]: RCFGBuilder took 1132.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 11.5 GB. [2018-11-28 20:21:08,240 INFO L168 Benchmark]: TraceAbstraction took 29456.81 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -378.0 MB). Peak memory consumption was 737.7 MB. Max. memory is 11.5 GB. [2018-11-28 20:21:08,240 INFO L168 Benchmark]: Witness Printer took 185.27 ms. Allocated memory is still 2.3 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.2 MB). Peak memory consumption was 52.2 MB. Max. memory is 11.5 GB. [2018-11-28 20:21:08,243 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 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 943.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -159.3 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1132.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 29456.81 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -378.0 MB). Peak memory consumption was 737.7 MB. Max. memory is 11.5 GB. * Witness Printer took 185.27 ms. Allocated memory is still 2.3 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.2 MB). Peak memory consumption was 52.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L678] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L679] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L680] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L682] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L684] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L685] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L686] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L687] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L688] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L689] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L690] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L691] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L692] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L693] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L694] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L695] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L696] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L697] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L698] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L700] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L701] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L702] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L778] -1 pthread_t t1661; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] FCALL, FORK -1 pthread_create(&t1661, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] -1 pthread_t t1662; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] FCALL, FORK -1 pthread_create(&t1662, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L736] 0 y$w_buff1 = y$w_buff0 [L737] 0 y$w_buff0 = 1 [L738] 0 y$w_buff1_used = y$w_buff0_used [L739] 0 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L741] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L742] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L743] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L744] 0 y$r_buff0_thd2 = (_Bool)1 [L747] 0 z = 1 [L750] 0 __unbuffered_p1_EAX = z [L753] 0 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L706] 1 x = 1 [L711] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L712] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L713] 1 y$flush_delayed = weak$$choice2 [L714] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L715] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 0 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L757] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L715] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L716] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L716] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L717] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L717] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L758] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L759] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 0 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L760] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 0 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L763] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L718] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L718] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L719] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L719] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L720] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L720] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L721] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L721] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L722] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L723] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L723] 1 y = y$flush_delayed ? y$mem_tmp : y [L724] 1 y$flush_delayed = (_Bool)0 [L729] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L783] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L788] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L788] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L789] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L789] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L790] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L791] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L794] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 200 locations, 3 error locations. UNSAFE Result, 29.2s OverallTime, 24 OverallIterations, 1 TraceHistogramMax, 16.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5430 SDtfs, 6760 SDslu, 13032 SDs, 0 SdLazy, 5185 SolverSat, 260 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 224 GetRequests, 59 SyntacticMatches, 15 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 7.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27856occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.5s AutomataMinimizationTime, 23 MinimizatonAttempts, 33217 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 1791 NumberOfCodeBlocks, 1791 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1683 ConstructedInterpolants, 0 QuantifiedInterpolants, 328467 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...