./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix022_rmo.opt_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_rmo.opt_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 892c70f1fefdd41ce6be6b69b919a1c90f237180 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:57,992 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 19:33:57,995 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 19:33:58,012 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 19:33:58,014 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 19:33:58,016 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 19:33:58,018 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 19:33:58,021 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 19:33:58,026 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 19:33:58,027 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 19:33:58,031 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 19:33:58,032 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 19:33:58,033 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 19:33:58,035 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 19:33:58,036 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 19:33:58,036 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 19:33:58,037 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 19:33:58,039 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 19:33:58,041 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 19:33:58,043 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 19:33:58,044 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 19:33:58,045 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 19:33:58,048 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 19:33:58,048 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 19:33:58,048 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 19:33:58,049 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 19:33:58,051 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 19:33:58,051 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 19:33:58,052 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 19:33:58,053 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 19:33:58,054 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 19:33:58,054 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 19:33:58,055 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 19:33:58,055 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 19:33:58,056 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 19:33:58,057 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 19:33:58,057 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:58,074 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 19:33:58,074 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 19:33:58,076 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 19:33:58,076 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 19:33:58,076 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 19:33:58,076 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 19:33:58,077 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 19:33:58,077 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 19:33:58,077 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 19:33:58,077 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 19:33:58,077 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 19:33:58,077 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 19:33:58,078 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 19:33:58,078 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 19:33:58,078 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 19:33:58,078 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 19:33:58,078 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 19:33:58,078 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 19:33:58,079 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 19:33:58,079 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 19:33:58,079 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 19:33:58,079 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 19:33:58,079 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 19:33:58,079 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 19:33:58,080 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 19:33:58,080 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 19:33:58,080 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 19:33:58,080 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 19:33:58,080 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 -> 892c70f1fefdd41ce6be6b69b919a1c90f237180 [2018-12-31 19:33:58,133 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 19:33:58,150 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 19:33:58,155 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 19:33:58,158 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 19:33:58,158 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 19:33:58,160 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix022_rmo.opt_false-unreach-call.i [2018-12-31 19:33:58,233 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc753082e/0f93d9446cd548e789bff58750d79b19/FLAG409a7eef5 [2018-12-31 19:33:58,845 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 19:33:58,846 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix022_rmo.opt_false-unreach-call.i [2018-12-31 19:33:58,865 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc753082e/0f93d9446cd548e789bff58750d79b19/FLAG409a7eef5 [2018-12-31 19:33:59,057 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc753082e/0f93d9446cd548e789bff58750d79b19 [2018-12-31 19:33:59,061 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 19:33:59,063 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 19:33:59,064 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 19:33:59,064 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 19:33:59,068 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 19:33:59,069 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 07:33:59" (1/1) ... [2018-12-31 19:33:59,072 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12b20f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 07:33:59, skipping insertion in model container [2018-12-31 19:33:59,072 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 07:33:59" (1/1) ... [2018-12-31 19:33:59,081 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 19:33:59,145 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 19:33:59,642 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 19:33:59,673 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 19:33:59,867 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 19:33:59,965 INFO L195 MainTranslator]: Completed translation [2018-12-31 19:33:59,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 07:33:59 WrapperNode [2018-12-31 19:33:59,966 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 19:33:59,967 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 19:33:59,967 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 19:33:59,967 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 19:33:59,978 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:59" (1/1) ... [2018-12-31 19:34:00,009 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:59" (1/1) ... [2018-12-31 19:34:00,063 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 19:34:00,064 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 19:34:00,065 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 19:34:00,068 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 19:34:00,080 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:59" (1/1) ... [2018-12-31 19:34:00,080 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:59" (1/1) ... [2018-12-31 19:34:00,094 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:59" (1/1) ... [2018-12-31 19:34:00,097 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:59" (1/1) ... [2018-12-31 19:34:00,121 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:59" (1/1) ... [2018-12-31 19:34:00,126 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:59" (1/1) ... [2018-12-31 19:34:00,133 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:59" (1/1) ... [2018-12-31 19:34:00,138 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 19:34:00,139 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 19:34:00,139 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 19:34:00,139 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 19:34:00,140 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 07:33:59" (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:34:00,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 19:34:00,209 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-31 19:34:00,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 19:34:00,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 19:34:00,210 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-31 19:34:00,210 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-31 19:34:00,210 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-31 19:34:00,210 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-31 19:34:00,210 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-31 19:34:00,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 19:34:00,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 19:34:00,213 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:34:01,349 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 19:34:01,349 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-31 19:34:01,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 07:34:01 BoogieIcfgContainer [2018-12-31 19:34:01,350 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 19:34:01,351 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 19:34:01,351 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 19:34:01,355 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 19:34:01,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 07:33:59" (1/3) ... [2018-12-31 19:34:01,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e5f8b75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 07:34:01, skipping insertion in model container [2018-12-31 19:34:01,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 07:33:59" (2/3) ... [2018-12-31 19:34:01,357 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e5f8b75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 07:34:01, skipping insertion in model container [2018-12-31 19:34:01,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 07:34:01" (3/3) ... [2018-12-31 19:34:01,359 INFO L112 eAbstractionObserver]: Analyzing ICFG mix022_rmo.opt_false-unreach-call.i [2018-12-31 19:34:01,407 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,408 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,408 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,408 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,409 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,409 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:34:01,410 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,410 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,411 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,411 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,411 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,411 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,411 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,412 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,412 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,412 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,412 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,413 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,413 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,413 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,413 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,414 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,414 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,414 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,414 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,415 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,415 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,415 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,415 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,415 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,416 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,416 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,416 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,416 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,416 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,417 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,417 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,417 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,418 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,419 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,419 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,419 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,419 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,419 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,419 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,420 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,420 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,420 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,420 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,420 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,421 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,421 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,421 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,421 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,422 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,422 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,422 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,422 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,423 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,423 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,423 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,423 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,423 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,424 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,424 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,424 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,424 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,425 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,425 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,425 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,425 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,425 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,426 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,426 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,426 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,426 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,426 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,427 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,427 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,427 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,427 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,428 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,428 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,428 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,428 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,428 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,429 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,429 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,429 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,430 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,430 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,430 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,430 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,430 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,431 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,431 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,431 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,431 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,432 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,432 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,432 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,432 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,432 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,433 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,433 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,433 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,433 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,433 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,434 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,434 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,434 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,434 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,435 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,435 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,435 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,435 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,435 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,436 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,436 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,436 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,436 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,437 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,437 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,437 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,437 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,438 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,438 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,438 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,438 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,438 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,439 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,439 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,439 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,439 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,439 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,440 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,440 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,440 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,440 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,441 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,441 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,441 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,441 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,441 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,442 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,442 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,442 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,443 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,443 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,443 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,443 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,443 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,444 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,444 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,444 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,444 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,444 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,445 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,445 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,445 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,445 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,445 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,446 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,446 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 19:34:01,476 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-31 19:34:01,476 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 19:34:01,487 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 19:34:01,508 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 19:34:01,538 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 19:34:01,539 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 19:34:01,539 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 19:34:01,539 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 19:34:01,539 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 19:34:01,539 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 19:34:01,539 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 19:34:01,540 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 19:34:01,540 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 19:34:01,557 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 142places, 180 transitions [2018-12-31 19:34:04,423 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34806 states. [2018-12-31 19:34:04,425 INFO L276 IsEmpty]: Start isEmpty. Operand 34806 states. [2018-12-31 19:34:04,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-31 19:34:04,434 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:34:04,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] [2018-12-31 19:34:04,438 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:34:04,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:34:04,446 INFO L82 PathProgramCache]: Analyzing trace with hash 2100747441, now seen corresponding path program 1 times [2018-12-31 19:34:04,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:34:04,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:34:04,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:04,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:34:04,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:04,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:34:04,870 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:34:04,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:34:04,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 19:34:04,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 19:34:04,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 19:34:04,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 19:34:04,908 INFO L87 Difference]: Start difference. First operand 34806 states. Second operand 4 states. [2018-12-31 19:34:06,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:34:06,514 INFO L93 Difference]: Finished difference Result 60790 states and 234493 transitions. [2018-12-31 19:34:06,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 19:34:06,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-12-31 19:34:06,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:34:06,924 INFO L225 Difference]: With dead ends: 60790 [2018-12-31 19:34:06,925 INFO L226 Difference]: Without dead ends: 44270 [2018-12-31 19:34:06,927 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:34:07,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44270 states. [2018-12-31 19:34:08,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44270 to 27338. [2018-12-31 19:34:08,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27338 states. [2018-12-31 19:34:08,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27338 states to 27338 states and 105499 transitions. [2018-12-31 19:34:08,882 INFO L78 Accepts]: Start accepts. Automaton has 27338 states and 105499 transitions. Word has length 33 [2018-12-31 19:34:08,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:34:08,883 INFO L480 AbstractCegarLoop]: Abstraction has 27338 states and 105499 transitions. [2018-12-31 19:34:08,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 19:34:08,883 INFO L276 IsEmpty]: Start isEmpty. Operand 27338 states and 105499 transitions. [2018-12-31 19:34:08,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-31 19:34:08,895 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:34:08,895 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:34:08,896 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:34:08,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:34:08,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1664977985, now seen corresponding path program 1 times [2018-12-31 19:34:08,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:34:08,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:34:08,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:08,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:34:08,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:08,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:34:09,047 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:34:09,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:34:09,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 19:34:09,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 19:34:09,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 19:34:09,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 19:34:09,050 INFO L87 Difference]: Start difference. First operand 27338 states and 105499 transitions. Second operand 4 states. [2018-12-31 19:34:09,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:34:09,400 INFO L93 Difference]: Finished difference Result 8528 states and 28344 transitions. [2018-12-31 19:34:09,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 19:34:09,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-12-31 19:34:09,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:34:09,422 INFO L225 Difference]: With dead ends: 8528 [2018-12-31 19:34:09,422 INFO L226 Difference]: Without dead ends: 7466 [2018-12-31 19:34:09,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 19:34:09,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7466 states. [2018-12-31 19:34:09,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7466 to 7466. [2018-12-31 19:34:09,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7466 states. [2018-12-31 19:34:09,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7466 states to 7466 states and 24636 transitions. [2018-12-31 19:34:09,665 INFO L78 Accepts]: Start accepts. Automaton has 7466 states and 24636 transitions. Word has length 45 [2018-12-31 19:34:09,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:34:09,667 INFO L480 AbstractCegarLoop]: Abstraction has 7466 states and 24636 transitions. [2018-12-31 19:34:09,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 19:34:09,667 INFO L276 IsEmpty]: Start isEmpty. Operand 7466 states and 24636 transitions. [2018-12-31 19:34:09,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-31 19:34:09,671 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:34:09,671 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:34:09,671 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:34:09,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:34:09,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1909915460, now seen corresponding path program 1 times [2018-12-31 19:34:09,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:34:09,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:34:09,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:09,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:34:09,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:09,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:34:09,990 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:34:09,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:34:09,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 19:34:09,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 19:34:09,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 19:34:09,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 19:34:09,992 INFO L87 Difference]: Start difference. First operand 7466 states and 24636 transitions. Second operand 5 states. [2018-12-31 19:34:11,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:34:11,127 INFO L93 Difference]: Finished difference Result 13998 states and 45805 transitions. [2018-12-31 19:34:11,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 19:34:11,130 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-31 19:34:11,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:34:11,169 INFO L225 Difference]: With dead ends: 13998 [2018-12-31 19:34:11,169 INFO L226 Difference]: Without dead ends: 13930 [2018-12-31 19:34:11,170 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:34:11,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13930 states. [2018-12-31 19:34:11,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13930 to 9441. [2018-12-31 19:34:11,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9441 states. [2018-12-31 19:34:11,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9441 states to 9441 states and 30542 transitions. [2018-12-31 19:34:11,444 INFO L78 Accepts]: Start accepts. Automaton has 9441 states and 30542 transitions. Word has length 46 [2018-12-31 19:34:11,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:34:11,447 INFO L480 AbstractCegarLoop]: Abstraction has 9441 states and 30542 transitions. [2018-12-31 19:34:11,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 19:34:11,448 INFO L276 IsEmpty]: Start isEmpty. Operand 9441 states and 30542 transitions. [2018-12-31 19:34:11,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-31 19:34:11,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:34:11,453 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:34:11,454 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:34:11,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:34:11,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1845061814, now seen corresponding path program 1 times [2018-12-31 19:34:11,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:34:11,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:34:11,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:11,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:34:11,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:11,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:34:11,832 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:34:11,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:34:11,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 19:34:11,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 19:34:11,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 19:34:11,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 19:34:11,833 INFO L87 Difference]: Start difference. First operand 9441 states and 30542 transitions. Second operand 3 states. [2018-12-31 19:34:12,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:34:12,072 INFO L93 Difference]: Finished difference Result 13279 states and 42641 transitions. [2018-12-31 19:34:12,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 19:34:12,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-12-31 19:34:12,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:34:12,103 INFO L225 Difference]: With dead ends: 13279 [2018-12-31 19:34:12,103 INFO L226 Difference]: Without dead ends: 13279 [2018-12-31 19:34:12,103 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:34:12,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13279 states. [2018-12-31 19:34:12,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13279 to 9845. [2018-12-31 19:34:12,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9845 states. [2018-12-31 19:34:12,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9845 states to 9845 states and 31508 transitions. [2018-12-31 19:34:12,367 INFO L78 Accepts]: Start accepts. Automaton has 9845 states and 31508 transitions. Word has length 48 [2018-12-31 19:34:12,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:34:12,368 INFO L480 AbstractCegarLoop]: Abstraction has 9845 states and 31508 transitions. [2018-12-31 19:34:12,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 19:34:12,368 INFO L276 IsEmpty]: Start isEmpty. Operand 9845 states and 31508 transitions. [2018-12-31 19:34:12,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-31 19:34:12,371 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:34:12,371 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:34:12,371 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:34:12,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:34:12,371 INFO L82 PathProgramCache]: Analyzing trace with hash 484350805, now seen corresponding path program 1 times [2018-12-31 19:34:12,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:34:12,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:34:12,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:12,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:34:12,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:12,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:34:12,802 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:34:12,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:34:12,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 19:34:12,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 19:34:12,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 19:34:12,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-31 19:34:12,803 INFO L87 Difference]: Start difference. First operand 9845 states and 31508 transitions. Second operand 7 states. [2018-12-31 19:34:13,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:34:13,928 INFO L93 Difference]: Finished difference Result 12285 states and 38673 transitions. [2018-12-31 19:34:13,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 19:34:13,928 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-12-31 19:34:13,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:34:13,963 INFO L225 Difference]: With dead ends: 12285 [2018-12-31 19:34:13,963 INFO L226 Difference]: Without dead ends: 12213 [2018-12-31 19:34:13,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-31 19:34:14,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12213 states. [2018-12-31 19:34:14,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12213 to 10849. [2018-12-31 19:34:14,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10849 states. [2018-12-31 19:34:14,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10849 states to 10849 states and 34563 transitions. [2018-12-31 19:34:14,239 INFO L78 Accepts]: Start accepts. Automaton has 10849 states and 34563 transitions. Word has length 52 [2018-12-31 19:34:14,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:34:14,241 INFO L480 AbstractCegarLoop]: Abstraction has 10849 states and 34563 transitions. [2018-12-31 19:34:14,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 19:34:14,241 INFO L276 IsEmpty]: Start isEmpty. Operand 10849 states and 34563 transitions. [2018-12-31 19:34:14,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-31 19:34:14,249 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:34:14,249 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:34:14,249 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:34:14,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:34:14,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1383304625, now seen corresponding path program 1 times [2018-12-31 19:34:14,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:34:14,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:34:14,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:14,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:34:14,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:14,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:34:14,503 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:34:14,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:34:14,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 19:34:14,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 19:34:14,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 19:34:14,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 19:34:14,505 INFO L87 Difference]: Start difference. First operand 10849 states and 34563 transitions. Second operand 4 states. [2018-12-31 19:34:15,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:34:15,372 INFO L93 Difference]: Finished difference Result 12396 states and 39572 transitions. [2018-12-31 19:34:15,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 19:34:15,373 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-12-31 19:34:15,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:34:15,406 INFO L225 Difference]: With dead ends: 12396 [2018-12-31 19:34:15,406 INFO L226 Difference]: Without dead ends: 12396 [2018-12-31 19:34:15,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 19:34:15,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12396 states. [2018-12-31 19:34:15,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12396 to 11369. [2018-12-31 19:34:15,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11369 states. [2018-12-31 19:34:15,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11369 states to 11369 states and 36236 transitions. [2018-12-31 19:34:15,715 INFO L78 Accepts]: Start accepts. Automaton has 11369 states and 36236 transitions. Word has length 60 [2018-12-31 19:34:15,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:34:15,718 INFO L480 AbstractCegarLoop]: Abstraction has 11369 states and 36236 transitions. [2018-12-31 19:34:15,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 19:34:15,718 INFO L276 IsEmpty]: Start isEmpty. Operand 11369 states and 36236 transitions. [2018-12-31 19:34:15,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-31 19:34:15,730 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:34:15,730 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:34:15,731 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:34:15,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:34:15,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1168852336, now seen corresponding path program 1 times [2018-12-31 19:34:15,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:34:15,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:34:15,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:15,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:34:15,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:15,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:34:16,042 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:34:16,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:34:16,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 19:34:16,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 19:34:16,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 19:34:16,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 19:34:16,046 INFO L87 Difference]: Start difference. First operand 11369 states and 36236 transitions. Second operand 6 states. [2018-12-31 19:34:16,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:34:16,823 INFO L93 Difference]: Finished difference Result 20969 states and 66486 transitions. [2018-12-31 19:34:16,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 19:34:16,824 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2018-12-31 19:34:16,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:34:16,871 INFO L225 Difference]: With dead ends: 20969 [2018-12-31 19:34:16,871 INFO L226 Difference]: Without dead ends: 20898 [2018-12-31 19:34:16,871 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:34:16,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20898 states. [2018-12-31 19:34:17,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20898 to 13755. [2018-12-31 19:34:17,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13755 states. [2018-12-31 19:34:17,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13755 states to 13755 states and 43280 transitions. [2018-12-31 19:34:17,478 INFO L78 Accepts]: Start accepts. Automaton has 13755 states and 43280 transitions. Word has length 60 [2018-12-31 19:34:17,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:34:17,478 INFO L480 AbstractCegarLoop]: Abstraction has 13755 states and 43280 transitions. [2018-12-31 19:34:17,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 19:34:17,478 INFO L276 IsEmpty]: Start isEmpty. Operand 13755 states and 43280 transitions. [2018-12-31 19:34:17,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-31 19:34:17,489 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:34:17,489 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:34:17,490 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:34:17,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:34:17,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1208126989, now seen corresponding path program 1 times [2018-12-31 19:34:17,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:34:17,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:34:17,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:17,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:34:17,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:17,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:34:17,679 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:34:17,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:34:17,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 19:34:17,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 19:34:17,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 19:34:17,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 19:34:17,680 INFO L87 Difference]: Start difference. First operand 13755 states and 43280 transitions. Second operand 4 states. [2018-12-31 19:34:18,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:34:18,200 INFO L93 Difference]: Finished difference Result 23352 states and 74493 transitions. [2018-12-31 19:34:18,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 19:34:18,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-31 19:34:18,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:34:18,243 INFO L225 Difference]: With dead ends: 23352 [2018-12-31 19:34:18,243 INFO L226 Difference]: Without dead ends: 23352 [2018-12-31 19:34:18,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 19:34:18,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23352 states. [2018-12-31 19:34:18,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23352 to 14523. [2018-12-31 19:34:18,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14523 states. [2018-12-31 19:34:18,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14523 states to 14523 states and 45664 transitions. [2018-12-31 19:34:18,525 INFO L78 Accepts]: Start accepts. Automaton has 14523 states and 45664 transitions. Word has length 64 [2018-12-31 19:34:18,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:34:18,526 INFO L480 AbstractCegarLoop]: Abstraction has 14523 states and 45664 transitions. [2018-12-31 19:34:18,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 19:34:18,526 INFO L276 IsEmpty]: Start isEmpty. Operand 14523 states and 45664 transitions. [2018-12-31 19:34:18,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-31 19:34:18,534 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:34:18,534 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:34:18,534 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:34:18,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:34:18,534 INFO L82 PathProgramCache]: Analyzing trace with hash -914723982, now seen corresponding path program 1 times [2018-12-31 19:34:18,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:34:18,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:34:18,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:18,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:34:18,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:34:18,773 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:34:18,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:34:18,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 19:34:18,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 19:34:18,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 19:34:18,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 19:34:18,774 INFO L87 Difference]: Start difference. First operand 14523 states and 45664 transitions. Second operand 4 states. [2018-12-31 19:34:19,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:34:19,266 INFO L93 Difference]: Finished difference Result 18411 states and 56991 transitions. [2018-12-31 19:34:19,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 19:34:19,267 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-31 19:34:19,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:34:19,303 INFO L225 Difference]: With dead ends: 18411 [2018-12-31 19:34:19,304 INFO L226 Difference]: Without dead ends: 18411 [2018-12-31 19:34:19,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 19:34:19,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18411 states. [2018-12-31 19:34:19,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18411 to 16569. [2018-12-31 19:34:19,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16569 states. [2018-12-31 19:34:19,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16569 states to 16569 states and 51537 transitions. [2018-12-31 19:34:19,607 INFO L78 Accepts]: Start accepts. Automaton has 16569 states and 51537 transitions. Word has length 64 [2018-12-31 19:34:19,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:34:19,608 INFO L480 AbstractCegarLoop]: Abstraction has 16569 states and 51537 transitions. [2018-12-31 19:34:19,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 19:34:19,608 INFO L276 IsEmpty]: Start isEmpty. Operand 16569 states and 51537 transitions. [2018-12-31 19:34:19,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-31 19:34:19,621 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:34:19,621 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:34:19,621 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:34:19,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:34:19,622 INFO L82 PathProgramCache]: Analyzing trace with hash 46890035, now seen corresponding path program 1 times [2018-12-31 19:34:19,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:34:19,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:34:19,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:19,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:34:19,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:19,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:34:19,687 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:34:19,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:34:19,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 19:34:19,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 19:34:19,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 19:34:19,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 19:34:19,689 INFO L87 Difference]: Start difference. First operand 16569 states and 51537 transitions. Second operand 3 states. [2018-12-31 19:34:19,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:34:19,977 INFO L93 Difference]: Finished difference Result 17193 states and 53232 transitions. [2018-12-31 19:34:19,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 19:34:19,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2018-12-31 19:34:19,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:34:20,009 INFO L225 Difference]: With dead ends: 17193 [2018-12-31 19:34:20,009 INFO L226 Difference]: Without dead ends: 17193 [2018-12-31 19:34:20,010 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:34:20,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17193 states. [2018-12-31 19:34:20,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17193 to 16901. [2018-12-31 19:34:20,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16901 states. [2018-12-31 19:34:20,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16901 states to 16901 states and 52431 transitions. [2018-12-31 19:34:20,601 INFO L78 Accepts]: Start accepts. Automaton has 16901 states and 52431 transitions. Word has length 64 [2018-12-31 19:34:20,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:34:20,602 INFO L480 AbstractCegarLoop]: Abstraction has 16901 states and 52431 transitions. [2018-12-31 19:34:20,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 19:34:20,602 INFO L276 IsEmpty]: Start isEmpty. Operand 16901 states and 52431 transitions. [2018-12-31 19:34:20,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-31 19:34:20,612 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:34:20,613 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:34:20,613 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:34:20,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:34:20,613 INFO L82 PathProgramCache]: Analyzing trace with hash -859455011, now seen corresponding path program 1 times [2018-12-31 19:34:20,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:34:20,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:34:20,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:20,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:34:20,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:20,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:34:20,769 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-12-31 19:34:20,955 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:34:20,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:34:20,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 19:34:20,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 19:34:20,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 19:34:20,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 19:34:20,956 INFO L87 Difference]: Start difference. First operand 16901 states and 52431 transitions. Second operand 6 states. [2018-12-31 19:34:22,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:34:22,503 INFO L93 Difference]: Finished difference Result 20789 states and 63395 transitions. [2018-12-31 19:34:22,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 19:34:22,503 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-31 19:34:22,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:34:22,542 INFO L225 Difference]: With dead ends: 20789 [2018-12-31 19:34:22,542 INFO L226 Difference]: Without dead ends: 20789 [2018-12-31 19:34:22,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 19:34:22,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20789 states. [2018-12-31 19:34:22,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20789 to 19521. [2018-12-31 19:34:22,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19521 states. [2018-12-31 19:34:22,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19521 states to 19521 states and 60007 transitions. [2018-12-31 19:34:22,871 INFO L78 Accepts]: Start accepts. Automaton has 19521 states and 60007 transitions. Word has length 66 [2018-12-31 19:34:22,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:34:22,871 INFO L480 AbstractCegarLoop]: Abstraction has 19521 states and 60007 transitions. [2018-12-31 19:34:22,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 19:34:22,871 INFO L276 IsEmpty]: Start isEmpty. Operand 19521 states and 60007 transitions. [2018-12-31 19:34:22,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-31 19:34:22,885 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:34:22,885 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:34:22,885 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:34:22,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:34:22,886 INFO L82 PathProgramCache]: Analyzing trace with hash 102159006, now seen corresponding path program 1 times [2018-12-31 19:34:22,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:34:22,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:34:22,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:22,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:34:22,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:22,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:34:23,309 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-12-31 19:34:23,378 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:34:23,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:34:23,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 19:34:23,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 19:34:23,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 19:34:23,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 19:34:23,380 INFO L87 Difference]: Start difference. First operand 19521 states and 60007 transitions. Second operand 6 states. [2018-12-31 19:34:24,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:34:24,271 INFO L93 Difference]: Finished difference Result 22441 states and 66578 transitions. [2018-12-31 19:34:24,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 19:34:24,272 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-31 19:34:24,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:34:24,311 INFO L225 Difference]: With dead ends: 22441 [2018-12-31 19:34:24,311 INFO L226 Difference]: Without dead ends: 22441 [2018-12-31 19:34:24,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-31 19:34:24,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22441 states. [2018-12-31 19:34:24,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22441 to 20085. [2018-12-31 19:34:24,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20085 states. [2018-12-31 19:34:24,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20085 states to 20085 states and 60622 transitions. [2018-12-31 19:34:24,656 INFO L78 Accepts]: Start accepts. Automaton has 20085 states and 60622 transitions. Word has length 66 [2018-12-31 19:34:24,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:34:24,657 INFO L480 AbstractCegarLoop]: Abstraction has 20085 states and 60622 transitions. [2018-12-31 19:34:24,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 19:34:24,657 INFO L276 IsEmpty]: Start isEmpty. Operand 20085 states and 60622 transitions. [2018-12-31 19:34:24,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-31 19:34:24,672 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:34:24,672 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:34:24,672 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:34:24,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:34:24,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1346923487, now seen corresponding path program 1 times [2018-12-31 19:34:24,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:34:24,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:34:24,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:24,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:34:24,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:24,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:34:24,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:34:24,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:34:24,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 19:34:24,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 19:34:24,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 19:34:24,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 19:34:24,983 INFO L87 Difference]: Start difference. First operand 20085 states and 60622 transitions. Second operand 5 states. [2018-12-31 19:34:25,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:34:25,463 INFO L93 Difference]: Finished difference Result 26432 states and 79262 transitions. [2018-12-31 19:34:25,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 19:34:25,464 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-31 19:34:25,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:34:25,513 INFO L225 Difference]: With dead ends: 26432 [2018-12-31 19:34:25,513 INFO L226 Difference]: Without dead ends: 26432 [2018-12-31 19:34:25,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 19:34:25,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26432 states. [2018-12-31 19:34:25,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26432 to 23813. [2018-12-31 19:34:25,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23813 states. [2018-12-31 19:34:25,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23813 states to 23813 states and 71372 transitions. [2018-12-31 19:34:25,991 INFO L78 Accepts]: Start accepts. Automaton has 23813 states and 71372 transitions. Word has length 66 [2018-12-31 19:34:25,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:34:25,991 INFO L480 AbstractCegarLoop]: Abstraction has 23813 states and 71372 transitions. [2018-12-31 19:34:25,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 19:34:25,991 INFO L276 IsEmpty]: Start isEmpty. Operand 23813 states and 71372 transitions. [2018-12-31 19:34:26,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-31 19:34:26,007 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:34:26,007 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 19:34:26,008 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:34:26,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:34:26,008 INFO L82 PathProgramCache]: Analyzing trace with hash 836389310, now seen corresponding path program 1 times [2018-12-31 19:34:26,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:34:26,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:34:26,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:26,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:34:26,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:26,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:34:26,386 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:34:26,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:34:26,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 19:34:26,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 19:34:26,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 19:34:26,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 19:34:26,389 INFO L87 Difference]: Start difference. First operand 23813 states and 71372 transitions. Second operand 5 states. [2018-12-31 19:34:27,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:34:27,158 INFO L93 Difference]: Finished difference Result 33063 states and 98211 transitions. [2018-12-31 19:34:27,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 19:34:27,159 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-31 19:34:27,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:34:27,231 INFO L225 Difference]: With dead ends: 33063 [2018-12-31 19:34:27,232 INFO L226 Difference]: Without dead ends: 33063 [2018-12-31 19:34:27,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 19:34:27,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33063 states. [2018-12-31 19:34:27,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33063 to 29343. [2018-12-31 19:34:27,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29343 states. [2018-12-31 19:34:28,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29343 states to 29343 states and 87599 transitions. [2018-12-31 19:34:28,035 INFO L78 Accepts]: Start accepts. Automaton has 29343 states and 87599 transitions. Word has length 66 [2018-12-31 19:34:28,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:34:28,036 INFO L480 AbstractCegarLoop]: Abstraction has 29343 states and 87599 transitions. [2018-12-31 19:34:28,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 19:34:28,036 INFO L276 IsEmpty]: Start isEmpty. Operand 29343 states and 87599 transitions. [2018-12-31 19:34:28,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-31 19:34:28,051 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:34:28,051 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:34:28,051 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:34:28,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:34:28,051 INFO L82 PathProgramCache]: Analyzing trace with hash -971065153, now seen corresponding path program 1 times [2018-12-31 19:34:28,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:34:28,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:34:28,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:28,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:34:28,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:28,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:34:28,296 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:34:28,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:34:28,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 19:34:28,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 19:34:28,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 19:34:28,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 19:34:28,298 INFO L87 Difference]: Start difference. First operand 29343 states and 87599 transitions. Second operand 4 states. [2018-12-31 19:34:29,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:34:29,023 INFO L93 Difference]: Finished difference Result 38903 states and 116585 transitions. [2018-12-31 19:34:29,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 19:34:29,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-12-31 19:34:29,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:34:29,103 INFO L225 Difference]: With dead ends: 38903 [2018-12-31 19:34:29,103 INFO L226 Difference]: Without dead ends: 38671 [2018-12-31 19:34:29,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 19:34:29,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38671 states. [2018-12-31 19:34:29,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38671 to 35807. [2018-12-31 19:34:29,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35807 states. [2018-12-31 19:34:29,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35807 states to 35807 states and 107399 transitions. [2018-12-31 19:34:29,719 INFO L78 Accepts]: Start accepts. Automaton has 35807 states and 107399 transitions. Word has length 66 [2018-12-31 19:34:29,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:34:29,719 INFO L480 AbstractCegarLoop]: Abstraction has 35807 states and 107399 transitions. [2018-12-31 19:34:29,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 19:34:29,719 INFO L276 IsEmpty]: Start isEmpty. Operand 35807 states and 107399 transitions. [2018-12-31 19:34:29,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-31 19:34:29,736 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:34:29,736 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 19:34:29,736 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:34:29,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:34:29,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1526950784, now seen corresponding path program 1 times [2018-12-31 19:34:29,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:34:29,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:34:29,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:29,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:34:29,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:29,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:34:29,951 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:34:29,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:34:29,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 19:34:29,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 19:34:29,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 19:34:29,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-31 19:34:29,952 INFO L87 Difference]: Start difference. First operand 35807 states and 107399 transitions. Second operand 7 states. [2018-12-31 19:34:30,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:34:30,614 INFO L93 Difference]: Finished difference Result 31667 states and 90728 transitions. [2018-12-31 19:34:30,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 19:34:30,615 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2018-12-31 19:34:30,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:34:30,665 INFO L225 Difference]: With dead ends: 31667 [2018-12-31 19:34:30,665 INFO L226 Difference]: Without dead ends: 31667 [2018-12-31 19:34:30,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-12-31 19:34:30,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31667 states. [2018-12-31 19:34:31,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31667 to 25460. [2018-12-31 19:34:31,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25460 states. [2018-12-31 19:34:31,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25460 states to 25460 states and 73006 transitions. [2018-12-31 19:34:31,122 INFO L78 Accepts]: Start accepts. Automaton has 25460 states and 73006 transitions. Word has length 66 [2018-12-31 19:34:31,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:34:31,123 INFO L480 AbstractCegarLoop]: Abstraction has 25460 states and 73006 transitions. [2018-12-31 19:34:31,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 19:34:31,123 INFO L276 IsEmpty]: Start isEmpty. Operand 25460 states and 73006 transitions. [2018-12-31 19:34:31,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-31 19:34:31,136 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:34:31,136 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:34:31,136 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:34:31,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:34:31,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1880512831, now seen corresponding path program 1 times [2018-12-31 19:34:31,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:34:31,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:34:31,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:31,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:34:31,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:31,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:34:31,221 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:34:31,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:34:31,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 19:34:31,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 19:34:31,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 19:34:31,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 19:34:31,222 INFO L87 Difference]: Start difference. First operand 25460 states and 73006 transitions. Second operand 5 states. [2018-12-31 19:34:31,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:34:31,288 INFO L93 Difference]: Finished difference Result 7460 states and 17978 transitions. [2018-12-31 19:34:31,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 19:34:31,290 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-31 19:34:31,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:34:31,299 INFO L225 Difference]: With dead ends: 7460 [2018-12-31 19:34:31,299 INFO L226 Difference]: Without dead ends: 6135 [2018-12-31 19:34:31,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 19:34:31,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6135 states. [2018-12-31 19:34:31,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6135 to 5529. [2018-12-31 19:34:31,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5529 states. [2018-12-31 19:34:31,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5529 states to 5529 states and 12867 transitions. [2018-12-31 19:34:31,369 INFO L78 Accepts]: Start accepts. Automaton has 5529 states and 12867 transitions. Word has length 66 [2018-12-31 19:34:31,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:34:31,369 INFO L480 AbstractCegarLoop]: Abstraction has 5529 states and 12867 transitions. [2018-12-31 19:34:31,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 19:34:31,369 INFO L276 IsEmpty]: Start isEmpty. Operand 5529 states and 12867 transitions. [2018-12-31 19:34:31,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-31 19:34:31,375 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:34:31,376 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:34:31,376 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:34:31,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:34:31,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1184013087, now seen corresponding path program 1 times [2018-12-31 19:34:31,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:34:31,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:34:31,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:31,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:34:31,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:31,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:34:31,451 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:34:31,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:34:31,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 19:34:31,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 19:34:31,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 19:34:31,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 19:34:31,452 INFO L87 Difference]: Start difference. First operand 5529 states and 12867 transitions. Second operand 3 states. [2018-12-31 19:34:31,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:34:31,692 INFO L93 Difference]: Finished difference Result 7165 states and 16473 transitions. [2018-12-31 19:34:31,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 19:34:31,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-31 19:34:31,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:34:31,703 INFO L225 Difference]: With dead ends: 7165 [2018-12-31 19:34:31,704 INFO L226 Difference]: Without dead ends: 7165 [2018-12-31 19:34:31,704 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:34:31,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7165 states. [2018-12-31 19:34:31,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7165 to 5468. [2018-12-31 19:34:31,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5468 states. [2018-12-31 19:34:31,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5468 states to 5468 states and 12407 transitions. [2018-12-31 19:34:31,883 INFO L78 Accepts]: Start accepts. Automaton has 5468 states and 12407 transitions. Word has length 66 [2018-12-31 19:34:31,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:34:31,884 INFO L480 AbstractCegarLoop]: Abstraction has 5468 states and 12407 transitions. [2018-12-31 19:34:31,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 19:34:31,884 INFO L276 IsEmpty]: Start isEmpty. Operand 5468 states and 12407 transitions. [2018-12-31 19:34:31,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-31 19:34:31,891 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:34:31,891 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:34:31,892 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:34:31,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:34:31,892 INFO L82 PathProgramCache]: Analyzing trace with hash 280585492, now seen corresponding path program 1 times [2018-12-31 19:34:31,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:34:31,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:34:31,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:31,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:34:31,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:31,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:34:32,019 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:34:32,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:34:32,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 19:34:32,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 19:34:32,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 19:34:32,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 19:34:32,021 INFO L87 Difference]: Start difference. First operand 5468 states and 12407 transitions. Second operand 5 states. [2018-12-31 19:34:32,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:34:32,213 INFO L93 Difference]: Finished difference Result 6622 states and 15012 transitions. [2018-12-31 19:34:32,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 19:34:32,215 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2018-12-31 19:34:32,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:34:32,225 INFO L225 Difference]: With dead ends: 6622 [2018-12-31 19:34:32,225 INFO L226 Difference]: Without dead ends: 6622 [2018-12-31 19:34:32,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 19:34:32,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6622 states. [2018-12-31 19:34:32,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6622 to 5912. [2018-12-31 19:34:32,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5912 states. [2018-12-31 19:34:32,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5912 states to 5912 states and 13411 transitions. [2018-12-31 19:34:32,307 INFO L78 Accepts]: Start accepts. Automaton has 5912 states and 13411 transitions. Word has length 72 [2018-12-31 19:34:32,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:34:32,307 INFO L480 AbstractCegarLoop]: Abstraction has 5912 states and 13411 transitions. [2018-12-31 19:34:32,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 19:34:32,308 INFO L276 IsEmpty]: Start isEmpty. Operand 5912 states and 13411 transitions. [2018-12-31 19:34:32,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-31 19:34:32,315 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:34:32,315 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:34:32,315 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:34:32,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:34:32,315 INFO L82 PathProgramCache]: Analyzing trace with hash 2023395827, now seen corresponding path program 1 times [2018-12-31 19:34:32,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:34:32,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:34:32,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:32,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:34:32,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:32,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:34:32,578 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:34:32,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:34:32,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 19:34:32,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 19:34:32,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 19:34:32,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-31 19:34:32,580 INFO L87 Difference]: Start difference. First operand 5912 states and 13411 transitions. Second operand 9 states. [2018-12-31 19:34:33,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:34:33,332 INFO L93 Difference]: Finished difference Result 7374 states and 16560 transitions. [2018-12-31 19:34:33,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-31 19:34:33,334 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2018-12-31 19:34:33,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:34:33,344 INFO L225 Difference]: With dead ends: 7374 [2018-12-31 19:34:33,344 INFO L226 Difference]: Without dead ends: 7272 [2018-12-31 19:34:33,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-12-31 19:34:33,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7272 states. [2018-12-31 19:34:33,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7272 to 6009. [2018-12-31 19:34:33,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6009 states. [2018-12-31 19:34:33,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6009 states to 6009 states and 13504 transitions. [2018-12-31 19:34:33,416 INFO L78 Accepts]: Start accepts. Automaton has 6009 states and 13504 transitions. Word has length 72 [2018-12-31 19:34:33,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:34:33,417 INFO L480 AbstractCegarLoop]: Abstraction has 6009 states and 13504 transitions. [2018-12-31 19:34:33,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 19:34:33,417 INFO L276 IsEmpty]: Start isEmpty. Operand 6009 states and 13504 transitions. [2018-12-31 19:34:33,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-31 19:34:33,424 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:34:33,424 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 19:34:33,424 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:34:33,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:34:33,425 INFO L82 PathProgramCache]: Analyzing trace with hash 2109011007, now seen corresponding path program 1 times [2018-12-31 19:34:33,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:34:33,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:34:33,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:33,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:34:33,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:33,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:34:33,934 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:34:33,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:34:33,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 19:34:33,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 19:34:33,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 19:34:33,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 19:34:33,936 INFO L87 Difference]: Start difference. First operand 6009 states and 13504 transitions. Second operand 7 states. [2018-12-31 19:34:35,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:34:35,678 INFO L93 Difference]: Finished difference Result 7489 states and 16833 transitions. [2018-12-31 19:34:35,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 19:34:35,680 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-31 19:34:35,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:34:35,692 INFO L225 Difference]: With dead ends: 7489 [2018-12-31 19:34:35,692 INFO L226 Difference]: Without dead ends: 7489 [2018-12-31 19:34:35,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 19:34:35,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7489 states. [2018-12-31 19:34:35,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7489 to 6149. [2018-12-31 19:34:35,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6149 states. [2018-12-31 19:34:35,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6149 states to 6149 states and 13892 transitions. [2018-12-31 19:34:35,779 INFO L78 Accepts]: Start accepts. Automaton has 6149 states and 13892 transitions. Word has length 93 [2018-12-31 19:34:35,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:34:35,780 INFO L480 AbstractCegarLoop]: Abstraction has 6149 states and 13892 transitions. [2018-12-31 19:34:35,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 19:34:35,780 INFO L276 IsEmpty]: Start isEmpty. Operand 6149 states and 13892 transitions. [2018-12-31 19:34:35,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-31 19:34:35,787 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:34:35,788 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:34:35,788 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:34:35,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:34:35,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1747160284, now seen corresponding path program 1 times [2018-12-31 19:34:35,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:34:35,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:34:35,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:35,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:34:35,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:35,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:34:35,956 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:34:35,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:34:35,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 19:34:35,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 19:34:35,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 19:34:35,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 19:34:35,958 INFO L87 Difference]: Start difference. First operand 6149 states and 13892 transitions. Second operand 4 states. [2018-12-31 19:34:36,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:34:36,069 INFO L93 Difference]: Finished difference Result 7316 states and 16390 transitions. [2018-12-31 19:34:36,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 19:34:36,070 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2018-12-31 19:34:36,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:34:36,080 INFO L225 Difference]: With dead ends: 7316 [2018-12-31 19:34:36,081 INFO L226 Difference]: Without dead ends: 7316 [2018-12-31 19:34:36,081 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:34:36,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7316 states. [2018-12-31 19:34:36,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7316 to 6506. [2018-12-31 19:34:36,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6506 states. [2018-12-31 19:34:36,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6506 states to 6506 states and 14662 transitions. [2018-12-31 19:34:36,187 INFO L78 Accepts]: Start accepts. Automaton has 6506 states and 14662 transitions. Word has length 93 [2018-12-31 19:34:36,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:34:36,187 INFO L480 AbstractCegarLoop]: Abstraction has 6506 states and 14662 transitions. [2018-12-31 19:34:36,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 19:34:36,187 INFO L276 IsEmpty]: Start isEmpty. Operand 6506 states and 14662 transitions. [2018-12-31 19:34:36,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 19:34:36,196 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:34:36,196 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:36,197 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:34:36,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:34:36,197 INFO L82 PathProgramCache]: Analyzing trace with hash 279569706, now seen corresponding path program 1 times [2018-12-31 19:34:36,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:34:36,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:34:36,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:36,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:34:36,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:36,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:34:36,353 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:34:36,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:34:36,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 19:34:36,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 19:34:36,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 19:34:36,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 19:34:36,355 INFO L87 Difference]: Start difference. First operand 6506 states and 14662 transitions. Second operand 5 states. [2018-12-31 19:34:36,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:34:36,476 INFO L93 Difference]: Finished difference Result 7013 states and 15750 transitions. [2018-12-31 19:34:36,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 19:34:36,477 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2018-12-31 19:34:36,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:34:36,486 INFO L225 Difference]: With dead ends: 7013 [2018-12-31 19:34:36,486 INFO L226 Difference]: Without dead ends: 7013 [2018-12-31 19:34:36,487 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:34:36,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7013 states. [2018-12-31 19:34:36,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7013 to 5402. [2018-12-31 19:34:36,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5402 states. [2018-12-31 19:34:36,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5402 states to 5402 states and 12178 transitions. [2018-12-31 19:34:36,554 INFO L78 Accepts]: Start accepts. Automaton has 5402 states and 12178 transitions. Word has length 95 [2018-12-31 19:34:36,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:34:36,554 INFO L480 AbstractCegarLoop]: Abstraction has 5402 states and 12178 transitions. [2018-12-31 19:34:36,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 19:34:36,555 INFO L276 IsEmpty]: Start isEmpty. Operand 5402 states and 12178 transitions. [2018-12-31 19:34:36,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 19:34:36,564 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:34:36,564 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:34:36,564 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:34:36,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:34:36,564 INFO L82 PathProgramCache]: Analyzing trace with hash 290885833, now seen corresponding path program 1 times [2018-12-31 19:34:36,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:34:36,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:34:36,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:36,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:34:36,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:34:36,925 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:34:36,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:34:36,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-31 19:34:36,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 19:34:36,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 19:34:36,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-31 19:34:36,926 INFO L87 Difference]: Start difference. First operand 5402 states and 12178 transitions. Second operand 11 states. [2018-12-31 19:34:38,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:34:38,525 INFO L93 Difference]: Finished difference Result 7780 states and 17289 transitions. [2018-12-31 19:34:38,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-31 19:34:38,526 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2018-12-31 19:34:38,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:34:38,537 INFO L225 Difference]: With dead ends: 7780 [2018-12-31 19:34:38,537 INFO L226 Difference]: Without dead ends: 7748 [2018-12-31 19:34:38,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2018-12-31 19:34:38,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7748 states. [2018-12-31 19:34:38,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7748 to 6075. [2018-12-31 19:34:38,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6075 states. [2018-12-31 19:34:38,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6075 states to 6075 states and 13575 transitions. [2018-12-31 19:34:38,619 INFO L78 Accepts]: Start accepts. Automaton has 6075 states and 13575 transitions. Word has length 95 [2018-12-31 19:34:38,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:34:38,619 INFO L480 AbstractCegarLoop]: Abstraction has 6075 states and 13575 transitions. [2018-12-31 19:34:38,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 19:34:38,620 INFO L276 IsEmpty]: Start isEmpty. Operand 6075 states and 13575 transitions. [2018-12-31 19:34:38,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 19:34:38,629 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:34:38,629 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:34:38,630 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:34:38,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:34:38,630 INFO L82 PathProgramCache]: Analyzing trace with hash -898819829, now seen corresponding path program 1 times [2018-12-31 19:34:38,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:34:38,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:34:38,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:38,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:34:38,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:38,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:34:38,855 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:34:38,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:34:38,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 19:34:38,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 19:34:38,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 19:34:38,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-31 19:34:38,857 INFO L87 Difference]: Start difference. First operand 6075 states and 13575 transitions. Second operand 9 states. [2018-12-31 19:34:39,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:34:39,599 INFO L93 Difference]: Finished difference Result 7670 states and 16959 transitions. [2018-12-31 19:34:39,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-31 19:34:39,600 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2018-12-31 19:34:39,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:34:39,611 INFO L225 Difference]: With dead ends: 7670 [2018-12-31 19:34:39,611 INFO L226 Difference]: Without dead ends: 7670 [2018-12-31 19:34:39,611 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:34:39,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7670 states. [2018-12-31 19:34:39,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7670 to 6328. [2018-12-31 19:34:39,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6328 states. [2018-12-31 19:34:39,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6328 states to 6328 states and 14116 transitions. [2018-12-31 19:34:39,697 INFO L78 Accepts]: Start accepts. Automaton has 6328 states and 14116 transitions. Word has length 95 [2018-12-31 19:34:39,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:34:39,697 INFO L480 AbstractCegarLoop]: Abstraction has 6328 states and 14116 transitions. [2018-12-31 19:34:39,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 19:34:39,698 INFO L276 IsEmpty]: Start isEmpty. Operand 6328 states and 14116 transitions. [2018-12-31 19:34:39,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 19:34:39,706 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:34:39,706 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 19:34:39,708 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:34:39,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:34:39,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1574972597, now seen corresponding path program 1 times [2018-12-31 19:34:39,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:34:39,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:34:39,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:39,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:34:39,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:39,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:34:39,978 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:34:39,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:34:39,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 19:34:39,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 19:34:39,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 19:34:39,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-31 19:34:39,980 INFO L87 Difference]: Start difference. First operand 6328 states and 14116 transitions. Second operand 9 states. [2018-12-31 19:34:40,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:34:40,576 INFO L93 Difference]: Finished difference Result 7158 states and 15950 transitions. [2018-12-31 19:34:40,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-31 19:34:40,577 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2018-12-31 19:34:40,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:34:40,586 INFO L225 Difference]: With dead ends: 7158 [2018-12-31 19:34:40,586 INFO L226 Difference]: Without dead ends: 7121 [2018-12-31 19:34:40,587 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:34:40,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7121 states. [2018-12-31 19:34:40,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7121 to 6029. [2018-12-31 19:34:40,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6029 states. [2018-12-31 19:34:40,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6029 states to 6029 states and 13450 transitions. [2018-12-31 19:34:40,656 INFO L78 Accepts]: Start accepts. Automaton has 6029 states and 13450 transitions. Word has length 95 [2018-12-31 19:34:40,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:34:40,657 INFO L480 AbstractCegarLoop]: Abstraction has 6029 states and 13450 transitions. [2018-12-31 19:34:40,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 19:34:40,657 INFO L276 IsEmpty]: Start isEmpty. Operand 6029 states and 13450 transitions. [2018-12-31 19:34:40,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 19:34:40,663 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:34:40,663 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:34:40,664 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:34:40,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:34:40,664 INFO L82 PathProgramCache]: Analyzing trace with hash -687468916, now seen corresponding path program 1 times [2018-12-31 19:34:40,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:34:40,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:34:40,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:40,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:34:40,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:40,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:34:40,923 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-31 19:34:41,024 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:34:41,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:34:41,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-31 19:34:41,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 19:34:41,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 19:34:41,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-31 19:34:41,025 INFO L87 Difference]: Start difference. First operand 6029 states and 13450 transitions. Second operand 11 states. [2018-12-31 19:34:42,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:34:42,776 INFO L93 Difference]: Finished difference Result 11238 states and 25249 transitions. [2018-12-31 19:34:42,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-31 19:34:42,778 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2018-12-31 19:34:42,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:34:42,788 INFO L225 Difference]: With dead ends: 11238 [2018-12-31 19:34:42,789 INFO L226 Difference]: Without dead ends: 7673 [2018-12-31 19:34:42,789 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:34:42,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7673 states. [2018-12-31 19:34:42,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7673 to 5863. [2018-12-31 19:34:42,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5863 states. [2018-12-31 19:34:42,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5863 states to 5863 states and 13048 transitions. [2018-12-31 19:34:42,868 INFO L78 Accepts]: Start accepts. Automaton has 5863 states and 13048 transitions. Word has length 95 [2018-12-31 19:34:42,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:34:42,868 INFO L480 AbstractCegarLoop]: Abstraction has 5863 states and 13048 transitions. [2018-12-31 19:34:42,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 19:34:42,868 INFO L276 IsEmpty]: Start isEmpty. Operand 5863 states and 13048 transitions. [2018-12-31 19:34:42,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 19:34:42,875 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:34:42,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, 1, 1, 1, 1, 1, 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:34:42,876 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:34:42,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:34:42,876 INFO L82 PathProgramCache]: Analyzing trace with hash 874767388, now seen corresponding path program 1 times [2018-12-31 19:34:42,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:34:42,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:34:42,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:42,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:34:42,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:42,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:34:43,312 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-12-31 19:34:43,804 WARN L181 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 16 [2018-12-31 19:34:43,847 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:34:43,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:34:43,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 19:34:43,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 19:34:43,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 19:34:43,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 19:34:43,849 INFO L87 Difference]: Start difference. First operand 5863 states and 13048 transitions. Second operand 6 states. [2018-12-31 19:34:44,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:34:44,210 INFO L93 Difference]: Finished difference Result 6687 states and 14678 transitions. [2018-12-31 19:34:44,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 19:34:44,212 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2018-12-31 19:34:44,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:34:44,222 INFO L225 Difference]: With dead ends: 6687 [2018-12-31 19:34:44,222 INFO L226 Difference]: Without dead ends: 6630 [2018-12-31 19:34:44,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-31 19:34:44,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6630 states. [2018-12-31 19:34:44,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6630 to 5938. [2018-12-31 19:34:44,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5938 states. [2018-12-31 19:34:44,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5938 states to 5938 states and 13074 transitions. [2018-12-31 19:34:44,315 INFO L78 Accepts]: Start accepts. Automaton has 5938 states and 13074 transitions. Word has length 95 [2018-12-31 19:34:44,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:34:44,316 INFO L480 AbstractCegarLoop]: Abstraction has 5938 states and 13074 transitions. [2018-12-31 19:34:44,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 19:34:44,316 INFO L276 IsEmpty]: Start isEmpty. Operand 5938 states and 13074 transitions. [2018-12-31 19:34:44,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 19:34:44,324 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:34:44,325 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:34:44,325 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:34:44,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:34:44,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1692904092, now seen corresponding path program 2 times [2018-12-31 19:34:44,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:34:44,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:34:44,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:44,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:34:44,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:44,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:34:44,559 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:34:44,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:34:44,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 19:34:44,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 19:34:44,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 19:34:44,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-31 19:34:44,560 INFO L87 Difference]: Start difference. First operand 5938 states and 13074 transitions. Second operand 9 states. [2018-12-31 19:34:45,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:34:45,355 INFO L93 Difference]: Finished difference Result 6771 states and 14908 transitions. [2018-12-31 19:34:45,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 19:34:45,356 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2018-12-31 19:34:45,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:34:45,364 INFO L225 Difference]: With dead ends: 6771 [2018-12-31 19:34:45,365 INFO L226 Difference]: Without dead ends: 6771 [2018-12-31 19:34:45,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-12-31 19:34:45,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6771 states. [2018-12-31 19:34:45,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6771 to 6075. [2018-12-31 19:34:45,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6075 states. [2018-12-31 19:34:45,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6075 states to 6075 states and 13385 transitions. [2018-12-31 19:34:45,436 INFO L78 Accepts]: Start accepts. Automaton has 6075 states and 13385 transitions. Word has length 95 [2018-12-31 19:34:45,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:34:45,436 INFO L480 AbstractCegarLoop]: Abstraction has 6075 states and 13385 transitions. [2018-12-31 19:34:45,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 19:34:45,437 INFO L276 IsEmpty]: Start isEmpty. Operand 6075 states and 13385 transitions. [2018-12-31 19:34:45,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 19:34:45,444 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:34:45,444 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:34:45,444 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:34:45,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:34:45,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1904255005, now seen corresponding path program 1 times [2018-12-31 19:34:45,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:34:45,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:34:45,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:45,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 19:34:45,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:45,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:34:45,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:34:45,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:34:45,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 19:34:45,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 19:34:45,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 19:34:45,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-31 19:34:45,639 INFO L87 Difference]: Start difference. First operand 6075 states and 13385 transitions. Second operand 7 states. [2018-12-31 19:34:46,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:34:46,300 INFO L93 Difference]: Finished difference Result 7662 states and 16747 transitions. [2018-12-31 19:34:46,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 19:34:46,302 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-12-31 19:34:46,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:34:46,312 INFO L225 Difference]: With dead ends: 7662 [2018-12-31 19:34:46,312 INFO L226 Difference]: Without dead ends: 7662 [2018-12-31 19:34:46,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-12-31 19:34:46,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7662 states. [2018-12-31 19:34:46,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7662 to 6151. [2018-12-31 19:34:46,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6151 states. [2018-12-31 19:34:46,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6151 states to 6151 states and 13551 transitions. [2018-12-31 19:34:46,397 INFO L78 Accepts]: Start accepts. Automaton has 6151 states and 13551 transitions. Word has length 95 [2018-12-31 19:34:46,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:34:46,397 INFO L480 AbstractCegarLoop]: Abstraction has 6151 states and 13551 transitions. [2018-12-31 19:34:46,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 19:34:46,398 INFO L276 IsEmpty]: Start isEmpty. Operand 6151 states and 13551 transitions. [2018-12-31 19:34:46,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 19:34:46,405 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:34:46,406 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:34:46,406 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:34:46,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:34:46,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1204533149, now seen corresponding path program 2 times [2018-12-31 19:34:46,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:34:46,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:34:46,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:46,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 19:34:46,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:46,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 19:34:46,609 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:34:46,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 19:34:46,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 19:34:46,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 19:34:46,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 19:34:46,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-31 19:34:46,610 INFO L87 Difference]: Start difference. First operand 6151 states and 13551 transitions. Second operand 7 states. [2018-12-31 19:34:46,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 19:34:46,790 INFO L93 Difference]: Finished difference Result 8173 states and 18055 transitions. [2018-12-31 19:34:46,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 19:34:46,791 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-12-31 19:34:46,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 19:34:46,801 INFO L225 Difference]: With dead ends: 8173 [2018-12-31 19:34:46,801 INFO L226 Difference]: Without dead ends: 8173 [2018-12-31 19:34:46,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-31 19:34:46,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8173 states. [2018-12-31 19:34:46,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8173 to 5787. [2018-12-31 19:34:46,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5787 states. [2018-12-31 19:34:46,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5787 states to 5787 states and 12686 transitions. [2018-12-31 19:34:46,875 INFO L78 Accepts]: Start accepts. Automaton has 5787 states and 12686 transitions. Word has length 95 [2018-12-31 19:34:46,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 19:34:46,875 INFO L480 AbstractCegarLoop]: Abstraction has 5787 states and 12686 transitions. [2018-12-31 19:34:46,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 19:34:46,875 INFO L276 IsEmpty]: Start isEmpty. Operand 5787 states and 12686 transitions. [2018-12-31 19:34:46,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 19:34:46,882 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 19:34:46,882 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:34:46,883 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 19:34:46,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 19:34:46,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1415884062, now seen corresponding path program 2 times [2018-12-31 19:34:46,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 19:34:46,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 19:34:46,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:46,885 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 19:34:46,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 19:34:46,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 19:34:46,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 19:34:46,984 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 19:34:47,165 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-31 19:34:47,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 07:34:47 BasicIcfg [2018-12-31 19:34:47,167 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 19:34:47,168 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 19:34:47,168 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 19:34:47,168 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 19:34:47,169 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 07:34:01" (3/4) ... [2018-12-31 19:34:47,174 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 19:34:47,359 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 19:34:47,360 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 19:34:47,361 INFO L168 Benchmark]: Toolchain (without parser) took 48299.19 ms. Allocated memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: 1.8 GB). Free memory was 952.7 MB in the beginning and 2.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 619.5 MB. Max. memory is 11.5 GB. [2018-12-31 19:34:47,361 INFO L168 Benchmark]: CDTParser took 0.49 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:34:47,363 INFO L168 Benchmark]: CACSL2BoogieTranslator took 902.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -151.0 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. [2018-12-31 19:34:47,363 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-12-31 19:34:47,365 INFO L168 Benchmark]: Boogie Preprocessor took 74.36 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 19:34:47,365 INFO L168 Benchmark]: RCFGBuilder took 1211.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 11.5 GB. [2018-12-31 19:34:47,365 INFO L168 Benchmark]: TraceAbstraction took 45816.02 ms. Allocated memory was 1.2 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 549.0 MB. Max. memory is 11.5 GB. [2018-12-31 19:34:47,366 INFO L168 Benchmark]: Witness Printer took 192.10 ms. Allocated memory is still 2.9 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 37.5 MB). Peak memory consumption was 37.5 MB. Max. memory is 11.5 GB. [2018-12-31 19:34:47,370 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.49 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 902.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -151.0 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 96.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 74.36 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1211.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 45816.02 ms. Allocated memory was 1.2 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 549.0 MB. Max. memory is 11.5 GB. * Witness Printer took 192.10 ms. Allocated memory is still 2.9 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 37.5 MB). Peak memory consumption was 37.5 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 t597; 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(&t597, ((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 t598; 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(&t598, ((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, 45.6s OverallTime, 32 OverallIterations, 1 TraceHistogramMax, 23.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8749 SDtfs, 10509 SDslu, 20983 SDs, 0 SdLazy, 9879 SolverSat, 462 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 350 GetRequests, 80 SyntacticMatches, 40 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 8.4s 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.3s AutomataMinimizationTime, 31 MinimizatonAttempts, 83625 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 2344 NumberOfCodeBlocks, 2344 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2218 ConstructedInterpolants, 0 QuantifiedInterpolants, 524701 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...