./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix031_rmo.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/mix031_rmo.oepc_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 299cf90b3d63022a669c015dab67fb8f824b1c69 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 20:27:30,037 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 20:27:30,040 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 20:27:30,055 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 20:27:30,055 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 20:27:30,059 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 20:27:30,060 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 20:27:30,063 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 20:27:30,065 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 20:27:30,067 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 20:27:30,069 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 20:27:30,070 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 20:27:30,071 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 20:27:30,072 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 20:27:30,075 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 20:27:30,076 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 20:27:30,078 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 20:27:30,086 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 20:27:30,088 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 20:27:30,094 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 20:27:30,096 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 20:27:30,097 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 20:27:30,101 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 20:27:30,102 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 20:27:30,102 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 20:27:30,103 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 20:27:30,108 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 20:27:30,109 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 20:27:30,110 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 20:27:30,111 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 20:27:30,111 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 20:27:30,113 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 20:27:30,113 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 20:27:30,114 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 20:27:30,114 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 20:27:30,115 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 20:27:30,115 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 20:27:30,130 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 20:27:30,130 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 20:27:30,131 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 20:27:30,131 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 20:27:30,132 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 20:27:30,132 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 20:27:30,132 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 20:27:30,132 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 20:27:30,132 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 20:27:30,133 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 20:27:30,133 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 20:27:30,133 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 20:27:30,133 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 20:27:30,133 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 20:27:30,133 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 20:27:30,134 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 20:27:30,134 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 20:27:30,134 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 20:27:30,134 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 20:27:30,134 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 20:27:30,134 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 20:27:30,135 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 20:27:30,135 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 20:27:30,135 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 20:27:30,135 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 20:27:30,135 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 20:27:30,135 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 20:27:30,136 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 20:27:30,136 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 -> 299cf90b3d63022a669c015dab67fb8f824b1c69 [2018-12-31 20:27:30,184 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 20:27:30,198 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 20:27:30,202 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 20:27:30,204 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 20:27:30,204 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 20:27:30,205 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix031_rmo.oepc_false-unreach-call.i [2018-12-31 20:27:30,272 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f20ad774/4fc583ce843f4233801a20037eae9874/FLAGdd3516c52 [2018-12-31 20:27:30,917 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 20:27:30,918 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix031_rmo.oepc_false-unreach-call.i [2018-12-31 20:27:30,942 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f20ad774/4fc583ce843f4233801a20037eae9874/FLAGdd3516c52 [2018-12-31 20:27:31,232 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f20ad774/4fc583ce843f4233801a20037eae9874 [2018-12-31 20:27:31,236 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 20:27:31,238 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 20:27:31,239 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 20:27:31,242 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 20:27:31,247 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 20:27:31,248 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 08:27:31" (1/1) ... [2018-12-31 20:27:31,252 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@789f670f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:27:31, skipping insertion in model container [2018-12-31 20:27:31,252 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 08:27:31" (1/1) ... [2018-12-31 20:27:31,261 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 20:27:31,330 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 20:27:31,802 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 20:27:31,822 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 20:27:31,988 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 20:27:32,070 INFO L195 MainTranslator]: Completed translation [2018-12-31 20:27:32,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:27:32 WrapperNode [2018-12-31 20:27:32,071 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 20:27:32,072 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 20:27:32,072 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 20:27:32,072 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 20:27:32,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:27:32" (1/1) ... [2018-12-31 20:27:32,122 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:27:32" (1/1) ... [2018-12-31 20:27:32,158 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 20:27:32,160 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 20:27:32,160 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 20:27:32,160 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 20:27:32,170 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:27:32" (1/1) ... [2018-12-31 20:27:32,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:27:32" (1/1) ... [2018-12-31 20:27:32,176 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:27:32" (1/1) ... [2018-12-31 20:27:32,176 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:27:32" (1/1) ... [2018-12-31 20:27:32,189 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:27:32" (1/1) ... [2018-12-31 20:27:32,193 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:27:32" (1/1) ... [2018-12-31 20:27:32,197 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:27:32" (1/1) ... [2018-12-31 20:27:32,205 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 20:27:32,205 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 20:27:32,205 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 20:27:32,205 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 20:27:32,207 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:27:32" (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 20:27:32,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 20:27:32,271 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-31 20:27:32,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 20:27:32,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 20:27:32,272 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-31 20:27:32,273 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-31 20:27:32,273 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-31 20:27:32,273 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-31 20:27:32,273 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-31 20:27:32,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 20:27:32,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 20:27:32,277 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 20:27:33,473 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 20:27:33,473 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-31 20:27:33,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 08:27:33 BoogieIcfgContainer [2018-12-31 20:27:33,474 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 20:27:33,475 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 20:27:33,475 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 20:27:33,479 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 20:27:33,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 08:27:31" (1/3) ... [2018-12-31 20:27:33,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24f131f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 08:27:33, skipping insertion in model container [2018-12-31 20:27:33,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:27:32" (2/3) ... [2018-12-31 20:27:33,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24f131f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 08:27:33, skipping insertion in model container [2018-12-31 20:27:33,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 08:27:33" (3/3) ... [2018-12-31 20:27:33,482 INFO L112 eAbstractionObserver]: Analyzing ICFG mix031_rmo.oepc_false-unreach-call.i [2018-12-31 20:27:33,532 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,533 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,533 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,534 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,534 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,534 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,534 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,535 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,535 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,536 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,537 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,538 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,538 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,539 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,539 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,540 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,540 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,540 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,540 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,540 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,542 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,542 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,543 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,543 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,544 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,549 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,552 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,552 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,552 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,553 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,553 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,553 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,553 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,553 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,554 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,556 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,556 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,556 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,558 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,560 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,561 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,561 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,561 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,562 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,562 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,562 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,562 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,562 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,562 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,564 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,565 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,565 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,565 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,565 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,566 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,566 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,567 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,567 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,567 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,567 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,567 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,570 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,570 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,570 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,571 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,571 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,571 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,571 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,571 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,573 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,573 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,573 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,573 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,574 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,575 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,576 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,577 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,577 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,578 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,578 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,578 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,578 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,578 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,580 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,580 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,580 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,581 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,582 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,582 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,582 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,582 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,582 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,583 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,583 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,585 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,585 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,586 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,586 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,586 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,586 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,587 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,589 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,592 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,592 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,593 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,594 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,597 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,598 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,598 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,598 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,598 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,598 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,600 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,600 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,601 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,601 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,601 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,601 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,602 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,604 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,604 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,605 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,605 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,605 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,605 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,606 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,606 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,606 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,606 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,606 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,609 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,609 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,610 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,610 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,610 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,611 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,611 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,611 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,611 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,611 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,612 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,615 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,615 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,615 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,615 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,617 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,617 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,617 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,618 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,618 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,618 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,618 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,619 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,620 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,620 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,620 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,621 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,621 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,621 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,621 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,621 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,622 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,624 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,624 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:27:33,657 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-31 20:27:33,657 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 20:27:33,676 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 20:27:33,693 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 20:27:33,719 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 20:27:33,720 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 20:27:33,720 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 20:27:33,720 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 20:27:33,720 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 20:27:33,721 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 20:27:33,721 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 20:27:33,721 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 20:27:33,721 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 20:27:33,737 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 146places, 184 transitions [2018-12-31 20:27:36,152 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34810 states. [2018-12-31 20:27:36,155 INFO L276 IsEmpty]: Start isEmpty. Operand 34810 states. [2018-12-31 20:27:36,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-31 20:27:36,163 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:27:36,164 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] [2018-12-31 20:27:36,166 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:27:36,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:27:36,172 INFO L82 PathProgramCache]: Analyzing trace with hash 148401709, now seen corresponding path program 1 times [2018-12-31 20:27:36,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:27:36,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:27:36,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:36,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:27:36,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:36,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:27:36,530 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 20:27:36,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:27:36,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 20:27:36,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 20:27:36,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 20:27:36,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:27:36,559 INFO L87 Difference]: Start difference. First operand 34810 states. Second operand 4 states. [2018-12-31 20:27:37,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:27:37,979 INFO L93 Difference]: Finished difference Result 60794 states and 234497 transitions. [2018-12-31 20:27:37,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 20:27:37,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-12-31 20:27:37,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:27:38,385 INFO L225 Difference]: With dead ends: 60794 [2018-12-31 20:27:38,386 INFO L226 Difference]: Without dead ends: 44274 [2018-12-31 20:27:38,388 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 20:27:38,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44274 states. [2018-12-31 20:27:40,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44274 to 27342. [2018-12-31 20:27:40,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27342 states. [2018-12-31 20:27:40,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27342 states to 27342 states and 105503 transitions. [2018-12-31 20:27:40,148 INFO L78 Accepts]: Start accepts. Automaton has 27342 states and 105503 transitions. Word has length 37 [2018-12-31 20:27:40,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:27:40,149 INFO L480 AbstractCegarLoop]: Abstraction has 27342 states and 105503 transitions. [2018-12-31 20:27:40,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 20:27:40,149 INFO L276 IsEmpty]: Start isEmpty. Operand 27342 states and 105503 transitions. [2018-12-31 20:27:40,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-31 20:27:40,159 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:27:40,159 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:27:40,160 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:27:40,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:27:40,160 INFO L82 PathProgramCache]: Analyzing trace with hash -54930118, now seen corresponding path program 1 times [2018-12-31 20:27:40,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:27:40,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:27:40,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:40,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:27:40,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:40,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:27:40,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:27:40,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:27:40,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 20:27:40,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 20:27:40,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 20:27:40,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:27:40,424 INFO L87 Difference]: Start difference. First operand 27342 states and 105503 transitions. Second operand 5 states. [2018-12-31 20:27:44,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:27:44,142 INFO L93 Difference]: Finished difference Result 64008 states and 235338 transitions. [2018-12-31 20:27:44,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 20:27:44,143 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-12-31 20:27:44,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:27:44,478 INFO L225 Difference]: With dead ends: 64008 [2018-12-31 20:27:44,478 INFO L226 Difference]: Without dead ends: 63456 [2018-12-31 20:27:44,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 20:27:45,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63456 states. [2018-12-31 20:27:46,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63456 to 41424. [2018-12-31 20:27:46,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41424 states. [2018-12-31 20:27:46,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41424 states to 41424 states and 152333 transitions. [2018-12-31 20:27:46,534 INFO L78 Accepts]: Start accepts. Automaton has 41424 states and 152333 transitions. Word has length 49 [2018-12-31 20:27:46,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:27:46,537 INFO L480 AbstractCegarLoop]: Abstraction has 41424 states and 152333 transitions. [2018-12-31 20:27:46,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 20:27:46,537 INFO L276 IsEmpty]: Start isEmpty. Operand 41424 states and 152333 transitions. [2018-12-31 20:27:46,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-31 20:27:46,547 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:27:46,547 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] [2018-12-31 20:27:46,548 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:27:46,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:27:46,548 INFO L82 PathProgramCache]: Analyzing trace with hash -790300171, now seen corresponding path program 1 times [2018-12-31 20:27:46,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:27:46,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:27:46,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:46,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:27:46,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:46,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:27:46,778 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 20:27:46,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:27:46,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:27:46,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:27:46,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:27:46,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:27:46,780 INFO L87 Difference]: Start difference. First operand 41424 states and 152333 transitions. Second operand 6 states. [2018-12-31 20:27:48,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:27:48,245 INFO L93 Difference]: Finished difference Result 52774 states and 191028 transitions. [2018-12-31 20:27:48,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 20:27:48,246 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-12-31 20:27:48,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:27:48,379 INFO L225 Difference]: With dead ends: 52774 [2018-12-31 20:27:48,379 INFO L226 Difference]: Without dead ends: 52262 [2018-12-31 20:27:48,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-31 20:27:48,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52262 states. [2018-12-31 20:27:49,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52262 to 45378. [2018-12-31 20:27:49,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45378 states. [2018-12-31 20:27:49,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45378 states to 45378 states and 166021 transitions. [2018-12-31 20:27:49,558 INFO L78 Accepts]: Start accepts. Automaton has 45378 states and 166021 transitions. Word has length 50 [2018-12-31 20:27:49,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:27:49,559 INFO L480 AbstractCegarLoop]: Abstraction has 45378 states and 166021 transitions. [2018-12-31 20:27:49,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:27:49,559 INFO L276 IsEmpty]: Start isEmpty. Operand 45378 states and 166021 transitions. [2018-12-31 20:27:50,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-31 20:27:50,328 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:27:50,328 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 20:27:50,329 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:27:50,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:27:50,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1702931131, now seen corresponding path program 1 times [2018-12-31 20:27:50,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:27:50,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:27:50,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:50,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:27:50,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:50,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:27:50,406 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 20:27:50,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:27:50,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 20:27:50,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 20:27:50,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 20:27:50,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 20:27:50,408 INFO L87 Difference]: Start difference. First operand 45378 states and 166021 transitions. Second operand 3 states. [2018-12-31 20:27:50,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:27:50,782 INFO L93 Difference]: Finished difference Result 65254 states and 235817 transitions. [2018-12-31 20:27:50,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 20:27:50,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-12-31 20:27:50,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:27:50,991 INFO L225 Difference]: With dead ends: 65254 [2018-12-31 20:27:50,991 INFO L226 Difference]: Without dead ends: 65254 [2018-12-31 20:27:50,992 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 20:27:51,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65254 states. [2018-12-31 20:27:52,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65254 to 50948. [2018-12-31 20:27:52,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50948 states. [2018-12-31 20:27:52,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50948 states to 50948 states and 184328 transitions. [2018-12-31 20:27:52,137 INFO L78 Accepts]: Start accepts. Automaton has 50948 states and 184328 transitions. Word has length 52 [2018-12-31 20:27:52,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:27:52,137 INFO L480 AbstractCegarLoop]: Abstraction has 50948 states and 184328 transitions. [2018-12-31 20:27:52,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 20:27:52,137 INFO L276 IsEmpty]: Start isEmpty. Operand 50948 states and 184328 transitions. [2018-12-31 20:27:52,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-31 20:27:52,156 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:27:52,156 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] [2018-12-31 20:27:52,156 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:27:52,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:27:52,157 INFO L82 PathProgramCache]: Analyzing trace with hash -190326020, now seen corresponding path program 1 times [2018-12-31 20:27:52,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:27:52,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:27:52,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:52,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:27:52,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:52,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:27:52,657 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 10 [2018-12-31 20:27:52,674 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 20:27:52,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:27:52,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:27:52,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:27:52,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:27:52,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:27:52,677 INFO L87 Difference]: Start difference. First operand 50948 states and 184328 transitions. Second operand 6 states. [2018-12-31 20:27:53,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:27:53,962 INFO L93 Difference]: Finished difference Result 67514 states and 242188 transitions. [2018-12-31 20:27:53,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 20:27:53,963 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-12-31 20:27:53,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:27:54,892 INFO L225 Difference]: With dead ends: 67514 [2018-12-31 20:27:54,892 INFO L226 Difference]: Without dead ends: 67514 [2018-12-31 20:27:54,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 20:27:55,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67514 states. [2018-12-31 20:27:56,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67514 to 63439. [2018-12-31 20:27:56,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63439 states. [2018-12-31 20:27:56,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63439 states to 63439 states and 227587 transitions. [2018-12-31 20:27:56,283 INFO L78 Accepts]: Start accepts. Automaton has 63439 states and 227587 transitions. Word has length 56 [2018-12-31 20:27:56,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:27:56,283 INFO L480 AbstractCegarLoop]: Abstraction has 63439 states and 227587 transitions. [2018-12-31 20:27:56,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:27:56,283 INFO L276 IsEmpty]: Start isEmpty. Operand 63439 states and 227587 transitions. [2018-12-31 20:27:56,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-31 20:27:56,302 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:27:56,303 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] [2018-12-31 20:27:56,303 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:27:56,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:27:56,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1987277379, now seen corresponding path program 1 times [2018-12-31 20:27:56,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:27:56,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:27:56,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:56,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:27:56,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:56,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:27:56,540 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 20:27:56,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:27:56,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 20:27:56,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 20:27:56,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 20:27:56,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:27:56,542 INFO L87 Difference]: Start difference. First operand 63439 states and 227587 transitions. Second operand 7 states. [2018-12-31 20:27:58,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:27:58,302 INFO L93 Difference]: Finished difference Result 88531 states and 306204 transitions. [2018-12-31 20:27:58,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 20:27:58,303 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2018-12-31 20:27:58,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:27:59,216 INFO L225 Difference]: With dead ends: 88531 [2018-12-31 20:27:59,216 INFO L226 Difference]: Without dead ends: 88531 [2018-12-31 20:27:59,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-31 20:27:59,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88531 states. [2018-12-31 20:28:00,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88531 to 74884. [2018-12-31 20:28:00,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74884 states. [2018-12-31 20:28:00,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74884 states to 74884 states and 262990 transitions. [2018-12-31 20:28:00,741 INFO L78 Accepts]: Start accepts. Automaton has 74884 states and 262990 transitions. Word has length 56 [2018-12-31 20:28:00,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:00,741 INFO L480 AbstractCegarLoop]: Abstraction has 74884 states and 262990 transitions. [2018-12-31 20:28:00,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 20:28:00,741 INFO L276 IsEmpty]: Start isEmpty. Operand 74884 states and 262990 transitions. [2018-12-31 20:28:00,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-31 20:28:00,756 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:00,756 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] [2018-12-31 20:28:00,757 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:00,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:00,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1099773698, now seen corresponding path program 1 times [2018-12-31 20:28:00,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:00,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:00,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:00,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:00,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:00,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:00,921 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 20:28:00,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:00,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 20:28:00,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 20:28:00,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 20:28:00,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:28:00,923 INFO L87 Difference]: Start difference. First operand 74884 states and 262990 transitions. Second operand 4 states. [2018-12-31 20:28:01,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:01,166 INFO L93 Difference]: Finished difference Result 15378 states and 48829 transitions. [2018-12-31 20:28:01,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 20:28:01,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-12-31 20:28:01,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:01,197 INFO L225 Difference]: With dead ends: 15378 [2018-12-31 20:28:01,198 INFO L226 Difference]: Without dead ends: 13792 [2018-12-31 20:28:01,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:28:01,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13792 states. [2018-12-31 20:28:01,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13792 to 13743. [2018-12-31 20:28:01,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13743 states. [2018-12-31 20:28:01,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13743 states to 13743 states and 43355 transitions. [2018-12-31 20:28:01,417 INFO L78 Accepts]: Start accepts. Automaton has 13743 states and 43355 transitions. Word has length 56 [2018-12-31 20:28:01,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:01,417 INFO L480 AbstractCegarLoop]: Abstraction has 13743 states and 43355 transitions. [2018-12-31 20:28:01,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 20:28:01,417 INFO L276 IsEmpty]: Start isEmpty. Operand 13743 states and 43355 transitions. [2018-12-31 20:28:01,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-31 20:28:01,419 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:01,419 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:28:01,419 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:01,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:01,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1252831162, now seen corresponding path program 1 times [2018-12-31 20:28:01,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:01,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:01,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:01,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:01,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:01,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:01,728 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 20:28:01,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:01,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:28:01,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:28:01,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:28:01,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:28:01,729 INFO L87 Difference]: Start difference. First operand 13743 states and 43355 transitions. Second operand 6 states. [2018-12-31 20:28:02,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:02,379 INFO L93 Difference]: Finished difference Result 19973 states and 62592 transitions. [2018-12-31 20:28:02,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 20:28:02,380 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-12-31 20:28:02,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:02,418 INFO L225 Difference]: With dead ends: 19973 [2018-12-31 20:28:02,419 INFO L226 Difference]: Without dead ends: 19901 [2018-12-31 20:28:02,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-31 20:28:02,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19901 states. [2018-12-31 20:28:02,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19901 to 14317. [2018-12-31 20:28:02,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14317 states. [2018-12-31 20:28:02,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14317 states to 14317 states and 45052 transitions. [2018-12-31 20:28:02,662 INFO L78 Accepts]: Start accepts. Automaton has 14317 states and 45052 transitions. Word has length 56 [2018-12-31 20:28:02,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:02,663 INFO L480 AbstractCegarLoop]: Abstraction has 14317 states and 45052 transitions. [2018-12-31 20:28:02,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:28:02,663 INFO L276 IsEmpty]: Start isEmpty. Operand 14317 states and 45052 transitions. [2018-12-31 20:28:02,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-31 20:28:02,668 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:02,668 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 20:28:02,669 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:02,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:02,669 INFO L82 PathProgramCache]: Analyzing trace with hash -575191646, now seen corresponding path program 1 times [2018-12-31 20:28:02,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:02,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:02,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:02,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:02,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:02,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:02,873 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 20:28:02,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:02,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 20:28:02,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 20:28:02,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 20:28:02,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:28:02,875 INFO L87 Difference]: Start difference. First operand 14317 states and 45052 transitions. Second operand 4 states. [2018-12-31 20:28:03,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:03,119 INFO L93 Difference]: Finished difference Result 16620 states and 52380 transitions. [2018-12-31 20:28:03,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 20:28:03,120 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-31 20:28:03,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:03,155 INFO L225 Difference]: With dead ends: 16620 [2018-12-31 20:28:03,155 INFO L226 Difference]: Without dead ends: 16620 [2018-12-31 20:28:03,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:28:03,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16620 states. [2018-12-31 20:28:03,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16620 to 15137. [2018-12-31 20:28:03,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15137 states. [2018-12-31 20:28:03,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15137 states to 15137 states and 47642 transitions. [2018-12-31 20:28:03,448 INFO L78 Accepts]: Start accepts. Automaton has 15137 states and 47642 transitions. Word has length 64 [2018-12-31 20:28:03,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:03,448 INFO L480 AbstractCegarLoop]: Abstraction has 15137 states and 47642 transitions. [2018-12-31 20:28:03,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 20:28:03,448 INFO L276 IsEmpty]: Start isEmpty. Operand 15137 states and 47642 transitions. [2018-12-31 20:28:03,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-31 20:28:03,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:03,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:28:03,454 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:03,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:03,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1167618689, now seen corresponding path program 1 times [2018-12-31 20:28:03,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:03,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:03,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:03,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:03,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:03,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:03,710 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 20:28:03,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:03,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 20:28:03,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 20:28:03,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 20:28:03,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-31 20:28:03,711 INFO L87 Difference]: Start difference. First operand 15137 states and 47642 transitions. Second operand 8 states. [2018-12-31 20:28:04,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:04,632 INFO L93 Difference]: Finished difference Result 19827 states and 61331 transitions. [2018-12-31 20:28:04,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 20:28:04,633 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2018-12-31 20:28:04,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:04,671 INFO L225 Difference]: With dead ends: 19827 [2018-12-31 20:28:04,671 INFO L226 Difference]: Without dead ends: 19756 [2018-12-31 20:28:04,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-12-31 20:28:04,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19756 states. [2018-12-31 20:28:04,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19756 to 17415. [2018-12-31 20:28:04,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17415 states. [2018-12-31 20:28:04,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17415 states to 17415 states and 54316 transitions. [2018-12-31 20:28:04,942 INFO L78 Accepts]: Start accepts. Automaton has 17415 states and 54316 transitions. Word has length 64 [2018-12-31 20:28:04,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:04,943 INFO L480 AbstractCegarLoop]: Abstraction has 17415 states and 54316 transitions. [2018-12-31 20:28:04,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 20:28:04,943 INFO L276 IsEmpty]: Start isEmpty. Operand 17415 states and 54316 transitions. [2018-12-31 20:28:04,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-31 20:28:04,952 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:04,952 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] [2018-12-31 20:28:04,952 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:04,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:04,952 INFO L82 PathProgramCache]: Analyzing trace with hash -677873457, now seen corresponding path program 1 times [2018-12-31 20:28:04,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:04,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:04,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:04,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:04,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:04,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:05,209 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 20:28:05,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:05,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 20:28:05,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 20:28:05,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 20:28:05,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:28:05,213 INFO L87 Difference]: Start difference. First operand 17415 states and 54316 transitions. Second operand 4 states. [2018-12-31 20:28:06,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:06,694 INFO L93 Difference]: Finished difference Result 21359 states and 65805 transitions. [2018-12-31 20:28:06,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 20:28:06,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-12-31 20:28:06,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:06,734 INFO L225 Difference]: With dead ends: 21359 [2018-12-31 20:28:06,734 INFO L226 Difference]: Without dead ends: 21359 [2018-12-31 20:28:06,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:28:06,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21359 states. [2018-12-31 20:28:07,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21359 to 19309. [2018-12-31 20:28:07,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19309 states. [2018-12-31 20:28:07,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19309 states to 19309 states and 59695 transitions. [2018-12-31 20:28:07,053 INFO L78 Accepts]: Start accepts. Automaton has 19309 states and 59695 transitions. Word has length 68 [2018-12-31 20:28:07,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:07,054 INFO L480 AbstractCegarLoop]: Abstraction has 19309 states and 59695 transitions. [2018-12-31 20:28:07,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 20:28:07,054 INFO L276 IsEmpty]: Start isEmpty. Operand 19309 states and 59695 transitions. [2018-12-31 20:28:07,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-31 20:28:07,064 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:07,065 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] [2018-12-31 20:28:07,065 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:07,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:07,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1539884496, now seen corresponding path program 1 times [2018-12-31 20:28:07,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:07,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:07,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:07,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:07,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:07,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:07,187 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 20:28:07,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:07,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 20:28:07,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 20:28:07,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 20:28:07,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 20:28:07,189 INFO L87 Difference]: Start difference. First operand 19309 states and 59695 transitions. Second operand 3 states. [2018-12-31 20:28:07,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:07,514 INFO L93 Difference]: Finished difference Result 19949 states and 61434 transitions. [2018-12-31 20:28:07,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 20:28:07,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-12-31 20:28:07,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:07,558 INFO L225 Difference]: With dead ends: 19949 [2018-12-31 20:28:07,559 INFO L226 Difference]: Without dead ends: 19949 [2018-12-31 20:28:07,560 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 20:28:07,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19949 states. [2018-12-31 20:28:07,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19949 to 19649. [2018-12-31 20:28:07,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19649 states. [2018-12-31 20:28:07,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19649 states to 19649 states and 60611 transitions. [2018-12-31 20:28:07,859 INFO L78 Accepts]: Start accepts. Automaton has 19649 states and 60611 transitions. Word has length 68 [2018-12-31 20:28:07,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:07,859 INFO L480 AbstractCegarLoop]: Abstraction has 19649 states and 60611 transitions. [2018-12-31 20:28:07,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 20:28:07,860 INFO L276 IsEmpty]: Start isEmpty. Operand 19649 states and 60611 transitions. [2018-12-31 20:28:07,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-31 20:28:07,872 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:07,872 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] [2018-12-31 20:28:07,872 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:07,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:07,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1412859306, now seen corresponding path program 1 times [2018-12-31 20:28:07,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:07,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:07,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:07,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:07,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:07,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:08,015 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 20:28:08,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:08,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:28:08,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:28:08,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:28:08,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:28:08,016 INFO L87 Difference]: Start difference. First operand 19649 states and 60611 transitions. Second operand 6 states. [2018-12-31 20:28:09,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:09,393 INFO L93 Difference]: Finished difference Result 23817 states and 72329 transitions. [2018-12-31 20:28:09,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 20:28:09,394 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2018-12-31 20:28:09,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:09,437 INFO L225 Difference]: With dead ends: 23817 [2018-12-31 20:28:09,437 INFO L226 Difference]: Without dead ends: 23817 [2018-12-31 20:28:09,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:28:09,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23817 states. [2018-12-31 20:28:09,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23817 to 22477. [2018-12-31 20:28:09,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22477 states. [2018-12-31 20:28:09,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22477 states to 22477 states and 68751 transitions. [2018-12-31 20:28:09,779 INFO L78 Accepts]: Start accepts. Automaton has 22477 states and 68751 transitions. Word has length 70 [2018-12-31 20:28:09,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:09,780 INFO L480 AbstractCegarLoop]: Abstraction has 22477 states and 68751 transitions. [2018-12-31 20:28:09,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:28:09,780 INFO L276 IsEmpty]: Start isEmpty. Operand 22477 states and 68751 transitions. [2018-12-31 20:28:09,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-31 20:28:09,793 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:09,793 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] [2018-12-31 20:28:09,793 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:09,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:09,794 INFO L82 PathProgramCache]: Analyzing trace with hash 804898647, now seen corresponding path program 1 times [2018-12-31 20:28:09,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:09,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:09,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:09,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:09,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:09,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:10,176 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 20:28:10,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:10,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 20:28:10,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 20:28:10,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 20:28:10,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:28:10,178 INFO L87 Difference]: Start difference. First operand 22477 states and 68751 transitions. Second operand 5 states. [2018-12-31 20:28:10,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:10,711 INFO L93 Difference]: Finished difference Result 29036 states and 88481 transitions. [2018-12-31 20:28:10,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 20:28:10,712 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-12-31 20:28:10,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:10,774 INFO L225 Difference]: With dead ends: 29036 [2018-12-31 20:28:10,775 INFO L226 Difference]: Without dead ends: 29036 [2018-12-31 20:28:10,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:28:10,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29036 states. [2018-12-31 20:28:11,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29036 to 26257. [2018-12-31 20:28:11,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26257 states. [2018-12-31 20:28:11,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26257 states to 26257 states and 79967 transitions. [2018-12-31 20:28:11,289 INFO L78 Accepts]: Start accepts. Automaton has 26257 states and 79967 transitions. Word has length 70 [2018-12-31 20:28:11,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:11,290 INFO L480 AbstractCegarLoop]: Abstraction has 26257 states and 79967 transitions. [2018-12-31 20:28:11,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 20:28:11,290 INFO L276 IsEmpty]: Start isEmpty. Operand 26257 states and 79967 transitions. [2018-12-31 20:28:11,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-31 20:28:11,306 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:11,306 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] [2018-12-31 20:28:11,306 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:11,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:11,307 INFO L82 PathProgramCache]: Analyzing trace with hash 294364470, now seen corresponding path program 1 times [2018-12-31 20:28:11,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:11,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:11,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:11,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:11,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:11,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:11,590 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 20:28:11,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:11,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 20:28:11,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 20:28:11,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 20:28:11,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:28:11,592 INFO L87 Difference]: Start difference. First operand 26257 states and 79967 transitions. Second operand 5 states. [2018-12-31 20:28:12,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:12,427 INFO L93 Difference]: Finished difference Result 35347 states and 106727 transitions. [2018-12-31 20:28:12,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 20:28:12,428 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-12-31 20:28:12,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:12,498 INFO L225 Difference]: With dead ends: 35347 [2018-12-31 20:28:12,498 INFO L226 Difference]: Without dead ends: 35347 [2018-12-31 20:28:12,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 20:28:12,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35347 states. [2018-12-31 20:28:12,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35347 to 28671. [2018-12-31 20:28:12,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28671 states. [2018-12-31 20:28:12,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28671 states to 28671 states and 86974 transitions. [2018-12-31 20:28:12,946 INFO L78 Accepts]: Start accepts. Automaton has 28671 states and 86974 transitions. Word has length 70 [2018-12-31 20:28:12,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:12,946 INFO L480 AbstractCegarLoop]: Abstraction has 28671 states and 86974 transitions. [2018-12-31 20:28:12,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 20:28:12,946 INFO L276 IsEmpty]: Start isEmpty. Operand 28671 states and 86974 transitions. [2018-12-31 20:28:12,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-31 20:28:12,959 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:12,959 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] [2018-12-31 20:28:12,960 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:12,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:12,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1513089993, now seen corresponding path program 1 times [2018-12-31 20:28:12,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:12,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:12,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:12,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:12,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:12,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:13,121 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 20:28:13,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:13,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 20:28:13,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 20:28:13,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 20:28:13,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:28:13,123 INFO L87 Difference]: Start difference. First operand 28671 states and 86974 transitions. Second operand 5 states. [2018-12-31 20:28:13,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:13,211 INFO L93 Difference]: Finished difference Result 8611 states and 21473 transitions. [2018-12-31 20:28:13,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 20:28:13,212 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-12-31 20:28:13,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:13,222 INFO L225 Difference]: With dead ends: 8611 [2018-12-31 20:28:13,222 INFO L226 Difference]: Without dead ends: 6783 [2018-12-31 20:28:13,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:28:13,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6783 states. [2018-12-31 20:28:13,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6783 to 5764. [2018-12-31 20:28:13,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5764 states. [2018-12-31 20:28:13,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5764 states to 5764 states and 14037 transitions. [2018-12-31 20:28:13,306 INFO L78 Accepts]: Start accepts. Automaton has 5764 states and 14037 transitions. Word has length 70 [2018-12-31 20:28:13,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:13,307 INFO L480 AbstractCegarLoop]: Abstraction has 5764 states and 14037 transitions. [2018-12-31 20:28:13,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 20:28:13,307 INFO L276 IsEmpty]: Start isEmpty. Operand 5764 states and 14037 transitions. [2018-12-31 20:28:13,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-31 20:28:13,314 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:13,314 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] [2018-12-31 20:28:13,314 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:13,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:13,315 INFO L82 PathProgramCache]: Analyzing trace with hash -173742318, now seen corresponding path program 1 times [2018-12-31 20:28:13,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:13,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:13,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:13,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:13,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:13,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:13,412 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 20:28:13,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:13,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 20:28:13,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 20:28:13,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 20:28:13,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 20:28:13,414 INFO L87 Difference]: Start difference. First operand 5764 states and 14037 transitions. Second operand 3 states. [2018-12-31 20:28:13,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:13,465 INFO L93 Difference]: Finished difference Result 7836 states and 18976 transitions. [2018-12-31 20:28:13,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 20:28:13,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2018-12-31 20:28:13,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:13,479 INFO L225 Difference]: With dead ends: 7836 [2018-12-31 20:28:13,479 INFO L226 Difference]: Without dead ends: 7836 [2018-12-31 20:28:13,479 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 20:28:13,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7836 states. [2018-12-31 20:28:13,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7836 to 5665. [2018-12-31 20:28:13,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5665 states. [2018-12-31 20:28:13,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5665 states to 5665 states and 13522 transitions. [2018-12-31 20:28:13,562 INFO L78 Accepts]: Start accepts. Automaton has 5665 states and 13522 transitions. Word has length 70 [2018-12-31 20:28:13,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:13,562 INFO L480 AbstractCegarLoop]: Abstraction has 5665 states and 13522 transitions. [2018-12-31 20:28:13,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 20:28:13,563 INFO L276 IsEmpty]: Start isEmpty. Operand 5665 states and 13522 transitions. [2018-12-31 20:28:13,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-31 20:28:13,569 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:13,569 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] [2018-12-31 20:28:13,569 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:13,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:13,570 INFO L82 PathProgramCache]: Analyzing trace with hash 536084869, now seen corresponding path program 1 times [2018-12-31 20:28:13,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:13,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:13,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:13,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:13,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:13,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:13,909 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 20:28:13,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:13,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 20:28:13,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 20:28:13,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 20:28:13,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:28:13,911 INFO L87 Difference]: Start difference. First operand 5665 states and 13522 transitions. Second operand 5 states. [2018-12-31 20:28:14,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:14,250 INFO L93 Difference]: Finished difference Result 6725 states and 16031 transitions. [2018-12-31 20:28:14,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 20:28:14,251 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2018-12-31 20:28:14,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:14,260 INFO L225 Difference]: With dead ends: 6725 [2018-12-31 20:28:14,260 INFO L226 Difference]: Without dead ends: 6725 [2018-12-31 20:28:14,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 20:28:14,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6725 states. [2018-12-31 20:28:14,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6725 to 6143. [2018-12-31 20:28:14,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6143 states. [2018-12-31 20:28:14,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6143 states to 6143 states and 14680 transitions. [2018-12-31 20:28:14,335 INFO L78 Accepts]: Start accepts. Automaton has 6143 states and 14680 transitions. Word has length 76 [2018-12-31 20:28:14,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:14,335 INFO L480 AbstractCegarLoop]: Abstraction has 6143 states and 14680 transitions. [2018-12-31 20:28:14,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 20:28:14,336 INFO L276 IsEmpty]: Start isEmpty. Operand 6143 states and 14680 transitions. [2018-12-31 20:28:14,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-31 20:28:14,342 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:14,342 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] [2018-12-31 20:28:14,343 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:14,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:14,343 INFO L82 PathProgramCache]: Analyzing trace with hash -2016072092, now seen corresponding path program 1 times [2018-12-31 20:28:14,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:14,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:14,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:14,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:14,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:14,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:14,557 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 20:28:14,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:14,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 20:28:14,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 20:28:14,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 20:28:14,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:28:14,558 INFO L87 Difference]: Start difference. First operand 6143 states and 14680 transitions. Second operand 7 states. [2018-12-31 20:28:15,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:15,378 INFO L93 Difference]: Finished difference Result 7017 states and 16575 transitions. [2018-12-31 20:28:15,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 20:28:15,379 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2018-12-31 20:28:15,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:15,389 INFO L225 Difference]: With dead ends: 7017 [2018-12-31 20:28:15,390 INFO L226 Difference]: Without dead ends: 6898 [2018-12-31 20:28:15,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-12-31 20:28:15,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6898 states. [2018-12-31 20:28:15,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6898 to 6153. [2018-12-31 20:28:15,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6153 states. [2018-12-31 20:28:15,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6153 states to 6153 states and 14610 transitions. [2018-12-31 20:28:15,491 INFO L78 Accepts]: Start accepts. Automaton has 6153 states and 14610 transitions. Word has length 76 [2018-12-31 20:28:15,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:15,491 INFO L480 AbstractCegarLoop]: Abstraction has 6153 states and 14610 transitions. [2018-12-31 20:28:15,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 20:28:15,491 INFO L276 IsEmpty]: Start isEmpty. Operand 6153 states and 14610 transitions. [2018-12-31 20:28:15,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 20:28:15,500 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:15,500 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:28:15,501 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:15,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:15,501 INFO L82 PathProgramCache]: Analyzing trace with hash -837319995, now seen corresponding path program 1 times [2018-12-31 20:28:15,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:15,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:15,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:15,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:15,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:15,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:15,728 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 20:28:15,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:15,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 20:28:15,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 20:28:15,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 20:28:15,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:28:15,729 INFO L87 Difference]: Start difference. First operand 6153 states and 14610 transitions. Second operand 4 states. [2018-12-31 20:28:16,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:16,851 INFO L93 Difference]: Finished difference Result 9320 states and 22194 transitions. [2018-12-31 20:28:16,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 20:28:16,856 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2018-12-31 20:28:16,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:16,870 INFO L225 Difference]: With dead ends: 9320 [2018-12-31 20:28:16,871 INFO L226 Difference]: Without dead ends: 9320 [2018-12-31 20:28:16,871 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 20:28:16,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9320 states. [2018-12-31 20:28:16,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9320 to 7089. [2018-12-31 20:28:16,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7089 states. [2018-12-31 20:28:16,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7089 states to 7089 states and 16737 transitions. [2018-12-31 20:28:16,979 INFO L78 Accepts]: Start accepts. Automaton has 7089 states and 16737 transitions. Word has length 95 [2018-12-31 20:28:16,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:16,980 INFO L480 AbstractCegarLoop]: Abstraction has 7089 states and 16737 transitions. [2018-12-31 20:28:16,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 20:28:16,980 INFO L276 IsEmpty]: Start isEmpty. Operand 7089 states and 16737 transitions. [2018-12-31 20:28:16,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 20:28:16,989 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:16,989 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 20:28:16,989 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:16,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:16,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1337211388, now seen corresponding path program 1 times [2018-12-31 20:28:16,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:16,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:16,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:16,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:16,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:17,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:17,224 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 20:28:17,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:17,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 20:28:17,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 20:28:17,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 20:28:17,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:28:17,228 INFO L87 Difference]: Start difference. First operand 7089 states and 16737 transitions. Second operand 4 states. [2018-12-31 20:28:18,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:18,092 INFO L93 Difference]: Finished difference Result 7733 states and 18100 transitions. [2018-12-31 20:28:18,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 20:28:18,093 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2018-12-31 20:28:18,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:18,102 INFO L225 Difference]: With dead ends: 7733 [2018-12-31 20:28:18,102 INFO L226 Difference]: Without dead ends: 7733 [2018-12-31 20:28:18,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 20:28:18,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7733 states. [2018-12-31 20:28:18,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7733 to 7201. [2018-12-31 20:28:18,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7201 states. [2018-12-31 20:28:18,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7201 states to 7201 states and 16936 transitions. [2018-12-31 20:28:18,188 INFO L78 Accepts]: Start accepts. Automaton has 7201 states and 16936 transitions. Word has length 95 [2018-12-31 20:28:18,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:18,189 INFO L480 AbstractCegarLoop]: Abstraction has 7201 states and 16936 transitions. [2018-12-31 20:28:18,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 20:28:18,189 INFO L276 IsEmpty]: Start isEmpty. Operand 7201 states and 16936 transitions. [2018-12-31 20:28:18,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-31 20:28:18,198 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:18,198 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:28:18,198 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:18,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:18,198 INFO L82 PathProgramCache]: Analyzing trace with hash 986103563, now seen corresponding path program 1 times [2018-12-31 20:28:18,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:18,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:18,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:18,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:18,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:18,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:18,596 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 20:28:18,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:18,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 20:28:18,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 20:28:18,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 20:28:18,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:28:18,599 INFO L87 Difference]: Start difference. First operand 7201 states and 16936 transitions. Second operand 7 states. [2018-12-31 20:28:19,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:19,428 INFO L93 Difference]: Finished difference Result 8636 states and 20372 transitions. [2018-12-31 20:28:19,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 20:28:19,429 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2018-12-31 20:28:19,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:19,443 INFO L225 Difference]: With dead ends: 8636 [2018-12-31 20:28:19,443 INFO L226 Difference]: Without dead ends: 8636 [2018-12-31 20:28:19,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:28:19,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8636 states. [2018-12-31 20:28:19,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8636 to 7386. [2018-12-31 20:28:19,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7386 states. [2018-12-31 20:28:19,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7386 states to 7386 states and 17500 transitions. [2018-12-31 20:28:19,553 INFO L78 Accepts]: Start accepts. Automaton has 7386 states and 17500 transitions. Word has length 97 [2018-12-31 20:28:19,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:19,554 INFO L480 AbstractCegarLoop]: Abstraction has 7386 states and 17500 transitions. [2018-12-31 20:28:19,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 20:28:19,554 INFO L276 IsEmpty]: Start isEmpty. Operand 7386 states and 17500 transitions. [2018-12-31 20:28:19,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-31 20:28:19,564 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:19,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, 1, 1] [2018-12-31 20:28:19,565 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:19,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:19,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1080620369, now seen corresponding path program 1 times [2018-12-31 20:28:19,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:19,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:19,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:19,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:19,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:19,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:19,820 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 20:28:19,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:19,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 20:28:19,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 20:28:19,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 20:28:19,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:28:19,821 INFO L87 Difference]: Start difference. First operand 7386 states and 17500 transitions. Second operand 5 states. [2018-12-31 20:28:20,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:20,034 INFO L93 Difference]: Finished difference Result 8337 states and 19635 transitions. [2018-12-31 20:28:20,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 20:28:20,035 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2018-12-31 20:28:20,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:20,044 INFO L225 Difference]: With dead ends: 8337 [2018-12-31 20:28:20,044 INFO L226 Difference]: Without dead ends: 8337 [2018-12-31 20:28:20,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 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 20:28:20,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8337 states. [2018-12-31 20:28:20,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8337 to 6413. [2018-12-31 20:28:20,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6413 states. [2018-12-31 20:28:20,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6413 states to 6413 states and 15160 transitions. [2018-12-31 20:28:20,130 INFO L78 Accepts]: Start accepts. Automaton has 6413 states and 15160 transitions. Word has length 97 [2018-12-31 20:28:20,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:20,130 INFO L480 AbstractCegarLoop]: Abstraction has 6413 states and 15160 transitions. [2018-12-31 20:28:20,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 20:28:20,131 INFO L276 IsEmpty]: Start isEmpty. Operand 6413 states and 15160 transitions. [2018-12-31 20:28:20,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-31 20:28:20,140 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:20,140 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:28:20,141 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:20,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:20,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1335356914, now seen corresponding path program 1 times [2018-12-31 20:28:20,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:20,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:20,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:20,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:20,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:20,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:20,275 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 20:28:20,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:20,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 20:28:20,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 20:28:20,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 20:28:20,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:28:20,276 INFO L87 Difference]: Start difference. First operand 6413 states and 15160 transitions. Second operand 5 states. [2018-12-31 20:28:20,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:20,841 INFO L93 Difference]: Finished difference Result 10470 states and 24807 transitions. [2018-12-31 20:28:20,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 20:28:20,842 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2018-12-31 20:28:20,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:20,855 INFO L225 Difference]: With dead ends: 10470 [2018-12-31 20:28:20,856 INFO L226 Difference]: Without dead ends: 10392 [2018-12-31 20:28:20,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 20:28:20,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10392 states. [2018-12-31 20:28:20,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10392 to 7512. [2018-12-31 20:28:20,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7512 states. [2018-12-31 20:28:20,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7512 states to 7512 states and 17828 transitions. [2018-12-31 20:28:20,947 INFO L78 Accepts]: Start accepts. Automaton has 7512 states and 17828 transitions. Word has length 97 [2018-12-31 20:28:20,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:20,948 INFO L480 AbstractCegarLoop]: Abstraction has 7512 states and 17828 transitions. [2018-12-31 20:28:20,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 20:28:20,948 INFO L276 IsEmpty]: Start isEmpty. Operand 7512 states and 17828 transitions. [2018-12-31 20:28:20,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-31 20:28:20,956 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:20,956 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:28:20,957 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:20,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:20,957 INFO L82 PathProgramCache]: Analyzing trace with hash -90592433, now seen corresponding path program 1 times [2018-12-31 20:28:20,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:20,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:20,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:20,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:20,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:20,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:21,992 WARN L181 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 10 [2018-12-31 20:28:22,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:28:22,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:22,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 20:28:22,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 20:28:22,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 20:28:22,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-31 20:28:22,219 INFO L87 Difference]: Start difference. First operand 7512 states and 17828 transitions. Second operand 9 states. [2018-12-31 20:28:22,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:22,986 INFO L93 Difference]: Finished difference Result 10170 states and 24028 transitions. [2018-12-31 20:28:22,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-31 20:28:22,988 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2018-12-31 20:28:22,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:23,002 INFO L225 Difference]: With dead ends: 10170 [2018-12-31 20:28:23,003 INFO L226 Difference]: Without dead ends: 10138 [2018-12-31 20:28:23,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-12-31 20:28:23,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10138 states. [2018-12-31 20:28:23,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10138 to 8990. [2018-12-31 20:28:23,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8990 states. [2018-12-31 20:28:23,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8990 states to 8990 states and 21261 transitions. [2018-12-31 20:28:23,127 INFO L78 Accepts]: Start accepts. Automaton has 8990 states and 21261 transitions. Word has length 97 [2018-12-31 20:28:23,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:23,128 INFO L480 AbstractCegarLoop]: Abstraction has 8990 states and 21261 transitions. [2018-12-31 20:28:23,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 20:28:23,128 INFO L276 IsEmpty]: Start isEmpty. Operand 8990 states and 21261 transitions. [2018-12-31 20:28:23,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-31 20:28:23,139 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:23,140 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:28:23,140 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:23,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:23,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1887543792, now seen corresponding path program 1 times [2018-12-31 20:28:23,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:23,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:23,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:23,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:23,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:23,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:23,427 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 20:28:23,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:23,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 20:28:23,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 20:28:23,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 20:28:23,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-31 20:28:23,430 INFO L87 Difference]: Start difference. First operand 8990 states and 21261 transitions. Second operand 8 states. [2018-12-31 20:28:24,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:24,248 INFO L93 Difference]: Finished difference Result 15259 states and 36630 transitions. [2018-12-31 20:28:24,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-31 20:28:24,249 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2018-12-31 20:28:24,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:24,269 INFO L225 Difference]: With dead ends: 15259 [2018-12-31 20:28:24,269 INFO L226 Difference]: Without dead ends: 15259 [2018-12-31 20:28:24,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2018-12-31 20:28:24,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15259 states. [2018-12-31 20:28:24,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15259 to 9590. [2018-12-31 20:28:24,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9590 states. [2018-12-31 20:28:24,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9590 states to 9590 states and 22862 transitions. [2018-12-31 20:28:24,431 INFO L78 Accepts]: Start accepts. Automaton has 9590 states and 22862 transitions. Word has length 97 [2018-12-31 20:28:24,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:24,431 INFO L480 AbstractCegarLoop]: Abstraction has 9590 states and 22862 transitions. [2018-12-31 20:28:24,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 20:28:24,432 INFO L276 IsEmpty]: Start isEmpty. Operand 9590 states and 22862 transitions. [2018-12-31 20:28:24,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-31 20:28:24,443 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:24,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, 1, 1] [2018-12-31 20:28:24,444 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:24,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:24,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1000040111, now seen corresponding path program 1 times [2018-12-31 20:28:24,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:24,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:24,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:24,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:24,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:24,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:24,778 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 20:28:24,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:24,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-31 20:28:24,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 20:28:24,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 20:28:24,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-12-31 20:28:24,779 INFO L87 Difference]: Start difference. First operand 9590 states and 22862 transitions. Second operand 10 states. [2018-12-31 20:28:25,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:25,727 INFO L93 Difference]: Finished difference Result 12782 states and 30529 transitions. [2018-12-31 20:28:25,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-31 20:28:25,728 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2018-12-31 20:28:25,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:25,745 INFO L225 Difference]: With dead ends: 12782 [2018-12-31 20:28:25,745 INFO L226 Difference]: Without dead ends: 12782 [2018-12-31 20:28:25,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2018-12-31 20:28:25,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12782 states. [2018-12-31 20:28:25,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12782 to 10514. [2018-12-31 20:28:25,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10514 states. [2018-12-31 20:28:25,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10514 states to 10514 states and 24978 transitions. [2018-12-31 20:28:25,919 INFO L78 Accepts]: Start accepts. Automaton has 10514 states and 24978 transitions. Word has length 97 [2018-12-31 20:28:25,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:25,920 INFO L480 AbstractCegarLoop]: Abstraction has 10514 states and 24978 transitions. [2018-12-31 20:28:25,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 20:28:25,920 INFO L276 IsEmpty]: Start isEmpty. Operand 10514 states and 24978 transitions. [2018-12-31 20:28:25,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-31 20:28:25,934 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:25,934 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:28:25,935 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:25,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:25,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1562951633, now seen corresponding path program 1 times [2018-12-31 20:28:25,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:25,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:25,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:25,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:25,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:25,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:26,249 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 20:28:26,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:26,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:28:26,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:28:26,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:28:26,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:28:26,251 INFO L87 Difference]: Start difference. First operand 10514 states and 24978 transitions. Second operand 6 states. [2018-12-31 20:28:26,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:26,401 INFO L93 Difference]: Finished difference Result 10242 states and 24026 transitions. [2018-12-31 20:28:26,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 20:28:26,403 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2018-12-31 20:28:26,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:26,416 INFO L225 Difference]: With dead ends: 10242 [2018-12-31 20:28:26,417 INFO L226 Difference]: Without dead ends: 10242 [2018-12-31 20:28:26,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-31 20:28:26,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10242 states. [2018-12-31 20:28:26,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10242 to 7338. [2018-12-31 20:28:26,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7338 states. [2018-12-31 20:28:26,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7338 states to 7338 states and 17211 transitions. [2018-12-31 20:28:26,525 INFO L78 Accepts]: Start accepts. Automaton has 7338 states and 17211 transitions. Word has length 97 [2018-12-31 20:28:26,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:26,526 INFO L480 AbstractCegarLoop]: Abstraction has 7338 states and 17211 transitions. [2018-12-31 20:28:26,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:28:26,526 INFO L276 IsEmpty]: Start isEmpty. Operand 7338 states and 17211 transitions. [2018-12-31 20:28:26,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-31 20:28:26,534 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:26,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:28:26,534 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:26,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:26,534 INFO L82 PathProgramCache]: Analyzing trace with hash -529897289, now seen corresponding path program 1 times [2018-12-31 20:28:26,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:26,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:26,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:26,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:26,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:26,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:26,653 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 20:28:26,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:26,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 20:28:26,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 20:28:26,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 20:28:26,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:28:26,654 INFO L87 Difference]: Start difference. First operand 7338 states and 17211 transitions. Second operand 5 states. [2018-12-31 20:28:26,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:26,711 INFO L93 Difference]: Finished difference Result 7338 states and 17195 transitions. [2018-12-31 20:28:26,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 20:28:26,712 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2018-12-31 20:28:26,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:26,722 INFO L225 Difference]: With dead ends: 7338 [2018-12-31 20:28:26,722 INFO L226 Difference]: Without dead ends: 7338 [2018-12-31 20:28:26,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:28:26,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7338 states. [2018-12-31 20:28:26,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7338 to 7338. [2018-12-31 20:28:26,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7338 states. [2018-12-31 20:28:26,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7338 states to 7338 states and 17195 transitions. [2018-12-31 20:28:26,801 INFO L78 Accepts]: Start accepts. Automaton has 7338 states and 17195 transitions. Word has length 99 [2018-12-31 20:28:26,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:26,801 INFO L480 AbstractCegarLoop]: Abstraction has 7338 states and 17195 transitions. [2018-12-31 20:28:26,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 20:28:26,801 INFO L276 IsEmpty]: Start isEmpty. Operand 7338 states and 17195 transitions. [2018-12-31 20:28:26,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-31 20:28:26,810 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:26,810 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:28:26,810 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:26,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:26,810 INFO L82 PathProgramCache]: Analyzing trace with hash 357606392, now seen corresponding path program 1 times [2018-12-31 20:28:26,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:26,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:26,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:26,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:26,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:26,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:27,043 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 20:28:27,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:27,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-31 20:28:27,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 20:28:27,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 20:28:27,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-31 20:28:27,045 INFO L87 Difference]: Start difference. First operand 7338 states and 17195 transitions. Second operand 10 states. [2018-12-31 20:28:28,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:28,087 INFO L93 Difference]: Finished difference Result 10504 states and 24507 transitions. [2018-12-31 20:28:28,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 20:28:28,089 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 99 [2018-12-31 20:28:28,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:28,100 INFO L225 Difference]: With dead ends: 10504 [2018-12-31 20:28:28,100 INFO L226 Difference]: Without dead ends: 8056 [2018-12-31 20:28:28,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-12-31 20:28:28,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8056 states. [2018-12-31 20:28:28,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8056 to 7471. [2018-12-31 20:28:28,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7471 states. [2018-12-31 20:28:28,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7471 states to 7471 states and 17468 transitions. [2018-12-31 20:28:28,189 INFO L78 Accepts]: Start accepts. Automaton has 7471 states and 17468 transitions. Word has length 99 [2018-12-31 20:28:28,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:28,189 INFO L480 AbstractCegarLoop]: Abstraction has 7471 states and 17468 transitions. [2018-12-31 20:28:28,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 20:28:28,190 INFO L276 IsEmpty]: Start isEmpty. Operand 7471 states and 17468 transitions. [2018-12-31 20:28:28,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-31 20:28:28,198 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:28,198 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:28:28,199 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:28,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:28,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1323515283, now seen corresponding path program 1 times [2018-12-31 20:28:28,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:28,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:28,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:28,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:28,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:28,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:28,623 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-12-31 20:28:29,175 WARN L181 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 16 [2018-12-31 20:28:29,199 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 20:28:29,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:29,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:28:29,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:28:29,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:28:29,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:28:29,201 INFO L87 Difference]: Start difference. First operand 7471 states and 17468 transitions. Second operand 6 states. [2018-12-31 20:28:29,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:29,464 INFO L93 Difference]: Finished difference Result 8972 states and 20330 transitions. [2018-12-31 20:28:29,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 20:28:29,465 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2018-12-31 20:28:29,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:29,478 INFO L225 Difference]: With dead ends: 8972 [2018-12-31 20:28:29,478 INFO L226 Difference]: Without dead ends: 8939 [2018-12-31 20:28:29,478 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 20:28:29,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8939 states. [2018-12-31 20:28:29,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8939 to 7538. [2018-12-31 20:28:29,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7538 states. [2018-12-31 20:28:29,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7538 states to 7538 states and 17250 transitions. [2018-12-31 20:28:29,567 INFO L78 Accepts]: Start accepts. Automaton has 7538 states and 17250 transitions. Word has length 99 [2018-12-31 20:28:29,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:29,568 INFO L480 AbstractCegarLoop]: Abstraction has 7538 states and 17250 transitions. [2018-12-31 20:28:29,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:28:29,568 INFO L276 IsEmpty]: Start isEmpty. Operand 7538 states and 17250 transitions. [2018-12-31 20:28:29,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-31 20:28:29,577 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:29,577 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:28:29,577 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:29,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:29,578 INFO L82 PathProgramCache]: Analyzing trace with hash -705952148, now seen corresponding path program 1 times [2018-12-31 20:28:29,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:29,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:29,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:29,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:29,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:29,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:29,706 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 20:28:29,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:29,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 20:28:29,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 20:28:29,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 20:28:29,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:28:29,707 INFO L87 Difference]: Start difference. First operand 7538 states and 17250 transitions. Second operand 5 states. [2018-12-31 20:28:29,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:29,964 INFO L93 Difference]: Finished difference Result 8815 states and 20021 transitions. [2018-12-31 20:28:29,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 20:28:29,966 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2018-12-31 20:28:29,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:29,977 INFO L225 Difference]: With dead ends: 8815 [2018-12-31 20:28:29,977 INFO L226 Difference]: Without dead ends: 8733 [2018-12-31 20:28:29,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 20:28:29,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8733 states. [2018-12-31 20:28:30,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8733 to 6949. [2018-12-31 20:28:30,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6949 states. [2018-12-31 20:28:30,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6949 states to 6949 states and 16006 transitions. [2018-12-31 20:28:30,069 INFO L78 Accepts]: Start accepts. Automaton has 6949 states and 16006 transitions. Word has length 99 [2018-12-31 20:28:30,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:30,070 INFO L480 AbstractCegarLoop]: Abstraction has 6949 states and 16006 transitions. [2018-12-31 20:28:30,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 20:28:30,070 INFO L276 IsEmpty]: Start isEmpty. Operand 6949 states and 16006 transitions. [2018-12-31 20:28:30,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-31 20:28:30,078 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:30,078 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:28:30,079 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:30,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:30,079 INFO L82 PathProgramCache]: Analyzing trace with hash -12850451, now seen corresponding path program 2 times [2018-12-31 20:28:30,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:30,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:30,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:30,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:30,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:30,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:30,292 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 20:28:30,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:30,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:28:30,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:28:30,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:28:30,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:28:30,293 INFO L87 Difference]: Start difference. First operand 6949 states and 16006 transitions. Second operand 6 states. [2018-12-31 20:28:30,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:30,509 INFO L93 Difference]: Finished difference Result 7444 states and 17018 transitions. [2018-12-31 20:28:30,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 20:28:30,510 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2018-12-31 20:28:30,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:30,520 INFO L225 Difference]: With dead ends: 7444 [2018-12-31 20:28:30,520 INFO L226 Difference]: Without dead ends: 7444 [2018-12-31 20:28:30,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-31 20:28:30,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7444 states. [2018-12-31 20:28:30,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7444 to 7309. [2018-12-31 20:28:30,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7309 states. [2018-12-31 20:28:30,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7309 states to 7309 states and 16732 transitions. [2018-12-31 20:28:30,604 INFO L78 Accepts]: Start accepts. Automaton has 7309 states and 16732 transitions. Word has length 99 [2018-12-31 20:28:30,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:30,604 INFO L480 AbstractCegarLoop]: Abstraction has 7309 states and 16732 transitions. [2018-12-31 20:28:30,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:28:30,604 INFO L276 IsEmpty]: Start isEmpty. Operand 7309 states and 16732 transitions. [2018-12-31 20:28:30,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-31 20:28:30,613 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:30,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:28:30,613 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:30,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:30,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1772211922, now seen corresponding path program 2 times [2018-12-31 20:28:30,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:30,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:30,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:30,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 20:28:30,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:30,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:30,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:28:30,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:30,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 20:28:30,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 20:28:30,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 20:28:30,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-31 20:28:30,799 INFO L87 Difference]: Start difference. First operand 7309 states and 16732 transitions. Second operand 9 states. [2018-12-31 20:28:30,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:30,996 INFO L93 Difference]: Finished difference Result 10484 states and 23979 transitions. [2018-12-31 20:28:30,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 20:28:30,998 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2018-12-31 20:28:30,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:31,003 INFO L225 Difference]: With dead ends: 10484 [2018-12-31 20:28:31,003 INFO L226 Difference]: Without dead ends: 3386 [2018-12-31 20:28:31,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-12-31 20:28:31,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3386 states. [2018-12-31 20:28:31,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3386 to 3386. [2018-12-31 20:28:31,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3386 states. [2018-12-31 20:28:31,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 3386 states and 7668 transitions. [2018-12-31 20:28:31,036 INFO L78 Accepts]: Start accepts. Automaton has 3386 states and 7668 transitions. Word has length 99 [2018-12-31 20:28:31,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:31,036 INFO L480 AbstractCegarLoop]: Abstraction has 3386 states and 7668 transitions. [2018-12-31 20:28:31,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 20:28:31,036 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 7668 transitions. [2018-12-31 20:28:31,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-31 20:28:31,040 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:31,040 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:28:31,041 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:31,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:31,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1712473986, now seen corresponding path program 3 times [2018-12-31 20:28:31,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:31,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:31,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:31,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 20:28:31,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:31,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:31,261 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-31 20:28:31,351 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 20:28:31,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:31,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-31 20:28:31,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 20:28:31,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 20:28:31,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-31 20:28:31,353 INFO L87 Difference]: Start difference. First operand 3386 states and 7668 transitions. Second operand 11 states. [2018-12-31 20:28:32,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:32,295 INFO L93 Difference]: Finished difference Result 6993 states and 15902 transitions. [2018-12-31 20:28:32,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 20:28:32,297 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 99 [2018-12-31 20:28:32,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:32,303 INFO L225 Difference]: With dead ends: 6993 [2018-12-31 20:28:32,303 INFO L226 Difference]: Without dead ends: 4514 [2018-12-31 20:28:32,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2018-12-31 20:28:32,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4514 states. [2018-12-31 20:28:32,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4514 to 3417. [2018-12-31 20:28:32,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3417 states. [2018-12-31 20:28:32,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3417 states to 3417 states and 7684 transitions. [2018-12-31 20:28:32,339 INFO L78 Accepts]: Start accepts. Automaton has 3417 states and 7684 transitions. Word has length 99 [2018-12-31 20:28:32,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:32,339 INFO L480 AbstractCegarLoop]: Abstraction has 3417 states and 7684 transitions. [2018-12-31 20:28:32,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 20:28:32,339 INFO L276 IsEmpty]: Start isEmpty. Operand 3417 states and 7684 transitions. [2018-12-31 20:28:32,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-31 20:28:32,344 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:32,344 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:28:32,344 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:32,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:32,344 INFO L82 PathProgramCache]: Analyzing trace with hash -109781726, now seen corresponding path program 4 times [2018-12-31 20:28:32,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:32,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:32,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:32,346 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 20:28:32,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:32,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 20:28:32,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 20:28:32,426 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 20:28:32,627 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-31 20:28:32,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 08:28:32 BasicIcfg [2018-12-31 20:28:32,629 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 20:28:32,629 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 20:28:32,630 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 20:28:32,632 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 20:28:32,633 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 08:27:33" (3/4) ... [2018-12-31 20:28:32,638 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 20:28:32,827 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 20:28:32,827 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 20:28:32,830 INFO L168 Benchmark]: Toolchain (without parser) took 61591.43 ms. Allocated memory was 1.0 GB in the beginning and 3.9 GB in the end (delta: 2.9 GB). Free memory was 940.6 MB in the beginning and 2.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-12-31 20:28:32,831 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 20:28:32,832 INFO L168 Benchmark]: CACSL2BoogieTranslator took 833.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -161.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2018-12-31 20:28:32,832 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-31 20:28:32,832 INFO L168 Benchmark]: Boogie Preprocessor took 45.19 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 20:28:32,832 INFO L168 Benchmark]: RCFGBuilder took 1269.17 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: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 11.5 GB. [2018-12-31 20:28:32,836 INFO L168 Benchmark]: TraceAbstraction took 59153.85 ms. Allocated memory was 1.2 GB in the beginning and 3.9 GB in the end (delta: 2.8 GB). Free memory was 1.0 GB in the beginning and 2.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2018-12-31 20:28:32,837 INFO L168 Benchmark]: Witness Printer took 197.51 ms. Allocated memory is still 3.9 GB. Free memory was 2.5 GB in the beginning and 2.5 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-12-31 20:28:32,841 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 833.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -161.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 87.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.19 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 1269.17 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: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 59153.85 ms. Allocated memory was 1.2 GB in the beginning and 3.9 GB in the end (delta: 2.8 GB). Free memory was 1.0 GB in the beginning and 2.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * Witness Printer took 197.51 ms. Allocated memory is still 3.9 GB. Free memory was 2.5 GB in the beginning and 2.5 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L675] -1 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L677] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L679] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L681] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0] [L682] -1 _Bool a$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0] [L683] -1 int a$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0] [L684] -1 _Bool a$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0] [L685] -1 _Bool a$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0] [L686] -1 _Bool a$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0] [L687] -1 _Bool a$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0] [L688] -1 _Bool a$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0] [L689] -1 _Bool a$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0] [L690] -1 _Bool a$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0] [L691] -1 int *a$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}] [L692] -1 int a$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0] [L693] -1 _Bool a$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0] [L694] -1 int a$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0] [L695] -1 _Bool a$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0] [L696] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0] [L697] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0] [L699] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L701] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L703] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L704] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0] [L705] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L790] -1 pthread_t t843; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L791] FCALL, FORK -1 pthread_create(&t843, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L709] 0 a$w_buff1 = a$w_buff0 [L710] 0 a$w_buff0 = 1 [L711] 0 a$w_buff1_used = a$w_buff0_used [L712] 0 a$w_buff0_used = (_Bool)1 [L792] -1 pthread_t t844; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L793] FCALL, FORK -1 pthread_create(&t844, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L714] 0 a$r_buff1_thd0 = a$r_buff0_thd0 [L715] 0 a$r_buff1_thd1 = a$r_buff0_thd1 [L716] 0 a$r_buff1_thd2 = a$r_buff0_thd2 [L717] 0 a$r_buff0_thd1 = (_Bool)1 [L720] 0 x = 1 [L723] 0 __unbuffered_p0_EAX = x [L726] 0 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L729] EXPR 0 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L743] 1 y = 1 [L746] 1 z = 1 [L749] 1 __unbuffered_p1_EAX = z [L752] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L753] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L754] 1 a$flush_delayed = weak$$choice2 [L755] 1 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L756] EXPR 1 !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L729] 0 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L730] EXPR 0 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used VAL [!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L730] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L756] 1 a = !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) [L731] EXPR 0 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L731] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L757] EXPR 1 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L732] EXPR 0 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L732] 0 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L733] EXPR 0 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L733] 0 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L736] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L757] 1 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) [L758] EXPR 1 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L758] 1 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) [L759] EXPR 1 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used))=0, x=1, y=1, z=1] [L759] 1 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) [L760] EXPR 1 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L760] 1 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L761] EXPR 1 weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2))=0, x=1, y=1, z=1] [L761] 1 a$r_buff0_thd2 = weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2)) [L762] EXPR 1 weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L762] 1 a$r_buff1_thd2 = weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L763] 1 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L764] EXPR 1 a$flush_delayed ? a$mem_tmp : a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$flush_delayed ? a$mem_tmp : a=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L764] 1 a = a$flush_delayed ? a$mem_tmp : a [L765] 1 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L768] EXPR 1 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L768] EXPR 1 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L768] EXPR 1 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a)=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L768] 1 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L769] EXPR 1 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L770] EXPR 1 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L771] EXPR 1 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L771] 1 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L772] EXPR 1 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L772] 1 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L795] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L799] EXPR -1 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L799] EXPR -1 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L799] EXPR -1 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L799] -1 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L800] EXPR -1 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L800] -1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L801] EXPR -1 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L801] -1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L802] EXPR -1 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L802] -1 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L803] EXPR -1 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L803] -1 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L806] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 226 locations, 3 error locations. UNSAFE Result, 58.9s OverallTime, 36 OverallIterations, 1 TraceHistogramMax, 30.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9464 SDtfs, 10783 SDslu, 22886 SDs, 0 SdLazy, 9878 SolverSat, 553 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 372 GetRequests, 91 SyntacticMatches, 29 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 10.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74884occurred in iteration=6, 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: 13.8s AutomataMinimizationTime, 35 MinimizatonAttempts, 130803 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 2839 NumberOfCodeBlocks, 2839 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 2705 ConstructedInterpolants, 0 QuantifiedInterpolants, 657624 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...