./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/safe033_power.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/safe033_power.opt_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e04c1867cdf33f0ec1767437f14955c9bee7679a ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 [2019-01-01 00:43:13,498 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 00:43:13,500 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 00:43:13,517 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 00:43:13,518 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 00:43:13,521 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 00:43:13,523 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 00:43:13,525 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 00:43:13,527 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 00:43:13,528 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 00:43:13,529 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 00:43:13,529 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 00:43:13,530 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 00:43:13,531 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 00:43:13,532 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 00:43:13,533 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 00:43:13,534 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 00:43:13,535 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 00:43:13,537 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 00:43:13,539 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 00:43:13,540 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 00:43:13,542 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 00:43:13,544 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 00:43:13,545 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 00:43:13,545 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 00:43:13,546 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 00:43:13,547 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 00:43:13,548 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 00:43:13,549 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 00:43:13,550 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 00:43:13,550 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 00:43:13,551 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 00:43:13,551 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 00:43:13,552 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 00:43:13,553 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 00:43:13,553 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 00:43:13,554 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-01 00:43:13,571 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 00:43:13,572 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 00:43:13,573 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 00:43:13,573 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 00:43:13,573 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 00:43:13,574 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 00:43:13,574 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 00:43:13,574 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 00:43:13,574 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 00:43:13,574 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 00:43:13,576 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-01 00:43:13,576 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 00:43:13,576 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-01 00:43:13,576 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 00:43:13,577 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 00:43:13,577 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 00:43:13,577 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-01 00:43:13,577 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 00:43:13,577 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 00:43:13,577 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 00:43:13,579 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 00:43:13,579 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 00:43:13,579 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 00:43:13,579 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 00:43:13,580 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-01 00:43:13,580 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 00:43:13,580 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 00:43:13,581 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-01 00:43:13,581 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 -> e04c1867cdf33f0ec1767437f14955c9bee7679a [2019-01-01 00:43:13,620 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 00:43:13,636 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 00:43:13,644 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 00:43:13,646 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 00:43:13,646 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 00:43:13,647 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/safe033_power.opt_false-unreach-call.i [2019-01-01 00:43:13,722 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbce23156/d21ef2bdddfa43b2b098a048bea22f9e/FLAGbab0c0b9f [2019-01-01 00:43:14,330 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 00:43:14,331 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/safe033_power.opt_false-unreach-call.i [2019-01-01 00:43:14,365 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbce23156/d21ef2bdddfa43b2b098a048bea22f9e/FLAGbab0c0b9f [2019-01-01 00:43:14,548 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbce23156/d21ef2bdddfa43b2b098a048bea22f9e [2019-01-01 00:43:14,555 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 00:43:14,559 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 00:43:14,560 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 00:43:14,561 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 00:43:14,566 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 00:43:14,568 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 12:43:14" (1/1) ... [2019-01-01 00:43:14,571 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5317c7f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:43:14, skipping insertion in model container [2019-01-01 00:43:14,573 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 12:43:14" (1/1) ... [2019-01-01 00:43:14,583 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 00:43:14,652 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 00:43:15,106 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 00:43:15,122 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 00:43:15,297 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 00:43:15,378 INFO L195 MainTranslator]: Completed translation [2019-01-01 00:43:15,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:43:15 WrapperNode [2019-01-01 00:43:15,378 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 00:43:15,380 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 00:43:15,380 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 00:43:15,380 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 00:43:15,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:43:15" (1/1) ... [2019-01-01 00:43:15,413 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:43:15" (1/1) ... [2019-01-01 00:43:15,449 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 00:43:15,449 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 00:43:15,450 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 00:43:15,450 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 00:43:15,463 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:43:15" (1/1) ... [2019-01-01 00:43:15,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:43:15" (1/1) ... [2019-01-01 00:43:15,469 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:43:15" (1/1) ... [2019-01-01 00:43:15,471 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:43:15" (1/1) ... [2019-01-01 00:43:15,482 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:43:15" (1/1) ... [2019-01-01 00:43:15,487 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:43:15" (1/1) ... [2019-01-01 00:43:15,492 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:43:15" (1/1) ... [2019-01-01 00:43:15,500 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 00:43:15,502 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 00:43:15,502 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 00:43:15,503 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 00:43:15,504 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:43:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 00:43:15,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 00:43:15,571 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-01 00:43:15,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 00:43:15,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 00:43:15,571 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-01 00:43:15,572 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-01 00:43:15,572 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-01 00:43:15,573 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-01 00:43:15,573 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-01 00:43:15,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 00:43:15,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 00:43:15,576 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-01 00:43:17,040 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 00:43:17,040 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-01 00:43:17,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 12:43:17 BoogieIcfgContainer [2019-01-01 00:43:17,041 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 00:43:17,042 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 00:43:17,042 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 00:43:17,046 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 00:43:17,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 12:43:14" (1/3) ... [2019-01-01 00:43:17,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6828d75f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 12:43:17, skipping insertion in model container [2019-01-01 00:43:17,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:43:15" (2/3) ... [2019-01-01 00:43:17,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6828d75f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 12:43:17, skipping insertion in model container [2019-01-01 00:43:17,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 12:43:17" (3/3) ... [2019-01-01 00:43:17,050 INFO L112 eAbstractionObserver]: Analyzing ICFG safe033_power.opt_false-unreach-call.i [2019-01-01 00:43:17,107 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,107 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,107 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,107 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,108 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,108 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,108 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,108 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,108 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,109 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,109 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,109 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,109 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,109 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,110 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,110 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,110 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,110 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,111 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,111 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,111 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,111 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,111 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,112 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,112 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,112 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,112 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,112 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,113 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,113 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,113 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,113 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,113 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,113 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,114 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,114 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,115 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,115 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,115 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,115 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,115 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,116 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,116 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,116 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,116 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,116 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,117 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,117 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,117 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,117 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,117 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,118 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,118 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,118 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,118 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,118 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,119 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,119 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,119 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,119 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,120 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,120 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,120 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,120 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,120 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,121 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,121 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,121 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,121 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,122 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,122 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,122 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,122 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,122 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,123 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,123 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,123 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,123 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,123 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,124 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,124 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,124 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,124 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,125 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,125 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,125 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,125 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,125 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,126 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,126 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,126 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,126 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,126 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,127 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,127 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,127 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,127 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,127 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,128 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,128 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,128 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,129 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,129 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,129 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,129 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,130 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,130 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,130 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,130 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,130 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,131 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,131 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,131 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,131 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,132 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,132 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,132 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,132 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,132 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,133 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,133 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,133 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,133 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,133 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,134 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,134 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,134 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,134 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,135 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,135 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,135 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,135 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,135 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,135 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,136 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,136 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:17,166 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-01 00:43:17,166 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 00:43:17,177 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-01 00:43:17,196 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-01 00:43:17,223 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 00:43:17,224 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 00:43:17,224 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-01 00:43:17,224 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 00:43:17,224 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 00:43:17,225 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 00:43:17,225 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 00:43:17,225 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 00:43:17,225 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 00:43:17,239 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 129places, 161 transitions [2019-01-01 00:43:19,501 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27853 states. [2019-01-01 00:43:19,503 INFO L276 IsEmpty]: Start isEmpty. Operand 27853 states. [2019-01-01 00:43:19,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-01 00:43:19,515 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:43:19,516 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:43:19,518 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:43:19,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:43:19,525 INFO L82 PathProgramCache]: Analyzing trace with hash -743892383, now seen corresponding path program 1 times [2019-01-01 00:43:19,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:43:19,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:43:19,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:19,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:43:19,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:19,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:43:19,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:43:19,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:43:19,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:43:19,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:43:19,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:43:19,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:43:19,901 INFO L87 Difference]: Start difference. First operand 27853 states. Second operand 4 states. [2019-01-01 00:43:20,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:43:20,949 INFO L93 Difference]: Finished difference Result 47765 states and 183116 transitions. [2019-01-01 00:43:20,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 00:43:20,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-01-01 00:43:20,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:43:21,299 INFO L225 Difference]: With dead ends: 47765 [2019-01-01 00:43:21,300 INFO L226 Difference]: Without dead ends: 34605 [2019-01-01 00:43:21,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:43:21,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34605 states. [2019-01-01 00:43:22,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34605 to 21753. [2019-01-01 00:43:22,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21753 states. [2019-01-01 00:43:22,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21753 states to 21753 states and 83438 transitions. [2019-01-01 00:43:22,947 INFO L78 Accepts]: Start accepts. Automaton has 21753 states and 83438 transitions. Word has length 36 [2019-01-01 00:43:22,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:43:22,951 INFO L480 AbstractCegarLoop]: Abstraction has 21753 states and 83438 transitions. [2019-01-01 00:43:22,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:43:22,951 INFO L276 IsEmpty]: Start isEmpty. Operand 21753 states and 83438 transitions. [2019-01-01 00:43:22,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-01 00:43:22,969 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:43:22,969 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:43:22,969 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:43:22,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:43:22,970 INFO L82 PathProgramCache]: Analyzing trace with hash 243022970, now seen corresponding path program 1 times [2019-01-01 00:43:22,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:43:22,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:43:22,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:22,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:43:22,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:23,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:43:23,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:43:23,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:43:23,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:43:23,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:43:23,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:43:23,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:43:23,173 INFO L87 Difference]: Start difference. First operand 21753 states and 83438 transitions. Second operand 4 states. [2019-01-01 00:43:23,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:43:23,507 INFO L93 Difference]: Finished difference Result 7167 states and 23623 transitions. [2019-01-01 00:43:23,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 00:43:23,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-01-01 00:43:23,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:43:23,536 INFO L225 Difference]: With dead ends: 7167 [2019-01-01 00:43:23,536 INFO L226 Difference]: Without dead ends: 6321 [2019-01-01 00:43:23,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:43:23,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6321 states. [2019-01-01 00:43:23,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6321 to 6321. [2019-01-01 00:43:23,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6321 states. [2019-01-01 00:43:23,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6321 states to 6321 states and 20695 transitions. [2019-01-01 00:43:23,753 INFO L78 Accepts]: Start accepts. Automaton has 6321 states and 20695 transitions. Word has length 44 [2019-01-01 00:43:23,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:43:23,753 INFO L480 AbstractCegarLoop]: Abstraction has 6321 states and 20695 transitions. [2019-01-01 00:43:23,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:43:23,754 INFO L276 IsEmpty]: Start isEmpty. Operand 6321 states and 20695 transitions. [2019-01-01 00:43:23,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-01 00:43:23,757 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:43:23,757 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:43:23,758 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:43:23,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:43:23,758 INFO L82 PathProgramCache]: Analyzing trace with hash -69776966, now seen corresponding path program 1 times [2019-01-01 00:43:23,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:43:23,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:43:23,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:23,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:43:23,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:23,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:43:24,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:43:24,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:43:24,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 00:43:24,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 00:43:24,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 00:43:24,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:43:24,089 INFO L87 Difference]: Start difference. First operand 6321 states and 20695 transitions. Second operand 5 states. [2019-01-01 00:43:25,131 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-01-01 00:43:25,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:43:25,696 INFO L93 Difference]: Finished difference Result 12017 states and 38781 transitions. [2019-01-01 00:43:25,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:43:25,703 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-01-01 00:43:25,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:43:25,746 INFO L225 Difference]: With dead ends: 12017 [2019-01-01 00:43:25,746 INFO L226 Difference]: Without dead ends: 11942 [2019-01-01 00:43:25,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-01 00:43:25,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11942 states. [2019-01-01 00:43:25,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11942 to 8286. [2019-01-01 00:43:25,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8286 states. [2019-01-01 00:43:25,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8286 states to 8286 states and 26548 transitions. [2019-01-01 00:43:25,993 INFO L78 Accepts]: Start accepts. Automaton has 8286 states and 26548 transitions. Word has length 45 [2019-01-01 00:43:25,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:43:25,995 INFO L480 AbstractCegarLoop]: Abstraction has 8286 states and 26548 transitions. [2019-01-01 00:43:25,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 00:43:25,995 INFO L276 IsEmpty]: Start isEmpty. Operand 8286 states and 26548 transitions. [2019-01-01 00:43:25,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-01 00:43:25,998 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:43:25,999 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] [2019-01-01 00:43:25,999 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:43:25,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:43:25,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1748582240, now seen corresponding path program 1 times [2019-01-01 00:43:25,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:43:25,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:43:26,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:26,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:43:26,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:26,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:43:26,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:43:26,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:43:26,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 00:43:26,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 00:43:26,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 00:43:26,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 00:43:26,093 INFO L87 Difference]: Start difference. First operand 8286 states and 26548 transitions. Second operand 3 states. [2019-01-01 00:43:26,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:43:26,302 INFO L93 Difference]: Finished difference Result 10982 states and 34703 transitions. [2019-01-01 00:43:26,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 00:43:26,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-01-01 00:43:26,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:43:26,339 INFO L225 Difference]: With dead ends: 10982 [2019-01-01 00:43:26,340 INFO L226 Difference]: Without dead ends: 10978 [2019-01-01 00:43:26,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 00:43:26,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10978 states. [2019-01-01 00:43:26,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10978 to 8504. [2019-01-01 00:43:26,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8504 states. [2019-01-01 00:43:26,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8504 states to 8504 states and 26984 transitions. [2019-01-01 00:43:26,577 INFO L78 Accepts]: Start accepts. Automaton has 8504 states and 26984 transitions. Word has length 47 [2019-01-01 00:43:26,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:43:26,579 INFO L480 AbstractCegarLoop]: Abstraction has 8504 states and 26984 transitions. [2019-01-01 00:43:26,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 00:43:26,579 INFO L276 IsEmpty]: Start isEmpty. Operand 8504 states and 26984 transitions. [2019-01-01 00:43:26,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-01 00:43:26,583 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:43:26,583 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] [2019-01-01 00:43:26,583 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:43:26,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:43:26,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1993857643, now seen corresponding path program 1 times [2019-01-01 00:43:26,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:43:26,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:43:26,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:26,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:43:26,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:26,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:43:26,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:43:26,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:43:26,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:43:26,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:43:26,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:43:26,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:43:26,849 INFO L87 Difference]: Start difference. First operand 8504 states and 26984 transitions. Second operand 6 states. [2019-01-01 00:43:27,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:43:27,594 INFO L93 Difference]: Finished difference Result 11920 states and 37195 transitions. [2019-01-01 00:43:27,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 00:43:27,595 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-01-01 00:43:27,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:43:27,622 INFO L225 Difference]: With dead ends: 11920 [2019-01-01 00:43:27,622 INFO L226 Difference]: Without dead ends: 11823 [2019-01-01 00:43:27,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-01-01 00:43:27,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11823 states. [2019-01-01 00:43:27,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11823 to 9278. [2019-01-01 00:43:27,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9278 states. [2019-01-01 00:43:28,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9278 states to 9278 states and 29428 transitions. [2019-01-01 00:43:28,203 INFO L78 Accepts]: Start accepts. Automaton has 9278 states and 29428 transitions. Word has length 51 [2019-01-01 00:43:28,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:43:28,204 INFO L480 AbstractCegarLoop]: Abstraction has 9278 states and 29428 transitions. [2019-01-01 00:43:28,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:43:28,204 INFO L276 IsEmpty]: Start isEmpty. Operand 9278 states and 29428 transitions. [2019-01-01 00:43:28,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-01 00:43:28,218 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:43:28,218 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] [2019-01-01 00:43:28,218 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:43:28,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:43:28,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1315887873, now seen corresponding path program 1 times [2019-01-01 00:43:28,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:43:28,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:43:28,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:28,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:43:28,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:28,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:43:28,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:43:28,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:43:28,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 00:43:28,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 00:43:28,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 00:43:28,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:43:28,444 INFO L87 Difference]: Start difference. First operand 9278 states and 29428 transitions. Second operand 5 states. [2019-01-01 00:43:28,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:43:28,625 INFO L93 Difference]: Finished difference Result 2586 states and 6693 transitions. [2019-01-01 00:43:28,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 00:43:28,626 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-01-01 00:43:28,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:43:28,631 INFO L225 Difference]: With dead ends: 2586 [2019-01-01 00:43:28,631 INFO L226 Difference]: Without dead ends: 2138 [2019-01-01 00:43:28,631 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 [2019-01-01 00:43:28,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2138 states. [2019-01-01 00:43:28,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2138 to 2125. [2019-01-01 00:43:28,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2125 states. [2019-01-01 00:43:28,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2125 states to 2125 states and 5339 transitions. [2019-01-01 00:43:28,685 INFO L78 Accepts]: Start accepts. Automaton has 2125 states and 5339 transitions. Word has length 61 [2019-01-01 00:43:28,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:43:28,685 INFO L480 AbstractCegarLoop]: Abstraction has 2125 states and 5339 transitions. [2019-01-01 00:43:28,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 00:43:28,686 INFO L276 IsEmpty]: Start isEmpty. Operand 2125 states and 5339 transitions. [2019-01-01 00:43:28,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-01 00:43:28,702 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:43:28,703 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:43:28,703 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:43:28,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:43:28,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1710407868, now seen corresponding path program 1 times [2019-01-01 00:43:28,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:43:28,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:43:28,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:28,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:43:28,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:28,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:43:29,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:43:29,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:43:29,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:43:29,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:43:29,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:43:29,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:43:29,010 INFO L87 Difference]: Start difference. First operand 2125 states and 5339 transitions. Second operand 4 states. [2019-01-01 00:43:29,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:43:29,437 INFO L93 Difference]: Finished difference Result 2907 states and 7134 transitions. [2019-01-01 00:43:29,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 00:43:29,438 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-01-01 00:43:29,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:43:29,442 INFO L225 Difference]: With dead ends: 2907 [2019-01-01 00:43:29,443 INFO L226 Difference]: Without dead ends: 2907 [2019-01-01 00:43:29,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:43:29,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2907 states. [2019-01-01 00:43:29,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2907 to 2488. [2019-01-01 00:43:29,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2488 states. [2019-01-01 00:43:29,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2488 states to 2488 states and 6155 transitions. [2019-01-01 00:43:29,490 INFO L78 Accepts]: Start accepts. Automaton has 2488 states and 6155 transitions. Word has length 80 [2019-01-01 00:43:29,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:43:29,490 INFO L480 AbstractCegarLoop]: Abstraction has 2488 states and 6155 transitions. [2019-01-01 00:43:29,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:43:29,490 INFO L276 IsEmpty]: Start isEmpty. Operand 2488 states and 6155 transitions. [2019-01-01 00:43:29,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-01 00:43:29,498 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:43:29,499 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:43:29,499 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:43:29,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:43:29,499 INFO L82 PathProgramCache]: Analyzing trace with hash -366801475, now seen corresponding path program 1 times [2019-01-01 00:43:29,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:43:29,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:43:29,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:29,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:43:29,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:29,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:43:30,034 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2019-01-01 00:43:30,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:43:30,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:43:30,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:43:30,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:43:30,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:43:30,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:43:30,044 INFO L87 Difference]: Start difference. First operand 2488 states and 6155 transitions. Second operand 6 states. [2019-01-01 00:43:30,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:43:30,876 INFO L93 Difference]: Finished difference Result 2571 states and 6195 transitions. [2019-01-01 00:43:30,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 00:43:30,878 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-01-01 00:43:30,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:43:30,882 INFO L225 Difference]: With dead ends: 2571 [2019-01-01 00:43:30,882 INFO L226 Difference]: Without dead ends: 2571 [2019-01-01 00:43:30,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-01 00:43:30,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2019-01-01 00:43:30,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2339. [2019-01-01 00:43:30,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2339 states. [2019-01-01 00:43:30,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2339 states to 2339 states and 5602 transitions. [2019-01-01 00:43:30,917 INFO L78 Accepts]: Start accepts. Automaton has 2339 states and 5602 transitions. Word has length 80 [2019-01-01 00:43:30,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:43:30,917 INFO L480 AbstractCegarLoop]: Abstraction has 2339 states and 5602 transitions. [2019-01-01 00:43:30,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:43:30,917 INFO L276 IsEmpty]: Start isEmpty. Operand 2339 states and 5602 transitions. [2019-01-01 00:43:30,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-01 00:43:30,924 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:43:30,924 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:43:30,924 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:43:30,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:43:30,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1817662385, now seen corresponding path program 1 times [2019-01-01 00:43:30,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:43:30,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:43:30,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:30,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:43:30,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:30,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:43:31,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:43:31,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:43:31,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:43:31,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:43:31,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:43:31,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:43:31,355 INFO L87 Difference]: Start difference. First operand 2339 states and 5602 transitions. Second operand 6 states. [2019-01-01 00:43:32,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:43:32,134 INFO L93 Difference]: Finished difference Result 3002 states and 7052 transitions. [2019-01-01 00:43:32,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:43:32,135 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-01-01 00:43:32,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:43:32,140 INFO L225 Difference]: With dead ends: 3002 [2019-01-01 00:43:32,140 INFO L226 Difference]: Without dead ends: 2927 [2019-01-01 00:43:32,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:43:32,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2927 states. [2019-01-01 00:43:32,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2927 to 2682. [2019-01-01 00:43:32,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2682 states. [2019-01-01 00:43:32,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2682 states to 2682 states and 6364 transitions. [2019-01-01 00:43:32,185 INFO L78 Accepts]: Start accepts. Automaton has 2682 states and 6364 transitions. Word has length 80 [2019-01-01 00:43:32,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:43:32,185 INFO L480 AbstractCegarLoop]: Abstraction has 2682 states and 6364 transitions. [2019-01-01 00:43:32,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:43:32,186 INFO L276 IsEmpty]: Start isEmpty. Operand 2682 states and 6364 transitions. [2019-01-01 00:43:32,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-01 00:43:32,193 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:43:32,193 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:43:32,193 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:43:32,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:43:32,194 INFO L82 PathProgramCache]: Analyzing trace with hash -130354882, now seen corresponding path program 2 times [2019-01-01 00:43:32,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:43:32,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:43:32,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:32,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:43:32,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:32,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:43:32,402 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-01 00:43:32,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:43:32,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:43:32,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 00:43:32,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 00:43:32,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 00:43:32,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:43:32,577 INFO L87 Difference]: Start difference. First operand 2682 states and 6364 transitions. Second operand 7 states. [2019-01-01 00:43:33,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:43:33,412 INFO L93 Difference]: Finished difference Result 3229 states and 7678 transitions. [2019-01-01 00:43:33,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:43:33,413 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 80 [2019-01-01 00:43:33,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:43:33,419 INFO L225 Difference]: With dead ends: 3229 [2019-01-01 00:43:33,419 INFO L226 Difference]: Without dead ends: 3229 [2019-01-01 00:43:33,420 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 [2019-01-01 00:43:33,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3229 states. [2019-01-01 00:43:33,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3229 to 2712. [2019-01-01 00:43:33,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2712 states. [2019-01-01 00:43:33,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2712 states to 2712 states and 6470 transitions. [2019-01-01 00:43:33,458 INFO L78 Accepts]: Start accepts. Automaton has 2712 states and 6470 transitions. Word has length 80 [2019-01-01 00:43:33,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:43:33,458 INFO L480 AbstractCegarLoop]: Abstraction has 2712 states and 6470 transitions. [2019-01-01 00:43:33,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 00:43:33,458 INFO L276 IsEmpty]: Start isEmpty. Operand 2712 states and 6470 transitions. [2019-01-01 00:43:33,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-01 00:43:33,464 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:43:33,464 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:43:33,465 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:43:33,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:43:33,465 INFO L82 PathProgramCache]: Analyzing trace with hash 467201070, now seen corresponding path program 1 times [2019-01-01 00:43:33,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:43:33,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:43:33,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:33,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 00:43:33,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:33,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:43:33,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:43:33,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:43:33,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:43:33,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:43:33,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:43:33,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:43:33,768 INFO L87 Difference]: Start difference. First operand 2712 states and 6470 transitions. Second operand 6 states. [2019-01-01 00:43:34,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:43:34,168 INFO L93 Difference]: Finished difference Result 3109 states and 7177 transitions. [2019-01-01 00:43:34,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 00:43:34,169 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-01-01 00:43:34,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:43:34,173 INFO L225 Difference]: With dead ends: 3109 [2019-01-01 00:43:34,174 INFO L226 Difference]: Without dead ends: 3109 [2019-01-01 00:43:34,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-01-01 00:43:34,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3109 states. [2019-01-01 00:43:34,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3109 to 2796. [2019-01-01 00:43:34,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2796 states. [2019-01-01 00:43:34,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2796 states to 2796 states and 6505 transitions. [2019-01-01 00:43:34,210 INFO L78 Accepts]: Start accepts. Automaton has 2796 states and 6505 transitions. Word has length 80 [2019-01-01 00:43:34,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:43:34,210 INFO L480 AbstractCegarLoop]: Abstraction has 2796 states and 6505 transitions. [2019-01-01 00:43:34,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:43:34,210 INFO L276 IsEmpty]: Start isEmpty. Operand 2796 states and 6505 transitions. [2019-01-01 00:43:34,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-01 00:43:34,216 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:43:34,216 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:43:34,216 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:43:34,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:43:34,216 INFO L82 PathProgramCache]: Analyzing trace with hash 212464525, now seen corresponding path program 1 times [2019-01-01 00:43:34,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:43:34,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:43:34,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:34,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:43:34,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:34,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:43:34,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:43:34,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:43:34,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:43:34,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:43:34,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:43:34,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:43:34,456 INFO L87 Difference]: Start difference. First operand 2796 states and 6505 transitions. Second operand 4 states. [2019-01-01 00:43:34,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:43:34,768 INFO L93 Difference]: Finished difference Result 3004 states and 7041 transitions. [2019-01-01 00:43:34,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 00:43:34,770 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-01-01 00:43:34,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:43:34,774 INFO L225 Difference]: With dead ends: 3004 [2019-01-01 00:43:34,774 INFO L226 Difference]: Without dead ends: 3004 [2019-01-01 00:43:34,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:43:34,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3004 states. [2019-01-01 00:43:34,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3004 to 2860. [2019-01-01 00:43:34,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2860 states. [2019-01-01 00:43:34,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2860 states to 2860 states and 6681 transitions. [2019-01-01 00:43:34,822 INFO L78 Accepts]: Start accepts. Automaton has 2860 states and 6681 transitions. Word has length 80 [2019-01-01 00:43:34,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:43:34,823 INFO L480 AbstractCegarLoop]: Abstraction has 2860 states and 6681 transitions. [2019-01-01 00:43:34,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:43:34,823 INFO L276 IsEmpty]: Start isEmpty. Operand 2860 states and 6681 transitions. [2019-01-01 00:43:34,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-01 00:43:34,829 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:43:34,829 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:43:34,829 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:43:34,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:43:34,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1594989938, now seen corresponding path program 1 times [2019-01-01 00:43:34,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:43:34,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:43:34,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:34,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:43:34,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:34,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:43:35,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:43:35,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:43:35,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:43:35,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:43:35,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:43:35,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:43:35,222 INFO L87 Difference]: Start difference. First operand 2860 states and 6681 transitions. Second operand 6 states. [2019-01-01 00:43:35,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:43:35,394 INFO L93 Difference]: Finished difference Result 2812 states and 6449 transitions. [2019-01-01 00:43:35,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 00:43:35,395 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-01-01 00:43:35,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:43:35,399 INFO L225 Difference]: With dead ends: 2812 [2019-01-01 00:43:35,399 INFO L226 Difference]: Without dead ends: 2812 [2019-01-01 00:43:35,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:43:35,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2812 states. [2019-01-01 00:43:35,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2812 to 2541. [2019-01-01 00:43:35,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2541 states. [2019-01-01 00:43:35,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2541 states to 2541 states and 5837 transitions. [2019-01-01 00:43:35,441 INFO L78 Accepts]: Start accepts. Automaton has 2541 states and 5837 transitions. Word has length 80 [2019-01-01 00:43:35,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:43:35,442 INFO L480 AbstractCegarLoop]: Abstraction has 2541 states and 5837 transitions. [2019-01-01 00:43:35,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:43:35,442 INFO L276 IsEmpty]: Start isEmpty. Operand 2541 states and 5837 transitions. [2019-01-01 00:43:35,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-01 00:43:35,447 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:43:35,447 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] [2019-01-01 00:43:35,447 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:43:35,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:43:35,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1562827304, now seen corresponding path program 1 times [2019-01-01 00:43:35,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:43:35,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:43:35,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:35,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:43:35,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:35,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:43:35,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:43:35,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:43:35,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:43:35,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:43:35,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:43:35,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:43:35,763 INFO L87 Difference]: Start difference. First operand 2541 states and 5837 transitions. Second operand 6 states. [2019-01-01 00:43:36,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:43:36,011 INFO L93 Difference]: Finished difference Result 2927 states and 6650 transitions. [2019-01-01 00:43:36,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:43:36,012 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-01-01 00:43:36,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:43:36,016 INFO L225 Difference]: With dead ends: 2927 [2019-01-01 00:43:36,016 INFO L226 Difference]: Without dead ends: 2869 [2019-01-01 00:43:36,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:43:36,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2869 states. [2019-01-01 00:43:36,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2869 to 2244. [2019-01-01 00:43:36,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2244 states. [2019-01-01 00:43:36,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2244 states to 2244 states and 5100 transitions. [2019-01-01 00:43:36,254 INFO L78 Accepts]: Start accepts. Automaton has 2244 states and 5100 transitions. Word has length 82 [2019-01-01 00:43:36,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:43:36,254 INFO L480 AbstractCegarLoop]: Abstraction has 2244 states and 5100 transitions. [2019-01-01 00:43:36,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:43:36,255 INFO L276 IsEmpty]: Start isEmpty. Operand 2244 states and 5100 transitions. [2019-01-01 00:43:36,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-01 00:43:36,258 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:43:36,258 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] [2019-01-01 00:43:36,259 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:43:36,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:43:36,259 INFO L82 PathProgramCache]: Analyzing trace with hash -514382039, now seen corresponding path program 1 times [2019-01-01 00:43:36,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:43:36,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:43:36,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:36,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:43:36,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:36,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:43:36,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:43:36,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:43:36,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 00:43:36,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 00:43:36,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 00:43:36,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:43:36,451 INFO L87 Difference]: Start difference. First operand 2244 states and 5100 transitions. Second operand 5 states. [2019-01-01 00:43:36,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:43:36,488 INFO L93 Difference]: Finished difference Result 2244 states and 5084 transitions. [2019-01-01 00:43:36,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 00:43:36,489 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-01-01 00:43:36,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:43:36,492 INFO L225 Difference]: With dead ends: 2244 [2019-01-01 00:43:36,492 INFO L226 Difference]: Without dead ends: 2244 [2019-01-01 00:43:36,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:43:36,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2244 states. [2019-01-01 00:43:36,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2244 to 2244. [2019-01-01 00:43:36,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2244 states. [2019-01-01 00:43:36,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2244 states to 2244 states and 5084 transitions. [2019-01-01 00:43:36,521 INFO L78 Accepts]: Start accepts. Automaton has 2244 states and 5084 transitions. Word has length 82 [2019-01-01 00:43:36,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:43:36,522 INFO L480 AbstractCegarLoop]: Abstraction has 2244 states and 5084 transitions. [2019-01-01 00:43:36,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 00:43:36,522 INFO L276 IsEmpty]: Start isEmpty. Operand 2244 states and 5084 transitions. [2019-01-01 00:43:36,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-01 00:43:36,527 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:43:36,527 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] [2019-01-01 00:43:36,527 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:43:36,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:43:36,528 INFO L82 PathProgramCache]: Analyzing trace with hash 373121642, now seen corresponding path program 1 times [2019-01-01 00:43:36,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:43:36,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:43:36,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:36,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:43:36,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:36,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:43:36,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:43:36,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:43:36,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 00:43:36,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 00:43:36,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 00:43:36,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:43:36,729 INFO L87 Difference]: Start difference. First operand 2244 states and 5084 transitions. Second operand 7 states. [2019-01-01 00:43:37,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:43:37,645 INFO L93 Difference]: Finished difference Result 3952 states and 9010 transitions. [2019-01-01 00:43:37,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 00:43:37,646 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2019-01-01 00:43:37,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:43:37,649 INFO L225 Difference]: With dead ends: 3952 [2019-01-01 00:43:37,650 INFO L226 Difference]: Without dead ends: 1652 [2019-01-01 00:43:37,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-01-01 00:43:37,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1652 states. [2019-01-01 00:43:37,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1652 to 1652. [2019-01-01 00:43:37,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1652 states. [2019-01-01 00:43:37,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1652 states and 3759 transitions. [2019-01-01 00:43:37,668 INFO L78 Accepts]: Start accepts. Automaton has 1652 states and 3759 transitions. Word has length 82 [2019-01-01 00:43:37,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:43:37,669 INFO L480 AbstractCegarLoop]: Abstraction has 1652 states and 3759 transitions. [2019-01-01 00:43:37,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 00:43:37,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 3759 transitions. [2019-01-01 00:43:37,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-01 00:43:37,672 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:43:37,672 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:43:37,672 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:43:37,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:43:37,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1980467430, now seen corresponding path program 2 times [2019-01-01 00:43:37,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:43:37,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:43:37,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:37,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:43:37,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:37,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 00:43:37,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 00:43:37,760 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-01 00:43:37,946 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-01 00:43:37,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 12:43:37 BasicIcfg [2019-01-01 00:43:37,949 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 00:43:37,950 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 00:43:37,950 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 00:43:37,950 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 00:43:37,953 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 12:43:17" (3/4) ... [2019-01-01 00:43:37,955 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-01 00:43:38,109 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 00:43:38,112 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 00:43:38,113 INFO L168 Benchmark]: Toolchain (without parser) took 23555.85 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 705.7 MB). Free memory was 943.3 MB in the beginning and 1.3 GB in the end (delta: -317.9 MB). Peak memory consumption was 387.8 MB. Max. memory is 11.5 GB. [2019-01-01 00:43:38,114 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 00:43:38,114 INFO L168 Benchmark]: CACSL2BoogieTranslator took 819.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -156.4 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. [2019-01-01 00:43:38,116 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.36 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. [2019-01-01 00:43:38,117 INFO L168 Benchmark]: Boogie Preprocessor took 50.84 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 00:43:38,117 INFO L168 Benchmark]: RCFGBuilder took 1539.09 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.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. [2019-01-01 00:43:38,120 INFO L168 Benchmark]: TraceAbstraction took 20907.29 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 578.3 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -243.6 MB). Peak memory consumption was 334.7 MB. Max. memory is 11.5 GB. [2019-01-01 00:43:38,126 INFO L168 Benchmark]: Witness Printer took 161.83 ms. Allocated memory is still 1.7 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 30.1 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. [2019-01-01 00:43:38,133 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 819.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -156.4 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.36 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 50.84 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 1539.09 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.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 20907.29 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 578.3 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -243.6 MB). Peak memory consumption was 334.7 MB. Max. memory is 11.5 GB. * Witness Printer took 161.83 ms. Allocated memory is still 1.7 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 30.1 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L675] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0] [L676] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L678] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L679] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L680] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L681] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L682] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L683] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L684] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L685] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L686] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L687] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L688] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L689] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L690] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L691] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L692] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L694] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L695] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L696] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L766] -1 pthread_t t2565; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L767] FCALL, FORK -1 pthread_create(&t2565, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L768] -1 pthread_t t2566; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L769] FCALL, FORK -1 pthread_create(&t2566, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L730] 0 x$w_buff1 = x$w_buff0 [L731] 0 x$w_buff0 = 1 [L732] 0 x$w_buff1_used = x$w_buff0_used [L733] 0 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L735] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L736] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L737] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L738] 0 x$r_buff0_thd2 = (_Bool)1 [L741] 0 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L700] 1 y = 2 [L705] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L706] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L707] 1 x$flush_delayed = weak$$choice2 [L708] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L709] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L709] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L710] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L710] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L711] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L711] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L712] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L712] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L713] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L713] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L714] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L714] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L715] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L715] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L716] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L717] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L717] 1 x = x$flush_delayed ? x$mem_tmp : x [L718] 1 x$flush_delayed = (_Bool)0 [L723] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 0 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L745] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L745] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L746] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L746] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L747] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L748] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L748] 0 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L751] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L771] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L776] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L776] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L777] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L777] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L778] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L778] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L779] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L779] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L782] -1 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 197 locations, 3 error locations. UNSAFE Result, 20.7s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 9.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3513 SDtfs, 4229 SDslu, 6399 SDs, 0 SdLazy, 2740 SolverSat, 168 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 38 SyntacticMatches, 8 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27853occurred in iteration=0, 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: 3.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 24306 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 1172 NumberOfCodeBlocks, 1172 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1074 ConstructedInterpolants, 0 QuantifiedInterpolants, 211681 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...