./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix022_pso.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/mix022_pso.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 1c54506a798de9d41251094a4ea3380b8b9997e5 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 19:33:07,427 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 19:33:07,429 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 19:33:07,442 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 19:33:07,442 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 19:33:07,443 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 19:33:07,445 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 19:33:07,447 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 19:33:07,450 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 19:33:07,451 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 19:33:07,452 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 19:33:07,452 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 19:33:07,453 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 19:33:07,454 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 19:33:07,456 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 19:33:07,457 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 19:33:07,458 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 19:33:07,460 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 19:33:07,463 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 19:33:07,465 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 19:33:07,466 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 19:33:07,468 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 19:33:07,471 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 19:33:07,471 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 19:33:07,472 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 19:33:07,473 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 19:33:07,474 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 19:33:07,475 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 19:33:07,476 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 19:33:07,477 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 19:33:07,478 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 19:33:07,478 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 19:33:07,479 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 19:33:07,479 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 19:33:07,480 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 19:33:07,481 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 19:33:07,481 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 19:33:07,499 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 19:33:07,499 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 19:33:07,501 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 19:33:07,501 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 19:33:07,501 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 19:33:07,501 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 19:33:07,501 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 19:33:07,502 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 19:33:07,503 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 19:33:07,503 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 19:33:07,503 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 19:33:07,503 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 19:33:07,503 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 19:33:07,504 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 19:33:07,504 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 19:33:07,505 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 19:33:07,505 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 19:33:07,505 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 19:33:07,505 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 19:33:07,505 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 19:33:07,506 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 19:33:07,506 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 19:33:07,506 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 19:33:07,506 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 19:33:07,506 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 19:33:07,506 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 19:33:07,508 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 19:33:07,508 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 19:33:07,508 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 -> 1c54506a798de9d41251094a4ea3380b8b9997e5 [2018-12-31 19:33:07,548 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 19:33:07,561 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 19:33:07,565 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 19:33:07,567 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 19:33:07,568 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 19:33:07,569 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix022_pso.oepc_false-unreach-call.i [2018-12-31 19:33:07,632 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ec7c59a3/e74c703554464e24bdf13b11b41a1e46/FLAG5120f1b22 [2018-12-31 19:33:08,291 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 19:33:08,293 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix022_pso.oepc_false-unreach-call.i [2018-12-31 19:33:08,318 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ec7c59a3/e74c703554464e24bdf13b11b41a1e46/FLAG5120f1b22 [2018-12-31 19:33:08,474 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ec7c59a3/e74c703554464e24bdf13b11b41a1e46 [2018-12-31 19:33:08,479 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 19:33:08,481 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 19:33:08,483 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 19:33:08,483 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 19:33:08,487 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 19:33:08,488 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 07:33:08" (1/1) ... [2018-12-31 19:33:08,492 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e6c7975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 07:33:08, skipping insertion in model container [2018-12-31 19:33:08,492 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 07:33:08" (1/1) ... [2018-12-31 19:33:08,503 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 19:33:08,574 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 19:33:09,020 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 19:33:09,039 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 19:33:09,241 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 19:33:09,326 INFO L195 MainTranslator]: Completed translation [2018-12-31 19:33:09,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 07:33:09 WrapperNode [2018-12-31 19:33:09,327 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 19:33:09,328 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 19:33:09,328 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 19:33:09,329 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 19:33:09,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 07:33:09" (1/1) ... [2018-12-31 19:33:09,362 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 07:33:09" (1/1) ... [2018-12-31 19:33:09,412 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 19:33:09,413 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 19:33:09,413 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 19:33:09,413 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 19:33:09,424 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 07:33:09" (1/1) ... [2018-12-31 19:33:09,424 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 07:33:09" (1/1) ... [2018-12-31 19:33:09,429 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 07:33:09" (1/1) ... [2018-12-31 19:33:09,430 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 07:33:09" (1/1) ... [2018-12-31 19:33:09,441 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 07:33:09" (1/1) ... [2018-12-31 19:33:09,446 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 07:33:09" (1/1) ... [2018-12-31 19:33:09,450 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 07:33:09" (1/1) ... [2018-12-31 19:33:09,455 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 19:33:09,456 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 19:33:09,456 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 19:33:09,457 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 19:33:09,458 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 07:33:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 19:33:09,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 19:33:09,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-31 19:33:09,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 19:33:09,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 19:33:09,534 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-31 19:33:09,534 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-31 19:33:09,535 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-31 19:33:09,535 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-31 19:33:09,535 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-31 19:33:09,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 19:33:09,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 19:33:09,537 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-31 19:33:10,772 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 19:33:10,772 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-31 19:33:10,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 07:33:10 BoogieIcfgContainer [2018-12-31 19:33:10,773 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 19:33:10,775 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 19:33:10,775 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 19:33:10,779 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 19:33:10,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 07:33:08" (1/3) ... [2018-12-31 19:33:10,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@245dfc92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 07:33:10, skipping insertion in model container [2018-12-31 19:33:10,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 07:33:09" (2/3) ... [2018-12-31 19:33:10,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@245dfc92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 07:33:10, skipping insertion in model container [2018-12-31 19:33:10,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 07:33:10" (3/3) ... [2018-12-31 19:33:10,785 INFO L112 eAbstractionObserver]: Analyzing ICFG mix022_pso.oepc_false-unreach-call.i [2018-12-31 19:33:10,839 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,840 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,840 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,840 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,840 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,840 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,841 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,842 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,842 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,842 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,842 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,843 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,843 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,843 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,843 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,843 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,845 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,845 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,845 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,845 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,845 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,846 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,846 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,846 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,846 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,846 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,847 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,847 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,848 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,848 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,848 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,848 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,849 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,849 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,849 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,849 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,849 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,849 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,856 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,856 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,856 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,857 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,857 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,857 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,857 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,857 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,857 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,858 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,858 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,858 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,858 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,860 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,860 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,861 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,861 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,861 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,861 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,862 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,862 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,863 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,863 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,863 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,863 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,863 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,864 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,864 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,864 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,864 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,865 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,865 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,865 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,865 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,865 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,866 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,866 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,866 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,867 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,868 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,868 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,868 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,868 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,869 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,869 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,869 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,869 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,869 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,870 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,871 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,871 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,871 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,871 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,871 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,872 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,872 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,872 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,872 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,872 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,873 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,874 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,874 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,875 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,875 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,875 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,875 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,876 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,879 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,879 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,879 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,879 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,880 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,880 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,880 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,880 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,881 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,882 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,882 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,882 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,882 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,885 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,885 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,885 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,885 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,886 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,886 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,886 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,886 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,887 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,887 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,888 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,888 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,888 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,888 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,888 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,889 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,889 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,889 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,889 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,889 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,890 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,890 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,890 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,890 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,890 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,891 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,891 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,891 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,891 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,891 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,892 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,892 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,892 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,892 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,893 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,893 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,893 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,893 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,894 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,894 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,894 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,894 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,894 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,895 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,895 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,895 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:33:10,927 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-31 19:33:10,927 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 19:33:10,941 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 19:33:10,961 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 19:33:10,991 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 19:33:10,992 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 19:33:10,992 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 19:33:10,992 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 19:33:10,992 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 19:33:10,992 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 19:33:10,992 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 19:33:10,993 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 19:33:10,993 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 19:33:11,008 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 142places, 180 transitions [2018-12-31 19:33:13,604 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34806 states. [2018-12-31 19:33:13,607 INFO L276 IsEmpty]: Start isEmpty. Operand 34806 states. [2018-12-31 19:33:13,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-31 19:33:13,614 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:33:13,616 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 19:33:13,618 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:33:13,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:33:13,625 INFO L82 PathProgramCache]: Analyzing trace with hash 2100747441, now seen corresponding path program 1 times [2018-12-31 19:33:13,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:33:13,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:33:13,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:13,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:33:13,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:13,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:33:14,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 19:33:14,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:33:14,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 19:33:14,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 19:33:14,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 19:33:14,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 19:33:14,056 INFO L87 Difference]: Start difference. First operand 34806 states. Second operand 4 states. [2018-12-31 19:33:15,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:33:15,442 INFO L93 Difference]: Finished difference Result 60790 states and 234493 transitions. [2018-12-31 19:33:15,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 19:33:15,450 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-12-31 19:33:15,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:33:15,804 INFO L225 Difference]: With dead ends: 60790 [2018-12-31 19:33:15,804 INFO L226 Difference]: Without dead ends: 44270 [2018-12-31 19:33:15,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 19:33:16,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44270 states. [2018-12-31 19:33:17,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44270 to 27338. [2018-12-31 19:33:17,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27338 states. [2018-12-31 19:33:17,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27338 states to 27338 states and 105499 transitions. [2018-12-31 19:33:17,735 INFO L78 Accepts]: Start accepts. Automaton has 27338 states and 105499 transitions. Word has length 33 [2018-12-31 19:33:17,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:33:17,736 INFO L480 AbstractCegarLoop]: Abstraction has 27338 states and 105499 transitions. [2018-12-31 19:33:17,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 19:33:17,736 INFO L276 IsEmpty]: Start isEmpty. Operand 27338 states and 105499 transitions. [2018-12-31 19:33:17,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-31 19:33:17,756 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:33:17,757 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 19:33:17,757 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:33:17,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:33:17,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1664977985, now seen corresponding path program 1 times [2018-12-31 19:33:17,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:33:17,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:33:17,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:17,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:33:17,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:17,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:33:17,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 19:33:17,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:33:17,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 19:33:17,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 19:33:17,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 19:33:17,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 19:33:17,988 INFO L87 Difference]: Start difference. First operand 27338 states and 105499 transitions. Second operand 4 states. [2018-12-31 19:33:18,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:33:18,374 INFO L93 Difference]: Finished difference Result 8528 states and 28344 transitions. [2018-12-31 19:33:18,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 19:33:18,375 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-12-31 19:33:18,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:33:18,413 INFO L225 Difference]: With dead ends: 8528 [2018-12-31 19:33:18,414 INFO L226 Difference]: Without dead ends: 7466 [2018-12-31 19:33:18,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 19:33:18,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7466 states. [2018-12-31 19:33:18,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7466 to 7466. [2018-12-31 19:33:18,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7466 states. [2018-12-31 19:33:18,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7466 states to 7466 states and 24636 transitions. [2018-12-31 19:33:18,624 INFO L78 Accepts]: Start accepts. Automaton has 7466 states and 24636 transitions. Word has length 45 [2018-12-31 19:33:18,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:33:18,625 INFO L480 AbstractCegarLoop]: Abstraction has 7466 states and 24636 transitions. [2018-12-31 19:33:18,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 19:33:18,626 INFO L276 IsEmpty]: Start isEmpty. Operand 7466 states and 24636 transitions. [2018-12-31 19:33:18,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-31 19:33:18,630 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:33:18,630 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 19:33:18,630 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:33:18,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:33:18,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1909915460, now seen corresponding path program 1 times [2018-12-31 19:33:18,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:33:18,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:33:18,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:18,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:33:18,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:18,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:33:18,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 19:33:18,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:33:18,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 19:33:18,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 19:33:18,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 19:33:18,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 19:33:18,944 INFO L87 Difference]: Start difference. First operand 7466 states and 24636 transitions. Second operand 5 states. [2018-12-31 19:33:20,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:33:20,550 INFO L93 Difference]: Finished difference Result 13998 states and 45805 transitions. [2018-12-31 19:33:20,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 19:33:20,552 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-31 19:33:20,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:33:20,607 INFO L225 Difference]: With dead ends: 13998 [2018-12-31 19:33:20,607 INFO L226 Difference]: Without dead ends: 13930 [2018-12-31 19:33:20,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 19:33:20,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13930 states. [2018-12-31 19:33:20,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13930 to 9441. [2018-12-31 19:33:20,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9441 states. [2018-12-31 19:33:21,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9441 states to 9441 states and 30542 transitions. [2018-12-31 19:33:21,314 INFO L78 Accepts]: Start accepts. Automaton has 9441 states and 30542 transitions. Word has length 46 [2018-12-31 19:33:21,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:33:21,316 INFO L480 AbstractCegarLoop]: Abstraction has 9441 states and 30542 transitions. [2018-12-31 19:33:21,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 19:33:21,317 INFO L276 IsEmpty]: Start isEmpty. Operand 9441 states and 30542 transitions. [2018-12-31 19:33:21,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-31 19:33:21,320 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:33:21,320 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 19:33:21,320 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:33:21,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:33:21,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1845061814, now seen corresponding path program 1 times [2018-12-31 19:33:21,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:33:21,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:33:21,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:21,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:33:21,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:21,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:33:21,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 19:33:21,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:33:21,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 19:33:21,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 19:33:21,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 19:33:21,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 19:33:21,415 INFO L87 Difference]: Start difference. First operand 9441 states and 30542 transitions. Second operand 3 states. [2018-12-31 19:33:21,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:33:21,657 INFO L93 Difference]: Finished difference Result 13279 states and 42641 transitions. [2018-12-31 19:33:21,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 19:33:21,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-12-31 19:33:21,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:33:21,699 INFO L225 Difference]: With dead ends: 13279 [2018-12-31 19:33:21,700 INFO L226 Difference]: Without dead ends: 13279 [2018-12-31 19:33:21,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 19:33:21,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13279 states. [2018-12-31 19:33:21,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13279 to 9845. [2018-12-31 19:33:21,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9845 states. [2018-12-31 19:33:21,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9845 states to 9845 states and 31508 transitions. [2018-12-31 19:33:21,962 INFO L78 Accepts]: Start accepts. Automaton has 9845 states and 31508 transitions. Word has length 48 [2018-12-31 19:33:21,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:33:21,963 INFO L480 AbstractCegarLoop]: Abstraction has 9845 states and 31508 transitions. [2018-12-31 19:33:21,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 19:33:21,963 INFO L276 IsEmpty]: Start isEmpty. Operand 9845 states and 31508 transitions. [2018-12-31 19:33:21,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-31 19:33:21,967 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:33:21,967 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 19:33:21,967 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:33:21,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:33:21,968 INFO L82 PathProgramCache]: Analyzing trace with hash 484350805, now seen corresponding path program 1 times [2018-12-31 19:33:21,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:33:21,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:33:21,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:21,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:33:21,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:21,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:33:22,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 19:33:22,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:33:22,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 19:33:22,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 19:33:22,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 19:33:22,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-31 19:33:22,160 INFO L87 Difference]: Start difference. First operand 9845 states and 31508 transitions. Second operand 7 states. [2018-12-31 19:33:23,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:33:23,168 INFO L93 Difference]: Finished difference Result 12285 states and 38673 transitions. [2018-12-31 19:33:23,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 19:33:23,169 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-12-31 19:33:23,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:33:23,202 INFO L225 Difference]: With dead ends: 12285 [2018-12-31 19:33:23,202 INFO L226 Difference]: Without dead ends: 12213 [2018-12-31 19:33:23,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-31 19:33:23,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12213 states. [2018-12-31 19:33:23,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12213 to 10849. [2018-12-31 19:33:23,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10849 states. [2018-12-31 19:33:23,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10849 states to 10849 states and 34563 transitions. [2018-12-31 19:33:23,464 INFO L78 Accepts]: Start accepts. Automaton has 10849 states and 34563 transitions. Word has length 52 [2018-12-31 19:33:23,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:33:23,464 INFO L480 AbstractCegarLoop]: Abstraction has 10849 states and 34563 transitions. [2018-12-31 19:33:23,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 19:33:23,465 INFO L276 IsEmpty]: Start isEmpty. Operand 10849 states and 34563 transitions. [2018-12-31 19:33:23,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-31 19:33:23,473 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:33:23,474 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 19:33:23,474 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:33:23,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:33:23,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1383304625, now seen corresponding path program 1 times [2018-12-31 19:33:23,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:33:23,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:33:23,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:23,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:33:23,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:23,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:33:23,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 19:33:23,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:33:23,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 19:33:23,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 19:33:23,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 19:33:23,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 19:33:23,727 INFO L87 Difference]: Start difference. First operand 10849 states and 34563 transitions. Second operand 4 states. [2018-12-31 19:33:24,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:33:24,093 INFO L93 Difference]: Finished difference Result 12396 states and 39572 transitions. [2018-12-31 19:33:24,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 19:33:24,094 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-12-31 19:33:24,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:33:24,124 INFO L225 Difference]: With dead ends: 12396 [2018-12-31 19:33:24,125 INFO L226 Difference]: Without dead ends: 12396 [2018-12-31 19:33:24,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 19:33:24,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12396 states. [2018-12-31 19:33:24,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12396 to 11369. [2018-12-31 19:33:24,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11369 states. [2018-12-31 19:33:24,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11369 states to 11369 states and 36236 transitions. [2018-12-31 19:33:24,410 INFO L78 Accepts]: Start accepts. Automaton has 11369 states and 36236 transitions. Word has length 60 [2018-12-31 19:33:24,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:33:24,412 INFO L480 AbstractCegarLoop]: Abstraction has 11369 states and 36236 transitions. [2018-12-31 19:33:24,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 19:33:24,412 INFO L276 IsEmpty]: Start isEmpty. Operand 11369 states and 36236 transitions. [2018-12-31 19:33:24,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-31 19:33:24,424 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:33:24,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] [2018-12-31 19:33:24,425 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:33:24,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:33:24,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1168852336, now seen corresponding path program 1 times [2018-12-31 19:33:24,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:33:24,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:33:24,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:24,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:33:24,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:24,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:33:24,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 19:33:24,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:33:24,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 19:33:24,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 19:33:24,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 19:33:24,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 19:33:24,588 INFO L87 Difference]: Start difference. First operand 11369 states and 36236 transitions. Second operand 6 states. [2018-12-31 19:33:25,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:33:25,568 INFO L93 Difference]: Finished difference Result 20969 states and 66486 transitions. [2018-12-31 19:33:25,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 19:33:25,569 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2018-12-31 19:33:25,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:33:25,615 INFO L225 Difference]: With dead ends: 20969 [2018-12-31 19:33:25,615 INFO L226 Difference]: Without dead ends: 20898 [2018-12-31 19:33:25,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-31 19:33:25,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20898 states. [2018-12-31 19:33:26,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20898 to 13755. [2018-12-31 19:33:26,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13755 states. [2018-12-31 19:33:26,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13755 states to 13755 states and 43280 transitions. [2018-12-31 19:33:26,316 INFO L78 Accepts]: Start accepts. Automaton has 13755 states and 43280 transitions. Word has length 60 [2018-12-31 19:33:26,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:33:26,316 INFO L480 AbstractCegarLoop]: Abstraction has 13755 states and 43280 transitions. [2018-12-31 19:33:26,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 19:33:26,316 INFO L276 IsEmpty]: Start isEmpty. Operand 13755 states and 43280 transitions. [2018-12-31 19:33:26,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-31 19:33:26,333 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:33:26,334 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 19:33:26,334 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:33:26,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:33:26,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1208126989, now seen corresponding path program 1 times [2018-12-31 19:33:26,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:33:26,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:33:26,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:26,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:33:26,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:26,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:33:26,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 19:33:26,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:33:26,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 19:33:26,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 19:33:26,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 19:33:26,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 19:33:26,494 INFO L87 Difference]: Start difference. First operand 13755 states and 43280 transitions. Second operand 4 states. [2018-12-31 19:33:27,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:33:27,022 INFO L93 Difference]: Finished difference Result 23352 states and 74493 transitions. [2018-12-31 19:33:27,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 19:33:27,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-31 19:33:27,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:33:27,071 INFO L225 Difference]: With dead ends: 23352 [2018-12-31 19:33:27,071 INFO L226 Difference]: Without dead ends: 23352 [2018-12-31 19:33:27,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 19:33:27,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23352 states. [2018-12-31 19:33:27,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23352 to 14523. [2018-12-31 19:33:27,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14523 states. [2018-12-31 19:33:27,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14523 states to 14523 states and 45664 transitions. [2018-12-31 19:33:27,371 INFO L78 Accepts]: Start accepts. Automaton has 14523 states and 45664 transitions. Word has length 64 [2018-12-31 19:33:27,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:33:27,371 INFO L480 AbstractCegarLoop]: Abstraction has 14523 states and 45664 transitions. [2018-12-31 19:33:27,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 19:33:27,371 INFO L276 IsEmpty]: Start isEmpty. Operand 14523 states and 45664 transitions. [2018-12-31 19:33:27,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-31 19:33:27,380 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:33:27,380 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 19:33:27,380 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:33:27,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:33:27,381 INFO L82 PathProgramCache]: Analyzing trace with hash -914723982, now seen corresponding path program 1 times [2018-12-31 19:33:27,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:33:27,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:33:27,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:27,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:33:27,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:27,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:33:27,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 19:33:27,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:33:27,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 19:33:27,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 19:33:27,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 19:33:27,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 19:33:27,637 INFO L87 Difference]: Start difference. First operand 14523 states and 45664 transitions. Second operand 4 states. [2018-12-31 19:33:28,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:33:28,448 INFO L93 Difference]: Finished difference Result 18411 states and 56991 transitions. [2018-12-31 19:33:28,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 19:33:28,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-31 19:33:28,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:33:28,484 INFO L225 Difference]: With dead ends: 18411 [2018-12-31 19:33:28,484 INFO L226 Difference]: Without dead ends: 18411 [2018-12-31 19:33:28,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 19:33:28,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18411 states. [2018-12-31 19:33:28,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18411 to 16569. [2018-12-31 19:33:28,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16569 states. [2018-12-31 19:33:28,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16569 states to 16569 states and 51537 transitions. [2018-12-31 19:33:28,779 INFO L78 Accepts]: Start accepts. Automaton has 16569 states and 51537 transitions. Word has length 64 [2018-12-31 19:33:28,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:33:28,780 INFO L480 AbstractCegarLoop]: Abstraction has 16569 states and 51537 transitions. [2018-12-31 19:33:28,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 19:33:28,780 INFO L276 IsEmpty]: Start isEmpty. Operand 16569 states and 51537 transitions. [2018-12-31 19:33:28,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-31 19:33:28,790 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:33:28,791 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 19:33:28,791 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:33:28,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:33:28,791 INFO L82 PathProgramCache]: Analyzing trace with hash 126242611, now seen corresponding path program 1 times [2018-12-31 19:33:28,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:33:28,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:33:28,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:28,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:33:28,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:28,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:33:28,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 19:33:28,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:33:28,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 19:33:28,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 19:33:28,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 19:33:28,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 19:33:28,881 INFO L87 Difference]: Start difference. First operand 16569 states and 51537 transitions. Second operand 3 states. [2018-12-31 19:33:29,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:33:29,179 INFO L93 Difference]: Finished difference Result 17193 states and 53232 transitions. [2018-12-31 19:33:29,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 19:33:29,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2018-12-31 19:33:29,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:33:29,619 INFO L225 Difference]: With dead ends: 17193 [2018-12-31 19:33:29,619 INFO L226 Difference]: Without dead ends: 17193 [2018-12-31 19:33:29,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 19:33:29,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17193 states. [2018-12-31 19:33:29,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17193 to 16901. [2018-12-31 19:33:29,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16901 states. [2018-12-31 19:33:29,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16901 states to 16901 states and 52431 transitions. [2018-12-31 19:33:29,866 INFO L78 Accepts]: Start accepts. Automaton has 16901 states and 52431 transitions. Word has length 64 [2018-12-31 19:33:29,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:33:29,866 INFO L480 AbstractCegarLoop]: Abstraction has 16901 states and 52431 transitions. [2018-12-31 19:33:29,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 19:33:29,866 INFO L276 IsEmpty]: Start isEmpty. Operand 16901 states and 52431 transitions. [2018-12-31 19:33:29,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-31 19:33:29,876 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:33:29,876 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 19:33:29,876 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:33:29,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:33:29,877 INFO L82 PathProgramCache]: Analyzing trace with hash -859455011, now seen corresponding path program 1 times [2018-12-31 19:33:29,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:33:29,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:33:29,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:29,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:33:29,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:29,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:33:30,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 19:33:30,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:33:30,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 19:33:30,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 19:33:30,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 19:33:30,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 19:33:30,053 INFO L87 Difference]: Start difference. First operand 16901 states and 52431 transitions. Second operand 6 states. [2018-12-31 19:33:31,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:33:31,663 INFO L93 Difference]: Finished difference Result 20789 states and 63395 transitions. [2018-12-31 19:33:31,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 19:33:31,664 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-31 19:33:31,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:33:31,702 INFO L225 Difference]: With dead ends: 20789 [2018-12-31 19:33:31,702 INFO L226 Difference]: Without dead ends: 20789 [2018-12-31 19:33:31,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 19:33:31,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20789 states. [2018-12-31 19:33:31,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20789 to 19521. [2018-12-31 19:33:31,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19521 states. [2018-12-31 19:33:32,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19521 states to 19521 states and 60007 transitions. [2018-12-31 19:33:32,019 INFO L78 Accepts]: Start accepts. Automaton has 19521 states and 60007 transitions. Word has length 66 [2018-12-31 19:33:32,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:33:32,019 INFO L480 AbstractCegarLoop]: Abstraction has 19521 states and 60007 transitions. [2018-12-31 19:33:32,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 19:33:32,019 INFO L276 IsEmpty]: Start isEmpty. Operand 19521 states and 60007 transitions. [2018-12-31 19:33:32,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-31 19:33:32,032 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:33:32,032 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 19:33:32,033 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:33:32,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:33:32,033 INFO L82 PathProgramCache]: Analyzing trace with hash 102159006, now seen corresponding path program 1 times [2018-12-31 19:33:32,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:33:32,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:33:32,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:32,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:33:32,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:32,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:33:32,446 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-12-31 19:33:32,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 19:33:32,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:33:32,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 19:33:32,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 19:33:32,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 19:33:32,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 19:33:32,639 INFO L87 Difference]: Start difference. First operand 19521 states and 60007 transitions. Second operand 6 states. [2018-12-31 19:33:33,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:33:33,918 INFO L93 Difference]: Finished difference Result 22441 states and 66578 transitions. [2018-12-31 19:33:33,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 19:33:33,919 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-31 19:33:33,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:33:33,959 INFO L225 Difference]: With dead ends: 22441 [2018-12-31 19:33:33,959 INFO L226 Difference]: Without dead ends: 22441 [2018-12-31 19:33:33,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-31 19:33:34,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22441 states. [2018-12-31 19:33:34,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22441 to 20085. [2018-12-31 19:33:34,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20085 states. [2018-12-31 19:33:34,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20085 states to 20085 states and 60622 transitions. [2018-12-31 19:33:34,304 INFO L78 Accepts]: Start accepts. Automaton has 20085 states and 60622 transitions. Word has length 66 [2018-12-31 19:33:34,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:33:34,305 INFO L480 AbstractCegarLoop]: Abstraction has 20085 states and 60622 transitions. [2018-12-31 19:33:34,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 19:33:34,305 INFO L276 IsEmpty]: Start isEmpty. Operand 20085 states and 60622 transitions. [2018-12-31 19:33:34,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-31 19:33:34,318 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:33:34,318 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 19:33:34,318 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:33:34,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:33:34,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1346923487, now seen corresponding path program 1 times [2018-12-31 19:33:34,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:33:34,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:33:34,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:34,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:33:34,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:34,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:33:34,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 19:33:34,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:33:34,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 19:33:34,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 19:33:34,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 19:33:34,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 19:33:34,477 INFO L87 Difference]: Start difference. First operand 20085 states and 60622 transitions. Second operand 5 states. [2018-12-31 19:33:34,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:33:34,973 INFO L93 Difference]: Finished difference Result 26432 states and 79262 transitions. [2018-12-31 19:33:34,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 19:33:34,974 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-31 19:33:34,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:33:35,025 INFO L225 Difference]: With dead ends: 26432 [2018-12-31 19:33:35,025 INFO L226 Difference]: Without dead ends: 26432 [2018-12-31 19:33:35,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 19:33:35,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26432 states. [2018-12-31 19:33:35,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26432 to 23813. [2018-12-31 19:33:35,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23813 states. [2018-12-31 19:33:35,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23813 states to 23813 states and 71372 transitions. [2018-12-31 19:33:35,557 INFO L78 Accepts]: Start accepts. Automaton has 23813 states and 71372 transitions. Word has length 66 [2018-12-31 19:33:35,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:33:35,557 INFO L480 AbstractCegarLoop]: Abstraction has 23813 states and 71372 transitions. [2018-12-31 19:33:35,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 19:33:35,557 INFO L276 IsEmpty]: Start isEmpty. Operand 23813 states and 71372 transitions. [2018-12-31 19:33:35,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-31 19:33:35,575 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:33:35,575 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 19:33:35,575 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:33:35,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:33:35,576 INFO L82 PathProgramCache]: Analyzing trace with hash 836389310, now seen corresponding path program 1 times [2018-12-31 19:33:35,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:33:35,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:33:35,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:35,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:33:35,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:35,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:33:36,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 19:33:36,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:33:36,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 19:33:36,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 19:33:36,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 19:33:36,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 19:33:36,166 INFO L87 Difference]: Start difference. First operand 23813 states and 71372 transitions. Second operand 5 states. [2018-12-31 19:33:36,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:33:36,963 INFO L93 Difference]: Finished difference Result 33063 states and 98211 transitions. [2018-12-31 19:33:36,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 19:33:36,964 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-31 19:33:36,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:33:37,031 INFO L225 Difference]: With dead ends: 33063 [2018-12-31 19:33:37,032 INFO L226 Difference]: Without dead ends: 33063 [2018-12-31 19:33:37,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 19:33:37,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33063 states. [2018-12-31 19:33:37,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33063 to 29343. [2018-12-31 19:33:37,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29343 states. [2018-12-31 19:33:37,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29343 states to 29343 states and 87599 transitions. [2018-12-31 19:33:37,556 INFO L78 Accepts]: Start accepts. Automaton has 29343 states and 87599 transitions. Word has length 66 [2018-12-31 19:33:37,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:33:37,557 INFO L480 AbstractCegarLoop]: Abstraction has 29343 states and 87599 transitions. [2018-12-31 19:33:37,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 19:33:37,557 INFO L276 IsEmpty]: Start isEmpty. Operand 29343 states and 87599 transitions. [2018-12-31 19:33:37,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-31 19:33:37,572 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:33:37,572 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 19:33:37,572 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:33:37,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:33:37,573 INFO L82 PathProgramCache]: Analyzing trace with hash -971065153, now seen corresponding path program 1 times [2018-12-31 19:33:37,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:33:37,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:33:37,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:37,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:33:37,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:37,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:33:37,936 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2018-12-31 19:33:37,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 19:33:37,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:33:37,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 19:33:37,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 19:33:37,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 19:33:37,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 19:33:37,943 INFO L87 Difference]: Start difference. First operand 29343 states and 87599 transitions. Second operand 4 states. [2018-12-31 19:33:38,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:33:38,861 INFO L93 Difference]: Finished difference Result 38903 states and 116585 transitions. [2018-12-31 19:33:38,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 19:33:38,862 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-12-31 19:33:38,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:33:38,934 INFO L225 Difference]: With dead ends: 38903 [2018-12-31 19:33:38,934 INFO L226 Difference]: Without dead ends: 38671 [2018-12-31 19:33:38,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 19:33:39,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38671 states. [2018-12-31 19:33:39,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38671 to 35807. [2018-12-31 19:33:39,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35807 states. [2018-12-31 19:33:39,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35807 states to 35807 states and 107399 transitions. [2018-12-31 19:33:39,477 INFO L78 Accepts]: Start accepts. Automaton has 35807 states and 107399 transitions. Word has length 66 [2018-12-31 19:33:39,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:33:39,477 INFO L480 AbstractCegarLoop]: Abstraction has 35807 states and 107399 transitions. [2018-12-31 19:33:39,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 19:33:39,477 INFO L276 IsEmpty]: Start isEmpty. Operand 35807 states and 107399 transitions. [2018-12-31 19:33:39,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-31 19:33:39,492 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:33:39,493 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 19:33:39,493 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:33:39,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:33:39,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1526950784, now seen corresponding path program 1 times [2018-12-31 19:33:39,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:33:39,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:33:39,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:39,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:33:39,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:39,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:33:39,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 19:33:39,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:33:39,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 19:33:39,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 19:33:39,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 19:33:39,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-31 19:33:39,711 INFO L87 Difference]: Start difference. First operand 35807 states and 107399 transitions. Second operand 7 states. [2018-12-31 19:33:40,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:33:40,381 INFO L93 Difference]: Finished difference Result 31667 states and 90728 transitions. [2018-12-31 19:33:40,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 19:33:40,382 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2018-12-31 19:33:40,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:33:40,437 INFO L225 Difference]: With dead ends: 31667 [2018-12-31 19:33:40,438 INFO L226 Difference]: Without dead ends: 31667 [2018-12-31 19:33:40,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-12-31 19:33:40,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31667 states. [2018-12-31 19:33:41,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31667 to 25460. [2018-12-31 19:33:41,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25460 states. [2018-12-31 19:33:41,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25460 states to 25460 states and 73006 transitions. [2018-12-31 19:33:41,137 INFO L78 Accepts]: Start accepts. Automaton has 25460 states and 73006 transitions. Word has length 66 [2018-12-31 19:33:41,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:33:41,137 INFO L480 AbstractCegarLoop]: Abstraction has 25460 states and 73006 transitions. [2018-12-31 19:33:41,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 19:33:41,137 INFO L276 IsEmpty]: Start isEmpty. Operand 25460 states and 73006 transitions. [2018-12-31 19:33:41,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-31 19:33:41,149 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:33:41,149 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 19:33:41,150 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:33:41,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:33:41,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1880512831, now seen corresponding path program 1 times [2018-12-31 19:33:41,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:33:41,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:33:41,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:41,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:33:41,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:33:41,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 19:33:41,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:33:41,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 19:33:41,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 19:33:41,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 19:33:41,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 19:33:41,284 INFO L87 Difference]: Start difference. First operand 25460 states and 73006 transitions. Second operand 5 states. [2018-12-31 19:33:41,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:33:41,341 INFO L93 Difference]: Finished difference Result 7460 states and 17978 transitions. [2018-12-31 19:33:41,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 19:33:41,349 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-31 19:33:41,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:33:41,358 INFO L225 Difference]: With dead ends: 7460 [2018-12-31 19:33:41,358 INFO L226 Difference]: Without dead ends: 6135 [2018-12-31 19:33:41,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 19:33:41,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6135 states. [2018-12-31 19:33:41,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6135 to 5529. [2018-12-31 19:33:41,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5529 states. [2018-12-31 19:33:41,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5529 states to 5529 states and 12867 transitions. [2018-12-31 19:33:41,428 INFO L78 Accepts]: Start accepts. Automaton has 5529 states and 12867 transitions. Word has length 66 [2018-12-31 19:33:41,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:33:41,429 INFO L480 AbstractCegarLoop]: Abstraction has 5529 states and 12867 transitions. [2018-12-31 19:33:41,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 19:33:41,429 INFO L276 IsEmpty]: Start isEmpty. Operand 5529 states and 12867 transitions. [2018-12-31 19:33:41,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-31 19:33:41,435 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:33:41,435 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 19:33:41,435 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:33:41,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:33:41,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1184013087, now seen corresponding path program 1 times [2018-12-31 19:33:41,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:33:41,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:33:41,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:41,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:33:41,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:41,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:33:41,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 19:33:41,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:33:41,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 19:33:41,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 19:33:41,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 19:33:41,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 19:33:41,506 INFO L87 Difference]: Start difference. First operand 5529 states and 12867 transitions. Second operand 3 states. [2018-12-31 19:33:41,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:33:41,550 INFO L93 Difference]: Finished difference Result 7165 states and 16473 transitions. [2018-12-31 19:33:41,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 19:33:41,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-31 19:33:41,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:33:41,560 INFO L225 Difference]: With dead ends: 7165 [2018-12-31 19:33:41,560 INFO L226 Difference]: Without dead ends: 7165 [2018-12-31 19:33:41,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 19:33:41,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7165 states. [2018-12-31 19:33:41,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7165 to 5468. [2018-12-31 19:33:41,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5468 states. [2018-12-31 19:33:41,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5468 states to 5468 states and 12407 transitions. [2018-12-31 19:33:41,633 INFO L78 Accepts]: Start accepts. Automaton has 5468 states and 12407 transitions. Word has length 66 [2018-12-31 19:33:41,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:33:41,634 INFO L480 AbstractCegarLoop]: Abstraction has 5468 states and 12407 transitions. [2018-12-31 19:33:41,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 19:33:41,634 INFO L276 IsEmpty]: Start isEmpty. Operand 5468 states and 12407 transitions. [2018-12-31 19:33:41,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-31 19:33:41,640 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:33:41,640 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 19:33:41,642 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:33:41,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:33:41,642 INFO L82 PathProgramCache]: Analyzing trace with hash 280585492, now seen corresponding path program 1 times [2018-12-31 19:33:41,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:33:41,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:33:41,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:41,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:33:41,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:41,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:33:41,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 19:33:41,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:33:41,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 19:33:41,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 19:33:41,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 19:33:41,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 19:33:41,915 INFO L87 Difference]: Start difference. First operand 5468 states and 12407 transitions. Second operand 5 states. [2018-12-31 19:33:42,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:33:42,109 INFO L93 Difference]: Finished difference Result 6622 states and 15012 transitions. [2018-12-31 19:33:42,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 19:33:42,110 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2018-12-31 19:33:42,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:33:42,119 INFO L225 Difference]: With dead ends: 6622 [2018-12-31 19:33:42,120 INFO L226 Difference]: Without dead ends: 6622 [2018-12-31 19:33:42,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 19:33:42,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6622 states. [2018-12-31 19:33:42,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6622 to 5912. [2018-12-31 19:33:42,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5912 states. [2018-12-31 19:33:42,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5912 states to 5912 states and 13411 transitions. [2018-12-31 19:33:42,194 INFO L78 Accepts]: Start accepts. Automaton has 5912 states and 13411 transitions. Word has length 72 [2018-12-31 19:33:42,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:33:42,194 INFO L480 AbstractCegarLoop]: Abstraction has 5912 states and 13411 transitions. [2018-12-31 19:33:42,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 19:33:42,195 INFO L276 IsEmpty]: Start isEmpty. Operand 5912 states and 13411 transitions. [2018-12-31 19:33:42,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-31 19:33:42,206 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:33:42,206 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 19:33:42,206 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:33:42,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:33:42,208 INFO L82 PathProgramCache]: Analyzing trace with hash 2023395827, now seen corresponding path program 1 times [2018-12-31 19:33:42,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:33:42,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:33:42,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:42,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:33:42,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:42,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:33:42,466 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-12-31 19:33:42,661 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 6 [2018-12-31 19:33:42,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 19:33:42,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:33:42,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 19:33:42,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 19:33:42,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 19:33:42,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-31 19:33:42,740 INFO L87 Difference]: Start difference. First operand 5912 states and 13411 transitions. Second operand 9 states. [2018-12-31 19:33:43,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:33:43,370 INFO L93 Difference]: Finished difference Result 7374 states and 16560 transitions. [2018-12-31 19:33:43,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-31 19:33:43,371 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2018-12-31 19:33:43,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:33:43,382 INFO L225 Difference]: With dead ends: 7374 [2018-12-31 19:33:43,382 INFO L226 Difference]: Without dead ends: 7272 [2018-12-31 19:33:43,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-12-31 19:33:43,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7272 states. [2018-12-31 19:33:43,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7272 to 6009. [2018-12-31 19:33:43,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6009 states. [2018-12-31 19:33:43,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6009 states to 6009 states and 13504 transitions. [2018-12-31 19:33:43,462 INFO L78 Accepts]: Start accepts. Automaton has 6009 states and 13504 transitions. Word has length 72 [2018-12-31 19:33:43,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:33:43,462 INFO L480 AbstractCegarLoop]: Abstraction has 6009 states and 13504 transitions. [2018-12-31 19:33:43,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 19:33:43,462 INFO L276 IsEmpty]: Start isEmpty. Operand 6009 states and 13504 transitions. [2018-12-31 19:33:43,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-31 19:33:43,470 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:33:43,470 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 19:33:43,471 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:33:43,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:33:43,471 INFO L82 PathProgramCache]: Analyzing trace with hash 2109011007, now seen corresponding path program 1 times [2018-12-31 19:33:43,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:33:43,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:33:43,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:43,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:33:43,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:43,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:33:43,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 19:33:43,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:33:43,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 19:33:43,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 19:33:43,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 19:33:43,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 19:33:43,659 INFO L87 Difference]: Start difference. First operand 6009 states and 13504 transitions. Second operand 7 states. [2018-12-31 19:33:45,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:33:45,993 INFO L93 Difference]: Finished difference Result 7489 states and 16833 transitions. [2018-12-31 19:33:45,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 19:33:45,994 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-31 19:33:45,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:33:46,004 INFO L225 Difference]: With dead ends: 7489 [2018-12-31 19:33:46,005 INFO L226 Difference]: Without dead ends: 7489 [2018-12-31 19:33:46,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 19:33:46,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7489 states. [2018-12-31 19:33:46,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7489 to 6149. [2018-12-31 19:33:46,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6149 states. [2018-12-31 19:33:46,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6149 states to 6149 states and 13892 transitions. [2018-12-31 19:33:46,088 INFO L78 Accepts]: Start accepts. Automaton has 6149 states and 13892 transitions. Word has length 93 [2018-12-31 19:33:46,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:33:46,088 INFO L480 AbstractCegarLoop]: Abstraction has 6149 states and 13892 transitions. [2018-12-31 19:33:46,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 19:33:46,088 INFO L276 IsEmpty]: Start isEmpty. Operand 6149 states and 13892 transitions. [2018-12-31 19:33:46,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-31 19:33:46,096 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:33:46,096 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 19:33:46,097 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:33:46,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:33:46,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1747160284, now seen corresponding path program 1 times [2018-12-31 19:33:46,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:33:46,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:33:46,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:46,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:33:46,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:46,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:33:46,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 19:33:46,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:33:46,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 19:33:46,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 19:33:46,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 19:33:46,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 19:33:46,336 INFO L87 Difference]: Start difference. First operand 6149 states and 13892 transitions. Second operand 4 states. [2018-12-31 19:33:46,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:33:46,519 INFO L93 Difference]: Finished difference Result 7316 states and 16390 transitions. [2018-12-31 19:33:46,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 19:33:46,520 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2018-12-31 19:33:46,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:33:46,529 INFO L225 Difference]: With dead ends: 7316 [2018-12-31 19:33:46,529 INFO L226 Difference]: Without dead ends: 7316 [2018-12-31 19:33:46,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 19:33:46,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7316 states. [2018-12-31 19:33:46,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7316 to 6506. [2018-12-31 19:33:46,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6506 states. [2018-12-31 19:33:46,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6506 states to 6506 states and 14662 transitions. [2018-12-31 19:33:46,614 INFO L78 Accepts]: Start accepts. Automaton has 6506 states and 14662 transitions. Word has length 93 [2018-12-31 19:33:46,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:33:46,615 INFO L480 AbstractCegarLoop]: Abstraction has 6506 states and 14662 transitions. [2018-12-31 19:33:46,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 19:33:46,615 INFO L276 IsEmpty]: Start isEmpty. Operand 6506 states and 14662 transitions. [2018-12-31 19:33:46,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 19:33:46,623 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:33:46,624 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 19:33:46,624 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:33:46,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:33:46,624 INFO L82 PathProgramCache]: Analyzing trace with hash 279569706, now seen corresponding path program 1 times [2018-12-31 19:33:46,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:33:46,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:33:46,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:46,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:33:46,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:46,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:33:46,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 19:33:46,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:33:46,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 19:33:46,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 19:33:46,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 19:33:46,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 19:33:46,781 INFO L87 Difference]: Start difference. First operand 6506 states and 14662 transitions. Second operand 5 states. [2018-12-31 19:33:46,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:33:46,942 INFO L93 Difference]: Finished difference Result 7013 states and 15750 transitions. [2018-12-31 19:33:46,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 19:33:46,943 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2018-12-31 19:33:46,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:33:46,951 INFO L225 Difference]: With dead ends: 7013 [2018-12-31 19:33:46,952 INFO L226 Difference]: Without dead ends: 7013 [2018-12-31 19:33:46,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 19:33:46,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7013 states. [2018-12-31 19:33:47,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7013 to 5402. [2018-12-31 19:33:47,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5402 states. [2018-12-31 19:33:47,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5402 states to 5402 states and 12178 transitions. [2018-12-31 19:33:47,022 INFO L78 Accepts]: Start accepts. Automaton has 5402 states and 12178 transitions. Word has length 95 [2018-12-31 19:33:47,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:33:47,022 INFO L480 AbstractCegarLoop]: Abstraction has 5402 states and 12178 transitions. [2018-12-31 19:33:47,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 19:33:47,022 INFO L276 IsEmpty]: Start isEmpty. Operand 5402 states and 12178 transitions. [2018-12-31 19:33:47,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 19:33:47,030 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:33:47,031 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 19:33:47,031 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:33:47,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:33:47,031 INFO L82 PathProgramCache]: Analyzing trace with hash 290885833, now seen corresponding path program 1 times [2018-12-31 19:33:47,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:33:47,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:33:47,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:47,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:33:47,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:47,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:33:47,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 19:33:47,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:33:47,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-31 19:33:47,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 19:33:47,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 19:33:47,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-31 19:33:47,372 INFO L87 Difference]: Start difference. First operand 5402 states and 12178 transitions. Second operand 11 states. [2018-12-31 19:33:48,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:33:48,841 INFO L93 Difference]: Finished difference Result 7780 states and 17289 transitions. [2018-12-31 19:33:48,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-31 19:33:48,843 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2018-12-31 19:33:48,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:33:48,853 INFO L225 Difference]: With dead ends: 7780 [2018-12-31 19:33:48,853 INFO L226 Difference]: Without dead ends: 7748 [2018-12-31 19:33:48,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2018-12-31 19:33:48,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7748 states. [2018-12-31 19:33:48,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7748 to 6075. [2018-12-31 19:33:48,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6075 states. [2018-12-31 19:33:48,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6075 states to 6075 states and 13575 transitions. [2018-12-31 19:33:48,936 INFO L78 Accepts]: Start accepts. Automaton has 6075 states and 13575 transitions. Word has length 95 [2018-12-31 19:33:48,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:33:48,936 INFO L480 AbstractCegarLoop]: Abstraction has 6075 states and 13575 transitions. [2018-12-31 19:33:48,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 19:33:48,936 INFO L276 IsEmpty]: Start isEmpty. Operand 6075 states and 13575 transitions. [2018-12-31 19:33:48,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 19:33:48,945 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:33:48,945 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 19:33:48,946 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:33:48,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:33:48,946 INFO L82 PathProgramCache]: Analyzing trace with hash -898819829, now seen corresponding path program 1 times [2018-12-31 19:33:48,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:33:48,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:33:48,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:48,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:33:48,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:48,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:33:49,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 19:33:49,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:33:49,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 19:33:49,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 19:33:49,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 19:33:49,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-31 19:33:49,182 INFO L87 Difference]: Start difference. First operand 6075 states and 13575 transitions. Second operand 9 states. [2018-12-31 19:33:49,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:33:49,919 INFO L93 Difference]: Finished difference Result 7670 states and 16959 transitions. [2018-12-31 19:33:49,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-31 19:33:49,921 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2018-12-31 19:33:49,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:33:49,931 INFO L225 Difference]: With dead ends: 7670 [2018-12-31 19:33:49,932 INFO L226 Difference]: Without dead ends: 7670 [2018-12-31 19:33:49,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2018-12-31 19:33:49,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7670 states. [2018-12-31 19:33:49,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7670 to 6328. [2018-12-31 19:33:49,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6328 states. [2018-12-31 19:33:50,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6328 states to 6328 states and 14116 transitions. [2018-12-31 19:33:50,005 INFO L78 Accepts]: Start accepts. Automaton has 6328 states and 14116 transitions. Word has length 95 [2018-12-31 19:33:50,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:33:50,006 INFO L480 AbstractCegarLoop]: Abstraction has 6328 states and 14116 transitions. [2018-12-31 19:33:50,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 19:33:50,006 INFO L276 IsEmpty]: Start isEmpty. Operand 6328 states and 14116 transitions. [2018-12-31 19:33:50,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 19:33:50,013 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:33:50,013 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 19:33:50,015 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:33:50,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:33:50,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1574972597, now seen corresponding path program 1 times [2018-12-31 19:33:50,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:33:50,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:33:50,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:50,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:33:50,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:50,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:33:50,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 19:33:50,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:33:50,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 19:33:50,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 19:33:50,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 19:33:50,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-31 19:33:50,259 INFO L87 Difference]: Start difference. First operand 6328 states and 14116 transitions. Second operand 9 states. [2018-12-31 19:33:50,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:33:50,910 INFO L93 Difference]: Finished difference Result 7158 states and 15950 transitions. [2018-12-31 19:33:50,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-31 19:33:50,911 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2018-12-31 19:33:50,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:33:50,921 INFO L225 Difference]: With dead ends: 7158 [2018-12-31 19:33:50,921 INFO L226 Difference]: Without dead ends: 7121 [2018-12-31 19:33:50,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2018-12-31 19:33:50,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7121 states. [2018-12-31 19:33:50,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7121 to 6029. [2018-12-31 19:33:50,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6029 states. [2018-12-31 19:33:50,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6029 states to 6029 states and 13450 transitions. [2018-12-31 19:33:50,990 INFO L78 Accepts]: Start accepts. Automaton has 6029 states and 13450 transitions. Word has length 95 [2018-12-31 19:33:50,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:33:50,991 INFO L480 AbstractCegarLoop]: Abstraction has 6029 states and 13450 transitions. [2018-12-31 19:33:50,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 19:33:50,991 INFO L276 IsEmpty]: Start isEmpty. Operand 6029 states and 13450 transitions. [2018-12-31 19:33:50,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 19:33:50,997 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:33:50,997 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 19:33:50,997 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:33:50,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:33:50,999 INFO L82 PathProgramCache]: Analyzing trace with hash -687468916, now seen corresponding path program 1 times [2018-12-31 19:33:51,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:33:51,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:33:51,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:51,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:33:51,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:51,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:33:51,270 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-31 19:33:51,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 19:33:51,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:33:51,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-31 19:33:51,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 19:33:51,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 19:33:51,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-31 19:33:51,350 INFO L87 Difference]: Start difference. First operand 6029 states and 13450 transitions. Second operand 11 states. [2018-12-31 19:33:53,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:33:53,286 INFO L93 Difference]: Finished difference Result 11238 states and 25249 transitions. [2018-12-31 19:33:53,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-31 19:33:53,288 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2018-12-31 19:33:53,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:33:53,298 INFO L225 Difference]: With dead ends: 11238 [2018-12-31 19:33:53,299 INFO L226 Difference]: Without dead ends: 7673 [2018-12-31 19:33:53,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-31 19:33:53,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7673 states. [2018-12-31 19:33:53,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7673 to 5863. [2018-12-31 19:33:53,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5863 states. [2018-12-31 19:33:53,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5863 states to 5863 states and 13048 transitions. [2018-12-31 19:33:53,377 INFO L78 Accepts]: Start accepts. Automaton has 5863 states and 13048 transitions. Word has length 95 [2018-12-31 19:33:53,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:33:53,378 INFO L480 AbstractCegarLoop]: Abstraction has 5863 states and 13048 transitions. [2018-12-31 19:33:53,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 19:33:53,378 INFO L276 IsEmpty]: Start isEmpty. Operand 5863 states and 13048 transitions. [2018-12-31 19:33:53,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 19:33:53,385 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:33:53,386 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 19:33:53,386 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:33:53,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:33:53,386 INFO L82 PathProgramCache]: Analyzing trace with hash 874767388, now seen corresponding path program 1 times [2018-12-31 19:33:53,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:33:53,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:33:53,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:53,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:33:53,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:53,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:33:53,792 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-12-31 19:33:54,116 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 16 [2018-12-31 19:33:54,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 19:33:54,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:33:54,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 19:33:54,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 19:33:54,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 19:33:54,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 19:33:54,129 INFO L87 Difference]: Start difference. First operand 5863 states and 13048 transitions. Second operand 6 states. [2018-12-31 19:33:54,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:33:54,366 INFO L93 Difference]: Finished difference Result 6687 states and 14678 transitions. [2018-12-31 19:33:54,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 19:33:54,367 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2018-12-31 19:33:54,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:33:54,377 INFO L225 Difference]: With dead ends: 6687 [2018-12-31 19:33:54,377 INFO L226 Difference]: Without dead ends: 6630 [2018-12-31 19:33:54,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-31 19:33:54,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6630 states. [2018-12-31 19:33:54,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6630 to 5938. [2018-12-31 19:33:54,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5938 states. [2018-12-31 19:33:54,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5938 states to 5938 states and 13074 transitions. [2018-12-31 19:33:54,448 INFO L78 Accepts]: Start accepts. Automaton has 5938 states and 13074 transitions. Word has length 95 [2018-12-31 19:33:54,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:33:54,448 INFO L480 AbstractCegarLoop]: Abstraction has 5938 states and 13074 transitions. [2018-12-31 19:33:54,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 19:33:54,449 INFO L276 IsEmpty]: Start isEmpty. Operand 5938 states and 13074 transitions. [2018-12-31 19:33:54,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 19:33:54,456 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:33:54,456 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 19:33:54,456 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:33:54,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:33:54,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1692904092, now seen corresponding path program 2 times [2018-12-31 19:33:54,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:33:54,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:33:54,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:54,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:33:54,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:54,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:33:55,169 WARN L181 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 16 [2018-12-31 19:33:55,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 19:33:55,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:33:55,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 19:33:55,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 19:33:55,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 19:33:55,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-31 19:33:55,225 INFO L87 Difference]: Start difference. First operand 5938 states and 13074 transitions. Second operand 9 states. [2018-12-31 19:33:55,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:33:55,924 INFO L93 Difference]: Finished difference Result 6771 states and 14908 transitions. [2018-12-31 19:33:55,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 19:33:55,926 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2018-12-31 19:33:55,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:33:55,935 INFO L225 Difference]: With dead ends: 6771 [2018-12-31 19:33:55,935 INFO L226 Difference]: Without dead ends: 6771 [2018-12-31 19:33:55,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-12-31 19:33:55,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6771 states. [2018-12-31 19:33:56,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6771 to 6075. [2018-12-31 19:33:56,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6075 states. [2018-12-31 19:33:56,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6075 states to 6075 states and 13385 transitions. [2018-12-31 19:33:56,012 INFO L78 Accepts]: Start accepts. Automaton has 6075 states and 13385 transitions. Word has length 95 [2018-12-31 19:33:56,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:33:56,012 INFO L480 AbstractCegarLoop]: Abstraction has 6075 states and 13385 transitions. [2018-12-31 19:33:56,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 19:33:56,012 INFO L276 IsEmpty]: Start isEmpty. Operand 6075 states and 13385 transitions. [2018-12-31 19:33:56,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 19:33:56,019 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:33:56,019 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 19:33:56,019 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:33:56,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:33:56,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1904255005, now seen corresponding path program 1 times [2018-12-31 19:33:56,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:33:56,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:33:56,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:56,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 19:33:56,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:56,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:33:56,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 19:33:56,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:33:56,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 19:33:56,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 19:33:56,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 19:33:56,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-31 19:33:56,313 INFO L87 Difference]: Start difference. First operand 6075 states and 13385 transitions. Second operand 7 states. [2018-12-31 19:33:57,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:33:57,096 INFO L93 Difference]: Finished difference Result 7662 states and 16747 transitions. [2018-12-31 19:33:57,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 19:33:57,097 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-12-31 19:33:57,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:33:57,108 INFO L225 Difference]: With dead ends: 7662 [2018-12-31 19:33:57,108 INFO L226 Difference]: Without dead ends: 7662 [2018-12-31 19:33:57,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-12-31 19:33:57,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7662 states. [2018-12-31 19:33:57,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7662 to 6151. [2018-12-31 19:33:57,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6151 states. [2018-12-31 19:33:57,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6151 states to 6151 states and 13551 transitions. [2018-12-31 19:33:57,183 INFO L78 Accepts]: Start accepts. Automaton has 6151 states and 13551 transitions. Word has length 95 [2018-12-31 19:33:57,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:33:57,183 INFO L480 AbstractCegarLoop]: Abstraction has 6151 states and 13551 transitions. [2018-12-31 19:33:57,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 19:33:57,183 INFO L276 IsEmpty]: Start isEmpty. Operand 6151 states and 13551 transitions. [2018-12-31 19:33:57,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 19:33:57,189 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:33:57,190 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 19:33:57,190 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:33:57,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:33:57,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1204533149, now seen corresponding path program 2 times [2018-12-31 19:33:57,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:33:57,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:33:57,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:57,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:33:57,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:57,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:33:57,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 19:33:57,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:33:57,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 19:33:57,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 19:33:57,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 19:33:57,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-31 19:33:57,448 INFO L87 Difference]: Start difference. First operand 6151 states and 13551 transitions. Second operand 7 states. [2018-12-31 19:33:57,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:33:57,636 INFO L93 Difference]: Finished difference Result 8173 states and 18055 transitions. [2018-12-31 19:33:57,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 19:33:57,638 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-12-31 19:33:57,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:33:57,648 INFO L225 Difference]: With dead ends: 8173 [2018-12-31 19:33:57,648 INFO L226 Difference]: Without dead ends: 8173 [2018-12-31 19:33:57,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-31 19:33:57,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8173 states. [2018-12-31 19:33:57,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8173 to 5787. [2018-12-31 19:33:57,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5787 states. [2018-12-31 19:33:57,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5787 states to 5787 states and 12686 transitions. [2018-12-31 19:33:57,724 INFO L78 Accepts]: Start accepts. Automaton has 5787 states and 12686 transitions. Word has length 95 [2018-12-31 19:33:57,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:33:57,725 INFO L480 AbstractCegarLoop]: Abstraction has 5787 states and 12686 transitions. [2018-12-31 19:33:57,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 19:33:57,725 INFO L276 IsEmpty]: Start isEmpty. Operand 5787 states and 12686 transitions. [2018-12-31 19:33:57,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 19:33:57,732 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:33:57,732 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 19:33:57,732 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:33:57,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:33:57,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1415884062, now seen corresponding path program 2 times [2018-12-31 19:33:57,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:33:57,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:33:57,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:57,735 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 19:33:57,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:33:57,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 19:33:57,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 19:33:57,825 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 19:33:58,064 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-31 19:33:58,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 07:33:58 BasicIcfg [2018-12-31 19:33:58,066 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 19:33:58,067 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 19:33:58,067 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 19:33:58,067 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 19:33:58,068 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 07:33:10" (3/4) ... [2018-12-31 19:33:58,073 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 19:33:58,264 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 19:33:58,264 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 19:33:58,265 INFO L168 Benchmark]: Toolchain (without parser) took 49786.26 ms. Allocated memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: 1.9 GB). Free memory was 948.7 MB in the beginning and 1.8 GB in the end (delta: -829.7 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2018-12-31 19:33:58,269 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 19:33:58,270 INFO L168 Benchmark]: CACSL2BoogieTranslator took 845.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -133.6 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2018-12-31 19:33:58,270 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-31 19:33:58,274 INFO L168 Benchmark]: Boogie Preprocessor took 42.40 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 19:33:58,274 INFO L168 Benchmark]: RCFGBuilder took 1317.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 11.5 GB. [2018-12-31 19:33:58,275 INFO L168 Benchmark]: TraceAbstraction took 47291.45 ms. Allocated memory was 1.1 GB in the beginning and 2.9 GB in the end (delta: 1.8 GB). Free memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: -787.0 MB). Peak memory consumption was 978.3 MB. Max. memory is 11.5 GB. [2018-12-31 19:33:58,275 INFO L168 Benchmark]: Witness Printer took 197.33 ms. Allocated memory is still 2.9 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 37.3 MB). Peak memory consumption was 37.3 MB. Max. memory is 11.5 GB. [2018-12-31 19:33:58,281 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.18 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 845.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -133.6 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 84.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.40 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1317.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 47291.45 ms. Allocated memory was 1.1 GB in the beginning and 2.9 GB in the end (delta: 1.8 GB). Free memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: -787.0 MB). Peak memory consumption was 978.3 MB. Max. memory is 11.5 GB. * Witness Printer took 197.33 ms. Allocated memory is still 2.9 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 37.3 MB). Peak memory consumption was 37.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L681] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L682] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L683] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L684] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L685] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L686] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L687] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L688] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L689] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L690] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L691] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L692] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L693] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L694] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L695] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L696] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L697] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L773] -1 pthread_t t591; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] FCALL, FORK -1 pthread_create(&t591, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L701] 0 y$w_buff1 = y$w_buff0 [L702] 0 y$w_buff0 = 1 [L703] 0 y$w_buff1_used = y$w_buff0_used [L704] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L706] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L707] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L708] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L709] 0 y$r_buff0_thd1 = (_Bool)1 [L712] 0 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L715] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L775] -1 pthread_t t592; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L776] FCALL, FORK -1 pthread_create(&t592, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 x = 2 [L732] 1 __unbuffered_p1_EAX = x [L735] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L736] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L737] 1 y$flush_delayed = weak$$choice2 [L738] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L740] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L741] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L742] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L743] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] 1 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L745] EXPR 1 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L745] 1 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L715] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L747] 1 y = y$flush_delayed ? y$mem_tmp : y [L748] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L716] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L716] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L717] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L718] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L718] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L719] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L722] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L751] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L751] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L752] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L753] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L753] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L754] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L755] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L755] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L782] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L782] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L782] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L782] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L783] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L784] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L785] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L786] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L786] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L789] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 222 locations, 3 error locations. UNSAFE Result, 47.0s OverallTime, 32 OverallIterations, 1 TraceHistogramMax, 25.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8749 SDtfs, 10506 SDslu, 20983 SDs, 0 SdLazy, 9880 SolverSat, 461 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 350 GetRequests, 80 SyntacticMatches, 40 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 8.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35807occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 9.2s AutomataMinimizationTime, 31 MinimizatonAttempts, 83625 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 2344 NumberOfCodeBlocks, 2344 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2218 ConstructedInterpolants, 0 QuantifiedInterpolants, 526717 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...