./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix054_tso.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f 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/mix054_tso.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 6c2480fd206faf06e31cc180dc59749750db48b4 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-0ed9222-m [2019-01-13 03:13:28,333 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 03:13:28,334 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 03:13:28,345 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 03:13:28,345 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 03:13:28,346 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 03:13:28,348 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 03:13:28,349 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 03:13:28,351 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 03:13:28,352 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 03:13:28,353 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 03:13:28,353 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 03:13:28,354 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 03:13:28,355 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 03:13:28,357 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 03:13:28,357 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 03:13:28,358 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 03:13:28,360 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 03:13:28,362 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 03:13:28,364 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 03:13:28,365 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 03:13:28,367 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 03:13:28,370 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 03:13:28,370 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 03:13:28,370 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 03:13:28,371 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 03:13:28,372 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 03:13:28,373 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 03:13:28,374 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 03:13:28,375 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 03:13:28,375 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 03:13:28,376 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 03:13:28,376 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 03:13:28,377 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 03:13:28,378 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 03:13:28,378 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 03:13:28,379 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-13 03:13:28,394 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 03:13:28,394 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 03:13:28,396 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 03:13:28,396 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 03:13:28,396 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 03:13:28,396 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 03:13:28,397 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 03:13:28,397 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 03:13:28,397 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 03:13:28,397 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 03:13:28,397 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-13 03:13:28,397 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 03:13:28,398 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-13 03:13:28,398 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 03:13:28,398 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-13 03:13:28,398 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 03:13:28,398 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-13 03:13:28,399 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 03:13:28,399 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 03:13:28,399 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 03:13:28,399 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 03:13:28,399 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 03:13:28,399 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 03:13:28,400 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 03:13:28,401 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-13 03:13:28,402 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 03:13:28,402 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 03:13:28,402 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-13 03:13:28,402 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 -> 6c2480fd206faf06e31cc180dc59749750db48b4 [2019-01-13 03:13:28,439 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 03:13:28,451 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 03:13:28,456 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 03:13:28,457 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 03:13:28,458 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 03:13:28,458 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix054_tso.oepc_false-unreach-call.i [2019-01-13 03:13:28,511 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0200248bc/4f211a02b8504d4da74dc92b171638a2/FLAG5abfa8a1e [2019-01-13 03:13:29,041 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 03:13:29,042 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix054_tso.oepc_false-unreach-call.i [2019-01-13 03:13:29,060 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0200248bc/4f211a02b8504d4da74dc92b171638a2/FLAG5abfa8a1e [2019-01-13 03:13:29,284 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0200248bc/4f211a02b8504d4da74dc92b171638a2 [2019-01-13 03:13:29,289 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 03:13:29,291 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-13 03:13:29,292 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 03:13:29,293 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 03:13:29,297 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 03:13:29,298 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 03:13:29" (1/1) ... [2019-01-13 03:13:29,301 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79626fb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:13:29, skipping insertion in model container [2019-01-13 03:13:29,302 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 03:13:29" (1/1) ... [2019-01-13 03:13:29,311 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 03:13:29,392 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 03:13:29,959 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 03:13:29,986 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 03:13:30,165 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 03:13:30,268 INFO L195 MainTranslator]: Completed translation [2019-01-13 03:13:30,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:13:30 WrapperNode [2019-01-13 03:13:30,268 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 03:13:30,269 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-13 03:13:30,269 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-13 03:13:30,269 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-13 03:13:30,281 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:13:30" (1/1) ... [2019-01-13 03:13:30,319 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:13:30" (1/1) ... [2019-01-13 03:13:30,383 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-13 03:13:30,386 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 03:13:30,389 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 03:13:30,389 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 03:13:30,408 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:13:30" (1/1) ... [2019-01-13 03:13:30,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:13:30" (1/1) ... [2019-01-13 03:13:30,420 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:13:30" (1/1) ... [2019-01-13 03:13:30,427 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:13:30" (1/1) ... [2019-01-13 03:13:30,456 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:13:30" (1/1) ... [2019-01-13 03:13:30,461 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:13:30" (1/1) ... [2019-01-13 03:13:30,465 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:13:30" (1/1) ... [2019-01-13 03:13:30,470 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 03:13:30,476 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 03:13:30,476 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 03:13:30,476 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 03:13:30,477 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:13:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 03:13:30,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 03:13:30,544 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-13 03:13:30,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 03:13:30,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 03:13:30,545 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-13 03:13:30,545 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-13 03:13:30,545 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-13 03:13:30,546 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-13 03:13:30,546 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-13 03:13:30,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 03:13:30,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 03:13:30,548 WARN L204 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-13 03:13:31,795 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 03:13:31,798 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-13 03:13:31,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 03:13:31 BoogieIcfgContainer [2019-01-13 03:13:31,799 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 03:13:31,801 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 03:13:31,801 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 03:13:31,804 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 03:13:31,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 03:13:29" (1/3) ... [2019-01-13 03:13:31,805 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@530b0bae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 03:13:31, skipping insertion in model container [2019-01-13 03:13:31,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:13:30" (2/3) ... [2019-01-13 03:13:31,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@530b0bae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 03:13:31, skipping insertion in model container [2019-01-13 03:13:31,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 03:13:31" (3/3) ... [2019-01-13 03:13:31,808 INFO L112 eAbstractionObserver]: Analyzing ICFG mix054_tso.oepc_false-unreach-call.i [2019-01-13 03:13:31,852 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,852 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,852 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,852 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,853 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,853 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,853 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,853 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,854 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,854 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,854 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,854 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,855 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,855 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,855 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,855 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,855 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,856 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,856 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,856 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,856 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,856 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,857 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,857 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,857 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,857 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,858 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,858 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,858 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,858 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,858 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,858 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,859 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,859 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,860 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,860 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,860 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,860 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,860 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,860 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,861 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,861 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,861 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,862 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,862 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,862 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,862 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,862 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,863 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,863 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,863 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,863 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,864 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,864 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,864 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,864 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,864 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,865 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,865 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,865 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,865 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,865 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,866 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,866 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,866 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,866 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,866 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,867 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,867 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,867 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,867 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,867 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:31,897 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-13 03:13:31,898 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 03:13:31,906 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-13 03:13:31,923 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-13 03:13:31,945 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 03:13:31,946 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 03:13:31,946 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-13 03:13:31,946 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 03:13:31,946 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 03:13:31,947 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 03:13:31,947 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 03:13:31,947 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 03:13:31,947 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 03:13:31,962 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 141places, 179 transitions [2019-01-13 03:13:33,591 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25087 states. [2019-01-13 03:13:33,593 INFO L276 IsEmpty]: Start isEmpty. Operand 25087 states. [2019-01-13 03:13:33,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-13 03:13:33,603 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:13:33,604 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] [2019-01-13 03:13:33,607 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:13:33,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:13:33,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1104590460, now seen corresponding path program 1 times [2019-01-13 03:13:33,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:13:33,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:13:33,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:33,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:13:33,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:33,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:13:33,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:13:33,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:13:33,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:13:33,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:13:34,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:13:34,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:13:34,006 INFO L87 Difference]: Start difference. First operand 25087 states. Second operand 4 states. [2019-01-13 03:13:35,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:13:35,113 INFO L93 Difference]: Finished difference Result 45387 states and 177625 transitions. [2019-01-13 03:13:35,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 03:13:35,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-01-13 03:13:35,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:13:35,448 INFO L225 Difference]: With dead ends: 45387 [2019-01-13 03:13:35,448 INFO L226 Difference]: Without dead ends: 40627 [2019-01-13 03:13:35,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:13:36,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40627 states. [2019-01-13 03:13:36,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40627 to 23661. [2019-01-13 03:13:36,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23661 states. [2019-01-13 03:13:37,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23661 states to 23661 states and 92542 transitions. [2019-01-13 03:13:37,174 INFO L78 Accepts]: Start accepts. Automaton has 23661 states and 92542 transitions. Word has length 36 [2019-01-13 03:13:37,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:13:37,174 INFO L480 AbstractCegarLoop]: Abstraction has 23661 states and 92542 transitions. [2019-01-13 03:13:37,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:13:37,174 INFO L276 IsEmpty]: Start isEmpty. Operand 23661 states and 92542 transitions. [2019-01-13 03:13:37,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-13 03:13:37,191 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:13:37,191 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:13:37,192 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:13:37,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:13:37,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1074635055, now seen corresponding path program 1 times [2019-01-13 03:13:37,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:13:37,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:13:37,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:37,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:13:37,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:37,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:13:37,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:13:37,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:13:37,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:13:37,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:13:37,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:13:37,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:13:37,433 INFO L87 Difference]: Start difference. First operand 23661 states and 92542 transitions. Second operand 5 states. [2019-01-13 03:13:40,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:13:40,565 INFO L93 Difference]: Finished difference Result 64829 states and 241368 transitions. [2019-01-13 03:13:40,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:13:40,566 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-01-13 03:13:40,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:13:40,886 INFO L225 Difference]: With dead ends: 64829 [2019-01-13 03:13:40,886 INFO L226 Difference]: Without dead ends: 64669 [2019-01-13 03:13:40,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:13:41,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64669 states. [2019-01-13 03:13:42,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64669 to 37141. [2019-01-13 03:13:42,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37141 states. [2019-01-13 03:13:42,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37141 states to 37141 states and 138283 transitions. [2019-01-13 03:13:42,704 INFO L78 Accepts]: Start accepts. Automaton has 37141 states and 138283 transitions. Word has length 43 [2019-01-13 03:13:42,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:13:42,706 INFO L480 AbstractCegarLoop]: Abstraction has 37141 states and 138283 transitions. [2019-01-13 03:13:42,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:13:42,706 INFO L276 IsEmpty]: Start isEmpty. Operand 37141 states and 138283 transitions. [2019-01-13 03:13:42,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-13 03:13:42,711 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:13:42,711 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] [2019-01-13 03:13:42,712 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:13:42,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:13:42,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1003362560, now seen corresponding path program 1 times [2019-01-13 03:13:42,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:13:42,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:13:42,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:42,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:13:42,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:42,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:13:42,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:13:42,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:13:42,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:13:42,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:13:42,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:13:42,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:13:42,810 INFO L87 Difference]: Start difference. First operand 37141 states and 138283 transitions. Second operand 4 states. [2019-01-13 03:13:42,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:13:42,903 INFO L93 Difference]: Finished difference Result 12363 states and 41176 transitions. [2019-01-13 03:13:42,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 03:13:42,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-01-13 03:13:42,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:13:42,924 INFO L225 Difference]: With dead ends: 12363 [2019-01-13 03:13:42,924 INFO L226 Difference]: Without dead ends: 11842 [2019-01-13 03:13:42,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:13:42,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11842 states. [2019-01-13 03:13:43,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11842 to 11842. [2019-01-13 03:13:43,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11842 states. [2019-01-13 03:13:43,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11842 states to 11842 states and 39621 transitions. [2019-01-13 03:13:43,186 INFO L78 Accepts]: Start accepts. Automaton has 11842 states and 39621 transitions. Word has length 44 [2019-01-13 03:13:43,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:13:43,187 INFO L480 AbstractCegarLoop]: Abstraction has 11842 states and 39621 transitions. [2019-01-13 03:13:43,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:13:43,187 INFO L276 IsEmpty]: Start isEmpty. Operand 11842 states and 39621 transitions. [2019-01-13 03:13:43,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-13 03:13:43,196 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:13:43,196 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] [2019-01-13 03:13:43,196 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:13:43,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:13:43,196 INFO L82 PathProgramCache]: Analyzing trace with hash -550854488, now seen corresponding path program 1 times [2019-01-13 03:13:43,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:13:43,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:13:43,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:43,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:13:43,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:43,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:13:43,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:13:43,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:13:43,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:13:43,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:13:43,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:13:43,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:13:43,410 INFO L87 Difference]: Start difference. First operand 11842 states and 39621 transitions. Second operand 4 states. [2019-01-13 03:13:43,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:13:43,980 INFO L93 Difference]: Finished difference Result 17018 states and 55692 transitions. [2019-01-13 03:13:43,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 03:13:43,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-01-13 03:13:43,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:13:44,011 INFO L225 Difference]: With dead ends: 17018 [2019-01-13 03:13:44,011 INFO L226 Difference]: Without dead ends: 17018 [2019-01-13 03:13:44,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:13:44,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17018 states. [2019-01-13 03:13:44,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17018 to 12878. [2019-01-13 03:13:44,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12878 states. [2019-01-13 03:13:44,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12878 states to 12878 states and 42719 transitions. [2019-01-13 03:13:44,418 INFO L78 Accepts]: Start accepts. Automaton has 12878 states and 42719 transitions. Word has length 57 [2019-01-13 03:13:44,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:13:44,419 INFO L480 AbstractCegarLoop]: Abstraction has 12878 states and 42719 transitions. [2019-01-13 03:13:44,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:13:44,420 INFO L276 IsEmpty]: Start isEmpty. Operand 12878 states and 42719 transitions. [2019-01-13 03:13:44,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-13 03:13:44,427 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:13:44,428 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] [2019-01-13 03:13:44,428 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:13:44,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:13:44,428 INFO L82 PathProgramCache]: Analyzing trace with hash -257181528, now seen corresponding path program 1 times [2019-01-13 03:13:44,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:13:44,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:13:44,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:44,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:13:44,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:44,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:13:44,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:13:44,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:13:44,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:13:44,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:13:44,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:13:44,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:13:44,670 INFO L87 Difference]: Start difference. First operand 12878 states and 42719 transitions. Second operand 4 states. [2019-01-13 03:13:45,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:13:45,966 INFO L93 Difference]: Finished difference Result 18385 states and 59996 transitions. [2019-01-13 03:13:45,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 03:13:45,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-01-13 03:13:45,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:13:45,997 INFO L225 Difference]: With dead ends: 18385 [2019-01-13 03:13:45,997 INFO L226 Difference]: Without dead ends: 18385 [2019-01-13 03:13:45,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:13:46,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18385 states. [2019-01-13 03:13:46,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18385 to 16342. [2019-01-13 03:13:46,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16342 states. [2019-01-13 03:13:46,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16342 states to 16342 states and 53813 transitions. [2019-01-13 03:13:46,273 INFO L78 Accepts]: Start accepts. Automaton has 16342 states and 53813 transitions. Word has length 57 [2019-01-13 03:13:46,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:13:46,274 INFO L480 AbstractCegarLoop]: Abstraction has 16342 states and 53813 transitions. [2019-01-13 03:13:46,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:13:46,274 INFO L276 IsEmpty]: Start isEmpty. Operand 16342 states and 53813 transitions. [2019-01-13 03:13:46,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-13 03:13:46,282 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:13:46,283 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] [2019-01-13 03:13:46,283 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:13:46,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:13:46,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1101653399, now seen corresponding path program 1 times [2019-01-13 03:13:46,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:13:46,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:13:46,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:46,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:13:46,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:46,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:13:46,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:13:46,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:13:46,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:13:46,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:13:46,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:13:46,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:13:46,458 INFO L87 Difference]: Start difference. First operand 16342 states and 53813 transitions. Second operand 6 states. [2019-01-13 03:13:47,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:13:47,236 INFO L93 Difference]: Finished difference Result 22914 states and 74398 transitions. [2019-01-13 03:13:47,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 03:13:47,237 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-01-13 03:13:47,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:13:47,274 INFO L225 Difference]: With dead ends: 22914 [2019-01-13 03:13:47,274 INFO L226 Difference]: Without dead ends: 22882 [2019-01-13 03:13:47,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-01-13 03:13:47,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22882 states. [2019-01-13 03:13:47,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22882 to 18246. [2019-01-13 03:13:47,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18246 states. [2019-01-13 03:13:47,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18246 states to 18246 states and 59757 transitions. [2019-01-13 03:13:47,563 INFO L78 Accepts]: Start accepts. Automaton has 18246 states and 59757 transitions. Word has length 57 [2019-01-13 03:13:47,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:13:47,564 INFO L480 AbstractCegarLoop]: Abstraction has 18246 states and 59757 transitions. [2019-01-13 03:13:47,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:13:47,564 INFO L276 IsEmpty]: Start isEmpty. Operand 18246 states and 59757 transitions. [2019-01-13 03:13:47,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-13 03:13:47,589 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:13:47,589 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] [2019-01-13 03:13:47,589 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:13:47,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:13:47,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1846707644, now seen corresponding path program 1 times [2019-01-13 03:13:47,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:13:47,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:13:47,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:47,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:13:47,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:47,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:13:47,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:13:47,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:13:47,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 03:13:47,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 03:13:47,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 03:13:47,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:13:47,868 INFO L87 Difference]: Start difference. First operand 18246 states and 59757 transitions. Second operand 8 states. [2019-01-13 03:13:49,112 WARN L181 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-13 03:13:49,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:13:49,732 INFO L93 Difference]: Finished difference Result 25778 states and 82386 transitions. [2019-01-13 03:13:49,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-13 03:13:49,733 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 71 [2019-01-13 03:13:49,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:13:49,773 INFO L225 Difference]: With dead ends: 25778 [2019-01-13 03:13:49,774 INFO L226 Difference]: Without dead ends: 25714 [2019-01-13 03:13:49,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2019-01-13 03:13:49,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25714 states. [2019-01-13 03:13:50,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25714 to 20338. [2019-01-13 03:13:50,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20338 states. [2019-01-13 03:13:50,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20338 states to 20338 states and 66162 transitions. [2019-01-13 03:13:50,083 INFO L78 Accepts]: Start accepts. Automaton has 20338 states and 66162 transitions. Word has length 71 [2019-01-13 03:13:50,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:13:50,084 INFO L480 AbstractCegarLoop]: Abstraction has 20338 states and 66162 transitions. [2019-01-13 03:13:50,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 03:13:50,084 INFO L276 IsEmpty]: Start isEmpty. Operand 20338 states and 66162 transitions. [2019-01-13 03:13:50,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-13 03:13:50,106 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:13:50,106 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] [2019-01-13 03:13:50,106 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:13:50,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:13:50,107 INFO L82 PathProgramCache]: Analyzing trace with hash 2049921486, now seen corresponding path program 1 times [2019-01-13 03:13:50,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:13:50,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:13:50,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:50,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:13:50,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:50,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:13:50,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:13:50,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:13:50,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 03:13:50,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 03:13:50,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 03:13:50,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 03:13:50,209 INFO L87 Difference]: Start difference. First operand 20338 states and 66162 transitions. Second operand 3 states. [2019-01-13 03:13:50,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:13:50,521 INFO L93 Difference]: Finished difference Result 24386 states and 77974 transitions. [2019-01-13 03:13:50,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 03:13:50,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-01-13 03:13:50,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:13:50,561 INFO L225 Difference]: With dead ends: 24386 [2019-01-13 03:13:50,562 INFO L226 Difference]: Without dead ends: 24386 [2019-01-13 03:13:50,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 03:13:50,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24386 states. [2019-01-13 03:13:50,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24386 to 21906. [2019-01-13 03:13:50,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21906 states. [2019-01-13 03:13:50,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21906 states to 21906 states and 70642 transitions. [2019-01-13 03:13:50,870 INFO L78 Accepts]: Start accepts. Automaton has 21906 states and 70642 transitions. Word has length 73 [2019-01-13 03:13:50,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:13:50,870 INFO L480 AbstractCegarLoop]: Abstraction has 21906 states and 70642 transitions. [2019-01-13 03:13:50,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 03:13:50,870 INFO L276 IsEmpty]: Start isEmpty. Operand 21906 states and 70642 transitions. [2019-01-13 03:13:50,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-13 03:13:50,896 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:13:50,896 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] [2019-01-13 03:13:50,896 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:13:50,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:13:50,896 INFO L82 PathProgramCache]: Analyzing trace with hash 449886895, now seen corresponding path program 1 times [2019-01-13 03:13:50,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:13:50,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:13:50,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:50,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:13:50,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:50,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:13:51,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:13:51,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:13:51,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:13:51,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:13:51,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:13:51,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:13:51,153 INFO L87 Difference]: Start difference. First operand 21906 states and 70642 transitions. Second operand 4 states. [2019-01-13 03:13:51,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:13:51,919 INFO L93 Difference]: Finished difference Result 33994 states and 108244 transitions. [2019-01-13 03:13:51,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 03:13:51,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-01-13 03:13:51,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:13:51,973 INFO L225 Difference]: With dead ends: 33994 [2019-01-13 03:13:51,974 INFO L226 Difference]: Without dead ends: 33798 [2019-01-13 03:13:51,974 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 [2019-01-13 03:13:52,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33798 states. [2019-01-13 03:13:52,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33798 to 28426. [2019-01-13 03:13:52,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28426 states. [2019-01-13 03:13:52,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28426 states to 28426 states and 91464 transitions. [2019-01-13 03:13:52,464 INFO L78 Accepts]: Start accepts. Automaton has 28426 states and 91464 transitions. Word has length 77 [2019-01-13 03:13:52,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:13:52,464 INFO L480 AbstractCegarLoop]: Abstraction has 28426 states and 91464 transitions. [2019-01-13 03:13:52,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:13:52,465 INFO L276 IsEmpty]: Start isEmpty. Operand 28426 states and 91464 transitions. [2019-01-13 03:13:52,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-13 03:13:52,500 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:13:52,500 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] [2019-01-13 03:13:52,500 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:13:52,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:13:52,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1694651376, now seen corresponding path program 1 times [2019-01-13 03:13:52,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:13:52,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:13:52,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:52,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:13:52,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:52,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:13:52,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:13:52,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:13:52,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 03:13:52,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 03:13:52,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 03:13:52,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:13:52,812 INFO L87 Difference]: Start difference. First operand 28426 states and 91464 transitions. Second operand 8 states. [2019-01-13 03:13:55,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:13:55,790 INFO L93 Difference]: Finished difference Result 43452 states and 135569 transitions. [2019-01-13 03:13:55,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-13 03:13:55,790 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 77 [2019-01-13 03:13:55,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:13:55,856 INFO L225 Difference]: With dead ends: 43452 [2019-01-13 03:13:55,856 INFO L226 Difference]: Without dead ends: 43204 [2019-01-13 03:13:55,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-01-13 03:13:55,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43204 states. [2019-01-13 03:13:56,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43204 to 31023. [2019-01-13 03:13:56,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31023 states. [2019-01-13 03:13:56,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31023 states to 31023 states and 99252 transitions. [2019-01-13 03:13:56,384 INFO L78 Accepts]: Start accepts. Automaton has 31023 states and 99252 transitions. Word has length 77 [2019-01-13 03:13:56,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:13:56,385 INFO L480 AbstractCegarLoop]: Abstraction has 31023 states and 99252 transitions. [2019-01-13 03:13:56,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 03:13:56,385 INFO L276 IsEmpty]: Start isEmpty. Operand 31023 states and 99252 transitions. [2019-01-13 03:13:56,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-13 03:13:56,413 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:13:56,413 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] [2019-01-13 03:13:56,413 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:13:56,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:13:56,414 INFO L82 PathProgramCache]: Analyzing trace with hash 850179505, now seen corresponding path program 1 times [2019-01-13 03:13:56,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:13:56,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:13:56,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:56,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:13:56,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:56,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:13:56,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:13:56,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:13:56,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:13:56,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:13:56,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:13:56,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:13:56,747 INFO L87 Difference]: Start difference. First operand 31023 states and 99252 transitions. Second operand 6 states. [2019-01-13 03:13:57,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:13:57,309 INFO L93 Difference]: Finished difference Result 33613 states and 106498 transitions. [2019-01-13 03:13:57,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:13:57,310 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2019-01-13 03:13:57,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:13:57,367 INFO L225 Difference]: With dead ends: 33613 [2019-01-13 03:13:57,367 INFO L226 Difference]: Without dead ends: 33613 [2019-01-13 03:13:57,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:13:57,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33613 states. [2019-01-13 03:13:57,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33613 to 31806. [2019-01-13 03:13:57,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31806 states. [2019-01-13 03:13:57,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31806 states to 31806 states and 101445 transitions. [2019-01-13 03:13:57,796 INFO L78 Accepts]: Start accepts. Automaton has 31806 states and 101445 transitions. Word has length 77 [2019-01-13 03:13:57,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:13:57,796 INFO L480 AbstractCegarLoop]: Abstraction has 31806 states and 101445 transitions. [2019-01-13 03:13:57,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:13:57,796 INFO L276 IsEmpty]: Start isEmpty. Operand 31806 states and 101445 transitions. [2019-01-13 03:13:57,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-13 03:13:57,823 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:13:57,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] [2019-01-13 03:13:57,824 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:13:57,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:13:57,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1719306894, now seen corresponding path program 1 times [2019-01-13 03:13:57,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:13:57,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:13:57,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:57,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:13:57,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:57,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:13:57,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:13:57,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:13:57,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 03:13:57,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 03:13:57,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 03:13:57,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:13:57,987 INFO L87 Difference]: Start difference. First operand 31806 states and 101445 transitions. Second operand 8 states. [2019-01-13 03:13:59,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:13:59,220 INFO L93 Difference]: Finished difference Result 36250 states and 114638 transitions. [2019-01-13 03:13:59,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-13 03:13:59,221 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 77 [2019-01-13 03:13:59,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:13:59,277 INFO L225 Difference]: With dead ends: 36250 [2019-01-13 03:13:59,277 INFO L226 Difference]: Without dead ends: 36186 [2019-01-13 03:13:59,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2019-01-13 03:13:59,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36186 states. [2019-01-13 03:13:59,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36186 to 32526. [2019-01-13 03:13:59,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32526 states. [2019-01-13 03:13:59,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32526 states to 32526 states and 103865 transitions. [2019-01-13 03:13:59,978 INFO L78 Accepts]: Start accepts. Automaton has 32526 states and 103865 transitions. Word has length 77 [2019-01-13 03:13:59,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:13:59,979 INFO L480 AbstractCegarLoop]: Abstraction has 32526 states and 103865 transitions. [2019-01-13 03:13:59,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 03:13:59,979 INFO L276 IsEmpty]: Start isEmpty. Operand 32526 states and 103865 transitions. [2019-01-13 03:14:00,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-13 03:14:00,022 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:14:00,022 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] [2019-01-13 03:14:00,022 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:14:00,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:14:00,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1768968179, now seen corresponding path program 1 times [2019-01-13 03:14:00,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:14:00,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:14:00,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:14:00,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:14:00,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:14:00,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:14:00,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:14:00,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:14:00,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:14:00,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:14:00,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:14:00,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:14:00,267 INFO L87 Difference]: Start difference. First operand 32526 states and 103865 transitions. Second operand 4 states. [2019-01-13 03:14:02,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:14:02,366 INFO L93 Difference]: Finished difference Result 38542 states and 121421 transitions. [2019-01-13 03:14:02,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 03:14:02,367 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-01-13 03:14:02,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:14:02,428 INFO L225 Difference]: With dead ends: 38542 [2019-01-13 03:14:02,428 INFO L226 Difference]: Without dead ends: 38302 [2019-01-13 03:14:02,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:14:02,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38302 states. [2019-01-13 03:14:02,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38302 to 36610. [2019-01-13 03:14:02,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36610 states. [2019-01-13 03:14:02,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36610 states to 36610 states and 115884 transitions. [2019-01-13 03:14:02,930 INFO L78 Accepts]: Start accepts. Automaton has 36610 states and 115884 transitions. Word has length 79 [2019-01-13 03:14:02,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:14:02,930 INFO L480 AbstractCegarLoop]: Abstraction has 36610 states and 115884 transitions. [2019-01-13 03:14:02,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:14:02,930 INFO L276 IsEmpty]: Start isEmpty. Operand 36610 states and 115884 transitions. [2019-01-13 03:14:02,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-13 03:14:02,963 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:14:02,963 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] [2019-01-13 03:14:02,963 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:14:02,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:14:02,964 INFO L82 PathProgramCache]: Analyzing trace with hash 590338830, now seen corresponding path program 1 times [2019-01-13 03:14:02,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:14:02,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:14:02,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:14:02,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:14:02,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:14:02,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:14:03,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:14:03,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:14:03,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 03:14:03,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 03:14:03,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 03:14:03,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 03:14:03,069 INFO L87 Difference]: Start difference. First operand 36610 states and 115884 transitions. Second operand 3 states. [2019-01-13 03:14:03,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:14:03,468 INFO L93 Difference]: Finished difference Result 38602 states and 121864 transitions. [2019-01-13 03:14:03,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 03:14:03,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-01-13 03:14:03,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:14:03,529 INFO L225 Difference]: With dead ends: 38602 [2019-01-13 03:14:03,530 INFO L226 Difference]: Without dead ends: 38602 [2019-01-13 03:14:03,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 03:14:03,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38602 states. [2019-01-13 03:14:03,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38602 to 37598. [2019-01-13 03:14:03,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37598 states. [2019-01-13 03:14:04,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37598 states to 37598 states and 118840 transitions. [2019-01-13 03:14:04,056 INFO L78 Accepts]: Start accepts. Automaton has 37598 states and 118840 transitions. Word has length 79 [2019-01-13 03:14:04,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:14:04,056 INFO L480 AbstractCegarLoop]: Abstraction has 37598 states and 118840 transitions. [2019-01-13 03:14:04,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 03:14:04,056 INFO L276 IsEmpty]: Start isEmpty. Operand 37598 states and 118840 transitions. [2019-01-13 03:14:04,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-13 03:14:04,090 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:14:04,090 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] [2019-01-13 03:14:04,091 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:14:04,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:14:04,092 INFO L82 PathProgramCache]: Analyzing trace with hash 941215826, now seen corresponding path program 1 times [2019-01-13 03:14:04,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:14:04,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:14:04,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:14:04,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:14:04,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:14:04,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:14:04,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:14:04,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:14:04,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:14:04,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:14:04,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:14:04,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:14:04,345 INFO L87 Difference]: Start difference. First operand 37598 states and 118840 transitions. Second operand 5 states. [2019-01-13 03:14:04,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:14:04,815 INFO L93 Difference]: Finished difference Result 5962 states and 15305 transitions. [2019-01-13 03:14:04,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 03:14:04,817 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-01-13 03:14:04,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:14:04,829 INFO L225 Difference]: With dead ends: 5962 [2019-01-13 03:14:04,829 INFO L226 Difference]: Without dead ends: 4908 [2019-01-13 03:14:04,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:14:04,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4908 states. [2019-01-13 03:14:04,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4908 to 4520. [2019-01-13 03:14:04,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4520 states. [2019-01-13 03:14:04,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4520 states to 4520 states and 11664 transitions. [2019-01-13 03:14:04,952 INFO L78 Accepts]: Start accepts. Automaton has 4520 states and 11664 transitions. Word has length 80 [2019-01-13 03:14:04,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:14:04,953 INFO L480 AbstractCegarLoop]: Abstraction has 4520 states and 11664 transitions. [2019-01-13 03:14:04,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:14:04,953 INFO L276 IsEmpty]: Start isEmpty. Operand 4520 states and 11664 transitions. [2019-01-13 03:14:04,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-13 03:14:04,966 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:14:04,966 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] [2019-01-13 03:14:04,967 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:14:04,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:14:04,967 INFO L82 PathProgramCache]: Analyzing trace with hash 404950075, now seen corresponding path program 1 times [2019-01-13 03:14:04,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:14:04,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:14:04,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:14:04,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:14:04,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:14:04,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:14:05,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:14:05,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:14:05,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:14:05,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:14:05,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:14:05,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:14:05,385 INFO L87 Difference]: Start difference. First operand 4520 states and 11664 transitions. Second operand 7 states. [2019-01-13 03:14:05,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:14:05,800 INFO L93 Difference]: Finished difference Result 5089 states and 12746 transitions. [2019-01-13 03:14:05,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:14:05,801 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2019-01-13 03:14:05,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:14:05,808 INFO L225 Difference]: With dead ends: 5089 [2019-01-13 03:14:05,808 INFO L226 Difference]: Without dead ends: 4931 [2019-01-13 03:14:05,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:14:05,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4931 states. [2019-01-13 03:14:05,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4931 to 4777. [2019-01-13 03:14:05,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4777 states. [2019-01-13 03:14:05,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4777 states to 4777 states and 12151 transitions. [2019-01-13 03:14:05,859 INFO L78 Accepts]: Start accepts. Automaton has 4777 states and 12151 transitions. Word has length 90 [2019-01-13 03:14:05,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:14:05,859 INFO L480 AbstractCegarLoop]: Abstraction has 4777 states and 12151 transitions. [2019-01-13 03:14:05,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:14:05,860 INFO L276 IsEmpty]: Start isEmpty. Operand 4777 states and 12151 transitions. [2019-01-13 03:14:05,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-13 03:14:05,867 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:14:05,867 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] [2019-01-13 03:14:05,867 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:14:05,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:14:05,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1374531098, now seen corresponding path program 1 times [2019-01-13 03:14:05,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:14:05,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:14:05,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:14:05,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:14:05,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:14:05,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:14:06,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:14:06,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:14:06,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:14:06,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:14:06,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:14:06,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:14:06,019 INFO L87 Difference]: Start difference. First operand 4777 states and 12151 transitions. Second operand 5 states. [2019-01-13 03:14:06,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:14:06,283 INFO L93 Difference]: Finished difference Result 5349 states and 13474 transitions. [2019-01-13 03:14:06,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:14:06,284 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-01-13 03:14:06,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:14:06,292 INFO L225 Difference]: With dead ends: 5349 [2019-01-13 03:14:06,292 INFO L226 Difference]: Without dead ends: 5286 [2019-01-13 03:14:06,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:14:06,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5286 states. [2019-01-13 03:14:06,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5286 to 4795. [2019-01-13 03:14:06,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4795 states. [2019-01-13 03:14:06,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4795 states to 4795 states and 12184 transitions. [2019-01-13 03:14:06,356 INFO L78 Accepts]: Start accepts. Automaton has 4795 states and 12184 transitions. Word has length 90 [2019-01-13 03:14:06,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:14:06,356 INFO L480 AbstractCegarLoop]: Abstraction has 4795 states and 12184 transitions. [2019-01-13 03:14:06,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:14:06,356 INFO L276 IsEmpty]: Start isEmpty. Operand 4795 states and 12184 transitions. [2019-01-13 03:14:06,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 03:14:06,361 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:14:06,362 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:14:06,362 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:14:06,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:14:06,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1723830517, now seen corresponding path program 1 times [2019-01-13 03:14:06,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:14:06,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:14:06,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:14:06,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:14:06,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:14:06,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:14:06,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:14:06,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:14:06,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:14:06,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:14:06,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:14:06,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:14:06,580 INFO L87 Difference]: Start difference. First operand 4795 states and 12184 transitions. Second operand 4 states. [2019-01-13 03:14:06,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:14:06,803 INFO L93 Difference]: Finished difference Result 8152 states and 21084 transitions. [2019-01-13 03:14:06,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 03:14:06,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-01-13 03:14:06,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:14:06,815 INFO L225 Difference]: With dead ends: 8152 [2019-01-13 03:14:06,816 INFO L226 Difference]: Without dead ends: 8122 [2019-01-13 03:14:06,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:14:06,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8122 states. [2019-01-13 03:14:06,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8122 to 4538. [2019-01-13 03:14:06,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4538 states. [2019-01-13 03:14:06,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4538 states to 4538 states and 11484 transitions. [2019-01-13 03:14:06,892 INFO L78 Accepts]: Start accepts. Automaton has 4538 states and 11484 transitions. Word has length 92 [2019-01-13 03:14:06,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:14:06,893 INFO L480 AbstractCegarLoop]: Abstraction has 4538 states and 11484 transitions. [2019-01-13 03:14:06,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:14:06,893 INFO L276 IsEmpty]: Start isEmpty. Operand 4538 states and 11484 transitions. [2019-01-13 03:14:06,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 03:14:06,898 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:14:06,898 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] [2019-01-13 03:14:06,898 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:14:06,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:14:06,899 INFO L82 PathProgramCache]: Analyzing trace with hash 868756730, now seen corresponding path program 1 times [2019-01-13 03:14:06,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:14:06,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:14:06,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:14:06,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:14:06,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:14:06,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:14:07,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:14:07,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:14:07,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:14:07,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:14:07,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:14:07,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:14:07,123 INFO L87 Difference]: Start difference. First operand 4538 states and 11484 transitions. Second operand 6 states. [2019-01-13 03:14:07,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:14:07,525 INFO L93 Difference]: Finished difference Result 6142 states and 15400 transitions. [2019-01-13 03:14:07,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:14:07,526 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-01-13 03:14:07,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:14:07,534 INFO L225 Difference]: With dead ends: 6142 [2019-01-13 03:14:07,534 INFO L226 Difference]: Without dead ends: 6110 [2019-01-13 03:14:07,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:14:07,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6110 states. [2019-01-13 03:14:07,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6110 to 4735. [2019-01-13 03:14:07,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4735 states. [2019-01-13 03:14:07,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4735 states to 4735 states and 11948 transitions. [2019-01-13 03:14:07,639 INFO L78 Accepts]: Start accepts. Automaton has 4735 states and 11948 transitions. Word has length 92 [2019-01-13 03:14:07,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:14:07,639 INFO L480 AbstractCegarLoop]: Abstraction has 4735 states and 11948 transitions. [2019-01-13 03:14:07,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:14:07,639 INFO L276 IsEmpty]: Start isEmpty. Operand 4735 states and 11948 transitions. [2019-01-13 03:14:07,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 03:14:07,645 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:14:07,645 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] [2019-01-13 03:14:07,645 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:14:07,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:14:07,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1830370747, now seen corresponding path program 1 times [2019-01-13 03:14:07,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:14:07,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:14:07,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:14:07,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:14:07,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:14:07,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:14:07,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:14:07,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:14:07,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:14:07,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:14:07,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:14:07,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:14:07,885 INFO L87 Difference]: Start difference. First operand 4735 states and 11948 transitions. Second operand 7 states. [2019-01-13 03:14:08,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:14:08,500 INFO L93 Difference]: Finished difference Result 9486 states and 24387 transitions. [2019-01-13 03:14:08,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-13 03:14:08,502 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-01-13 03:14:08,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:14:08,514 INFO L225 Difference]: With dead ends: 9486 [2019-01-13 03:14:08,514 INFO L226 Difference]: Without dead ends: 9486 [2019-01-13 03:14:08,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-01-13 03:14:08,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9486 states. [2019-01-13 03:14:08,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9486 to 5205. [2019-01-13 03:14:08,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5205 states. [2019-01-13 03:14:08,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5205 states to 5205 states and 13187 transitions. [2019-01-13 03:14:08,586 INFO L78 Accepts]: Start accepts. Automaton has 5205 states and 13187 transitions. Word has length 92 [2019-01-13 03:14:08,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:14:08,587 INFO L480 AbstractCegarLoop]: Abstraction has 5205 states and 13187 transitions. [2019-01-13 03:14:08,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:14:08,587 INFO L276 IsEmpty]: Start isEmpty. Operand 5205 states and 13187 transitions. [2019-01-13 03:14:08,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 03:14:08,592 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:14:08,592 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] [2019-01-13 03:14:08,592 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:14:08,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:14:08,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1219832068, now seen corresponding path program 1 times [2019-01-13 03:14:08,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:14:08,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:14:08,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:14:08,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:14:08,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:14:08,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:14:09,387 WARN L181 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 14 [2019-01-13 03:14:09,835 WARN L181 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 15 [2019-01-13 03:14:09,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:14:09,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:14:09,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:14:09,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:14:09,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:14:09,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:14:09,843 INFO L87 Difference]: Start difference. First operand 5205 states and 13187 transitions. Second operand 7 states. [2019-01-13 03:14:10,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:14:10,212 INFO L93 Difference]: Finished difference Result 4885 states and 12402 transitions. [2019-01-13 03:14:10,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:14:10,213 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-01-13 03:14:10,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:14:10,220 INFO L225 Difference]: With dead ends: 4885 [2019-01-13 03:14:10,220 INFO L226 Difference]: Without dead ends: 4885 [2019-01-13 03:14:10,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-01-13 03:14:10,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4885 states. [2019-01-13 03:14:10,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4885 to 4684. [2019-01-13 03:14:10,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4684 states. [2019-01-13 03:14:10,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4684 states to 4684 states and 11957 transitions. [2019-01-13 03:14:10,266 INFO L78 Accepts]: Start accepts. Automaton has 4684 states and 11957 transitions. Word has length 92 [2019-01-13 03:14:10,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:14:10,266 INFO L480 AbstractCegarLoop]: Abstraction has 4684 states and 11957 transitions. [2019-01-13 03:14:10,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:14:10,266 INFO L276 IsEmpty]: Start isEmpty. Operand 4684 states and 11957 transitions. [2019-01-13 03:14:10,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 03:14:10,270 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:14:10,271 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] [2019-01-13 03:14:10,271 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:14:10,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:14:10,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1611236628, now seen corresponding path program 1 times [2019-01-13 03:14:10,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:14:10,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:14:10,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:14:10,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:14:10,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:14:10,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:14:10,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:14:10,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:14:10,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:14:10,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:14:10,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:14:10,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:14:10,466 INFO L87 Difference]: Start difference. First operand 4684 states and 11957 transitions. Second operand 7 states. [2019-01-13 03:14:10,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:14:10,741 INFO L93 Difference]: Finished difference Result 4984 states and 12705 transitions. [2019-01-13 03:14:10,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:14:10,742 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-01-13 03:14:10,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:14:10,748 INFO L225 Difference]: With dead ends: 4984 [2019-01-13 03:14:10,749 INFO L226 Difference]: Without dead ends: 4984 [2019-01-13 03:14:10,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:14:10,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4984 states. [2019-01-13 03:14:10,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4984 to 4649. [2019-01-13 03:14:10,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4649 states. [2019-01-13 03:14:10,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4649 states to 4649 states and 11891 transitions. [2019-01-13 03:14:10,795 INFO L78 Accepts]: Start accepts. Automaton has 4649 states and 11891 transitions. Word has length 92 [2019-01-13 03:14:10,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:14:10,796 INFO L480 AbstractCegarLoop]: Abstraction has 4649 states and 11891 transitions. [2019-01-13 03:14:10,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:14:10,796 INFO L276 IsEmpty]: Start isEmpty. Operand 4649 states and 11891 transitions. [2019-01-13 03:14:10,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 03:14:10,801 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:14:10,801 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] [2019-01-13 03:14:10,801 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:14:10,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:14:10,802 INFO L82 PathProgramCache]: Analyzing trace with hash -200357108, now seen corresponding path program 1 times [2019-01-13 03:14:10,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:14:10,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:14:10,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:14:10,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:14:10,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:14:10,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:14:11,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:14:11,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:14:11,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:14:11,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:14:11,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:14:11,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:14:11,050 INFO L87 Difference]: Start difference. First operand 4649 states and 11891 transitions. Second operand 5 states. [2019-01-13 03:14:11,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:14:11,178 INFO L93 Difference]: Finished difference Result 4290 states and 10980 transitions. [2019-01-13 03:14:11,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 03:14:11,179 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-01-13 03:14:11,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:14:11,185 INFO L225 Difference]: With dead ends: 4290 [2019-01-13 03:14:11,186 INFO L226 Difference]: Without dead ends: 4290 [2019-01-13 03:14:11,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:14:11,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4290 states. [2019-01-13 03:14:11,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4290 to 4207. [2019-01-13 03:14:11,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4207 states. [2019-01-13 03:14:11,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4207 states to 4207 states and 10814 transitions. [2019-01-13 03:14:11,226 INFO L78 Accepts]: Start accepts. Automaton has 4207 states and 10814 transitions. Word has length 92 [2019-01-13 03:14:11,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:14:11,226 INFO L480 AbstractCegarLoop]: Abstraction has 4207 states and 10814 transitions. [2019-01-13 03:14:11,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:14:11,226 INFO L276 IsEmpty]: Start isEmpty. Operand 4207 states and 10814 transitions. [2019-01-13 03:14:11,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 03:14:11,230 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:14:11,231 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] [2019-01-13 03:14:11,231 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:14:11,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:14:11,231 INFO L82 PathProgramCache]: Analyzing trace with hash -649053747, now seen corresponding path program 1 times [2019-01-13 03:14:11,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:14:11,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:14:11,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:14:11,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:14:11,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:14:11,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:14:11,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:14:11,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:14:11,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:14:11,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:14:11,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:14:11,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:14:11,507 INFO L87 Difference]: Start difference. First operand 4207 states and 10814 transitions. Second operand 6 states. [2019-01-13 03:14:11,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:14:11,645 INFO L93 Difference]: Finished difference Result 3839 states and 9622 transitions. [2019-01-13 03:14:11,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 03:14:11,646 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-01-13 03:14:11,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:14:11,651 INFO L225 Difference]: With dead ends: 3839 [2019-01-13 03:14:11,651 INFO L226 Difference]: Without dead ends: 3839 [2019-01-13 03:14:11,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:14:11,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3839 states. [2019-01-13 03:14:11,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3839 to 3059. [2019-01-13 03:14:11,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3059 states. [2019-01-13 03:14:11,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3059 states to 3059 states and 7774 transitions. [2019-01-13 03:14:11,684 INFO L78 Accepts]: Start accepts. Automaton has 3059 states and 7774 transitions. Word has length 92 [2019-01-13 03:14:11,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:14:11,685 INFO L480 AbstractCegarLoop]: Abstraction has 3059 states and 7774 transitions. [2019-01-13 03:14:11,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:14:11,685 INFO L276 IsEmpty]: Start isEmpty. Operand 3059 states and 7774 transitions. [2019-01-13 03:14:11,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 03:14:11,688 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:14:11,688 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] [2019-01-13 03:14:11,688 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:14:11,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:14:11,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1808878702, now seen corresponding path program 1 times [2019-01-13 03:14:11,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:14:11,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:14:11,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:14:11,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:14:11,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:14:11,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:14:11,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:14:11,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:14:11,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:14:11,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:14:11,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:14:11,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:14:11,923 INFO L87 Difference]: Start difference. First operand 3059 states and 7774 transitions. Second operand 7 states. [2019-01-13 03:14:12,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:14:12,480 INFO L93 Difference]: Finished difference Result 4681 states and 11656 transitions. [2019-01-13 03:14:12,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 03:14:12,481 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-01-13 03:14:12,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:14:12,487 INFO L225 Difference]: With dead ends: 4681 [2019-01-13 03:14:12,487 INFO L226 Difference]: Without dead ends: 4681 [2019-01-13 03:14:12,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-01-13 03:14:12,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4681 states. [2019-01-13 03:14:12,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4681 to 3409. [2019-01-13 03:14:12,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3409 states. [2019-01-13 03:14:12,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3409 states to 3409 states and 8632 transitions. [2019-01-13 03:14:12,525 INFO L78 Accepts]: Start accepts. Automaton has 3409 states and 8632 transitions. Word has length 94 [2019-01-13 03:14:12,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:14:12,525 INFO L480 AbstractCegarLoop]: Abstraction has 3409 states and 8632 transitions. [2019-01-13 03:14:12,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:14:12,525 INFO L276 IsEmpty]: Start isEmpty. Operand 3409 states and 8632 transitions. [2019-01-13 03:14:12,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 03:14:12,528 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:14:12,529 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] [2019-01-13 03:14:12,529 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:14:12,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:14:12,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1241324113, now seen corresponding path program 1 times [2019-01-13 03:14:12,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:14:12,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:14:12,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:14:12,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:14:12,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:14:12,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:14:12,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:14:12,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:14:12,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:14:12,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:14:12,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:14:12,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:14:12,733 INFO L87 Difference]: Start difference. First operand 3409 states and 8632 transitions. Second operand 6 states. [2019-01-13 03:14:12,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:14:12,889 INFO L93 Difference]: Finished difference Result 3543 states and 8861 transitions. [2019-01-13 03:14:12,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 03:14:12,890 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-01-13 03:14:12,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:14:12,894 INFO L225 Difference]: With dead ends: 3543 [2019-01-13 03:14:12,894 INFO L226 Difference]: Without dead ends: 3543 [2019-01-13 03:14:12,895 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 [2019-01-13 03:14:12,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3543 states. [2019-01-13 03:14:12,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3543 to 3409. [2019-01-13 03:14:12,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3409 states. [2019-01-13 03:14:12,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3409 states to 3409 states and 8607 transitions. [2019-01-13 03:14:12,927 INFO L78 Accepts]: Start accepts. Automaton has 3409 states and 8607 transitions. Word has length 94 [2019-01-13 03:14:12,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:14:12,927 INFO L480 AbstractCegarLoop]: Abstraction has 3409 states and 8607 transitions. [2019-01-13 03:14:12,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:14:12,927 INFO L276 IsEmpty]: Start isEmpty. Operand 3409 states and 8607 transitions. [2019-01-13 03:14:12,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 03:14:12,931 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:14:12,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:14:12,931 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:14:12,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:14:12,931 INFO L82 PathProgramCache]: Analyzing trace with hash 2138644463, now seen corresponding path program 1 times [2019-01-13 03:14:12,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:14:12,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:14:12,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:14:12,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:14:12,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:14:12,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:14:13,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:14:13,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:14:13,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:14:13,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:14:13,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:14:13,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:14:13,156 INFO L87 Difference]: Start difference. First operand 3409 states and 8607 transitions. Second operand 5 states. [2019-01-13 03:14:13,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:14:13,373 INFO L93 Difference]: Finished difference Result 3857 states and 9711 transitions. [2019-01-13 03:14:13,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:14:13,375 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-01-13 03:14:13,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:14:13,380 INFO L225 Difference]: With dead ends: 3857 [2019-01-13 03:14:13,381 INFO L226 Difference]: Without dead ends: 3825 [2019-01-13 03:14:13,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:14:13,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3825 states. [2019-01-13 03:14:13,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3825 to 2885. [2019-01-13 03:14:13,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2885 states. [2019-01-13 03:14:13,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2885 states to 2885 states and 7322 transitions. [2019-01-13 03:14:13,413 INFO L78 Accepts]: Start accepts. Automaton has 2885 states and 7322 transitions. Word has length 94 [2019-01-13 03:14:13,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:14:13,413 INFO L480 AbstractCegarLoop]: Abstraction has 2885 states and 7322 transitions. [2019-01-13 03:14:13,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:14:13,413 INFO L276 IsEmpty]: Start isEmpty. Operand 2885 states and 7322 transitions. [2019-01-13 03:14:13,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 03:14:13,416 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:14:13,417 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] [2019-01-13 03:14:13,417 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:14:13,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:14:13,417 INFO L82 PathProgramCache]: Analyzing trace with hash -911558352, now seen corresponding path program 1 times [2019-01-13 03:14:13,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:14:13,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:14:13,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:14:13,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:14:13,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:14:13,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:14:13,776 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-13 03:14:13,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:14:13,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:14:13,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-13 03:14:13,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 03:14:13,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 03:14:13,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-01-13 03:14:13,855 INFO L87 Difference]: Start difference. First operand 2885 states and 7322 transitions. Second operand 10 states. [2019-01-13 03:14:14,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:14:14,401 INFO L93 Difference]: Finished difference Result 4730 states and 12190 transitions. [2019-01-13 03:14:14,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 03:14:14,402 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2019-01-13 03:14:14,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:14:14,406 INFO L225 Difference]: With dead ends: 4730 [2019-01-13 03:14:14,406 INFO L226 Difference]: Without dead ends: 1879 [2019-01-13 03:14:14,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-01-13 03:14:14,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1879 states. [2019-01-13 03:14:14,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1879 to 1879. [2019-01-13 03:14:14,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1879 states. [2019-01-13 03:14:14,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1879 states to 1879 states and 4915 transitions. [2019-01-13 03:14:14,424 INFO L78 Accepts]: Start accepts. Automaton has 1879 states and 4915 transitions. Word has length 94 [2019-01-13 03:14:14,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:14:14,425 INFO L480 AbstractCegarLoop]: Abstraction has 1879 states and 4915 transitions. [2019-01-13 03:14:14,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 03:14:14,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 4915 transitions. [2019-01-13 03:14:14,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 03:14:14,427 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:14:14,427 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] [2019-01-13 03:14:14,427 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:14:14,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:14:14,428 INFO L82 PathProgramCache]: Analyzing trace with hash -350187536, now seen corresponding path program 1 times [2019-01-13 03:14:14,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:14:14,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:14:14,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:14:14,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:14:14,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:14:14,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:14:14,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:14:14,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:14:14,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:14:14,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:14:14,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:14:14,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:14:14,611 INFO L87 Difference]: Start difference. First operand 1879 states and 4915 transitions. Second operand 6 states. [2019-01-13 03:14:14,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:14:14,918 INFO L93 Difference]: Finished difference Result 2123 states and 5462 transitions. [2019-01-13 03:14:14,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:14:14,920 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-01-13 03:14:14,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:14:14,923 INFO L225 Difference]: With dead ends: 2123 [2019-01-13 03:14:14,923 INFO L226 Difference]: Without dead ends: 2123 [2019-01-13 03:14:14,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-01-13 03:14:14,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2123 states. [2019-01-13 03:14:14,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2123 to 1906. [2019-01-13 03:14:14,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1906 states. [2019-01-13 03:14:14,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1906 states to 1906 states and 4970 transitions. [2019-01-13 03:14:14,943 INFO L78 Accepts]: Start accepts. Automaton has 1906 states and 4970 transitions. Word has length 94 [2019-01-13 03:14:14,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:14:14,944 INFO L480 AbstractCegarLoop]: Abstraction has 1906 states and 4970 transitions. [2019-01-13 03:14:14,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:14:14,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1906 states and 4970 transitions. [2019-01-13 03:14:14,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 03:14:14,946 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:14:14,946 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] [2019-01-13 03:14:14,946 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:14:14,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:14:14,947 INFO L82 PathProgramCache]: Analyzing trace with hash -20421775, now seen corresponding path program 1 times [2019-01-13 03:14:14,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:14:14,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:14:14,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:14:14,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:14:14,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:14:14,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:14:15,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:14:15,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:14:15,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:14:15,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:14:15,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:14:15,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:14:15,241 INFO L87 Difference]: Start difference. First operand 1906 states and 4970 transitions. Second operand 6 states. [2019-01-13 03:14:15,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:14:15,394 INFO L93 Difference]: Finished difference Result 1965 states and 5079 transitions. [2019-01-13 03:14:15,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:14:15,395 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-01-13 03:14:15,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:14:15,399 INFO L225 Difference]: With dead ends: 1965 [2019-01-13 03:14:15,399 INFO L226 Difference]: Without dead ends: 1949 [2019-01-13 03:14:15,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:14:15,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1949 states. [2019-01-13 03:14:15,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1949 to 1879. [2019-01-13 03:14:15,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1879 states. [2019-01-13 03:14:15,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1879 states to 1879 states and 4907 transitions. [2019-01-13 03:14:15,421 INFO L78 Accepts]: Start accepts. Automaton has 1879 states and 4907 transitions. Word has length 94 [2019-01-13 03:14:15,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:14:15,421 INFO L480 AbstractCegarLoop]: Abstraction has 1879 states and 4907 transitions. [2019-01-13 03:14:15,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:14:15,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 4907 transitions. [2019-01-13 03:14:15,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 03:14:15,424 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:14:15,424 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] [2019-01-13 03:14:15,425 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:14:15,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:14:15,425 INFO L82 PathProgramCache]: Analyzing trace with hash -2050928015, now seen corresponding path program 1 times [2019-01-13 03:14:15,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:14:15,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:14:15,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:14:15,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:14:15,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:14:15,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:14:15,828 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 10 [2019-01-13 03:14:15,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:14:15,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:14:15,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:14:15,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:14:15,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:14:15,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:14:15,891 INFO L87 Difference]: Start difference. First operand 1879 states and 4907 transitions. Second operand 6 states. [2019-01-13 03:14:16,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:14:16,064 INFO L93 Difference]: Finished difference Result 1921 states and 4983 transitions. [2019-01-13 03:14:16,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 03:14:16,065 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-01-13 03:14:16,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:14:16,068 INFO L225 Difference]: With dead ends: 1921 [2019-01-13 03:14:16,068 INFO L226 Difference]: Without dead ends: 1921 [2019-01-13 03:14:16,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-01-13 03:14:16,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1921 states. [2019-01-13 03:14:16,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1921 to 1914. [2019-01-13 03:14:16,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1914 states. [2019-01-13 03:14:16,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 4970 transitions. [2019-01-13 03:14:16,087 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 4970 transitions. Word has length 94 [2019-01-13 03:14:16,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:14:16,088 INFO L480 AbstractCegarLoop]: Abstraction has 1914 states and 4970 transitions. [2019-01-13 03:14:16,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:14:16,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 4970 transitions. [2019-01-13 03:14:16,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 03:14:16,090 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:14:16,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, 1, 1] [2019-01-13 03:14:16,091 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:14:16,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:14:16,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1721162254, now seen corresponding path program 2 times [2019-01-13 03:14:16,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:14:16,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:14:16,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:14:16,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:14:16,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:14:16,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 03:14:16,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 03:14:16,185 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 03:14:16,394 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-13 03:14:16,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 03:14:16 BasicIcfg [2019-01-13 03:14:16,396 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 03:14:16,398 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 03:14:16,398 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 03:14:16,399 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 03:14:16,399 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 03:13:31" (3/4) ... [2019-01-13 03:14:16,405 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-13 03:14:16,587 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 03:14:16,588 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 03:14:16,591 INFO L168 Benchmark]: Toolchain (without parser) took 47301.54 ms. Allocated memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: 2.0 GB). Free memory was 946.0 MB in the beginning and 1.3 GB in the end (delta: -380.9 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-01-13 03:14:16,592 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 03:14:16,592 INFO L168 Benchmark]: CACSL2BoogieTranslator took 976.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -178.3 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2019-01-13 03:14:16,592 INFO L168 Benchmark]: Boogie Procedure Inliner took 116.46 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-13 03:14:16,596 INFO L168 Benchmark]: Boogie Preprocessor took 89.71 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. [2019-01-13 03:14:16,596 INFO L168 Benchmark]: RCFGBuilder took 1323.44 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: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 11.5 GB. [2019-01-13 03:14:16,597 INFO L168 Benchmark]: TraceAbstraction took 44597.18 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -254.1 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-01-13 03:14:16,597 INFO L168 Benchmark]: Witness Printer took 191.62 ms. Allocated memory is still 3.0 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 03:14:16,601 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.15 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 976.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -178.3 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 116.46 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 89.71 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 1323.44 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: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 44597.18 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -254.1 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. * Witness Printer took 191.62 ms. Allocated memory is still 3.0 GB. Free memory is still 1.3 GB. There was no memory consumed. 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_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L674] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L675] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L677] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L678] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L679] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L680] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L681] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L682] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L683] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L684] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L685] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L686] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L687] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L688] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L689] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L690] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L691] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L693] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L694] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L695] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L755] -1 pthread_t t1455; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] FCALL, FORK -1 pthread_create(&t1455, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L757] -1 pthread_t t1456; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] FCALL, FORK -1 pthread_create(&t1456, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L719] 0 x$w_buff1 = x$w_buff0 [L720] 0 x$w_buff0 = 2 [L721] 0 x$w_buff1_used = x$w_buff0_used [L722] 0 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L724] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L725] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L726] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L727] 0 x$r_buff0_thd2 = (_Bool)1 [L730] 0 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L699] 1 y = 1 [L702] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L705] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L705] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=1] [L705] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=1] [L705] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L706] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L706] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L707] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L707] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L733] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L733] 0 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L734] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L734] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L735] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L735] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L736] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L736] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L737] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L737] 0 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L740] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L708] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L708] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L709] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L709] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L712] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L760] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L764] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L764] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L764] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L764] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L765] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L765] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L766] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L766] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L767] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L767] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L768] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L768] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L771] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L772] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L773] -1 x$flush_delayed = weak$$choice2 [L774] -1 x$mem_tmp = x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] EXPR -1 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] -1 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L776] EXPR -1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L776] -1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L777] EXPR -1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L777] -1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L778] EXPR -1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L778] -1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L779] EXPR -1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L779] -1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L780] EXPR -1 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L780] -1 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L781] EXPR -1 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L781] -1 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L782] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L783] EXPR -1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L783] -1 x = x$flush_delayed ? x$mem_tmp : x [L784] -1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 179 locations, 3 error locations. UNSAFE Result, 44.4s OverallTime, 32 OverallIterations, 1 TraceHistogramMax, 23.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7793 SDtfs, 7739 SDslu, 17173 SDs, 0 SdLazy, 8379 SolverSat, 443 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 319 GetRequests, 84 SyntacticMatches, 19 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 8.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37598occurred 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, 31 MinimizatonAttempts, 103197 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 2560 NumberOfCodeBlocks, 2560 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2435 ConstructedInterpolants, 0 QuantifiedInterpolants, 496082 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...