./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix048_power.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/mix048_power.oepc_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a299d32759fb8b5d2ba361364e58b6f478d5063e ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:10:36,320 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 20:10:36,322 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 20:10:36,335 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 20:10:36,335 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 20:10:36,337 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 20:10:36,338 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 20:10:36,341 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 20:10:36,343 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 20:10:36,344 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 20:10:36,345 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 20:10:36,345 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 20:10:36,347 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 20:10:36,348 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 20:10:36,350 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 20:10:36,351 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 20:10:36,352 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 20:10:36,354 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 20:10:36,357 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 20:10:36,359 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 20:10:36,360 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 20:10:36,362 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 20:10:36,365 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 20:10:36,365 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 20:10:36,365 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 20:10:36,367 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 20:10:36,368 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 20:10:36,369 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 20:10:36,370 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 20:10:36,372 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 20:10:36,372 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 20:10:36,373 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 20:10:36,373 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 20:10:36,374 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 20:10:36,376 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 20:10:36,377 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 20:10:36,377 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:10:36,402 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 20:10:36,402 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 20:10:36,403 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 20:10:36,403 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 20:10:36,404 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 20:10:36,404 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 20:10:36,404 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 20:10:36,405 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 20:10:36,405 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 20:10:36,405 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 20:10:36,405 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 20:10:36,405 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 20:10:36,406 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 20:10:36,406 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 20:10:36,406 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 20:10:36,406 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 20:10:36,406 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 20:10:36,407 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 20:10:36,407 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 20:10:36,407 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 20:10:36,407 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 20:10:36,408 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 20:10:36,408 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 20:10:36,408 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 20:10:36,408 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 20:10:36,409 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 20:10:36,409 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 20:10:36,409 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 20:10:36,409 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 20:10:36,409 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 20:10:36,410 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 -> a299d32759fb8b5d2ba361364e58b6f478d5063e [2018-11-28 20:10:36,456 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 20:10:36,474 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 20:10:36,482 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 20:10:36,484 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 20:10:36,484 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 20:10:36,485 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix048_power.oepc_false-unreach-call.i [2018-11-28 20:10:36,554 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/951d24a9d/480d868d4bc048239186af93f28de705/FLAGfabf3b0d6 [2018-11-28 20:10:37,111 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 20:10:37,114 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix048_power.oepc_false-unreach-call.i [2018-11-28 20:10:37,139 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/951d24a9d/480d868d4bc048239186af93f28de705/FLAGfabf3b0d6 [2018-11-28 20:10:37,368 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/951d24a9d/480d868d4bc048239186af93f28de705 [2018-11-28 20:10:37,372 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 20:10:37,373 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 20:10:37,374 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 20:10:37,375 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 20:10:37,378 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 20:10:37,379 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:10:37" (1/1) ... [2018-11-28 20:10:37,383 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72e1a52d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:37, skipping insertion in model container [2018-11-28 20:10:37,383 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:10:37" (1/1) ... [2018-11-28 20:10:37,392 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 20:10:37,448 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 20:10:37,920 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 20:10:37,940 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 20:10:38,108 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 20:10:38,206 INFO L195 MainTranslator]: Completed translation [2018-11-28 20:10:38,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:38 WrapperNode [2018-11-28 20:10:38,207 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 20:10:38,208 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 20:10:38,209 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 20:10:38,209 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 20:10:38,219 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:10:38" (1/1) ... [2018-11-28 20:10:38,251 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:10:38" (1/1) ... [2018-11-28 20:10:38,293 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 20:10:38,293 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 20:10:38,293 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 20:10:38,294 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 20:10:38,314 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:38" (1/1) ... [2018-11-28 20:10:38,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:38" (1/1) ... [2018-11-28 20:10:38,321 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:38" (1/1) ... [2018-11-28 20:10:38,322 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:38" (1/1) ... [2018-11-28 20:10:38,334 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:38" (1/1) ... [2018-11-28 20:10:38,344 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:38" (1/1) ... [2018-11-28 20:10:38,354 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:38" (1/1) ... [2018-11-28 20:10:38,363 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 20:10:38,364 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 20:10:38,364 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 20:10:38,364 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 20:10:38,365 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 20:10:38,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 20:10:38,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 20:10:38,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-11-28 20:10:38,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 20:10:38,453 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-11-28 20:10:38,453 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-11-28 20:10:38,454 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-11-28 20:10:38,455 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-11-28 20:10:38,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-11-28 20:10:38,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 20:10:38,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 20:10:38,459 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:10:39,647 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 20:10:39,647 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 20:10:39,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:10:39 BoogieIcfgContainer [2018-11-28 20:10:39,648 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 20:10:39,652 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 20:10:39,652 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 20:10:39,656 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 20:10:39,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:10:37" (1/3) ... [2018-11-28 20:10:39,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22bd9bf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:10:39, skipping insertion in model container [2018-11-28 20:10:39,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:38" (2/3) ... [2018-11-28 20:10:39,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22bd9bf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:10:39, skipping insertion in model container [2018-11-28 20:10:39,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:10:39" (3/3) ... [2018-11-28 20:10:39,664 INFO L112 eAbstractionObserver]: Analyzing ICFG mix048_power.oepc_false-unreach-call.i [2018-11-28 20:10:39,720 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,721 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,721 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,721 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,721 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,723 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,724 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,724 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,724 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,725 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,725 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,725 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,725 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,727 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,727 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,727 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,728 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,728 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,728 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,728 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,729 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,730 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,730 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,730 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,730 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,731 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,731 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,732 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,732 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,732 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,732 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,733 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,734 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,734 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,734 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,734 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,734 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,735 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,737 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,737 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,737 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,738 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,738 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,738 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,738 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,738 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,738 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,740 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,740 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,740 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,741 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,742 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,742 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,742 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,742 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,743 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,743 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,743 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,743 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,745 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,745 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,745 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,746 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,746 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,746 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,746 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,748 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,748 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,748 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,748 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,749 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,749 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,749 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,749 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,749 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,751 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,751 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,751 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,751 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,752 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,752 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,753 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,753 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,753 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,753 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,753 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,754 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,754 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,754 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,755 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,755 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,755 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,757 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,757 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,757 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,758 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,758 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,758 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,758 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,758 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,759 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,759 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,759 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,759 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,760 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,760 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,760 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,760 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,760 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,761 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,761 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,761 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,761 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,761 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,762 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,762 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,762 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,762 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,763 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,763 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,763 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,763 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,763 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,764 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,764 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,764 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,764 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,764 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,765 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,765 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,765 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,765 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,765 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,766 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,766 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,766 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,766 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,766 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,767 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,767 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,767 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,767 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,768 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,768 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,768 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,768 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,768 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,768 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,769 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,769 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,769 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,769 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,770 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,770 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,770 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,770 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,770 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,771 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,771 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,771 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,771 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,771 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,771 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,772 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:39,802 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-11-28 20:10:39,802 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 20:10:39,813 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-28 20:10:39,833 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-28 20:10:39,862 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 20:10:39,863 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 20:10:39,863 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 20:10:39,863 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 20:10:39,863 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 20:10:39,863 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 20:10:39,863 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 20:10:39,863 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 20:10:39,864 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 20:10:39,878 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 142places, 180 transitions [2018-11-28 20:10:42,395 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34806 states. [2018-11-28 20:10:42,398 INFO L276 IsEmpty]: Start isEmpty. Operand 34806 states. [2018-11-28 20:10:42,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 20:10:42,408 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:10:42,409 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:10:42,413 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:10:42,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:10:42,420 INFO L82 PathProgramCache]: Analyzing trace with hash -454041356, now seen corresponding path program 1 times [2018-11-28 20:10:42,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:10:42,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:10:42,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:10:42,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:10:42,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:10:42,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:10:42,798 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:10:42,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:10:42,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:10:42,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:10:42,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:10:42,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:10:42,833 INFO L87 Difference]: Start difference. First operand 34806 states. Second operand 4 states. [2018-11-28 20:10:44,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:10:44,366 INFO L93 Difference]: Finished difference Result 60790 states and 234493 transitions. [2018-11-28 20:10:44,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:10:44,368 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-11-28 20:10:44,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:10:44,706 INFO L225 Difference]: With dead ends: 60790 [2018-11-28 20:10:44,706 INFO L226 Difference]: Without dead ends: 44270 [2018-11-28 20:10:44,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:10:45,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44270 states. [2018-11-28 20:10:46,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44270 to 27338. [2018-11-28 20:10:46,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27338 states. [2018-11-28 20:10:46,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27338 states to 27338 states and 105499 transitions. [2018-11-28 20:10:46,626 INFO L78 Accepts]: Start accepts. Automaton has 27338 states and 105499 transitions. Word has length 33 [2018-11-28 20:10:46,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:10:46,627 INFO L480 AbstractCegarLoop]: Abstraction has 27338 states and 105499 transitions. [2018-11-28 20:10:46,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:10:46,627 INFO L276 IsEmpty]: Start isEmpty. Operand 27338 states and 105499 transitions. [2018-11-28 20:10:46,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-28 20:10:46,637 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:10:46,638 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:10:46,638 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:10:46,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:10:46,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1863363909, now seen corresponding path program 1 times [2018-11-28 20:10:46,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:10:46,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:10:46,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:10:46,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:10:46,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:10:46,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:10:46,766 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:10:46,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:10:46,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:10:46,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:10:46,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:10:46,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:10:46,770 INFO L87 Difference]: Start difference. First operand 27338 states and 105499 transitions. Second operand 4 states. [2018-11-28 20:10:47,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:10:47,095 INFO L93 Difference]: Finished difference Result 8528 states and 28344 transitions. [2018-11-28 20:10:47,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:10:47,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-11-28 20:10:47,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:10:47,132 INFO L225 Difference]: With dead ends: 8528 [2018-11-28 20:10:47,132 INFO L226 Difference]: Without dead ends: 7466 [2018-11-28 20:10:47,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:10:47,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7466 states. [2018-11-28 20:10:47,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7466 to 7466. [2018-11-28 20:10:47,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7466 states. [2018-11-28 20:10:47,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7466 states to 7466 states and 24636 transitions. [2018-11-28 20:10:47,351 INFO L78 Accepts]: Start accepts. Automaton has 7466 states and 24636 transitions. Word has length 45 [2018-11-28 20:10:47,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:10:47,351 INFO L480 AbstractCegarLoop]: Abstraction has 7466 states and 24636 transitions. [2018-11-28 20:10:47,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:10:47,352 INFO L276 IsEmpty]: Start isEmpty. Operand 7466 states and 24636 transitions. [2018-11-28 20:10:47,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-28 20:10:47,354 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:10:47,354 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:10:47,356 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:10:47,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:10:47,357 INFO L82 PathProgramCache]: Analyzing trace with hash 591681941, now seen corresponding path program 1 times [2018-11-28 20:10:47,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:10:47,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:10:47,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:10:47,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:10:47,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:10:47,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:10:47,690 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:10:47,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:10:47,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:10:47,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:10:47,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:10:47,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:10:47,692 INFO L87 Difference]: Start difference. First operand 7466 states and 24636 transitions. Second operand 5 states. [2018-11-28 20:10:49,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:10:49,127 INFO L93 Difference]: Finished difference Result 13998 states and 45805 transitions. [2018-11-28 20:10:49,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:10:49,131 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-11-28 20:10:49,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:10:49,185 INFO L225 Difference]: With dead ends: 13998 [2018-11-28 20:10:49,186 INFO L226 Difference]: Without dead ends: 13930 [2018-11-28 20:10:49,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:10:49,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13930 states. [2018-11-28 20:10:49,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13930 to 9441. [2018-11-28 20:10:49,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9441 states. [2018-11-28 20:10:49,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9441 states to 9441 states and 30542 transitions. [2018-11-28 20:10:49,697 INFO L78 Accepts]: Start accepts. Automaton has 9441 states and 30542 transitions. Word has length 46 [2018-11-28 20:10:49,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:10:49,699 INFO L480 AbstractCegarLoop]: Abstraction has 9441 states and 30542 transitions. [2018-11-28 20:10:49,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:10:49,699 INFO L276 IsEmpty]: Start isEmpty. Operand 9441 states and 30542 transitions. [2018-11-28 20:10:49,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-28 20:10:49,707 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:10:49,707 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:10:49,707 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:10:49,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:10:49,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1652121253, now seen corresponding path program 1 times [2018-11-28 20:10:49,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:10:49,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:10:49,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:10:49,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:10:49,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:10:49,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:10:49,841 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:10:49,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:10:49,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:10:49,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:10:49,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:10:49,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:10:49,843 INFO L87 Difference]: Start difference. First operand 9441 states and 30542 transitions. Second operand 3 states. [2018-11-28 20:10:50,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:10:50,138 INFO L93 Difference]: Finished difference Result 13279 states and 42641 transitions. [2018-11-28 20:10:50,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:10:50,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-11-28 20:10:50,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:10:50,174 INFO L225 Difference]: With dead ends: 13279 [2018-11-28 20:10:50,174 INFO L226 Difference]: Without dead ends: 13279 [2018-11-28 20:10:50,174 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:10:50,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13279 states. [2018-11-28 20:10:50,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13279 to 9845. [2018-11-28 20:10:50,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9845 states. [2018-11-28 20:10:50,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9845 states to 9845 states and 31508 transitions. [2018-11-28 20:10:50,449 INFO L78 Accepts]: Start accepts. Automaton has 9845 states and 31508 transitions. Word has length 48 [2018-11-28 20:10:50,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:10:50,449 INFO L480 AbstractCegarLoop]: Abstraction has 9845 states and 31508 transitions. [2018-11-28 20:10:50,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:10:50,449 INFO L276 IsEmpty]: Start isEmpty. Operand 9845 states and 31508 transitions. [2018-11-28 20:10:50,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-28 20:10:50,454 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:10:50,454 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:10:50,454 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:10:50,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:10:50,454 INFO L82 PathProgramCache]: Analyzing trace with hash -164023066, now seen corresponding path program 1 times [2018-11-28 20:10:50,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:10:50,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:10:50,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:10:50,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:10:50,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:10:50,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:10:50,745 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-28 20:10:51,091 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:10:51,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:10:51,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:10:51,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:10:51,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:10:51,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:10:51,093 INFO L87 Difference]: Start difference. First operand 9845 states and 31508 transitions. Second operand 7 states. [2018-11-28 20:10:51,338 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2018-11-28 20:10:52,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:10:52,572 INFO L93 Difference]: Finished difference Result 12285 states and 38673 transitions. [2018-11-28 20:10:52,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 20:10:52,573 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-11-28 20:10:52,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:10:52,603 INFO L225 Difference]: With dead ends: 12285 [2018-11-28 20:10:52,604 INFO L226 Difference]: Without dead ends: 12213 [2018-11-28 20:10:52,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-11-28 20:10:52,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12213 states. [2018-11-28 20:10:52,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12213 to 10849. [2018-11-28 20:10:52,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10849 states. [2018-11-28 20:10:52,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10849 states to 10849 states and 34563 transitions. [2018-11-28 20:10:52,848 INFO L78 Accepts]: Start accepts. Automaton has 10849 states and 34563 transitions. Word has length 52 [2018-11-28 20:10:52,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:10:52,849 INFO L480 AbstractCegarLoop]: Abstraction has 10849 states and 34563 transitions. [2018-11-28 20:10:52,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:10:52,849 INFO L276 IsEmpty]: Start isEmpty. Operand 10849 states and 34563 transitions. [2018-11-28 20:10:52,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-28 20:10:52,857 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:10:52,857 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:10:52,858 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:10:52,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:10:52,858 INFO L82 PathProgramCache]: Analyzing trace with hash 317195842, now seen corresponding path program 1 times [2018-11-28 20:10:52,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:10:52,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:10:52,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:10:52,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:10:52,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:10:52,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:10:52,998 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:10:52,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:10:52,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:10:52,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:10:52,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:10:53,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:10:53,002 INFO L87 Difference]: Start difference. First operand 10849 states and 34563 transitions. Second operand 4 states. [2018-11-28 20:10:53,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:10:53,225 INFO L93 Difference]: Finished difference Result 12396 states and 39572 transitions. [2018-11-28 20:10:53,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:10:53,226 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-11-28 20:10:53,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:10:53,259 INFO L225 Difference]: With dead ends: 12396 [2018-11-28 20:10:53,259 INFO L226 Difference]: Without dead ends: 12396 [2018-11-28 20:10:53,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:10:53,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12396 states. [2018-11-28 20:10:53,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12396 to 11369. [2018-11-28 20:10:53,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11369 states. [2018-11-28 20:10:53,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11369 states to 11369 states and 36236 transitions. [2018-11-28 20:10:53,551 INFO L78 Accepts]: Start accepts. Automaton has 11369 states and 36236 transitions. Word has length 60 [2018-11-28 20:10:53,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:10:53,552 INFO L480 AbstractCegarLoop]: Abstraction has 11369 states and 36236 transitions. [2018-11-28 20:10:53,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:10:53,552 INFO L276 IsEmpty]: Start isEmpty. Operand 11369 states and 36236 transitions. [2018-11-28 20:10:53,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-28 20:10:53,561 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:10:53,561 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:10:53,561 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:10:53,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:10:53,562 INFO L82 PathProgramCache]: Analyzing trace with hash 2060006177, now seen corresponding path program 1 times [2018-11-28 20:10:53,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:10:53,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:10:53,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:10:53,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:10:53,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:10:53,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:10:53,911 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:10:53,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:10:53,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:10:53,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:10:53,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:10:53,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:10:53,913 INFO L87 Difference]: Start difference. First operand 11369 states and 36236 transitions. Second operand 6 states. [2018-11-28 20:10:54,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:10:54,746 INFO L93 Difference]: Finished difference Result 20969 states and 66486 transitions. [2018-11-28 20:10:54,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 20:10:54,747 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2018-11-28 20:10:54,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:10:54,798 INFO L225 Difference]: With dead ends: 20969 [2018-11-28 20:10:54,798 INFO L226 Difference]: Without dead ends: 20898 [2018-11-28 20:10:54,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-28 20:10:54,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20898 states. [2018-11-28 20:10:55,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20898 to 13755. [2018-11-28 20:10:55,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13755 states. [2018-11-28 20:10:55,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13755 states to 13755 states and 43280 transitions. [2018-11-28 20:10:55,471 INFO L78 Accepts]: Start accepts. Automaton has 13755 states and 43280 transitions. Word has length 60 [2018-11-28 20:10:55,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:10:55,472 INFO L480 AbstractCegarLoop]: Abstraction has 13755 states and 43280 transitions. [2018-11-28 20:10:55,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:10:55,472 INFO L276 IsEmpty]: Start isEmpty. Operand 13755 states and 43280 transitions. [2018-11-28 20:10:55,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-28 20:10:55,484 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:10:55,484 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:10:55,484 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:10:55,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:10:55,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1699576415, now seen corresponding path program 1 times [2018-11-28 20:10:55,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:10:55,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:10:55,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:10:55,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:10:55,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:10:55,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:10:55,703 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:10:55,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:10:55,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:10:55,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:10:55,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:10:55,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:10:55,705 INFO L87 Difference]: Start difference. First operand 13755 states and 43280 transitions. Second operand 4 states. [2018-11-28 20:10:56,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:10:56,282 INFO L93 Difference]: Finished difference Result 17635 states and 54585 transitions. [2018-11-28 20:10:56,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:10:56,283 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-11-28 20:10:56,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:10:56,316 INFO L225 Difference]: With dead ends: 17635 [2018-11-28 20:10:56,316 INFO L226 Difference]: Without dead ends: 17635 [2018-11-28 20:10:56,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 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:10:56,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17635 states. [2018-11-28 20:10:56,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17635 to 15793. [2018-11-28 20:10:56,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15793 states. [2018-11-28 20:10:56,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15793 states to 15793 states and 49131 transitions. [2018-11-28 20:10:56,652 INFO L78 Accepts]: Start accepts. Automaton has 15793 states and 49131 transitions. Word has length 64 [2018-11-28 20:10:56,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:10:56,653 INFO L480 AbstractCegarLoop]: Abstraction has 15793 states and 49131 transitions. [2018-11-28 20:10:56,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:10:56,653 INFO L276 IsEmpty]: Start isEmpty. Operand 15793 states and 49131 transitions. [2018-11-28 20:10:56,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-28 20:10:56,664 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:10:56,665 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:10:56,665 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:10:56,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:10:56,665 INFO L82 PathProgramCache]: Analyzing trace with hash -377632928, now seen corresponding path program 1 times [2018-11-28 20:10:56,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:10:56,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:10:56,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:10:56,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:10:56,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:10:56,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:10:56,800 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:10:56,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:10:56,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:10:56,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:10:56,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:10:56,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:10:56,802 INFO L87 Difference]: Start difference. First operand 15793 states and 49131 transitions. Second operand 3 states. [2018-11-28 20:10:57,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:10:57,196 INFO L93 Difference]: Finished difference Result 16385 states and 50738 transitions. [2018-11-28 20:10:57,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:10:57,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2018-11-28 20:10:57,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:10:57,226 INFO L225 Difference]: With dead ends: 16385 [2018-11-28 20:10:57,226 INFO L226 Difference]: Without dead ends: 16385 [2018-11-28 20:10:57,227 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:10:57,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16385 states. [2018-11-28 20:10:57,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16385 to 16109. [2018-11-28 20:10:57,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16109 states. [2018-11-28 20:10:57,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16109 states to 16109 states and 49981 transitions. [2018-11-28 20:10:57,488 INFO L78 Accepts]: Start accepts. Automaton has 16109 states and 49981 transitions. Word has length 64 [2018-11-28 20:10:57,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:10:57,488 INFO L480 AbstractCegarLoop]: Abstraction has 16109 states and 49981 transitions. [2018-11-28 20:10:57,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:10:57,488 INFO L276 IsEmpty]: Start isEmpty. Operand 16109 states and 49981 transitions. [2018-11-28 20:10:57,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 20:10:57,501 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:10:57,501 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:10:57,501 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:10:57,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:10:57,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1938632710, now seen corresponding path program 1 times [2018-11-28 20:10:57,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:10:57,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:10:57,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:10:57,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:10:57,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:10:57,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:10:57,819 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:10:57,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:10:57,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:10:57,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:10:57,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:10:57,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:10:57,821 INFO L87 Difference]: Start difference. First operand 16109 states and 49981 transitions. Second operand 6 states. [2018-11-28 20:10:59,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:10:59,261 INFO L93 Difference]: Finished difference Result 19821 states and 60437 transitions. [2018-11-28 20:10:59,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:10:59,262 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-11-28 20:10:59,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:10:59,303 INFO L225 Difference]: With dead ends: 19821 [2018-11-28 20:10:59,303 INFO L226 Difference]: Without dead ends: 19821 [2018-11-28 20:10:59,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:10:59,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19821 states. [2018-11-28 20:10:59,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19821 to 18617. [2018-11-28 20:10:59,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18617 states. [2018-11-28 20:10:59,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18617 states to 18617 states and 57217 transitions. [2018-11-28 20:10:59,845 INFO L78 Accepts]: Start accepts. Automaton has 18617 states and 57217 transitions. Word has length 66 [2018-11-28 20:10:59,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:10:59,845 INFO L480 AbstractCegarLoop]: Abstraction has 18617 states and 57217 transitions. [2018-11-28 20:10:59,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:10:59,845 INFO L276 IsEmpty]: Start isEmpty. Operand 18617 states and 57217 transitions. [2018-11-28 20:10:59,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 20:10:59,858 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:10:59,858 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:10:59,859 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:10:59,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:10:59,859 INFO L82 PathProgramCache]: Analyzing trace with hash -138576633, now seen corresponding path program 1 times [2018-11-28 20:10:59,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:10:59,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:10:59,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:10:59,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:10:59,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:10:59,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:11:00,155 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:11:00,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:11:00,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:11:00,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:11:00,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:11:00,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:11:00,157 INFO L87 Difference]: Start difference. First operand 18617 states and 57217 transitions. Second operand 6 states. [2018-11-28 20:11:00,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:11:00,754 INFO L93 Difference]: Finished difference Result 21449 states and 63626 transitions. [2018-11-28 20:11:00,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 20:11:00,755 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-11-28 20:11:00,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:11:00,787 INFO L225 Difference]: With dead ends: 21449 [2018-11-28 20:11:00,787 INFO L226 Difference]: Without dead ends: 21449 [2018-11-28 20:11:00,788 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:11:00,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21449 states. [2018-11-28 20:11:01,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21449 to 19133. [2018-11-28 20:11:01,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19133 states. [2018-11-28 20:11:01,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19133 states to 19133 states and 57764 transitions. [2018-11-28 20:11:01,056 INFO L78 Accepts]: Start accepts. Automaton has 19133 states and 57764 transitions. Word has length 66 [2018-11-28 20:11:01,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:11:01,056 INFO L480 AbstractCegarLoop]: Abstraction has 19133 states and 57764 transitions. [2018-11-28 20:11:01,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:11:01,057 INFO L276 IsEmpty]: Start isEmpty. Operand 19133 states and 57764 transitions. [2018-11-28 20:11:01,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 20:11:01,069 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:11:01,069 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:11:01,069 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:11:01,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:11:01,070 INFO L82 PathProgramCache]: Analyzing trace with hash 72774280, now seen corresponding path program 1 times [2018-11-28 20:11:01,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:11:01,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:11:01,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:01,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:11:01,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:01,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:11:01,354 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:11:01,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:11:01,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:11:01,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:11:01,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:11:01,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:11:01,356 INFO L87 Difference]: Start difference. First operand 19133 states and 57764 transitions. Second operand 5 states. [2018-11-28 20:11:02,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:11:02,465 INFO L93 Difference]: Finished difference Result 25024 states and 75018 transitions. [2018-11-28 20:11:02,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:11:02,466 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-11-28 20:11:02,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:11:02,502 INFO L225 Difference]: With dead ends: 25024 [2018-11-28 20:11:02,502 INFO L226 Difference]: Without dead ends: 25024 [2018-11-28 20:11:02,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:11:02,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25024 states. [2018-11-28 20:11:02,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25024 to 22709. [2018-11-28 20:11:02,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22709 states. [2018-11-28 20:11:02,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22709 states to 22709 states and 68032 transitions. [2018-11-28 20:11:02,831 INFO L78 Accepts]: Start accepts. Automaton has 22709 states and 68032 transitions. Word has length 66 [2018-11-28 20:11:02,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:11:02,831 INFO L480 AbstractCegarLoop]: Abstraction has 22709 states and 68032 transitions. [2018-11-28 20:11:02,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:11:02,832 INFO L276 IsEmpty]: Start isEmpty. Operand 22709 states and 68032 transitions. [2018-11-28 20:11:02,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 20:11:02,844 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:11:02,844 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:11:02,844 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:11:02,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:11:02,845 INFO L82 PathProgramCache]: Analyzing trace with hash -437759897, now seen corresponding path program 1 times [2018-11-28 20:11:02,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:11:02,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:11:02,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:02,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:11:02,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:02,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:11:03,051 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:11:03,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:11:03,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:11:03,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:11:03,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:11:03,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:11:03,052 INFO L87 Difference]: Start difference. First operand 22709 states and 68032 transitions. Second operand 4 states. [2018-11-28 20:11:03,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:11:03,781 INFO L93 Difference]: Finished difference Result 31689 states and 95699 transitions. [2018-11-28 20:11:03,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:11:03,782 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-11-28 20:11:03,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:11:03,837 INFO L225 Difference]: With dead ends: 31689 [2018-11-28 20:11:03,837 INFO L226 Difference]: Without dead ends: 31537 [2018-11-28 20:11:03,838 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:11:03,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31537 states. [2018-11-28 20:11:04,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31537 to 28553. [2018-11-28 20:11:04,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28553 states. [2018-11-28 20:11:04,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28553 states to 28553 states and 86263 transitions. [2018-11-28 20:11:04,422 INFO L78 Accepts]: Start accepts. Automaton has 28553 states and 86263 transitions. Word has length 66 [2018-11-28 20:11:04,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:11:04,422 INFO L480 AbstractCegarLoop]: Abstraction has 28553 states and 86263 transitions. [2018-11-28 20:11:04,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:11:04,422 INFO L276 IsEmpty]: Start isEmpty. Operand 28553 states and 86263 transitions. [2018-11-28 20:11:04,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 20:11:04,440 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:11:04,440 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:11:04,441 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:11:04,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:11:04,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1369694566, now seen corresponding path program 1 times [2018-11-28 20:11:04,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:11:04,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:11:04,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:04,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:11:04,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:04,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:11:04,738 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:11:04,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:11:04,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:11:04,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:11:04,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:11:04,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:11:04,740 INFO L87 Difference]: Start difference. First operand 28553 states and 86263 transitions. Second operand 5 states. [2018-11-28 20:11:05,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:11:05,721 INFO L93 Difference]: Finished difference Result 40195 states and 119844 transitions. [2018-11-28 20:11:05,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:11:05,722 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-11-28 20:11:05,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:11:05,794 INFO L225 Difference]: With dead ends: 40195 [2018-11-28 20:11:05,794 INFO L226 Difference]: Without dead ends: 39987 [2018-11-28 20:11:05,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 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:11:05,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39987 states. [2018-11-28 20:11:06,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39987 to 35807. [2018-11-28 20:11:06,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35807 states. [2018-11-28 20:11:06,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35807 states to 35807 states and 107399 transitions. [2018-11-28 20:11:06,339 INFO L78 Accepts]: Start accepts. Automaton has 35807 states and 107399 transitions. Word has length 66 [2018-11-28 20:11:06,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:11:06,340 INFO L480 AbstractCegarLoop]: Abstraction has 35807 states and 107399 transitions. [2018-11-28 20:11:06,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:11:06,340 INFO L276 IsEmpty]: Start isEmpty. Operand 35807 states and 107399 transitions. [2018-11-28 20:11:06,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 20:11:06,354 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:11:06,354 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:11:06,354 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:11:06,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:11:06,355 INFO L82 PathProgramCache]: Analyzing trace with hash 2060256040, now seen corresponding path program 1 times [2018-11-28 20:11:06,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:11:06,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:11:06,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:06,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:11:06,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:06,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:11:06,520 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:11:06,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:11:06,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 20:11:06,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 20:11:06,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 20:11:06,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:11:06,521 INFO L87 Difference]: Start difference. First operand 35807 states and 107399 transitions. Second operand 9 states. [2018-11-28 20:11:07,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:11:07,770 INFO L93 Difference]: Finished difference Result 44023 states and 131291 transitions. [2018-11-28 20:11:07,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 20:11:07,771 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2018-11-28 20:11:07,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:11:07,849 INFO L225 Difference]: With dead ends: 44023 [2018-11-28 20:11:07,850 INFO L226 Difference]: Without dead ends: 44023 [2018-11-28 20:11:07,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-11-28 20:11:07,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44023 states. [2018-11-28 20:11:08,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44023 to 38973. [2018-11-28 20:11:08,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38973 states. [2018-11-28 20:11:08,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38973 states to 38973 states and 116711 transitions. [2018-11-28 20:11:08,462 INFO L78 Accepts]: Start accepts. Automaton has 38973 states and 116711 transitions. Word has length 66 [2018-11-28 20:11:08,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:11:08,463 INFO L480 AbstractCegarLoop]: Abstraction has 38973 states and 116711 transitions. [2018-11-28 20:11:08,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 20:11:08,463 INFO L276 IsEmpty]: Start isEmpty. Operand 38973 states and 116711 transitions. [2018-11-28 20:11:08,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 20:11:08,478 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:11:08,478 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:11:08,478 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:11:08,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:11:08,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1347207575, now seen corresponding path program 1 times [2018-11-28 20:11:08,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:11:08,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:11:08,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:08,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:11:08,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:08,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:11:08,701 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:11:08,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:11:08,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:11:08,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:11:08,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:11:08,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:11:08,703 INFO L87 Difference]: Start difference. First operand 38973 states and 116711 transitions. Second operand 5 states. [2018-11-28 20:11:08,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:11:08,840 INFO L93 Difference]: Finished difference Result 9637 states and 23357 transitions. [2018-11-28 20:11:08,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 20:11:08,841 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-11-28 20:11:08,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:11:08,850 INFO L225 Difference]: With dead ends: 9637 [2018-11-28 20:11:08,850 INFO L226 Difference]: Without dead ends: 7669 [2018-11-28 20:11:08,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:11:08,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7669 states. [2018-11-28 20:11:08,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7669 to 6276. [2018-11-28 20:11:08,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6276 states. [2018-11-28 20:11:08,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6276 states to 6276 states and 14833 transitions. [2018-11-28 20:11:08,920 INFO L78 Accepts]: Start accepts. Automaton has 6276 states and 14833 transitions. Word has length 66 [2018-11-28 20:11:08,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:11:08,920 INFO L480 AbstractCegarLoop]: Abstraction has 6276 states and 14833 transitions. [2018-11-28 20:11:08,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:11:08,920 INFO L276 IsEmpty]: Start isEmpty. Operand 6276 states and 14833 transitions. [2018-11-28 20:11:08,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 20:11:08,925 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:11:08,925 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:11:08,925 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:11:08,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:11:08,926 INFO L82 PathProgramCache]: Analyzing trace with hash 890203314, now seen corresponding path program 1 times [2018-11-28 20:11:08,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:11:08,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:11:08,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:08,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:11:08,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:08,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:11:09,002 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:11:09,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:11:09,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:11:09,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:11:09,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:11:09,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:11:09,005 INFO L87 Difference]: Start difference. First operand 6276 states and 14833 transitions. Second operand 3 states. [2018-11-28 20:11:09,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:11:09,073 INFO L93 Difference]: Finished difference Result 8733 states and 20570 transitions. [2018-11-28 20:11:09,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:11:09,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-11-28 20:11:09,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:11:09,084 INFO L225 Difference]: With dead ends: 8733 [2018-11-28 20:11:09,084 INFO L226 Difference]: Without dead ends: 8733 [2018-11-28 20:11:09,084 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:11:09,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8733 states. [2018-11-28 20:11:09,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8733 to 6213. [2018-11-28 20:11:09,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6213 states. [2018-11-28 20:11:09,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6213 states to 6213 states and 14371 transitions. [2018-11-28 20:11:09,160 INFO L78 Accepts]: Start accepts. Automaton has 6213 states and 14371 transitions. Word has length 66 [2018-11-28 20:11:09,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:11:09,160 INFO L480 AbstractCegarLoop]: Abstraction has 6213 states and 14371 transitions. [2018-11-28 20:11:09,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:11:09,161 INFO L276 IsEmpty]: Start isEmpty. Operand 6213 states and 14371 transitions. [2018-11-28 20:11:09,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-28 20:11:09,166 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:11:09,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, 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:11:09,166 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:11:09,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:11:09,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1181781029, now seen corresponding path program 1 times [2018-11-28 20:11:09,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:11:09,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:11:09,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:09,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:11:09,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:09,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:11:09,514 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:11:09,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:11:09,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:11:09,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:11:09,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:11:09,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:11:09,518 INFO L87 Difference]: Start difference. First operand 6213 states and 14371 transitions. Second operand 5 states. [2018-11-28 20:11:09,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:11:09,914 INFO L93 Difference]: Finished difference Result 7383 states and 17012 transitions. [2018-11-28 20:11:09,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 20:11:09,915 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2018-11-28 20:11:09,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:11:09,924 INFO L225 Difference]: With dead ends: 7383 [2018-11-28 20:11:09,924 INFO L226 Difference]: Without dead ends: 7383 [2018-11-28 20:11:09,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:11:09,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7383 states. [2018-11-28 20:11:09,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7383 to 6657. [2018-11-28 20:11:09,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6657 states. [2018-11-28 20:11:09,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6657 states to 6657 states and 15375 transitions. [2018-11-28 20:11:10,000 INFO L78 Accepts]: Start accepts. Automaton has 6657 states and 15375 transitions. Word has length 72 [2018-11-28 20:11:10,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:11:10,000 INFO L480 AbstractCegarLoop]: Abstraction has 6657 states and 15375 transitions. [2018-11-28 20:11:10,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:11:10,000 INFO L276 IsEmpty]: Start isEmpty. Operand 6657 states and 15375 transitions. [2018-11-28 20:11:10,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-28 20:11:10,007 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:11:10,007 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:11:10,008 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:11:10,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:11:10,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1370375932, now seen corresponding path program 1 times [2018-11-28 20:11:10,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:11:10,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:11:10,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:10,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:11:10,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:10,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:11:10,219 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:11:10,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:11:10,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 20:11:10,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 20:11:10,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 20:11:10,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:11:10,221 INFO L87 Difference]: Start difference. First operand 6657 states and 15375 transitions. Second operand 9 states. [2018-11-28 20:11:13,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:11:13,239 INFO L93 Difference]: Finished difference Result 8851 states and 20272 transitions. [2018-11-28 20:11:13,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 20:11:13,240 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2018-11-28 20:11:13,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:11:13,253 INFO L225 Difference]: With dead ends: 8851 [2018-11-28 20:11:13,253 INFO L226 Difference]: Without dead ends: 8732 [2018-11-28 20:11:13,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-11-28 20:11:13,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8732 states. [2018-11-28 20:11:13,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8732 to 6746. [2018-11-28 20:11:13,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6746 states. [2018-11-28 20:11:13,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6746 states to 6746 states and 15444 transitions. [2018-11-28 20:11:13,343 INFO L78 Accepts]: Start accepts. Automaton has 6746 states and 15444 transitions. Word has length 72 [2018-11-28 20:11:13,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:11:13,344 INFO L480 AbstractCegarLoop]: Abstraction has 6746 states and 15444 transitions. [2018-11-28 20:11:13,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 20:11:13,344 INFO L276 IsEmpty]: Start isEmpty. Operand 6746 states and 15444 transitions. [2018-11-28 20:11:13,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 20:11:13,350 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:11:13,351 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:11:13,351 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:11:13,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:11:13,351 INFO L82 PathProgramCache]: Analyzing trace with hash 342181544, now seen corresponding path program 1 times [2018-11-28 20:11:13,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:11:13,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:11:13,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:13,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:11:13,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:13,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:11:13,418 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:11:13,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:11:13,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:11:13,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:11:13,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:11:13,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:11:13,421 INFO L87 Difference]: Start difference. First operand 6746 states and 15444 transitions. Second operand 3 states. [2018-11-28 20:11:13,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:11:13,595 INFO L93 Difference]: Finished difference Result 8422 states and 18970 transitions. [2018-11-28 20:11:13,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:11:13,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2018-11-28 20:11:13,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:11:13,608 INFO L225 Difference]: With dead ends: 8422 [2018-11-28 20:11:13,608 INFO L226 Difference]: Without dead ends: 8422 [2018-11-28 20:11:13,609 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:11:13,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8422 states. [2018-11-28 20:11:13,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8422 to 7857. [2018-11-28 20:11:13,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7857 states. [2018-11-28 20:11:13,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7857 states to 7857 states and 17760 transitions. [2018-11-28 20:11:13,692 INFO L78 Accepts]: Start accepts. Automaton has 7857 states and 17760 transitions. Word has length 91 [2018-11-28 20:11:13,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:11:13,692 INFO L480 AbstractCegarLoop]: Abstraction has 7857 states and 17760 transitions. [2018-11-28 20:11:13,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:11:13,693 INFO L276 IsEmpty]: Start isEmpty. Operand 7857 states and 17760 transitions. [2018-11-28 20:11:13,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 20:11:13,701 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:11:13,701 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:11:13,701 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:11:13,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:11:13,702 INFO L82 PathProgramCache]: Analyzing trace with hash 39095599, now seen corresponding path program 1 times [2018-11-28 20:11:13,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:11:13,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:11:13,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:13,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:11:13,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:13,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:11:13,795 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:11:13,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:11:13,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:11:13,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:11:13,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:11:13,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:11:13,796 INFO L87 Difference]: Start difference. First operand 7857 states and 17760 transitions. Second operand 4 states. [2018-11-28 20:11:13,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:11:13,949 INFO L93 Difference]: Finished difference Result 8431 states and 19074 transitions. [2018-11-28 20:11:13,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:11:13,950 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-11-28 20:11:13,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:11:13,960 INFO L225 Difference]: With dead ends: 8431 [2018-11-28 20:11:13,960 INFO L226 Difference]: Without dead ends: 8431 [2018-11-28 20:11:13,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:11:13,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8431 states. [2018-11-28 20:11:14,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8431 to 7772. [2018-11-28 20:11:14,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7772 states. [2018-11-28 20:11:14,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7772 states to 7772 states and 17676 transitions. [2018-11-28 20:11:14,048 INFO L78 Accepts]: Start accepts. Automaton has 7772 states and 17676 transitions. Word has length 91 [2018-11-28 20:11:14,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:11:14,048 INFO L480 AbstractCegarLoop]: Abstraction has 7772 states and 17676 transitions. [2018-11-28 20:11:14,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:11:14,048 INFO L276 IsEmpty]: Start isEmpty. Operand 7772 states and 17676 transitions. [2018-11-28 20:11:14,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 20:11:14,057 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:11:14,057 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:11:14,057 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:11:14,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:11:14,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1745561198, now seen corresponding path program 1 times [2018-11-28 20:11:14,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:11:14,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:11:14,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:14,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:11:14,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:14,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:11:14,262 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:11:14,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:11:14,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:11:14,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:11:14,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:11:14,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:11:14,263 INFO L87 Difference]: Start difference. First operand 7772 states and 17676 transitions. Second operand 5 states. [2018-11-28 20:11:14,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:11:14,415 INFO L93 Difference]: Finished difference Result 8948 states and 20243 transitions. [2018-11-28 20:11:14,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:11:14,416 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-11-28 20:11:14,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:11:14,427 INFO L225 Difference]: With dead ends: 8948 [2018-11-28 20:11:14,427 INFO L226 Difference]: Without dead ends: 8948 [2018-11-28 20:11:14,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:11:14,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8948 states. [2018-11-28 20:11:14,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8948 to 6902. [2018-11-28 20:11:14,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6902 states. [2018-11-28 20:11:14,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6902 states to 6902 states and 15741 transitions. [2018-11-28 20:11:14,510 INFO L78 Accepts]: Start accepts. Automaton has 6902 states and 15741 transitions. Word has length 93 [2018-11-28 20:11:14,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:11:14,511 INFO L480 AbstractCegarLoop]: Abstraction has 6902 states and 15741 transitions. [2018-11-28 20:11:14,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:11:14,511 INFO L276 IsEmpty]: Start isEmpty. Operand 6902 states and 15741 transitions. [2018-11-28 20:11:14,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 20:11:14,518 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:11:14,518 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:11:14,519 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:11:14,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:11:14,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1490824653, now seen corresponding path program 1 times [2018-11-28 20:11:14,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:11:14,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:11:14,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:14,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:11:14,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:14,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:11:14,794 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:11:14,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:11:14,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:11:14,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:11:14,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:11:14,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:11:14,796 INFO L87 Difference]: Start difference. First operand 6902 states and 15741 transitions. Second operand 5 states. [2018-11-28 20:11:15,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:11:15,369 INFO L93 Difference]: Finished difference Result 11458 states and 26340 transitions. [2018-11-28 20:11:15,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 20:11:15,371 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-11-28 20:11:15,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:11:15,385 INFO L225 Difference]: With dead ends: 11458 [2018-11-28 20:11:15,385 INFO L226 Difference]: Without dead ends: 11380 [2018-11-28 20:11:15,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:11:15,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11380 states. [2018-11-28 20:11:15,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11380 to 8056. [2018-11-28 20:11:15,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8056 states. [2018-11-28 20:11:15,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8056 states to 8056 states and 18403 transitions. [2018-11-28 20:11:15,502 INFO L78 Accepts]: Start accepts. Automaton has 8056 states and 18403 transitions. Word has length 93 [2018-11-28 20:11:15,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:11:15,503 INFO L480 AbstractCegarLoop]: Abstraction has 8056 states and 18403 transitions. [2018-11-28 20:11:15,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:11:15,503 INFO L276 IsEmpty]: Start isEmpty. Operand 8056 states and 18403 transitions. [2018-11-28 20:11:15,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 20:11:15,515 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:11:15,515 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:11:15,516 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:11:15,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:11:15,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1559378162, now seen corresponding path program 1 times [2018-11-28 20:11:15,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:11:15,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:11:15,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:15,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:11:15,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:15,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:11:15,723 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:11:15,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:11:15,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:11:15,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:11:15,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:11:15,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:11:15,725 INFO L87 Difference]: Start difference. First operand 8056 states and 18403 transitions. Second operand 6 states. [2018-11-28 20:11:16,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:11:16,104 INFO L93 Difference]: Finished difference Result 10204 states and 23157 transitions. [2018-11-28 20:11:16,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 20:11:16,106 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-11-28 20:11:16,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:11:16,117 INFO L225 Difference]: With dead ends: 10204 [2018-11-28 20:11:16,118 INFO L226 Difference]: Without dead ends: 10125 [2018-11-28 20:11:16,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-28 20:11:16,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10125 states. [2018-11-28 20:11:16,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10125 to 7529. [2018-11-28 20:11:16,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7529 states. [2018-11-28 20:11:16,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7529 states to 7529 states and 17293 transitions. [2018-11-28 20:11:16,214 INFO L78 Accepts]: Start accepts. Automaton has 7529 states and 17293 transitions. Word has length 93 [2018-11-28 20:11:16,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:11:16,215 INFO L480 AbstractCegarLoop]: Abstraction has 7529 states and 17293 transitions. [2018-11-28 20:11:16,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:11:16,215 INFO L276 IsEmpty]: Start isEmpty. Operand 7529 states and 17293 transitions. [2018-11-28 20:11:16,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 20:11:16,223 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:11:16,223 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:11:16,224 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:11:16,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:11:16,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1497612213, now seen corresponding path program 1 times [2018-11-28 20:11:16,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:11:16,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:11:16,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:16,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:11:16,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:16,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:11:16,470 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:11:16,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:11:16,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 20:11:16,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 20:11:16,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 20:11:16,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:11:16,471 INFO L87 Difference]: Start difference. First operand 7529 states and 17293 transitions. Second operand 9 states. [2018-11-28 20:11:17,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:11:17,167 INFO L93 Difference]: Finished difference Result 10604 states and 24259 transitions. [2018-11-28 20:11:17,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-28 20:11:17,169 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2018-11-28 20:11:17,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:11:17,181 INFO L225 Difference]: With dead ends: 10604 [2018-11-28 20:11:17,181 INFO L226 Difference]: Without dead ends: 10572 [2018-11-28 20:11:17,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-11-28 20:11:17,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10572 states. [2018-11-28 20:11:17,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10572 to 9100. [2018-11-28 20:11:17,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9100 states. [2018-11-28 20:11:17,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9100 states to 9100 states and 20773 transitions. [2018-11-28 20:11:17,291 INFO L78 Accepts]: Start accepts. Automaton has 9100 states and 20773 transitions. Word has length 93 [2018-11-28 20:11:17,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:11:17,291 INFO L480 AbstractCegarLoop]: Abstraction has 9100 states and 20773 transitions. [2018-11-28 20:11:17,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 20:11:17,292 INFO L276 IsEmpty]: Start isEmpty. Operand 9100 states and 20773 transitions. [2018-11-28 20:11:17,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 20:11:17,302 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:11:17,302 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:11:17,302 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:11:17,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:11:17,303 INFO L82 PathProgramCache]: Analyzing trace with hash -299339146, now seen corresponding path program 1 times [2018-11-28 20:11:17,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:11:17,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:11:17,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:17,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:11:17,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:17,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:11:18,152 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:11:18,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:11:18,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 20:11:18,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 20:11:18,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 20:11:18,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:11:18,155 INFO L87 Difference]: Start difference. First operand 9100 states and 20773 transitions. Second operand 8 states. [2018-11-28 20:11:19,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:11:19,374 INFO L93 Difference]: Finished difference Result 14198 states and 32836 transitions. [2018-11-28 20:11:19,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 20:11:19,375 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2018-11-28 20:11:19,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:11:19,392 INFO L225 Difference]: With dead ends: 14198 [2018-11-28 20:11:19,392 INFO L226 Difference]: Without dead ends: 14198 [2018-11-28 20:11:19,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-11-28 20:11:19,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14198 states. [2018-11-28 20:11:19,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14198 to 9690. [2018-11-28 20:11:19,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9690 states. [2018-11-28 20:11:19,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9690 states to 9690 states and 22304 transitions. [2018-11-28 20:11:19,524 INFO L78 Accepts]: Start accepts. Automaton has 9690 states and 22304 transitions. Word has length 93 [2018-11-28 20:11:19,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:11:19,524 INFO L480 AbstractCegarLoop]: Abstraction has 9690 states and 22304 transitions. [2018-11-28 20:11:19,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 20:11:19,525 INFO L276 IsEmpty]: Start isEmpty. Operand 9690 states and 22304 transitions. [2018-11-28 20:11:19,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 20:11:19,535 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:11:19,535 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:11:19,536 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:11:19,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:11:19,536 INFO L82 PathProgramCache]: Analyzing trace with hash 588164535, now seen corresponding path program 1 times [2018-11-28 20:11:19,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:11:19,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:11:19,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:19,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:11:19,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:19,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:11:19,655 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:11:19,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:11:19,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:11:19,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:11:19,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:11:19,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:11:19,656 INFO L87 Difference]: Start difference. First operand 9690 states and 22304 transitions. Second operand 3 states. [2018-11-28 20:11:19,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:11:19,834 INFO L93 Difference]: Finished difference Result 9434 states and 21504 transitions. [2018-11-28 20:11:19,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:11:19,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2018-11-28 20:11:19,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:11:19,849 INFO L225 Difference]: With dead ends: 9434 [2018-11-28 20:11:19,849 INFO L226 Difference]: Without dead ends: 9402 [2018-11-28 20:11:19,849 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:11:19,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9402 states. [2018-11-28 20:11:19,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9402 to 7460. [2018-11-28 20:11:19,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7460 states. [2018-11-28 20:11:19,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7460 states to 7460 states and 16875 transitions. [2018-11-28 20:11:19,973 INFO L78 Accepts]: Start accepts. Automaton has 7460 states and 16875 transitions. Word has length 93 [2018-11-28 20:11:19,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:11:19,974 INFO L480 AbstractCegarLoop]: Abstraction has 7460 states and 16875 transitions. [2018-11-28 20:11:19,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:11:19,974 INFO L276 IsEmpty]: Start isEmpty. Operand 7460 states and 16875 transitions. [2018-11-28 20:11:19,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-28 20:11:19,983 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:11:19,983 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:11:19,984 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:11:19,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:11:19,984 INFO L82 PathProgramCache]: Analyzing trace with hash -360597677, now seen corresponding path program 1 times [2018-11-28 20:11:19,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:11:19,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:11:19,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:19,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:11:19,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:20,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:11:20,306 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:11:20,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:11:20,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 20:11:20,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 20:11:20,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 20:11:20,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-28 20:11:20,307 INFO L87 Difference]: Start difference. First operand 7460 states and 16875 transitions. Second operand 11 states. [2018-11-28 20:11:21,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:11:21,700 INFO L93 Difference]: Finished difference Result 9968 states and 22228 transitions. [2018-11-28 20:11:21,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-28 20:11:21,701 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2018-11-28 20:11:21,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:11:21,714 INFO L225 Difference]: With dead ends: 9968 [2018-11-28 20:11:21,714 INFO L226 Difference]: Without dead ends: 9968 [2018-11-28 20:11:21,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2018-11-28 20:11:21,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9968 states. [2018-11-28 20:11:21,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9968 to 8883. [2018-11-28 20:11:21,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8883 states. [2018-11-28 20:11:21,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8883 states to 8883 states and 19937 transitions. [2018-11-28 20:11:21,837 INFO L78 Accepts]: Start accepts. Automaton has 8883 states and 19937 transitions. Word has length 95 [2018-11-28 20:11:21,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:11:21,837 INFO L480 AbstractCegarLoop]: Abstraction has 8883 states and 19937 transitions. [2018-11-28 20:11:21,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 20:11:21,837 INFO L276 IsEmpty]: Start isEmpty. Operand 8883 states and 19937 transitions. [2018-11-28 20:11:21,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-28 20:11:21,847 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:11:21,847 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:21,848 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:11:21,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:11:21,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1550303339, now seen corresponding path program 1 times [2018-11-28 20:11:21,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:11:21,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:11:21,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:21,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:11:21,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:21,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:11:22,372 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:11:22,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:11:22,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 20:11:22,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 20:11:22,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 20:11:22,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:11:22,374 INFO L87 Difference]: Start difference. First operand 8883 states and 19937 transitions. Second operand 9 states. [2018-11-28 20:11:23,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:11:23,218 INFO L93 Difference]: Finished difference Result 11095 states and 24591 transitions. [2018-11-28 20:11:23,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-28 20:11:23,219 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2018-11-28 20:11:23,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:11:23,234 INFO L225 Difference]: With dead ends: 11095 [2018-11-28 20:11:23,234 INFO L226 Difference]: Without dead ends: 11095 [2018-11-28 20:11:23,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2018-11-28 20:11:23,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11095 states. [2018-11-28 20:11:23,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11095 to 9338. [2018-11-28 20:11:23,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9338 states. [2018-11-28 20:11:23,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9338 states to 9338 states and 20900 transitions. [2018-11-28 20:11:23,351 INFO L78 Accepts]: Start accepts. Automaton has 9338 states and 20900 transitions. Word has length 95 [2018-11-28 20:11:23,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:11:23,352 INFO L480 AbstractCegarLoop]: Abstraction has 9338 states and 20900 transitions. [2018-11-28 20:11:23,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 20:11:23,352 INFO L276 IsEmpty]: Start isEmpty. Operand 9338 states and 20900 transitions. [2018-11-28 20:11:23,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-28 20:11:23,362 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:11:23,362 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:11:23,362 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:11:23,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:11:23,362 INFO L82 PathProgramCache]: Analyzing trace with hash 2068511189, now seen corresponding path program 1 times [2018-11-28 20:11:23,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:11:23,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:11:23,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:23,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:11:23,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:23,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:11:23,640 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:11:23,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:11:23,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 20:11:23,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 20:11:23,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 20:11:23,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:11:23,642 INFO L87 Difference]: Start difference. First operand 9338 states and 20900 transitions. Second operand 9 states. [2018-11-28 20:11:24,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:11:24,231 INFO L93 Difference]: Finished difference Result 10117 states and 22547 transitions. [2018-11-28 20:11:24,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-28 20:11:24,232 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2018-11-28 20:11:24,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:11:24,243 INFO L225 Difference]: With dead ends: 10117 [2018-11-28 20:11:24,244 INFO L226 Difference]: Without dead ends: 10117 [2018-11-28 20:11:24,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2018-11-28 20:11:24,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10117 states. [2018-11-28 20:11:24,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10117 to 7028. [2018-11-28 20:11:24,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7028 states. [2018-11-28 20:11:24,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7028 states to 7028 states and 15724 transitions. [2018-11-28 20:11:24,337 INFO L78 Accepts]: Start accepts. Automaton has 7028 states and 15724 transitions. Word has length 95 [2018-11-28 20:11:24,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:11:24,338 INFO L480 AbstractCegarLoop]: Abstraction has 7028 states and 15724 transitions. [2018-11-28 20:11:24,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 20:11:24,338 INFO L276 IsEmpty]: Start isEmpty. Operand 7028 states and 15724 transitions. [2018-11-28 20:11:24,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-28 20:11:24,346 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:11:24,346 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:11:24,346 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:11:24,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:11:24,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1338952426, now seen corresponding path program 1 times [2018-11-28 20:11:24,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:11:24,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:11:24,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:24,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:11:24,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:24,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:11:24,642 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:11:24,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:11:24,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 20:11:24,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 20:11:24,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 20:11:24,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-28 20:11:24,644 INFO L87 Difference]: Start difference. First operand 7028 states and 15724 transitions. Second operand 11 states. [2018-11-28 20:11:26,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:11:26,258 INFO L93 Difference]: Finished difference Result 13312 states and 30006 transitions. [2018-11-28 20:11:26,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 20:11:26,259 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2018-11-28 20:11:26,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:11:26,271 INFO L225 Difference]: With dead ends: 13312 [2018-11-28 20:11:26,272 INFO L226 Difference]: Without dead ends: 9089 [2018-11-28 20:11:26,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-11-28 20:11:26,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9089 states. [2018-11-28 20:11:26,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9089 to 6789. [2018-11-28 20:11:26,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6789 states. [2018-11-28 20:11:26,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6789 states to 6789 states and 15157 transitions. [2018-11-28 20:11:26,358 INFO L78 Accepts]: Start accepts. Automaton has 6789 states and 15157 transitions. Word has length 95 [2018-11-28 20:11:26,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:11:26,358 INFO L480 AbstractCegarLoop]: Abstraction has 6789 states and 15157 transitions. [2018-11-28 20:11:26,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 20:11:26,358 INFO L276 IsEmpty]: Start isEmpty. Operand 6789 states and 15157 transitions. [2018-11-28 20:11:26,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-28 20:11:26,366 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:11:26,366 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:11:26,366 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:11:26,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:11:26,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1071746382, now seen corresponding path program 1 times [2018-11-28 20:11:26,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:11:26,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:11:26,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:26,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:11:26,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:26,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:11:26,792 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-11-28 20:11:27,204 WARN L180 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 16 [2018-11-28 20:11:27,215 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:11:27,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:11:27,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:11:27,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:11:27,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:11:27,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:11:27,216 INFO L87 Difference]: Start difference. First operand 6789 states and 15157 transitions. Second operand 6 states. [2018-11-28 20:11:27,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:11:27,485 INFO L93 Difference]: Finished difference Result 7655 states and 16871 transitions. [2018-11-28 20:11:27,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:11:27,486 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2018-11-28 20:11:27,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:11:27,496 INFO L225 Difference]: With dead ends: 7655 [2018-11-28 20:11:27,496 INFO L226 Difference]: Without dead ends: 7598 [2018-11-28 20:11:27,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:11:27,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7598 states. [2018-11-28 20:11:27,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7598 to 6741. [2018-11-28 20:11:27,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6741 states. [2018-11-28 20:11:27,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6741 states to 6741 states and 14912 transitions. [2018-11-28 20:11:27,578 INFO L78 Accepts]: Start accepts. Automaton has 6741 states and 14912 transitions. Word has length 95 [2018-11-28 20:11:27,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:11:27,579 INFO L480 AbstractCegarLoop]: Abstraction has 6741 states and 14912 transitions. [2018-11-28 20:11:27,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:11:27,579 INFO L276 IsEmpty]: Start isEmpty. Operand 6741 states and 14912 transitions. [2018-11-28 20:11:27,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-28 20:11:27,587 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:11:27,587 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:11:27,587 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:11:27,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:11:27,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1408217134, now seen corresponding path program 2 times [2018-11-28 20:11:27,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:11:27,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:11:27,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:27,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:11:27,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:27,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:11:28,309 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:11:28,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:11:28,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:11:28,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:11:28,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:11:28,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:11:28,311 INFO L87 Difference]: Start difference. First operand 6741 states and 14912 transitions. Second operand 7 states. [2018-11-28 20:11:28,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:11:28,875 INFO L93 Difference]: Finished difference Result 9014 states and 19614 transitions. [2018-11-28 20:11:28,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 20:11:28,876 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-11-28 20:11:28,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:11:28,887 INFO L225 Difference]: With dead ends: 9014 [2018-11-28 20:11:28,887 INFO L226 Difference]: Without dead ends: 9014 [2018-11-28 20:11:28,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-11-28 20:11:28,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9014 states. [2018-11-28 20:11:28,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9014 to 7337. [2018-11-28 20:11:28,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7337 states. [2018-11-28 20:11:28,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7337 states to 7337 states and 16225 transitions. [2018-11-28 20:11:28,974 INFO L78 Accepts]: Start accepts. Automaton has 7337 states and 16225 transitions. Word has length 95 [2018-11-28 20:11:28,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:11:28,975 INFO L480 AbstractCegarLoop]: Abstraction has 7337 states and 16225 transitions. [2018-11-28 20:11:28,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:11:28,975 INFO L276 IsEmpty]: Start isEmpty. Operand 7337 states and 16225 transitions. [2018-11-28 20:11:28,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-28 20:11:28,984 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:11:28,984 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:11:28,985 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:11:28,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:11:28,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1196866221, now seen corresponding path program 1 times [2018-11-28 20:11:28,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:11:28,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:11:28,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:28,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 20:11:28,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:29,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:11:29,510 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:11:29,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:11:29,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:11:29,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:11:29,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:11:29,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:11:29,512 INFO L87 Difference]: Start difference. First operand 7337 states and 16225 transitions. Second operand 6 states. [2018-11-28 20:11:30,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:11:30,054 INFO L93 Difference]: Finished difference Result 7605 states and 16743 transitions. [2018-11-28 20:11:30,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:11:30,055 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2018-11-28 20:11:30,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:11:30,063 INFO L225 Difference]: With dead ends: 7605 [2018-11-28 20:11:30,064 INFO L226 Difference]: Without dead ends: 7605 [2018-11-28 20:11:30,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:11:30,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7605 states. [2018-11-28 20:11:30,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7605 to 7270. [2018-11-28 20:11:30,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7270 states. [2018-11-28 20:11:30,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7270 states to 7270 states and 16053 transitions. [2018-11-28 20:11:30,143 INFO L78 Accepts]: Start accepts. Automaton has 7270 states and 16053 transitions. Word has length 95 [2018-11-28 20:11:30,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:11:30,143 INFO L480 AbstractCegarLoop]: Abstraction has 7270 states and 16053 transitions. [2018-11-28 20:11:30,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:11:30,143 INFO L276 IsEmpty]: Start isEmpty. Operand 7270 states and 16053 transitions. [2018-11-28 20:11:30,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-28 20:11:30,151 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:11:30,151 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:11:30,152 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:11:30,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:11:30,152 INFO L82 PathProgramCache]: Analyzing trace with hash -741980621, now seen corresponding path program 2 times [2018-11-28 20:11:30,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:11:30,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:11:30,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:30,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:11:30,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:30,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:11:30,328 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:11:30,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:11:30,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:11:30,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:11:30,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:11:30,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:11:30,329 INFO L87 Difference]: Start difference. First operand 7270 states and 16053 transitions. Second operand 7 states. [2018-11-28 20:11:30,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:11:30,513 INFO L93 Difference]: Finished difference Result 9115 states and 20133 transitions. [2018-11-28 20:11:30,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:11:30,514 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-11-28 20:11:30,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:11:30,525 INFO L225 Difference]: With dead ends: 9115 [2018-11-28 20:11:30,525 INFO L226 Difference]: Without dead ends: 9115 [2018-11-28 20:11:30,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-28 20:11:30,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9115 states. [2018-11-28 20:11:30,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9115 to 6481. [2018-11-28 20:11:30,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6481 states. [2018-11-28 20:11:30,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6481 states to 6481 states and 14219 transitions. [2018-11-28 20:11:30,611 INFO L78 Accepts]: Start accepts. Automaton has 6481 states and 14219 transitions. Word has length 95 [2018-11-28 20:11:30,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:11:30,611 INFO L480 AbstractCegarLoop]: Abstraction has 6481 states and 14219 transitions. [2018-11-28 20:11:30,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:11:30,611 INFO L276 IsEmpty]: Start isEmpty. Operand 6481 states and 14219 transitions. [2018-11-28 20:11:30,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-28 20:11:30,619 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:11:30,619 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:30,619 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:11:30,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:11:30,620 INFO L82 PathProgramCache]: Analyzing trace with hash -530629708, now seen corresponding path program 2 times [2018-11-28 20:11:30,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:11:30,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:11:30,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:30,621 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 20:11:30,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:30,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 20:11:30,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 20:11:30,742 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 20:11:30,954 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-11-28 20:11:30,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:11:30 BasicIcfg [2018-11-28 20:11:30,955 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 20:11:30,956 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 20:11:30,956 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 20:11:30,956 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 20:11:30,957 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:10:39" (3/4) ... [2018-11-28 20:11:30,966 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 20:11:31,157 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 20:11:31,157 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 20:11:31,158 INFO L168 Benchmark]: Toolchain (without parser) took 53785.69 ms. Allocated memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: 1.8 GB). Free memory was 944.6 MB in the beginning and 1.2 GB in the end (delta: -225.0 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2018-11-28 20:11:31,162 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 20:11:31,162 INFO L168 Benchmark]: CACSL2BoogieTranslator took 833.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -163.1 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2018-11-28 20:11:31,163 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.65 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:11:31,163 INFO L168 Benchmark]: Boogie Preprocessor took 70.41 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:11:31,163 INFO L168 Benchmark]: RCFGBuilder took 1283.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.3 MB). Peak memory consumption was 45.3 MB. Max. memory is 11.5 GB. [2018-11-28 20:11:31,166 INFO L168 Benchmark]: TraceAbstraction took 51303.58 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.7 GB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -193.6 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2018-11-28 20:11:31,167 INFO L168 Benchmark]: Witness Printer took 201.32 ms. Allocated memory is still 2.8 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 74.2 MB). Peak memory consumption was 74.2 MB. Max. memory is 11.5 GB. [2018-11-28 20:11:31,169 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 833.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -163.1 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 84.65 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 70.41 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 1283.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.3 MB). Peak memory consumption was 45.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 51303.58 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.7 GB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -193.6 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. * Witness Printer took 201.32 ms. Allocated memory is still 2.8 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 74.2 MB). Peak memory consumption was 74.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L675] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L681] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L682] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L683] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L684] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L685] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L686] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L687] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L688] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L689] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L690] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L691] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L692] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L693] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L694] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L695] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L696] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L697] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L770] -1 pthread_t t1283; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L771] FCALL, FORK -1 pthread_create(&t1283, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L701] 0 y$w_buff1 = y$w_buff0 [L702] 0 y$w_buff0 = 1 [L703] 0 y$w_buff1_used = y$w_buff0_used [L704] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L772] -1 pthread_t t1284; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L773] FCALL, FORK -1 pthread_create(&t1284, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L706] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L707] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L708] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L709] 0 y$r_buff0_thd1 = (_Bool)1 [L712] 0 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L715] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 x = 1 [L732] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L733] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L734] 1 y$flush_delayed = weak$$choice2 [L735] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L737] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L737] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L738] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L739] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L740] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L741] EXPR 1 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L742] EXPR 1 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L743] 1 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L715] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L744] 1 y = y$flush_delayed ? y$mem_tmp : y [L745] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L716] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L716] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L717] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L718] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L718] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L719] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L722] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L748] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L748] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L750] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L751] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L752] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] 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=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] 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=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] 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=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] -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) [L780] 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=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L781] 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=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] -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 [L782] 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=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L782] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L783] 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=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] -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 [L786] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 222 locations, 3 error locations. UNSAFE Result, 51.1s OverallTime, 36 OverallIterations, 1 TraceHistogramMax, 27.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9309 SDtfs, 10448 SDslu, 24088 SDs, 0 SdLazy, 11278 SolverSat, 501 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 414 GetRequests, 98 SyntacticMatches, 44 SemanticMatches, 272 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 11.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38973occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 9.4s AutomataMinimizationTime, 35 MinimizatonAttempts, 92027 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 2739 NumberOfCodeBlocks, 2739 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 2609 ConstructedInterpolants, 0 QuantifiedInterpolants, 621810 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 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...