./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix012_rmo.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/mix012_rmo.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 874a9972fda7c5371d5beee908ce94ffa39446d7 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 18:35:29,310 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 18:35:29,311 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 18:35:29,324 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 18:35:29,324 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 18:35:29,325 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 18:35:29,327 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 18:35:29,329 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 18:35:29,331 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 18:35:29,332 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 18:35:29,333 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 18:35:29,333 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 18:35:29,334 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 18:35:29,335 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 18:35:29,337 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 18:35:29,338 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 18:35:29,339 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 18:35:29,341 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 18:35:29,343 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 18:35:29,345 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 18:35:29,346 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 18:35:29,348 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 18:35:29,351 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 18:35:29,351 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 18:35:29,351 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 18:35:29,352 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 18:35:29,354 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 18:35:29,355 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 18:35:29,355 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 18:35:29,357 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 18:35:29,357 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 18:35:29,358 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 18:35:29,358 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 18:35:29,358 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 18:35:29,360 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 18:35:29,360 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 18:35:29,361 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 18:35:29,377 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 18:35:29,378 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 18:35:29,379 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 18:35:29,379 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 18:35:29,380 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 18:35:29,380 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 18:35:29,380 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 18:35:29,381 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 18:35:29,381 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 18:35:29,381 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 18:35:29,381 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 18:35:29,382 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 18:35:29,382 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 18:35:29,382 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 18:35:29,382 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 18:35:29,383 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 18:35:29,383 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 18:35:29,383 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 18:35:29,384 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 18:35:29,384 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 18:35:29,384 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 18:35:29,384 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 18:35:29,385 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 18:35:29,385 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 18:35:29,385 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 18:35:29,385 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 18:35:29,386 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 18:35:29,386 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 18:35:29,386 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 -> 874a9972fda7c5371d5beee908ce94ffa39446d7 [2018-12-31 18:35:29,426 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 18:35:29,447 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 18:35:29,451 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 18:35:29,453 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 18:35:29,454 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 18:35:29,454 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix012_rmo.oepc_false-unreach-call.i [2018-12-31 18:35:29,521 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db53e5c0e/7be85451bd114c6d850066fc31e91483/FLAG2aa6e5b06 [2018-12-31 18:35:30,081 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 18:35:30,082 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix012_rmo.oepc_false-unreach-call.i [2018-12-31 18:35:30,103 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db53e5c0e/7be85451bd114c6d850066fc31e91483/FLAG2aa6e5b06 [2018-12-31 18:35:30,353 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db53e5c0e/7be85451bd114c6d850066fc31e91483 [2018-12-31 18:35:30,357 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 18:35:30,359 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 18:35:30,361 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 18:35:30,361 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 18:35:30,365 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 18:35:30,366 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 06:35:30" (1/1) ... [2018-12-31 18:35:30,370 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@785cf55a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:35:30, skipping insertion in model container [2018-12-31 18:35:30,370 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 06:35:30" (1/1) ... [2018-12-31 18:35:30,379 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 18:35:30,449 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 18:35:30,971 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 18:35:30,988 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 18:35:31,147 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 18:35:31,257 INFO L195 MainTranslator]: Completed translation [2018-12-31 18:35:31,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:35:31 WrapperNode [2018-12-31 18:35:31,258 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 18:35:31,259 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 18:35:31,260 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 18:35:31,260 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 18:35:31,272 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:35:31" (1/1) ... [2018-12-31 18:35:31,309 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:35:31" (1/1) ... [2018-12-31 18:35:31,366 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 18:35:31,366 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 18:35:31,367 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 18:35:31,367 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 18:35:31,379 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:35:31" (1/1) ... [2018-12-31 18:35:31,379 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:35:31" (1/1) ... [2018-12-31 18:35:31,389 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:35:31" (1/1) ... [2018-12-31 18:35:31,389 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:35:31" (1/1) ... [2018-12-31 18:35:31,415 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:35:31" (1/1) ... [2018-12-31 18:35:31,425 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:35:31" (1/1) ... [2018-12-31 18:35:31,428 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:35:31" (1/1) ... [2018-12-31 18:35:31,433 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 18:35:31,433 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 18:35:31,433 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 18:35:31,434 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 18:35:31,435 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:35:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 18:35:31,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 18:35:31,519 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-31 18:35:31,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 18:35:31,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 18:35:31,521 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-31 18:35:31,521 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-31 18:35:31,521 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-31 18:35:31,521 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-31 18:35:31,522 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-31 18:35:31,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 18:35:31,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 18:35:31,526 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-31 18:35:32,699 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 18:35:32,699 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-31 18:35:32,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 06:35:32 BoogieIcfgContainer [2018-12-31 18:35:32,700 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 18:35:32,704 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 18:35:32,705 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 18:35:32,708 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 18:35:32,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 06:35:30" (1/3) ... [2018-12-31 18:35:32,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12402a7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 06:35:32, skipping insertion in model container [2018-12-31 18:35:32,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:35:31" (2/3) ... [2018-12-31 18:35:32,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12402a7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 06:35:32, skipping insertion in model container [2018-12-31 18:35:32,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 06:35:32" (3/3) ... [2018-12-31 18:35:32,715 INFO L112 eAbstractionObserver]: Analyzing ICFG mix012_rmo.oepc_false-unreach-call.i [2018-12-31 18:35:32,770 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,770 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,770 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,770 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,770 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,771 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,771 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,771 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,772 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,772 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,772 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,772 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,773 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,773 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,773 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,773 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,774 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,774 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,774 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,774 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,774 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,775 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,775 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,775 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,775 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,775 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,776 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,776 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,776 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,776 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,777 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,777 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,777 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,777 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,777 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,777 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,778 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,778 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,779 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,779 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,780 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,780 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,780 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,780 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,780 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,780 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,781 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,781 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,781 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,781 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,781 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,782 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,782 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,782 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,783 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,783 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,783 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,783 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,784 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,784 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,784 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,784 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,784 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,784 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,785 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,785 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,786 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,787 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,787 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,787 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,787 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,787 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,790 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,790 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,790 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,791 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,791 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,792 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,792 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,792 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,792 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,792 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,793 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,793 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,793 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,793 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,793 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,796 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,796 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,797 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,797 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,798 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,798 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,798 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,799 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,799 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,799 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,799 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,800 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,800 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,800 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,800 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,800 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,802 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,802 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,803 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,805 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,805 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,805 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,805 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,806 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,806 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,806 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,806 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,810 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,811 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,811 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,811 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,811 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,812 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,812 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,812 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,812 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,812 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,813 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,813 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,813 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,813 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,813 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,815 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,815 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,815 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,815 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,815 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,816 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,816 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,816 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,816 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,816 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,817 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,817 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,817 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,817 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,817 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,818 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,818 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,818 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,818 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,818 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,819 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,819 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,819 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,819 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,819 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,820 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,820 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,820 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,820 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,820 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,821 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,822 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,822 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,822 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,822 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:32,852 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-31 18:35:32,852 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 18:35:32,865 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 18:35:32,888 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 18:35:32,918 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 18:35:32,919 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 18:35:32,919 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 18:35:32,919 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 18:35:32,919 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 18:35:32,919 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 18:35:32,920 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 18:35:32,920 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 18:35:32,920 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 18:35:32,941 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2018-12-31 18:35:35,614 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34807 states. [2018-12-31 18:35:35,616 INFO L276 IsEmpty]: Start isEmpty. Operand 34807 states. [2018-12-31 18:35:35,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-31 18:35:35,625 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:35,626 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] [2018-12-31 18:35:35,629 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:35,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:35,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1782476305, now seen corresponding path program 1 times [2018-12-31 18:35:35,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:35,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:35,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:35,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:35,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:35,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:36,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:36,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:36,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 18:35:36,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 18:35:36,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 18:35:36,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:35:36,091 INFO L87 Difference]: Start difference. First operand 34807 states. Second operand 4 states. [2018-12-31 18:35:37,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:37,606 INFO L93 Difference]: Finished difference Result 60791 states and 234494 transitions. [2018-12-31 18:35:37,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 18:35:37,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-12-31 18:35:37,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:37,977 INFO L225 Difference]: With dead ends: 60791 [2018-12-31 18:35:37,977 INFO L226 Difference]: Without dead ends: 44271 [2018-12-31 18:35:37,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:35:38,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44271 states. [2018-12-31 18:35:39,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44271 to 27339. [2018-12-31 18:35:39,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27339 states. [2018-12-31 18:35:39,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27339 states to 27339 states and 105500 transitions. [2018-12-31 18:35:39,870 INFO L78 Accepts]: Start accepts. Automaton has 27339 states and 105500 transitions. Word has length 34 [2018-12-31 18:35:39,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:39,874 INFO L480 AbstractCegarLoop]: Abstraction has 27339 states and 105500 transitions. [2018-12-31 18:35:39,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 18:35:39,874 INFO L276 IsEmpty]: Start isEmpty. Operand 27339 states and 105500 transitions. [2018-12-31 18:35:39,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-31 18:35:39,894 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:39,894 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:39,895 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:39,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:39,896 INFO L82 PathProgramCache]: Analyzing trace with hash -983112731, now seen corresponding path program 1 times [2018-12-31 18:35:39,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:39,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:39,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:39,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:39,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:39,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:40,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:40,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:40,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 18:35:40,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 18:35:40,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 18:35:40,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:35:40,148 INFO L87 Difference]: Start difference. First operand 27339 states and 105500 transitions. Second operand 4 states. [2018-12-31 18:35:40,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:40,599 INFO L93 Difference]: Finished difference Result 8529 states and 28345 transitions. [2018-12-31 18:35:40,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 18:35:40,600 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-12-31 18:35:40,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:40,631 INFO L225 Difference]: With dead ends: 8529 [2018-12-31 18:35:40,632 INFO L226 Difference]: Without dead ends: 7467 [2018-12-31 18:35:40,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:35:40,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7467 states. [2018-12-31 18:35:40,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7467 to 7467. [2018-12-31 18:35:40,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7467 states. [2018-12-31 18:35:40,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7467 states to 7467 states and 24637 transitions. [2018-12-31 18:35:40,871 INFO L78 Accepts]: Start accepts. Automaton has 7467 states and 24637 transitions. Word has length 46 [2018-12-31 18:35:40,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:40,872 INFO L480 AbstractCegarLoop]: Abstraction has 7467 states and 24637 transitions. [2018-12-31 18:35:40,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 18:35:40,873 INFO L276 IsEmpty]: Start isEmpty. Operand 7467 states and 24637 transitions. [2018-12-31 18:35:40,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-31 18:35:40,877 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:40,877 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:40,878 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:40,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:40,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1484418599, now seen corresponding path program 1 times [2018-12-31 18:35:40,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:40,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:40,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:40,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:40,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:41,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:41,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:41,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 18:35:41,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 18:35:41,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 18:35:41,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:35:41,220 INFO L87 Difference]: Start difference. First operand 7467 states and 24637 transitions. Second operand 5 states. [2018-12-31 18:35:43,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:43,393 INFO L93 Difference]: Finished difference Result 13999 states and 45806 transitions. [2018-12-31 18:35:43,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 18:35:43,394 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-31 18:35:43,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:43,443 INFO L225 Difference]: With dead ends: 13999 [2018-12-31 18:35:43,444 INFO L226 Difference]: Without dead ends: 13931 [2018-12-31 18:35:43,444 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-12-31 18:35:43,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13931 states. [2018-12-31 18:35:43,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13931 to 9442. [2018-12-31 18:35:43,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9442 states. [2018-12-31 18:35:43,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9442 states to 9442 states and 30543 transitions. [2018-12-31 18:35:43,988 INFO L78 Accepts]: Start accepts. Automaton has 9442 states and 30543 transitions. Word has length 47 [2018-12-31 18:35:43,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:43,990 INFO L480 AbstractCegarLoop]: Abstraction has 9442 states and 30543 transitions. [2018-12-31 18:35:43,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 18:35:43,990 INFO L276 IsEmpty]: Start isEmpty. Operand 9442 states and 30543 transitions. [2018-12-31 18:35:43,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-31 18:35:43,992 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:43,992 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] [2018-12-31 18:35:43,993 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:43,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:43,993 INFO L82 PathProgramCache]: Analyzing trace with hash 375052511, now seen corresponding path program 1 times [2018-12-31 18:35:43,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:43,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:43,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:43,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:43,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:44,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:44,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:44,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:44,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 18:35:44,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 18:35:44,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 18:35:44,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 18:35:44,109 INFO L87 Difference]: Start difference. First operand 9442 states and 30543 transitions. Second operand 3 states. [2018-12-31 18:35:44,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:44,334 INFO L93 Difference]: Finished difference Result 13280 states and 42642 transitions. [2018-12-31 18:35:44,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 18:35:44,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-31 18:35:44,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:44,372 INFO L225 Difference]: With dead ends: 13280 [2018-12-31 18:35:44,373 INFO L226 Difference]: Without dead ends: 13280 [2018-12-31 18:35:44,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 18:35:44,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13280 states. [2018-12-31 18:35:44,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13280 to 9846. [2018-12-31 18:35:44,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9846 states. [2018-12-31 18:35:44,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9846 states to 9846 states and 31509 transitions. [2018-12-31 18:35:44,644 INFO L78 Accepts]: Start accepts. Automaton has 9846 states and 31509 transitions. Word has length 49 [2018-12-31 18:35:44,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:44,644 INFO L480 AbstractCegarLoop]: Abstraction has 9846 states and 31509 transitions. [2018-12-31 18:35:44,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 18:35:44,645 INFO L276 IsEmpty]: Start isEmpty. Operand 9846 states and 31509 transitions. [2018-12-31 18:35:44,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-31 18:35:44,649 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:44,649 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] [2018-12-31 18:35:44,649 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:44,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:44,650 INFO L82 PathProgramCache]: Analyzing trace with hash -211879190, now seen corresponding path program 1 times [2018-12-31 18:35:44,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:44,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:44,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:44,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:44,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:44,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:44,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:44,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:44,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 18:35:44,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 18:35:44,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 18:35:44,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:35:44,868 INFO L87 Difference]: Start difference. First operand 9846 states and 31509 transitions. Second operand 6 states. [2018-12-31 18:35:45,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:45,586 INFO L93 Difference]: Finished difference Result 14204 states and 45065 transitions. [2018-12-31 18:35:45,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 18:35:45,587 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-31 18:35:45,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:45,623 INFO L225 Difference]: With dead ends: 14204 [2018-12-31 18:35:45,624 INFO L226 Difference]: Without dead ends: 14132 [2018-12-31 18:35:45,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-31 18:35:45,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14132 states. [2018-12-31 18:35:45,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14132 to 10850. [2018-12-31 18:35:45,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10850 states. [2018-12-31 18:35:45,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10850 states to 10850 states and 34564 transitions. [2018-12-31 18:35:45,915 INFO L78 Accepts]: Start accepts. Automaton has 10850 states and 34564 transitions. Word has length 53 [2018-12-31 18:35:45,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:45,917 INFO L480 AbstractCegarLoop]: Abstraction has 10850 states and 34564 transitions. [2018-12-31 18:35:45,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 18:35:45,917 INFO L276 IsEmpty]: Start isEmpty. Operand 10850 states and 34564 transitions. [2018-12-31 18:35:45,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-31 18:35:45,928 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:45,931 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:45,933 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:45,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:45,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1760614074, now seen corresponding path program 1 times [2018-12-31 18:35:45,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:45,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:45,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:45,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:45,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:45,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:46,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:46,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:46,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 18:35:46,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 18:35:46,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 18:35:46,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:35:46,162 INFO L87 Difference]: Start difference. First operand 10850 states and 34564 transitions. Second operand 4 states. [2018-12-31 18:35:46,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:46,425 INFO L93 Difference]: Finished difference Result 12397 states and 39573 transitions. [2018-12-31 18:35:46,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 18:35:46,426 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-12-31 18:35:46,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:46,461 INFO L225 Difference]: With dead ends: 12397 [2018-12-31 18:35:46,461 INFO L226 Difference]: Without dead ends: 12397 [2018-12-31 18:35:46,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:35:46,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12397 states. [2018-12-31 18:35:46,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12397 to 11370. [2018-12-31 18:35:46,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11370 states. [2018-12-31 18:35:46,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11370 states to 11370 states and 36237 transitions. [2018-12-31 18:35:46,769 INFO L78 Accepts]: Start accepts. Automaton has 11370 states and 36237 transitions. Word has length 61 [2018-12-31 18:35:46,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:46,770 INFO L480 AbstractCegarLoop]: Abstraction has 11370 states and 36237 transitions. [2018-12-31 18:35:46,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 18:35:46,770 INFO L276 IsEmpty]: Start isEmpty. Operand 11370 states and 36237 transitions. [2018-12-31 18:35:46,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-31 18:35:46,778 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:46,778 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] [2018-12-31 18:35:46,778 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:46,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:46,779 INFO L82 PathProgramCache]: Analyzing trace with hash -17803739, now seen corresponding path program 1 times [2018-12-31 18:35:46,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:46,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:46,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:46,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:46,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:46,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:46,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:46,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 18:35:46,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 18:35:46,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 18:35:46,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:35:46,909 INFO L87 Difference]: Start difference. First operand 11370 states and 36237 transitions. Second operand 6 states. [2018-12-31 18:35:47,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:47,961 INFO L93 Difference]: Finished difference Result 20970 states and 66487 transitions. [2018-12-31 18:35:47,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 18:35:47,962 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-12-31 18:35:47,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:48,013 INFO L225 Difference]: With dead ends: 20970 [2018-12-31 18:35:48,013 INFO L226 Difference]: Without dead ends: 20899 [2018-12-31 18:35:48,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-31 18:35:48,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20899 states. [2018-12-31 18:35:48,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20899 to 13756. [2018-12-31 18:35:48,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13756 states. [2018-12-31 18:35:48,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13756 states to 13756 states and 43281 transitions. [2018-12-31 18:35:48,686 INFO L78 Accepts]: Start accepts. Automaton has 13756 states and 43281 transitions. Word has length 61 [2018-12-31 18:35:48,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:48,687 INFO L480 AbstractCegarLoop]: Abstraction has 13756 states and 43281 transitions. [2018-12-31 18:35:48,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 18:35:48,687 INFO L276 IsEmpty]: Start isEmpty. Operand 13756 states and 43281 transitions. [2018-12-31 18:35:48,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-31 18:35:48,697 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:48,697 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] [2018-12-31 18:35:48,698 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:48,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:48,698 INFO L82 PathProgramCache]: Analyzing trace with hash -248672700, now seen corresponding path program 1 times [2018-12-31 18:35:48,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:48,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:48,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:48,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:48,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:48,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:48,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:48,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:48,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 18:35:48,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 18:35:48,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 18:35:48,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 18:35:48,837 INFO L87 Difference]: Start difference. First operand 13756 states and 43281 transitions. Second operand 3 states. [2018-12-31 18:35:49,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:49,337 INFO L93 Difference]: Finished difference Result 14388 states and 44981 transitions. [2018-12-31 18:35:49,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 18:35:49,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-12-31 18:35:49,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:49,367 INFO L225 Difference]: With dead ends: 14388 [2018-12-31 18:35:49,368 INFO L226 Difference]: Without dead ends: 14388 [2018-12-31 18:35:49,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 18:35:49,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14388 states. [2018-12-31 18:35:49,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14388 to 14072. [2018-12-31 18:35:49,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14072 states. [2018-12-31 18:35:49,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14072 states to 14072 states and 44131 transitions. [2018-12-31 18:35:49,614 INFO L78 Accepts]: Start accepts. Automaton has 14072 states and 44131 transitions. Word has length 65 [2018-12-31 18:35:49,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:49,615 INFO L480 AbstractCegarLoop]: Abstraction has 14072 states and 44131 transitions. [2018-12-31 18:35:49,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 18:35:49,615 INFO L276 IsEmpty]: Start isEmpty. Operand 14072 states and 44131 transitions. [2018-12-31 18:35:49,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-31 18:35:49,623 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:49,623 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] [2018-12-31 18:35:49,623 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:49,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:49,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1828536643, now seen corresponding path program 1 times [2018-12-31 18:35:49,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:49,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:49,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:49,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:49,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:49,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:49,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:49,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:49,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 18:35:49,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 18:35:49,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 18:35:49,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:35:49,753 INFO L87 Difference]: Start difference. First operand 14072 states and 44131 transitions. Second operand 4 states. [2018-12-31 18:35:50,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:50,392 INFO L93 Difference]: Finished difference Result 17952 states and 55436 transitions. [2018-12-31 18:35:50,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 18:35:50,393 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-31 18:35:50,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:50,429 INFO L225 Difference]: With dead ends: 17952 [2018-12-31 18:35:50,429 INFO L226 Difference]: Without dead ends: 17952 [2018-12-31 18:35:50,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:35:50,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17952 states. [2018-12-31 18:35:50,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17952 to 16110. [2018-12-31 18:35:50,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16110 states. [2018-12-31 18:35:50,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16110 states to 16110 states and 49982 transitions. [2018-12-31 18:35:50,733 INFO L78 Accepts]: Start accepts. Automaton has 16110 states and 49982 transitions. Word has length 65 [2018-12-31 18:35:50,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:50,734 INFO L480 AbstractCegarLoop]: Abstraction has 16110 states and 49982 transitions. [2018-12-31 18:35:50,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 18:35:50,734 INFO L276 IsEmpty]: Start isEmpty. Operand 16110 states and 49982 transitions. [2018-12-31 18:35:50,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 18:35:50,748 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:50,748 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] [2018-12-31 18:35:50,748 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:50,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:50,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1344510516, now seen corresponding path program 1 times [2018-12-31 18:35:50,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:50,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:50,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:50,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:50,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:50,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:51,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:51,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:51,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 18:35:51,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 18:35:51,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 18:35:51,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:35:51,101 INFO L87 Difference]: Start difference. First operand 16110 states and 49982 transitions. Second operand 6 states. [2018-12-31 18:35:52,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:52,584 INFO L93 Difference]: Finished difference Result 19822 states and 60438 transitions. [2018-12-31 18:35:52,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 18:35:52,585 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-31 18:35:52,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:52,618 INFO L225 Difference]: With dead ends: 19822 [2018-12-31 18:35:52,618 INFO L226 Difference]: Without dead ends: 19822 [2018-12-31 18:35:52,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:35:52,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19822 states. [2018-12-31 18:35:53,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19822 to 18618. [2018-12-31 18:35:53,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18618 states. [2018-12-31 18:35:53,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18618 states to 18618 states and 57218 transitions. [2018-12-31 18:35:53,159 INFO L78 Accepts]: Start accepts. Automaton has 18618 states and 57218 transitions. Word has length 67 [2018-12-31 18:35:53,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:53,159 INFO L480 AbstractCegarLoop]: Abstraction has 18618 states and 57218 transitions. [2018-12-31 18:35:53,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 18:35:53,160 INFO L276 IsEmpty]: Start isEmpty. Operand 18618 states and 57218 transitions. [2018-12-31 18:35:53,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 18:35:53,173 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:53,174 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] [2018-12-31 18:35:53,174 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:53,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:53,174 INFO L82 PathProgramCache]: Analyzing trace with hash 873247437, now seen corresponding path program 1 times [2018-12-31 18:35:53,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:53,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:53,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:53,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:53,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:53,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:53,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:53,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:53,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 18:35:53,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 18:35:53,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 18:35:53,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:35:53,347 INFO L87 Difference]: Start difference. First operand 18618 states and 57218 transitions. Second operand 6 states. [2018-12-31 18:35:54,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:54,170 INFO L93 Difference]: Finished difference Result 21450 states and 63627 transitions. [2018-12-31 18:35:54,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 18:35:54,171 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-31 18:35:54,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:54,206 INFO L225 Difference]: With dead ends: 21450 [2018-12-31 18:35:54,206 INFO L226 Difference]: Without dead ends: 21450 [2018-12-31 18:35:54,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-31 18:35:54,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21450 states. [2018-12-31 18:35:54,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21450 to 19134. [2018-12-31 18:35:54,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19134 states. [2018-12-31 18:35:54,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19134 states to 19134 states and 57765 transitions. [2018-12-31 18:35:54,506 INFO L78 Accepts]: Start accepts. Automaton has 19134 states and 57765 transitions. Word has length 67 [2018-12-31 18:35:54,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:54,507 INFO L480 AbstractCegarLoop]: Abstraction has 19134 states and 57765 transitions. [2018-12-31 18:35:54,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 18:35:54,507 INFO L276 IsEmpty]: Start isEmpty. Operand 19134 states and 57765 transitions. [2018-12-31 18:35:54,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 18:35:54,519 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:54,519 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:54,519 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:54,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:54,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1084598350, now seen corresponding path program 1 times [2018-12-31 18:35:54,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:54,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:54,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:54,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:54,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:54,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:54,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:54,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:54,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 18:35:54,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 18:35:54,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 18:35:54,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:35:54,820 INFO L87 Difference]: Start difference. First operand 19134 states and 57765 transitions. Second operand 5 states. [2018-12-31 18:35:55,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:55,913 INFO L93 Difference]: Finished difference Result 25025 states and 75019 transitions. [2018-12-31 18:35:55,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 18:35:55,914 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-31 18:35:55,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:55,958 INFO L225 Difference]: With dead ends: 25025 [2018-12-31 18:35:55,958 INFO L226 Difference]: Without dead ends: 25025 [2018-12-31 18:35:55,959 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-12-31 18:35:56,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25025 states. [2018-12-31 18:35:56,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25025 to 22710. [2018-12-31 18:35:56,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22710 states. [2018-12-31 18:35:56,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22710 states to 22710 states and 68033 transitions. [2018-12-31 18:35:56,347 INFO L78 Accepts]: Start accepts. Automaton has 22710 states and 68033 transitions. Word has length 67 [2018-12-31 18:35:56,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:56,347 INFO L480 AbstractCegarLoop]: Abstraction has 22710 states and 68033 transitions. [2018-12-31 18:35:56,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 18:35:56,347 INFO L276 IsEmpty]: Start isEmpty. Operand 22710 states and 68033 transitions. [2018-12-31 18:35:56,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 18:35:56,361 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:56,361 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] [2018-12-31 18:35:56,362 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:56,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:56,362 INFO L82 PathProgramCache]: Analyzing trace with hash 574064173, now seen corresponding path program 1 times [2018-12-31 18:35:56,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:56,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:56,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:56,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:56,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:56,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:56,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:56,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:56,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 18:35:56,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 18:35:56,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 18:35:56,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:35:56,770 INFO L87 Difference]: Start difference. First operand 22710 states and 68033 transitions. Second operand 5 states. [2018-12-31 18:35:57,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:57,839 INFO L93 Difference]: Finished difference Result 31960 states and 94872 transitions. [2018-12-31 18:35:57,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 18:35:57,840 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-31 18:35:57,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:57,896 INFO L225 Difference]: With dead ends: 31960 [2018-12-31 18:35:57,896 INFO L226 Difference]: Without dead ends: 31960 [2018-12-31 18:35:57,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 18:35:57,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31960 states. [2018-12-31 18:35:58,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31960 to 28240. [2018-12-31 18:35:58,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28240 states. [2018-12-31 18:35:58,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28240 states to 28240 states and 84260 transitions. [2018-12-31 18:35:58,480 INFO L78 Accepts]: Start accepts. Automaton has 28240 states and 84260 transitions. Word has length 67 [2018-12-31 18:35:58,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:58,480 INFO L480 AbstractCegarLoop]: Abstraction has 28240 states and 84260 transitions. [2018-12-31 18:35:58,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 18:35:58,481 INFO L276 IsEmpty]: Start isEmpty. Operand 28240 states and 84260 transitions. [2018-12-31 18:35:58,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 18:35:58,498 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:58,498 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] [2018-12-31 18:35:58,499 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:58,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:58,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1233390290, now seen corresponding path program 1 times [2018-12-31 18:35:58,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:58,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:58,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:58,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:58,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:58,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:58,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:58,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:58,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 18:35:58,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 18:35:58,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 18:35:58,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:35:58,754 INFO L87 Difference]: Start difference. First operand 28240 states and 84260 transitions. Second operand 4 states. [2018-12-31 18:35:59,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:59,761 INFO L93 Difference]: Finished difference Result 38904 states and 116586 transitions. [2018-12-31 18:35:59,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 18:35:59,762 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-31 18:35:59,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:59,831 INFO L225 Difference]: With dead ends: 38904 [2018-12-31 18:35:59,832 INFO L226 Difference]: Without dead ends: 38672 [2018-12-31 18:35:59,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:35:59,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38672 states. [2018-12-31 18:36:00,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38672 to 35808. [2018-12-31 18:36:00,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35808 states. [2018-12-31 18:36:00,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35808 states to 35808 states and 107400 transitions. [2018-12-31 18:36:00,363 INFO L78 Accepts]: Start accepts. Automaton has 35808 states and 107400 transitions. Word has length 67 [2018-12-31 18:36:00,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:00,363 INFO L480 AbstractCegarLoop]: Abstraction has 35808 states and 107400 transitions. [2018-12-31 18:36:00,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 18:36:00,363 INFO L276 IsEmpty]: Start isEmpty. Operand 35808 states and 107400 transitions. [2018-12-31 18:36:00,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 18:36:00,377 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:00,378 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] [2018-12-31 18:36:00,378 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:00,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:00,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1264625647, now seen corresponding path program 1 times [2018-12-31 18:36:00,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:00,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:00,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:00,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:00,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:00,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:00,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:36:00,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:00,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 18:36:00,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 18:36:00,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 18:36:00,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:36:00,622 INFO L87 Difference]: Start difference. First operand 35808 states and 107400 transitions. Second operand 5 states. [2018-12-31 18:36:00,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:00,702 INFO L93 Difference]: Finished difference Result 9316 states and 22547 transitions. [2018-12-31 18:36:00,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 18:36:00,702 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-31 18:36:00,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:00,713 INFO L225 Difference]: With dead ends: 9316 [2018-12-31 18:36:00,714 INFO L226 Difference]: Without dead ends: 7464 [2018-12-31 18:36:00,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:36:00,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7464 states. [2018-12-31 18:36:00,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7464 to 6361. [2018-12-31 18:36:00,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6361 states. [2018-12-31 18:36:00,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6361 states to 6361 states and 15018 transitions. [2018-12-31 18:36:00,802 INFO L78 Accepts]: Start accepts. Automaton has 6361 states and 15018 transitions. Word has length 67 [2018-12-31 18:36:00,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:00,803 INFO L480 AbstractCegarLoop]: Abstraction has 6361 states and 15018 transitions. [2018-12-31 18:36:00,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 18:36:00,803 INFO L276 IsEmpty]: Start isEmpty. Operand 6361 states and 15018 transitions. [2018-12-31 18:36:00,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 18:36:00,810 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:00,810 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] [2018-12-31 18:36:00,810 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:00,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:00,811 INFO L82 PathProgramCache]: Analyzing trace with hash 288361846, now seen corresponding path program 1 times [2018-12-31 18:36:00,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:00,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:00,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:00,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:00,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:00,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:36:00,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:00,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 18:36:00,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 18:36:00,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 18:36:00,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 18:36:00,893 INFO L87 Difference]: Start difference. First operand 6361 states and 15018 transitions. Second operand 3 states. [2018-12-31 18:36:01,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:01,117 INFO L93 Difference]: Finished difference Result 8820 states and 20757 transitions. [2018-12-31 18:36:01,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 18:36:01,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-31 18:36:01,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:01,129 INFO L225 Difference]: With dead ends: 8820 [2018-12-31 18:36:01,129 INFO L226 Difference]: Without dead ends: 8820 [2018-12-31 18:36:01,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 18:36:01,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8820 states. [2018-12-31 18:36:01,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8820 to 6300. [2018-12-31 18:36:01,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6300 states. [2018-12-31 18:36:01,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6300 states to 6300 states and 14558 transitions. [2018-12-31 18:36:01,227 INFO L78 Accepts]: Start accepts. Automaton has 6300 states and 14558 transitions. Word has length 67 [2018-12-31 18:36:01,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:01,227 INFO L480 AbstractCegarLoop]: Abstraction has 6300 states and 14558 transitions. [2018-12-31 18:36:01,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 18:36:01,227 INFO L276 IsEmpty]: Start isEmpty. Operand 6300 states and 14558 transitions. [2018-12-31 18:36:01,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-31 18:36:01,235 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:01,235 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:36:01,235 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:01,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:01,236 INFO L82 PathProgramCache]: Analyzing trace with hash -211461463, now seen corresponding path program 1 times [2018-12-31 18:36:01,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:01,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:01,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:01,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:01,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:01,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:01,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:36:01,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:01,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 18:36:01,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 18:36:01,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 18:36:01,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:36:01,366 INFO L87 Difference]: Start difference. First operand 6300 states and 14558 transitions. Second operand 5 states. [2018-12-31 18:36:01,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:01,573 INFO L93 Difference]: Finished difference Result 7470 states and 17199 transitions. [2018-12-31 18:36:01,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 18:36:01,574 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-12-31 18:36:01,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:01,585 INFO L225 Difference]: With dead ends: 7470 [2018-12-31 18:36:01,585 INFO L226 Difference]: Without dead ends: 7470 [2018-12-31 18:36:01,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 18:36:01,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7470 states. [2018-12-31 18:36:01,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7470 to 6744. [2018-12-31 18:36:01,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6744 states. [2018-12-31 18:36:01,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6744 states to 6744 states and 15562 transitions. [2018-12-31 18:36:01,672 INFO L78 Accepts]: Start accepts. Automaton has 6744 states and 15562 transitions. Word has length 73 [2018-12-31 18:36:01,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:01,673 INFO L480 AbstractCegarLoop]: Abstraction has 6744 states and 15562 transitions. [2018-12-31 18:36:01,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 18:36:01,673 INFO L276 IsEmpty]: Start isEmpty. Operand 6744 states and 15562 transitions. [2018-12-31 18:36:01,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-31 18:36:01,680 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:01,680 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:36:01,680 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:01,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:01,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1531348872, now seen corresponding path program 1 times [2018-12-31 18:36:01,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:01,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:01,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:01,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:01,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:01,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:01,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:36:01,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:01,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 18:36:01,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 18:36:01,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 18:36:01,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:36:01,808 INFO L87 Difference]: Start difference. First operand 6744 states and 15562 transitions. Second operand 7 states. [2018-12-31 18:36:02,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:02,312 INFO L93 Difference]: Finished difference Result 7881 states and 17984 transitions. [2018-12-31 18:36:02,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 18:36:02,313 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2018-12-31 18:36:02,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:02,323 INFO L225 Difference]: With dead ends: 7881 [2018-12-31 18:36:02,323 INFO L226 Difference]: Without dead ends: 7762 [2018-12-31 18:36:02,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-12-31 18:36:02,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7762 states. [2018-12-31 18:36:02,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7762 to 6841. [2018-12-31 18:36:02,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6841 states. [2018-12-31 18:36:02,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6841 states to 6841 states and 15655 transitions. [2018-12-31 18:36:02,410 INFO L78 Accepts]: Start accepts. Automaton has 6841 states and 15655 transitions. Word has length 73 [2018-12-31 18:36:02,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:02,410 INFO L480 AbstractCegarLoop]: Abstraction has 6841 states and 15655 transitions. [2018-12-31 18:36:02,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 18:36:02,411 INFO L276 IsEmpty]: Start isEmpty. Operand 6841 states and 15655 transitions. [2018-12-31 18:36:02,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-31 18:36:02,418 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:02,419 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] [2018-12-31 18:36:02,419 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:02,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:02,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1190095737, now seen corresponding path program 1 times [2018-12-31 18:36:02,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:02,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:02,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:02,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:02,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:02,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:02,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:36:02,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:02,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 18:36:02,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 18:36:02,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 18:36:02,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:36:02,522 INFO L87 Difference]: Start difference. First operand 6841 states and 15655 transitions. Second operand 4 states. [2018-12-31 18:36:02,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:02,946 INFO L93 Difference]: Finished difference Result 10608 states and 24142 transitions. [2018-12-31 18:36:02,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 18:36:02,948 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-31 18:36:02,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:02,963 INFO L225 Difference]: With dead ends: 10608 [2018-12-31 18:36:02,963 INFO L226 Difference]: Without dead ends: 10608 [2018-12-31 18:36:02,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:36:02,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10608 states. [2018-12-31 18:36:03,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10608 to 7961. [2018-12-31 18:36:03,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7961 states. [2018-12-31 18:36:03,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7961 states to 7961 states and 17989 transitions. [2018-12-31 18:36:03,080 INFO L78 Accepts]: Start accepts. Automaton has 7961 states and 17989 transitions. Word has length 92 [2018-12-31 18:36:03,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:03,080 INFO L480 AbstractCegarLoop]: Abstraction has 7961 states and 17989 transitions. [2018-12-31 18:36:03,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 18:36:03,080 INFO L276 IsEmpty]: Start isEmpty. Operand 7961 states and 17989 transitions. [2018-12-31 18:36:03,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-31 18:36:03,090 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:03,091 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] [2018-12-31 18:36:03,091 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:03,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:03,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1830258482, now seen corresponding path program 1 times [2018-12-31 18:36:03,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:03,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:03,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:03,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:03,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:03,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:03,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:36:03,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:03,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 18:36:03,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 18:36:03,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 18:36:03,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:36:03,280 INFO L87 Difference]: Start difference. First operand 7961 states and 17989 transitions. Second operand 4 states. [2018-12-31 18:36:03,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:03,407 INFO L93 Difference]: Finished difference Result 8526 states and 19282 transitions. [2018-12-31 18:36:03,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 18:36:03,408 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-31 18:36:03,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:03,418 INFO L225 Difference]: With dead ends: 8526 [2018-12-31 18:36:03,419 INFO L226 Difference]: Without dead ends: 8526 [2018-12-31 18:36:03,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:36:03,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8526 states. [2018-12-31 18:36:03,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8526 to 7867. [2018-12-31 18:36:03,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7867 states. [2018-12-31 18:36:03,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7867 states to 7867 states and 17884 transitions. [2018-12-31 18:36:03,515 INFO L78 Accepts]: Start accepts. Automaton has 7867 states and 17884 transitions. Word has length 92 [2018-12-31 18:36:03,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:03,515 INFO L480 AbstractCegarLoop]: Abstraction has 7867 states and 17884 transitions. [2018-12-31 18:36:03,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 18:36:03,515 INFO L276 IsEmpty]: Start isEmpty. Operand 7867 states and 17884 transitions. [2018-12-31 18:36:03,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 18:36:03,524 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:03,524 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] [2018-12-31 18:36:03,524 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:03,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:03,524 INFO L82 PathProgramCache]: Analyzing trace with hash -2094563457, now seen corresponding path program 1 times [2018-12-31 18:36:03,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:03,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:03,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:03,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:03,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:03,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:03,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:36:03,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:03,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 18:36:03,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 18:36:03,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 18:36:03,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:36:03,636 INFO L87 Difference]: Start difference. First operand 7867 states and 17884 transitions. Second operand 5 states. [2018-12-31 18:36:04,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:04,006 INFO L93 Difference]: Finished difference Result 7433 states and 16736 transitions. [2018-12-31 18:36:04,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 18:36:04,007 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-31 18:36:04,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:04,017 INFO L225 Difference]: With dead ends: 7433 [2018-12-31 18:36:04,017 INFO L226 Difference]: Without dead ends: 7433 [2018-12-31 18:36:04,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:36:04,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7433 states. [2018-12-31 18:36:04,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7433 to 7001. [2018-12-31 18:36:04,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7001 states. [2018-12-31 18:36:04,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7001 states to 7001 states and 15799 transitions. [2018-12-31 18:36:04,100 INFO L78 Accepts]: Start accepts. Automaton has 7001 states and 15799 transitions. Word has length 94 [2018-12-31 18:36:04,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:04,100 INFO L480 AbstractCegarLoop]: Abstraction has 7001 states and 15799 transitions. [2018-12-31 18:36:04,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 18:36:04,100 INFO L276 IsEmpty]: Start isEmpty. Operand 7001 states and 15799 transitions. [2018-12-31 18:36:04,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 18:36:04,109 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:04,109 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] [2018-12-31 18:36:04,109 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:04,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:04,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1751651615, now seen corresponding path program 1 times [2018-12-31 18:36:04,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:04,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:04,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:04,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:04,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:04,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:04,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:36:04,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:04,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 18:36:04,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 18:36:04,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 18:36:04,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-31 18:36:04,421 INFO L87 Difference]: Start difference. First operand 7001 states and 15799 transitions. Second operand 8 states. [2018-12-31 18:36:08,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:08,898 INFO L93 Difference]: Finished difference Result 19264 states and 43254 transitions. [2018-12-31 18:36:08,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-31 18:36:08,900 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2018-12-31 18:36:08,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:08,924 INFO L225 Difference]: With dead ends: 19264 [2018-12-31 18:36:08,924 INFO L226 Difference]: Without dead ends: 19145 [2018-12-31 18:36:08,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=324, Invalid=1158, Unknown=0, NotChecked=0, Total=1482 [2018-12-31 18:36:08,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19145 states. [2018-12-31 18:36:09,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19145 to 10407. [2018-12-31 18:36:09,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10407 states. [2018-12-31 18:36:09,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10407 states to 10407 states and 23675 transitions. [2018-12-31 18:36:09,137 INFO L78 Accepts]: Start accepts. Automaton has 10407 states and 23675 transitions. Word has length 94 [2018-12-31 18:36:09,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:09,138 INFO L480 AbstractCegarLoop]: Abstraction has 10407 states and 23675 transitions. [2018-12-31 18:36:09,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 18:36:09,138 INFO L276 IsEmpty]: Start isEmpty. Operand 10407 states and 23675 transitions. [2018-12-31 18:36:09,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 18:36:09,154 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:09,154 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] [2018-12-31 18:36:09,154 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:09,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:09,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1298551200, now seen corresponding path program 1 times [2018-12-31 18:36:09,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:09,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:09,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:09,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:09,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:09,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:09,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:36:09,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:09,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 18:36:09,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 18:36:09,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 18:36:09,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:36:09,410 INFO L87 Difference]: Start difference. First operand 10407 states and 23675 transitions. Second operand 6 states. [2018-12-31 18:36:09,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:09,821 INFO L93 Difference]: Finished difference Result 11096 states and 24687 transitions. [2018-12-31 18:36:09,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 18:36:09,823 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-31 18:36:09,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:09,838 INFO L225 Difference]: With dead ends: 11096 [2018-12-31 18:36:09,838 INFO L226 Difference]: Without dead ends: 11056 [2018-12-31 18:36:09,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:36:09,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11056 states. [2018-12-31 18:36:09,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11056 to 9526. [2018-12-31 18:36:09,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9526 states. [2018-12-31 18:36:09,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9526 states to 9526 states and 21397 transitions. [2018-12-31 18:36:09,968 INFO L78 Accepts]: Start accepts. Automaton has 9526 states and 21397 transitions. Word has length 94 [2018-12-31 18:36:09,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:09,968 INFO L480 AbstractCegarLoop]: Abstraction has 9526 states and 21397 transitions. [2018-12-31 18:36:09,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 18:36:09,969 INFO L276 IsEmpty]: Start isEmpty. Operand 9526 states and 21397 transitions. [2018-12-31 18:36:09,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 18:36:09,982 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:09,982 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] [2018-12-31 18:36:09,982 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:09,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:09,983 INFO L82 PathProgramCache]: Analyzing trace with hash 317655775, now seen corresponding path program 1 times [2018-12-31 18:36:09,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:09,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:09,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:09,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:09,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:10,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:10,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:36:10,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:10,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 18:36:10,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 18:36:10,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 18:36:10,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:36:10,107 INFO L87 Difference]: Start difference. First operand 9526 states and 21397 transitions. Second operand 5 states. [2018-12-31 18:36:10,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:10,481 INFO L93 Difference]: Finished difference Result 11733 states and 26116 transitions. [2018-12-31 18:36:10,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 18:36:10,483 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-31 18:36:10,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:10,498 INFO L225 Difference]: With dead ends: 11733 [2018-12-31 18:36:10,498 INFO L226 Difference]: Without dead ends: 11553 [2018-12-31 18:36:10,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:36:10,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11553 states. [2018-12-31 18:36:10,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11553 to 10359. [2018-12-31 18:36:10,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10359 states. [2018-12-31 18:36:10,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10359 states to 10359 states and 23191 transitions. [2018-12-31 18:36:10,640 INFO L78 Accepts]: Start accepts. Automaton has 10359 states and 23191 transitions. Word has length 94 [2018-12-31 18:36:10,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:10,640 INFO L480 AbstractCegarLoop]: Abstraction has 10359 states and 23191 transitions. [2018-12-31 18:36:10,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 18:36:10,641 INFO L276 IsEmpty]: Start isEmpty. Operand 10359 states and 23191 transitions. [2018-12-31 18:36:10,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 18:36:10,652 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:10,653 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] [2018-12-31 18:36:10,653 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:10,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:10,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1759553568, now seen corresponding path program 1 times [2018-12-31 18:36:10,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:10,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:10,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:10,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:10,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:10,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:10,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:36:10,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:10,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 18:36:10,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 18:36:10,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 18:36:10,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:36:10,806 INFO L87 Difference]: Start difference. First operand 10359 states and 23191 transitions. Second operand 5 states. [2018-12-31 18:36:11,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:11,230 INFO L93 Difference]: Finished difference Result 13005 states and 28915 transitions. [2018-12-31 18:36:11,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 18:36:11,231 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-31 18:36:11,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:11,247 INFO L225 Difference]: With dead ends: 13005 [2018-12-31 18:36:11,247 INFO L226 Difference]: Without dead ends: 12872 [2018-12-31 18:36:11,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 18:36:11,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12872 states. [2018-12-31 18:36:11,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12872 to 10524. [2018-12-31 18:36:11,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10524 states. [2018-12-31 18:36:11,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10524 states to 10524 states and 23529 transitions. [2018-12-31 18:36:11,390 INFO L78 Accepts]: Start accepts. Automaton has 10524 states and 23529 transitions. Word has length 94 [2018-12-31 18:36:11,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:11,390 INFO L480 AbstractCegarLoop]: Abstraction has 10524 states and 23529 transitions. [2018-12-31 18:36:11,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 18:36:11,390 INFO L276 IsEmpty]: Start isEmpty. Operand 10524 states and 23529 transitions. [2018-12-31 18:36:11,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 18:36:11,402 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:11,402 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] [2018-12-31 18:36:11,403 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:11,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:11,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1679056660, now seen corresponding path program 1 times [2018-12-31 18:36:11,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:11,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:11,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:11,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:11,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:11,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:11,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:36:11,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:11,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 18:36:11,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 18:36:11,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 18:36:11,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:36:11,581 INFO L87 Difference]: Start difference. First operand 10524 states and 23529 transitions. Second operand 5 states. [2018-12-31 18:36:11,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:11,709 INFO L93 Difference]: Finished difference Result 8563 states and 19163 transitions. [2018-12-31 18:36:11,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 18:36:11,710 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-31 18:36:11,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:11,721 INFO L225 Difference]: With dead ends: 8563 [2018-12-31 18:36:11,721 INFO L226 Difference]: Without dead ends: 8563 [2018-12-31 18:36:11,722 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-12-31 18:36:11,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8563 states. [2018-12-31 18:36:11,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8563 to 6968. [2018-12-31 18:36:11,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6968 states. [2018-12-31 18:36:11,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6968 states to 6968 states and 15719 transitions. [2018-12-31 18:36:11,815 INFO L78 Accepts]: Start accepts. Automaton has 6968 states and 15719 transitions. Word has length 94 [2018-12-31 18:36:11,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:11,815 INFO L480 AbstractCegarLoop]: Abstraction has 6968 states and 15719 transitions. [2018-12-31 18:36:11,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 18:36:11,815 INFO L276 IsEmpty]: Start isEmpty. Operand 6968 states and 15719 transitions. [2018-12-31 18:36:11,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 18:36:11,824 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:11,824 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] [2018-12-31 18:36:11,824 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:11,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:11,825 INFO L82 PathProgramCache]: Analyzing trace with hash 46424237, now seen corresponding path program 2 times [2018-12-31 18:36:11,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:11,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:11,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:11,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:11,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:11,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:12,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:36:12,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:12,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 18:36:12,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 18:36:12,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 18:36:12,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:36:12,119 INFO L87 Difference]: Start difference. First operand 6968 states and 15719 transitions. Second operand 7 states. [2018-12-31 18:36:12,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:12,593 INFO L93 Difference]: Finished difference Result 8682 states and 19319 transitions. [2018-12-31 18:36:12,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 18:36:12,595 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-31 18:36:12,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:12,606 INFO L225 Difference]: With dead ends: 8682 [2018-12-31 18:36:12,606 INFO L226 Difference]: Without dead ends: 8682 [2018-12-31 18:36:12,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-12-31 18:36:12,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8682 states. [2018-12-31 18:36:12,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8682 to 7081. [2018-12-31 18:36:12,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7081 states. [2018-12-31 18:36:12,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7081 states to 7081 states and 15958 transitions. [2018-12-31 18:36:12,697 INFO L78 Accepts]: Start accepts. Automaton has 7081 states and 15958 transitions. Word has length 94 [2018-12-31 18:36:12,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:12,697 INFO L480 AbstractCegarLoop]: Abstraction has 7081 states and 15958 transitions. [2018-12-31 18:36:12,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 18:36:12,697 INFO L276 IsEmpty]: Start isEmpty. Operand 7081 states and 15958 transitions. [2018-12-31 18:36:12,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 18:36:12,705 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:12,706 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] [2018-12-31 18:36:12,706 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:12,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:12,706 INFO L82 PathProgramCache]: Analyzing trace with hash -2030785106, now seen corresponding path program 2 times [2018-12-31 18:36:12,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:12,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:12,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:12,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 18:36:12,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:12,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:12,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:36:12,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:12,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 18:36:12,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 18:36:12,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 18:36:12,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:36:12,935 INFO L87 Difference]: Start difference. First operand 7081 states and 15958 transitions. Second operand 7 states. [2018-12-31 18:36:13,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:13,384 INFO L93 Difference]: Finished difference Result 9946 states and 22406 transitions. [2018-12-31 18:36:13,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 18:36:13,386 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-31 18:36:13,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:13,399 INFO L225 Difference]: With dead ends: 9946 [2018-12-31 18:36:13,399 INFO L226 Difference]: Without dead ends: 9914 [2018-12-31 18:36:13,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-31 18:36:13,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9914 states. [2018-12-31 18:36:13,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9914 to 8741. [2018-12-31 18:36:13,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8741 states. [2018-12-31 18:36:13,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8741 states to 8741 states and 19564 transitions. [2018-12-31 18:36:13,517 INFO L78 Accepts]: Start accepts. Automaton has 8741 states and 19564 transitions. Word has length 94 [2018-12-31 18:36:13,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:13,517 INFO L480 AbstractCegarLoop]: Abstraction has 8741 states and 19564 transitions. [2018-12-31 18:36:13,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 18:36:13,518 INFO L276 IsEmpty]: Start isEmpty. Operand 8741 states and 19564 transitions. [2018-12-31 18:36:13,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 18:36:13,530 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:13,530 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] [2018-12-31 18:36:13,530 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:13,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:13,531 INFO L82 PathProgramCache]: Analyzing trace with hash 467230831, now seen corresponding path program 1 times [2018-12-31 18:36:13,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:13,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:13,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:13,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 18:36:13,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:13,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:14,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:36:14,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:14,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 18:36:14,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 18:36:14,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 18:36:14,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-31 18:36:14,379 INFO L87 Difference]: Start difference. First operand 8741 states and 19564 transitions. Second operand 8 states. [2018-12-31 18:36:15,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:15,606 INFO L93 Difference]: Finished difference Result 13745 states and 31428 transitions. [2018-12-31 18:36:15,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 18:36:15,607 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2018-12-31 18:36:15,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:15,626 INFO L225 Difference]: With dead ends: 13745 [2018-12-31 18:36:15,626 INFO L226 Difference]: Without dead ends: 13745 [2018-12-31 18:36:15,628 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-12-31 18:36:15,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13745 states. [2018-12-31 18:36:15,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13745 to 9372. [2018-12-31 18:36:15,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9372 states. [2018-12-31 18:36:15,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9372 states to 9372 states and 21224 transitions. [2018-12-31 18:36:15,793 INFO L78 Accepts]: Start accepts. Automaton has 9372 states and 21224 transitions. Word has length 94 [2018-12-31 18:36:15,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:15,794 INFO L480 AbstractCegarLoop]: Abstraction has 9372 states and 21224 transitions. [2018-12-31 18:36:15,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 18:36:15,794 INFO L276 IsEmpty]: Start isEmpty. Operand 9372 states and 21224 transitions. [2018-12-31 18:36:15,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 18:36:15,807 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:15,807 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] [2018-12-31 18:36:15,807 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:15,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:15,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1354734512, now seen corresponding path program 1 times [2018-12-31 18:36:15,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:15,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:15,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:15,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:15,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:15,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:16,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:36:16,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:16,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 18:36:16,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 18:36:16,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 18:36:16,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:36:16,067 INFO L87 Difference]: Start difference. First operand 9372 states and 21224 transitions. Second operand 7 states. [2018-12-31 18:36:16,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:16,307 INFO L93 Difference]: Finished difference Result 12354 states and 28392 transitions. [2018-12-31 18:36:16,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 18:36:16,308 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-31 18:36:16,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:16,327 INFO L225 Difference]: With dead ends: 12354 [2018-12-31 18:36:16,327 INFO L226 Difference]: Without dead ends: 12354 [2018-12-31 18:36:16,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-31 18:36:16,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12354 states. [2018-12-31 18:36:16,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12354 to 9024. [2018-12-31 18:36:16,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9024 states. [2018-12-31 18:36:16,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9024 states to 9024 states and 20322 transitions. [2018-12-31 18:36:16,499 INFO L78 Accepts]: Start accepts. Automaton has 9024 states and 20322 transitions. Word has length 94 [2018-12-31 18:36:16,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:16,499 INFO L480 AbstractCegarLoop]: Abstraction has 9024 states and 20322 transitions. [2018-12-31 18:36:16,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 18:36:16,499 INFO L276 IsEmpty]: Start isEmpty. Operand 9024 states and 20322 transitions. [2018-12-31 18:36:16,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 18:36:16,512 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:16,512 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] [2018-12-31 18:36:16,512 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:16,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:16,513 INFO L82 PathProgramCache]: Analyzing trace with hash -377241040, now seen corresponding path program 1 times [2018-12-31 18:36:16,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:16,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:16,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:16,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:16,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:16,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:16,781 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 9 [2018-12-31 18:36:16,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:36:16,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:16,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 18:36:16,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 18:36:16,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 18:36:16,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:36:16,794 INFO L87 Difference]: Start difference. First operand 9024 states and 20322 transitions. Second operand 6 states. [2018-12-31 18:36:16,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:16,963 INFO L93 Difference]: Finished difference Result 8544 states and 18834 transitions. [2018-12-31 18:36:16,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 18:36:16,965 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-31 18:36:16,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:16,975 INFO L225 Difference]: With dead ends: 8544 [2018-12-31 18:36:16,975 INFO L226 Difference]: Without dead ends: 8544 [2018-12-31 18:36:16,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-31 18:36:16,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8544 states. [2018-12-31 18:36:17,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8544 to 5376. [2018-12-31 18:36:17,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5376 states. [2018-12-31 18:36:17,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5376 states to 5376 states and 11789 transitions. [2018-12-31 18:36:17,063 INFO L78 Accepts]: Start accepts. Automaton has 5376 states and 11789 transitions. Word has length 94 [2018-12-31 18:36:17,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:17,063 INFO L480 AbstractCegarLoop]: Abstraction has 5376 states and 11789 transitions. [2018-12-31 18:36:17,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 18:36:17,063 INFO L276 IsEmpty]: Start isEmpty. Operand 5376 states and 11789 transitions. [2018-12-31 18:36:17,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 18:36:17,070 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:17,070 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:36:17,070 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:17,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:17,070 INFO L82 PathProgramCache]: Analyzing trace with hash -2113137847, now seen corresponding path program 1 times [2018-12-31 18:36:17,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:17,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:17,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:17,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:17,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:17,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:17,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:36:17,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:17,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 18:36:17,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 18:36:17,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 18:36:17,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:36:17,258 INFO L87 Difference]: Start difference. First operand 5376 states and 11789 transitions. Second operand 7 states. [2018-12-31 18:36:17,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:17,649 INFO L93 Difference]: Finished difference Result 6566 states and 14255 transitions. [2018-12-31 18:36:17,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 18:36:17,651 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-31 18:36:17,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:17,660 INFO L225 Difference]: With dead ends: 6566 [2018-12-31 18:36:17,660 INFO L226 Difference]: Without dead ends: 6566 [2018-12-31 18:36:17,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-12-31 18:36:17,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6566 states. [2018-12-31 18:36:17,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6566 to 5425. [2018-12-31 18:36:17,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5425 states. [2018-12-31 18:36:17,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5425 states to 5425 states and 11892 transitions. [2018-12-31 18:36:17,727 INFO L78 Accepts]: Start accepts. Automaton has 5425 states and 11892 transitions. Word has length 96 [2018-12-31 18:36:17,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:17,727 INFO L480 AbstractCegarLoop]: Abstraction has 5425 states and 11892 transitions. [2018-12-31 18:36:17,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 18:36:17,727 INFO L276 IsEmpty]: Start isEmpty. Operand 5425 states and 11892 transitions. [2018-12-31 18:36:17,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 18:36:17,733 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:17,734 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:36:17,734 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:17,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:17,734 INFO L82 PathProgramCache]: Analyzing trace with hash -990915638, now seen corresponding path program 1 times [2018-12-31 18:36:17,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:17,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:17,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:17,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:17,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:17,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:18,821 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 6 [2018-12-31 18:36:19,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:36:19,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:19,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 18:36:19,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 18:36:19,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 18:36:19,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-31 18:36:19,080 INFO L87 Difference]: Start difference. First operand 5425 states and 11892 transitions. Second operand 8 states. [2018-12-31 18:36:19,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:19,694 INFO L93 Difference]: Finished difference Result 6503 states and 14168 transitions. [2018-12-31 18:36:19,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-31 18:36:19,695 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2018-12-31 18:36:19,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:19,704 INFO L225 Difference]: With dead ends: 6503 [2018-12-31 18:36:19,704 INFO L226 Difference]: Without dead ends: 6503 [2018-12-31 18:36:19,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2018-12-31 18:36:19,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6503 states. [2018-12-31 18:36:19,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6503 to 6413. [2018-12-31 18:36:19,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6413 states. [2018-12-31 18:36:19,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6413 states to 6413 states and 13982 transitions. [2018-12-31 18:36:19,781 INFO L78 Accepts]: Start accepts. Automaton has 6413 states and 13982 transitions. Word has length 96 [2018-12-31 18:36:19,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:19,782 INFO L480 AbstractCegarLoop]: Abstraction has 6413 states and 13982 transitions. [2018-12-31 18:36:19,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 18:36:19,782 INFO L276 IsEmpty]: Start isEmpty. Operand 6413 states and 13982 transitions. [2018-12-31 18:36:19,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 18:36:19,791 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:19,791 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:36:19,791 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:19,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:19,792 INFO L82 PathProgramCache]: Analyzing trace with hash -103411957, now seen corresponding path program 1 times [2018-12-31 18:36:19,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:19,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:19,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:19,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:19,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:19,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:20,088 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-31 18:36:20,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:36:20,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:20,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-31 18:36:20,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 18:36:20,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 18:36:20,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-31 18:36:20,255 INFO L87 Difference]: Start difference. First operand 6413 states and 13982 transitions. Second operand 11 states. [2018-12-31 18:36:22,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:22,050 INFO L93 Difference]: Finished difference Result 11999 states and 26363 transitions. [2018-12-31 18:36:22,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-31 18:36:22,051 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-12-31 18:36:22,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:22,062 INFO L225 Difference]: With dead ends: 11999 [2018-12-31 18:36:22,062 INFO L226 Difference]: Without dead ends: 7711 [2018-12-31 18:36:22,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-31 18:36:22,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7711 states. [2018-12-31 18:36:22,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7711 to 5796. [2018-12-31 18:36:22,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5796 states. [2018-12-31 18:36:22,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5796 states to 5796 states and 12625 transitions. [2018-12-31 18:36:22,145 INFO L78 Accepts]: Start accepts. Automaton has 5796 states and 12625 transitions. Word has length 96 [2018-12-31 18:36:22,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:22,145 INFO L480 AbstractCegarLoop]: Abstraction has 5796 states and 12625 transitions. [2018-12-31 18:36:22,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 18:36:22,145 INFO L276 IsEmpty]: Start isEmpty. Operand 5796 states and 12625 transitions. [2018-12-31 18:36:22,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 18:36:22,153 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:22,153 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:36:22,153 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:22,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:22,154 INFO L82 PathProgramCache]: Analyzing trace with hash 397601140, now seen corresponding path program 1 times [2018-12-31 18:36:22,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:22,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:22,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:22,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:22,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:22,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:22,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:36:22,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:22,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 18:36:22,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 18:36:22,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 18:36:22,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:36:22,731 INFO L87 Difference]: Start difference. First operand 5796 states and 12625 transitions. Second operand 6 states. [2018-12-31 18:36:23,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:23,251 INFO L93 Difference]: Finished difference Result 6573 states and 14340 transitions. [2018-12-31 18:36:23,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 18:36:23,253 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-31 18:36:23,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:23,261 INFO L225 Difference]: With dead ends: 6573 [2018-12-31 18:36:23,261 INFO L226 Difference]: Without dead ends: 6573 [2018-12-31 18:36:23,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-31 18:36:23,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6573 states. [2018-12-31 18:36:23,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6573 to 5979. [2018-12-31 18:36:23,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5979 states. [2018-12-31 18:36:23,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5979 states to 5979 states and 13022 transitions. [2018-12-31 18:36:23,332 INFO L78 Accepts]: Start accepts. Automaton has 5979 states and 13022 transitions. Word has length 96 [2018-12-31 18:36:23,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:23,332 INFO L480 AbstractCegarLoop]: Abstraction has 5979 states and 13022 transitions. [2018-12-31 18:36:23,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 18:36:23,332 INFO L276 IsEmpty]: Start isEmpty. Operand 5979 states and 13022 transitions. [2018-12-31 18:36:23,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 18:36:23,340 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:23,340 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:36:23,340 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:23,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:23,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1711267723, now seen corresponding path program 2 times [2018-12-31 18:36:23,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:23,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:23,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:23,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:23,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:23,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 18:36:23,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 18:36:23,424 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 18:36:23,597 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-31 18:36:23,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 06:36:23 BasicIcfg [2018-12-31 18:36:23,600 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 18:36:23,601 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 18:36:23,601 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 18:36:23,601 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 18:36:23,602 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 06:35:32" (3/4) ... [2018-12-31 18:36:23,605 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 18:36:23,825 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 18:36:23,825 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 18:36:23,830 INFO L168 Benchmark]: Toolchain (without parser) took 53472.65 ms. Allocated memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: 1.8 GB). Free memory was 948.7 MB in the beginning and 1.6 GB in the end (delta: -688.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-12-31 18:36:23,832 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 18:36:23,832 INFO L168 Benchmark]: CACSL2BoogieTranslator took 898.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -159.3 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. [2018-12-31 18:36:23,832 INFO L168 Benchmark]: Boogie Procedure Inliner took 106.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-31 18:36:23,833 INFO L168 Benchmark]: Boogie Preprocessor took 66.39 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 18:36:23,833 INFO L168 Benchmark]: RCFGBuilder took 1266.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. [2018-12-31 18:36:23,833 INFO L168 Benchmark]: TraceAbstraction took 50896.30 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.7 GB in the end (delta: -623.8 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-12-31 18:36:23,834 INFO L168 Benchmark]: Witness Printer took 224.19 ms. Allocated memory is still 2.8 GB. Free memory was 1.7 GB in the beginning and 1.6 GB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2018-12-31 18:36:23,840 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 898.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -159.3 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 106.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 66.39 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 1266.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 50896.30 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.7 GB in the end (delta: -623.8 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 224.19 ms. Allocated memory is still 2.8 GB. Free memory was 1.7 GB in the beginning and 1.6 GB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 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] [L677] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L678] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L679] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L681] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L683] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L684] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L685] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L686] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L687] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L688] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L689] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L690] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L691] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L692] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L693] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L694] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L695] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L696] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L697] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L698] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L699] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] -1 pthread_t t315; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] FCALL, FORK -1 pthread_create(&t315, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, 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] [L703] 0 y$w_buff1 = y$w_buff0 [L704] 0 y$w_buff0 = 1 [L705] 0 y$w_buff1_used = y$w_buff0_used [L706] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L777] -1 pthread_t t316; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L708] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L709] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L710] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L711] 0 y$r_buff0_thd1 = (_Bool)1 [L714] 0 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L717] 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, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L778] FCALL, FORK -1 pthread_create(&t316, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L731] 1 x = 1 [L734] 1 __unbuffered_p1_EAX = x [L737] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L738] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L739] 1 y$flush_delayed = weak$$choice2 [L740] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L741] 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=1, __unbuffered_p1_EBX=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] [L741] 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) [L742] 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=1, __unbuffered_p1_EBX=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] [L742] 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)) [L743] 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=1, __unbuffered_p1_EBX=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] [L743] 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)) [L744] 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=1, __unbuffered_p1_EBX=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] [L744] 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)) [L745] 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=1, __unbuffered_p1_EBX=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] [L745] 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)) [L746] 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=1, __unbuffered_p1_EBX=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] [L746] 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)) [L747] 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=1, __unbuffered_p1_EBX=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] [L747] 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)) [L748] 1 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L749] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L717] 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) [L749] 1 y = y$flush_delayed ? y$mem_tmp : y [L750] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L753] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L753] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, 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, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L753] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_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] [L753] 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) [L754] EXPR 1 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=1, __unbuffered_p1_EBX=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_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L755] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_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] [L755] 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 [L756] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L756] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L757] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_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] [L757] 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 [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L718] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L718] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L719] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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$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 [L720] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L720] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L721] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L721] 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 [L724] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=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] [L784] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=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] [L784] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=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] [L784] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=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] [L784] -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) [L785] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=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] [L785] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L786] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=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] [L786] -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 [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=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] [L787] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L788] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=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] [L788] -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 [L791] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=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, 223 locations, 3 error locations. UNSAFE Result, 50.6s OverallTime, 36 OverallIterations, 1 TraceHistogramMax, 27.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9506 SDtfs, 11035 SDslu, 22041 SDs, 0 SdLazy, 9683 SolverSat, 624 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 384 GetRequests, 96 SyntacticMatches, 35 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 643 ImplicationChecksByTransitivity, 10.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35808occurred in iteration=14, 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.3s AutomataMinimizationTime, 35 MinimizatonAttempts, 92682 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 2794 NumberOfCodeBlocks, 2794 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 2663 ConstructedInterpolants, 0 QuantifiedInterpolants, 614109 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...