./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/rfi003_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/rfi003_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 1b218bba3595b49a880dd100e3f3f5391aefd39b .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 22:48:00,619 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 22:48:00,622 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 22:48:00,634 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 22:48:00,635 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 22:48:00,636 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 22:48:00,637 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 22:48:00,639 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 22:48:00,641 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 22:48:00,642 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 22:48:00,644 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 22:48:00,644 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 22:48:00,645 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 22:48:00,647 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 22:48:00,648 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 22:48:00,649 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 22:48:00,650 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 22:48:00,652 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 22:48:00,655 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 22:48:00,657 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 22:48:00,658 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 22:48:00,660 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 22:48:00,663 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 22:48:00,663 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 22:48:00,663 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 22:48:00,664 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 22:48:00,666 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 22:48:00,667 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 22:48:00,668 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 22:48:00,669 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 22:48:00,670 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 22:48:00,671 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 22:48:00,671 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 22:48:00,671 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 22:48:00,672 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 22:48:00,674 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 22:48:00,674 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 22:48:00,704 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 22:48:00,705 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 22:48:00,706 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 22:48:00,706 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 22:48:00,706 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 22:48:00,708 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 22:48:00,708 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 22:48:00,708 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 22:48:00,708 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 22:48:00,709 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 22:48:00,709 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 22:48:00,709 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 22:48:00,709 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 22:48:00,709 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 22:48:00,710 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 22:48:00,711 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 22:48:00,711 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 22:48:00,712 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 22:48:00,712 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 22:48:00,712 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 22:48:00,712 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 22:48:00,712 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 22:48:00,714 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 22:48:00,715 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 22:48:00,716 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 22:48:00,716 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 22:48:00,716 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 22:48:00,716 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 22:48:00,716 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 -> 1b218bba3595b49a880dd100e3f3f5391aefd39b [2018-12-31 22:48:00,763 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 22:48:00,781 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 22:48:00,788 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 22:48:00,790 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 22:48:00,791 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 22:48:00,791 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/rfi003_power.opt_false-unreach-call.i [2018-12-31 22:48:00,861 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59e857555/367f10dd5e1048b1a0bd0ea27dbae4db/FLAG218fe77ce [2018-12-31 22:48:01,375 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 22:48:01,380 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/rfi003_power.opt_false-unreach-call.i [2018-12-31 22:48:01,396 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59e857555/367f10dd5e1048b1a0bd0ea27dbae4db/FLAG218fe77ce [2018-12-31 22:48:01,642 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59e857555/367f10dd5e1048b1a0bd0ea27dbae4db [2018-12-31 22:48:01,647 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 22:48:01,648 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 22:48:01,652 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 22:48:01,652 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 22:48:01,658 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 22:48:01,660 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 10:48:01" (1/1) ... [2018-12-31 22:48:01,663 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12e4e466 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:48:01, skipping insertion in model container [2018-12-31 22:48:01,663 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 10:48:01" (1/1) ... [2018-12-31 22:48:01,674 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 22:48:01,749 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 22:48:02,292 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 22:48:02,316 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 22:48:02,461 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 22:48:02,547 INFO L195 MainTranslator]: Completed translation [2018-12-31 22:48:02,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:48:02 WrapperNode [2018-12-31 22:48:02,548 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 22:48:02,549 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 22:48:02,549 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 22:48:02,549 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 22:48:02,560 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:48:02" (1/1) ... [2018-12-31 22:48:02,585 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:48:02" (1/1) ... [2018-12-31 22:48:02,626 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 22:48:02,629 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 22:48:02,629 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 22:48:02,629 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 22:48:02,645 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:48:02" (1/1) ... [2018-12-31 22:48:02,645 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:48:02" (1/1) ... [2018-12-31 22:48:02,662 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:48:02" (1/1) ... [2018-12-31 22:48:02,663 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:48:02" (1/1) ... [2018-12-31 22:48:02,687 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:48:02" (1/1) ... [2018-12-31 22:48:02,702 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:48:02" (1/1) ... [2018-12-31 22:48:02,708 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:48:02" (1/1) ... [2018-12-31 22:48:02,721 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 22:48:02,721 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 22:48:02,721 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 22:48:02,722 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 22:48:02,723 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:48:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 22:48:02,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 22:48:02,805 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-31 22:48:02,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 22:48:02,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 22:48:02,806 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-31 22:48:02,806 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-31 22:48:02,807 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-31 22:48:02,807 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-31 22:48:02,807 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-31 22:48:02,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 22:48:02,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 22:48:02,811 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-31 22:48:04,209 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 22:48:04,210 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-31 22:48:04,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:48:04 BoogieIcfgContainer [2018-12-31 22:48:04,211 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 22:48:04,212 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 22:48:04,212 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 22:48:04,216 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 22:48:04,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 10:48:01" (1/3) ... [2018-12-31 22:48:04,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@216d054c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 10:48:04, skipping insertion in model container [2018-12-31 22:48:04,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:48:02" (2/3) ... [2018-12-31 22:48:04,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@216d054c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 10:48:04, skipping insertion in model container [2018-12-31 22:48:04,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:48:04" (3/3) ... [2018-12-31 22:48:04,221 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi003_power.opt_false-unreach-call.i [2018-12-31 22:48:04,268 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,269 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,269 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,269 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,269 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,269 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,270 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,270 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,270 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,271 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,272 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,272 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,273 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,273 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,273 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,273 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,275 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,275 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,275 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,275 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,275 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,276 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,277 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,277 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,277 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,277 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,278 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,279 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,279 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,279 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,279 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,279 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,279 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,280 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,280 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,280 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,280 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,280 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,281 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,282 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,283 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,283 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,283 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,283 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,284 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,284 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,284 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,284 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,284 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,284 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,285 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,285 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,285 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,285 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,285 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,285 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,288 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,289 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,289 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,289 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,289 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,289 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,289 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,291 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,291 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,291 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,291 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,291 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,293 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,293 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,293 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,293 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,293 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,294 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,294 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,294 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,294 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,294 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,296 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,296 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,297 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,297 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,298 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,298 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,298 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,298 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,298 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,299 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,299 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,299 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,299 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,300 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,302 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,302 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,302 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,302 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,302 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,303 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,304 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,304 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,304 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,305 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,306 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,306 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,306 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,306 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,307 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,307 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,307 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,307 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,307 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,309 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,310 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,310 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,310 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,310 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,311 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,312 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,312 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,312 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,312 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,313 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,314 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,314 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,314 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,314 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,314 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,315 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,315 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,315 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,315 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,316 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,317 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,318 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,318 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,318 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,350 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-31 22:48:04,350 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 22:48:04,361 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 22:48:04,381 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 22:48:04,411 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 22:48:04,412 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 22:48:04,412 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 22:48:04,412 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 22:48:04,412 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 22:48:04,412 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 22:48:04,412 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 22:48:04,412 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 22:48:04,414 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 22:48:04,428 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 131places, 163 transitions [2018-12-31 22:48:06,279 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27855 states. [2018-12-31 22:48:06,281 INFO L276 IsEmpty]: Start isEmpty. Operand 27855 states. [2018-12-31 22:48:06,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-31 22:48:06,291 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:06,293 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] [2018-12-31 22:48:06,295 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:06,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:06,303 INFO L82 PathProgramCache]: Analyzing trace with hash 71244223, now seen corresponding path program 1 times [2018-12-31 22:48:06,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:06,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:06,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:06,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:06,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:06,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:06,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:06,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:06,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:48:06,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:48:06,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:48:06,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:48:06,779 INFO L87 Difference]: Start difference. First operand 27855 states. Second operand 4 states. [2018-12-31 22:48:07,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:07,783 INFO L93 Difference]: Finished difference Result 47767 states and 183118 transitions. [2018-12-31 22:48:07,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 22:48:07,785 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-12-31 22:48:07,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:08,107 INFO L225 Difference]: With dead ends: 47767 [2018-12-31 22:48:08,108 INFO L226 Difference]: Without dead ends: 34607 [2018-12-31 22:48:08,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:48:08,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34607 states. [2018-12-31 22:48:09,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34607 to 21755. [2018-12-31 22:48:09,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21755 states. [2018-12-31 22:48:09,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21755 states to 21755 states and 83440 transitions. [2018-12-31 22:48:09,654 INFO L78 Accepts]: Start accepts. Automaton has 21755 states and 83440 transitions. Word has length 38 [2018-12-31 22:48:09,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:09,654 INFO L480 AbstractCegarLoop]: Abstraction has 21755 states and 83440 transitions. [2018-12-31 22:48:09,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:48:09,655 INFO L276 IsEmpty]: Start isEmpty. Operand 21755 states and 83440 transitions. [2018-12-31 22:48:09,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-31 22:48:09,667 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:09,667 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:48:09,667 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:09,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:09,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1724990409, now seen corresponding path program 1 times [2018-12-31 22:48:09,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:09,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:09,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:09,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:09,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:09,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:09,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:09,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:09,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:48:09,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:48:09,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:48:09,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:48:09,901 INFO L87 Difference]: Start difference. First operand 21755 states and 83440 transitions. Second operand 5 states. [2018-12-31 22:48:13,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:13,189 INFO L93 Difference]: Finished difference Result 47633 states and 173801 transitions. [2018-12-31 22:48:13,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 22:48:13,190 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-31 22:48:13,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:13,446 INFO L225 Difference]: With dead ends: 47633 [2018-12-31 22:48:13,447 INFO L226 Difference]: Without dead ends: 47065 [2018-12-31 22:48:13,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:48:13,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47065 states. [2018-12-31 22:48:15,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47065 to 31795. [2018-12-31 22:48:15,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31795 states. [2018-12-31 22:48:15,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31795 states to 31795 states and 116818 transitions. [2018-12-31 22:48:15,147 INFO L78 Accepts]: Start accepts. Automaton has 31795 states and 116818 transitions. Word has length 46 [2018-12-31 22:48:15,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:15,149 INFO L480 AbstractCegarLoop]: Abstraction has 31795 states and 116818 transitions. [2018-12-31 22:48:15,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:48:15,149 INFO L276 IsEmpty]: Start isEmpty. Operand 31795 states and 116818 transitions. [2018-12-31 22:48:15,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-31 22:48:15,156 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:15,156 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:48:15,156 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:15,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:15,157 INFO L82 PathProgramCache]: Analyzing trace with hash -2058408648, now seen corresponding path program 1 times [2018-12-31 22:48:15,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:15,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:15,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:15,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:15,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:15,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:15,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:15,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:15,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:48:15,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:48:15,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:48:15,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:48:15,522 INFO L87 Difference]: Start difference. First operand 31795 states and 116818 transitions. Second operand 5 states. [2018-12-31 22:48:16,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:16,531 INFO L93 Difference]: Finished difference Result 63027 states and 229113 transitions. [2018-12-31 22:48:16,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 22:48:16,532 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-31 22:48:16,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:16,748 INFO L225 Difference]: With dead ends: 63027 [2018-12-31 22:48:16,748 INFO L226 Difference]: Without dead ends: 62563 [2018-12-31 22:48:16,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:48:17,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62563 states. [2018-12-31 22:48:18,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62563 to 35363. [2018-12-31 22:48:18,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35363 states. [2018-12-31 22:48:19,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35363 states to 35363 states and 128876 transitions. [2018-12-31 22:48:19,135 INFO L78 Accepts]: Start accepts. Automaton has 35363 states and 128876 transitions. Word has length 47 [2018-12-31 22:48:19,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:19,137 INFO L480 AbstractCegarLoop]: Abstraction has 35363 states and 128876 transitions. [2018-12-31 22:48:19,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:48:19,138 INFO L276 IsEmpty]: Start isEmpty. Operand 35363 states and 128876 transitions. [2018-12-31 22:48:19,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-31 22:48:19,151 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:19,151 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:48:19,151 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:19,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:19,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1703022802, now seen corresponding path program 1 times [2018-12-31 22:48:19,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:19,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:19,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:19,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:19,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:19,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:19,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:19,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:19,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 22:48:19,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 22:48:19,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 22:48:19,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 22:48:19,288 INFO L87 Difference]: Start difference. First operand 35363 states and 128876 transitions. Second operand 3 states. [2018-12-31 22:48:19,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:19,875 INFO L93 Difference]: Finished difference Result 45909 states and 163944 transitions. [2018-12-31 22:48:19,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 22:48:19,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-31 22:48:19,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:20,047 INFO L225 Difference]: With dead ends: 45909 [2018-12-31 22:48:20,047 INFO L226 Difference]: Without dead ends: 45909 [2018-12-31 22:48:20,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 22:48:20,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45909 states. [2018-12-31 22:48:21,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45909 to 40246. [2018-12-31 22:48:21,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40246 states. [2018-12-31 22:48:22,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40246 states to 40246 states and 145214 transitions. [2018-12-31 22:48:22,544 INFO L78 Accepts]: Start accepts. Automaton has 40246 states and 145214 transitions. Word has length 49 [2018-12-31 22:48:22,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:22,544 INFO L480 AbstractCegarLoop]: Abstraction has 40246 states and 145214 transitions. [2018-12-31 22:48:22,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 22:48:22,545 INFO L276 IsEmpty]: Start isEmpty. Operand 40246 states and 145214 transitions. [2018-12-31 22:48:22,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-31 22:48:22,567 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:22,567 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] [2018-12-31 22:48:22,567 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:22,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:22,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1764675695, now seen corresponding path program 1 times [2018-12-31 22:48:22,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:22,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:22,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:22,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:22,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:22,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:22,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:22,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:22,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:48:22,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:48:22,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:48:22,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:48:22,760 INFO L87 Difference]: Start difference. First operand 40246 states and 145214 transitions. Second operand 6 states. [2018-12-31 22:48:23,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:23,847 INFO L93 Difference]: Finished difference Result 70849 states and 252354 transitions. [2018-12-31 22:48:23,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 22:48:23,848 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-31 22:48:23,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:24,048 INFO L225 Difference]: With dead ends: 70849 [2018-12-31 22:48:24,049 INFO L226 Difference]: Without dead ends: 70313 [2018-12-31 22:48:24,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-31 22:48:24,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70313 states. [2018-12-31 22:48:25,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70313 to 40897. [2018-12-31 22:48:25,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40897 states. [2018-12-31 22:48:25,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40897 states to 40897 states and 147667 transitions. [2018-12-31 22:48:25,218 INFO L78 Accepts]: Start accepts. Automaton has 40897 states and 147667 transitions. Word has length 53 [2018-12-31 22:48:25,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:25,219 INFO L480 AbstractCegarLoop]: Abstraction has 40897 states and 147667 transitions. [2018-12-31 22:48:25,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:48:25,219 INFO L276 IsEmpty]: Start isEmpty. Operand 40897 states and 147667 transitions. [2018-12-31 22:48:25,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-31 22:48:25,236 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:25,236 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] [2018-12-31 22:48:25,236 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:25,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:25,237 INFO L82 PathProgramCache]: Analyzing trace with hash -2096426106, now seen corresponding path program 1 times [2018-12-31 22:48:25,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:25,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:25,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:25,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:25,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:25,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:25,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:25,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:25,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:48:25,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:48:25,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:48:25,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:48:25,487 INFO L87 Difference]: Start difference. First operand 40897 states and 147667 transitions. Second operand 6 states. [2018-12-31 22:48:26,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:26,609 INFO L93 Difference]: Finished difference Result 56598 states and 201647 transitions. [2018-12-31 22:48:26,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 22:48:26,610 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-31 22:48:26,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:26,783 INFO L225 Difference]: With dead ends: 56598 [2018-12-31 22:48:26,783 INFO L226 Difference]: Without dead ends: 55459 [2018-12-31 22:48:26,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:48:30,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55459 states. [2018-12-31 22:48:30,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55459 to 51954. [2018-12-31 22:48:30,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51954 states. [2018-12-31 22:48:31,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51954 states to 51954 states and 186006 transitions. [2018-12-31 22:48:31,047 INFO L78 Accepts]: Start accepts. Automaton has 51954 states and 186006 transitions. Word has length 53 [2018-12-31 22:48:31,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:31,048 INFO L480 AbstractCegarLoop]: Abstraction has 51954 states and 186006 transitions. [2018-12-31 22:48:31,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:48:31,048 INFO L276 IsEmpty]: Start isEmpty. Operand 51954 states and 186006 transitions. [2018-12-31 22:48:31,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-31 22:48:31,067 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:31,067 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] [2018-12-31 22:48:31,067 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:31,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:31,068 INFO L82 PathProgramCache]: Analyzing trace with hash 401589831, now seen corresponding path program 1 times [2018-12-31 22:48:31,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:31,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:31,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:31,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:31,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:31,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:31,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:31,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:31,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 22:48:31,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 22:48:31,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 22:48:31,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:48:31,469 INFO L87 Difference]: Start difference. First operand 51954 states and 186006 transitions. Second operand 7 states. [2018-12-31 22:48:32,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:32,766 INFO L93 Difference]: Finished difference Result 75637 states and 260103 transitions. [2018-12-31 22:48:32,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 22:48:32,767 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-12-31 22:48:32,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:33,001 INFO L225 Difference]: With dead ends: 75637 [2018-12-31 22:48:33,001 INFO L226 Difference]: Without dead ends: 75637 [2018-12-31 22:48:33,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-31 22:48:33,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75637 states. [2018-12-31 22:48:34,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75637 to 61472. [2018-12-31 22:48:34,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61472 states. [2018-12-31 22:48:35,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61472 states to 61472 states and 215183 transitions. [2018-12-31 22:48:35,064 INFO L78 Accepts]: Start accepts. Automaton has 61472 states and 215183 transitions. Word has length 53 [2018-12-31 22:48:35,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:35,064 INFO L480 AbstractCegarLoop]: Abstraction has 61472 states and 215183 transitions. [2018-12-31 22:48:35,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 22:48:35,065 INFO L276 IsEmpty]: Start isEmpty. Operand 61472 states and 215183 transitions. [2018-12-31 22:48:35,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-31 22:48:35,081 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:35,081 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] [2018-12-31 22:48:35,082 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:35,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:35,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1289093512, now seen corresponding path program 1 times [2018-12-31 22:48:35,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:35,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:35,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:35,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:35,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:35,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:35,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:35,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:35,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:48:35,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:48:35,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:48:35,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:48:35,184 INFO L87 Difference]: Start difference. First operand 61472 states and 215183 transitions. Second operand 4 states. [2018-12-31 22:48:35,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:35,316 INFO L93 Difference]: Finished difference Result 13777 states and 43273 transitions. [2018-12-31 22:48:35,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 22:48:35,317 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-12-31 22:48:35,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:35,339 INFO L225 Difference]: With dead ends: 13777 [2018-12-31 22:48:35,339 INFO L226 Difference]: Without dead ends: 12160 [2018-12-31 22:48:35,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:48:35,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12160 states. [2018-12-31 22:48:35,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12160 to 12112. [2018-12-31 22:48:35,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12112 states. [2018-12-31 22:48:35,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12112 states to 12112 states and 37957 transitions. [2018-12-31 22:48:35,530 INFO L78 Accepts]: Start accepts. Automaton has 12112 states and 37957 transitions. Word has length 53 [2018-12-31 22:48:35,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:35,531 INFO L480 AbstractCegarLoop]: Abstraction has 12112 states and 37957 transitions. [2018-12-31 22:48:35,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:48:35,531 INFO L276 IsEmpty]: Start isEmpty. Operand 12112 states and 37957 transitions. [2018-12-31 22:48:35,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-31 22:48:35,538 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:35,538 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] [2018-12-31 22:48:35,539 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:35,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:35,539 INFO L82 PathProgramCache]: Analyzing trace with hash 942323206, now seen corresponding path program 1 times [2018-12-31 22:48:35,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:35,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:35,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:35,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:35,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:35,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:35,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:35,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:35,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:48:35,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:48:35,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:48:35,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:48:35,757 INFO L87 Difference]: Start difference. First operand 12112 states and 37957 transitions. Second operand 4 states. [2018-12-31 22:48:36,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:36,026 INFO L93 Difference]: Finished difference Result 14275 states and 44580 transitions. [2018-12-31 22:48:36,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 22:48:36,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-31 22:48:36,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:36,053 INFO L225 Difference]: With dead ends: 14275 [2018-12-31 22:48:36,053 INFO L226 Difference]: Without dead ends: 14275 [2018-12-31 22:48:36,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:48:36,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14275 states. [2018-12-31 22:48:36,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14275 to 12843. [2018-12-31 22:48:36,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12843 states. [2018-12-31 22:48:36,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12843 states to 12843 states and 40182 transitions. [2018-12-31 22:48:36,271 INFO L78 Accepts]: Start accepts. Automaton has 12843 states and 40182 transitions. Word has length 63 [2018-12-31 22:48:36,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:36,271 INFO L480 AbstractCegarLoop]: Abstraction has 12843 states and 40182 transitions. [2018-12-31 22:48:36,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:48:36,271 INFO L276 IsEmpty]: Start isEmpty. Operand 12843 states and 40182 transitions. [2018-12-31 22:48:36,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-31 22:48:36,279 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:36,279 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] [2018-12-31 22:48:36,279 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:36,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:36,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1609833755, now seen corresponding path program 1 times [2018-12-31 22:48:36,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:36,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:36,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:36,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:36,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:36,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:36,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:36,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:36,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:48:36,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:48:36,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:48:36,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:48:36,465 INFO L87 Difference]: Start difference. First operand 12843 states and 40182 transitions. Second operand 6 states. [2018-12-31 22:48:37,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:37,168 INFO L93 Difference]: Finished difference Result 23410 states and 72791 transitions. [2018-12-31 22:48:37,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-31 22:48:37,169 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2018-12-31 22:48:37,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:37,213 INFO L225 Difference]: With dead ends: 23410 [2018-12-31 22:48:37,213 INFO L226 Difference]: Without dead ends: 23346 [2018-12-31 22:48:37,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-31 22:48:37,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23346 states. [2018-12-31 22:48:37,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23346 to 13812. [2018-12-31 22:48:37,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13812 states. [2018-12-31 22:48:37,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13812 states to 13812 states and 42966 transitions. [2018-12-31 22:48:37,505 INFO L78 Accepts]: Start accepts. Automaton has 13812 states and 42966 transitions. Word has length 63 [2018-12-31 22:48:37,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:37,506 INFO L480 AbstractCegarLoop]: Abstraction has 13812 states and 42966 transitions. [2018-12-31 22:48:37,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:48:37,506 INFO L276 IsEmpty]: Start isEmpty. Operand 13812 states and 42966 transitions. [2018-12-31 22:48:37,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-31 22:48:37,516 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:37,517 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] [2018-12-31 22:48:37,517 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:37,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:37,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1160555304, now seen corresponding path program 1 times [2018-12-31 22:48:37,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:37,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:37,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:37,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:37,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:37,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:37,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:37,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:37,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:48:37,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:48:37,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:48:37,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:48:37,777 INFO L87 Difference]: Start difference. First operand 13812 states and 42966 transitions. Second operand 4 states. [2018-12-31 22:48:38,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:38,701 INFO L93 Difference]: Finished difference Result 17359 states and 53255 transitions. [2018-12-31 22:48:38,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 22:48:38,702 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-31 22:48:38,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:38,735 INFO L225 Difference]: With dead ends: 17359 [2018-12-31 22:48:38,735 INFO L226 Difference]: Without dead ends: 17359 [2018-12-31 22:48:38,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:48:38,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17359 states. [2018-12-31 22:48:38,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17359 to 15783. [2018-12-31 22:48:38,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15783 states. [2018-12-31 22:48:38,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15783 states to 15783 states and 48578 transitions. [2018-12-31 22:48:38,995 INFO L78 Accepts]: Start accepts. Automaton has 15783 states and 48578 transitions. Word has length 65 [2018-12-31 22:48:38,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:38,996 INFO L480 AbstractCegarLoop]: Abstraction has 15783 states and 48578 transitions. [2018-12-31 22:48:38,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:48:38,996 INFO L276 IsEmpty]: Start isEmpty. Operand 15783 states and 48578 transitions. [2018-12-31 22:48:39,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-31 22:48:39,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:39,011 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] [2018-12-31 22:48:39,012 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:39,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:39,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1057202649, now seen corresponding path program 1 times [2018-12-31 22:48:39,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:39,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:39,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:39,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:39,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:39,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:39,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:39,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:39,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 22:48:39,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 22:48:39,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 22:48:39,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 22:48:39,149 INFO L87 Difference]: Start difference. First operand 15783 states and 48578 transitions. Second operand 3 states. [2018-12-31 22:48:39,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:39,389 INFO L93 Difference]: Finished difference Result 16413 states and 50318 transitions. [2018-12-31 22:48:39,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 22:48:39,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-12-31 22:48:39,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:39,421 INFO L225 Difference]: With dead ends: 16413 [2018-12-31 22:48:39,421 INFO L226 Difference]: Without dead ends: 16413 [2018-12-31 22:48:39,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 22:48:39,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16413 states. [2018-12-31 22:48:39,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16413 to 16125. [2018-12-31 22:48:39,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16125 states. [2018-12-31 22:48:39,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16125 states to 16125 states and 49516 transitions. [2018-12-31 22:48:39,690 INFO L78 Accepts]: Start accepts. Automaton has 16125 states and 49516 transitions. Word has length 65 [2018-12-31 22:48:39,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:39,690 INFO L480 AbstractCegarLoop]: Abstraction has 16125 states and 49516 transitions. [2018-12-31 22:48:39,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 22:48:39,690 INFO L276 IsEmpty]: Start isEmpty. Operand 16125 states and 49516 transitions. [2018-12-31 22:48:39,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 22:48:39,707 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:39,707 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] [2018-12-31 22:48:39,707 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:39,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:39,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1484400773, now seen corresponding path program 1 times [2018-12-31 22:48:39,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:39,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:39,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:39,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:39,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:39,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:39,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:39,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:39,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:48:39,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:48:39,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:48:39,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:48:39,921 INFO L87 Difference]: Start difference. First operand 16125 states and 49516 transitions. Second operand 6 states. [2018-12-31 22:48:40,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:40,749 INFO L93 Difference]: Finished difference Result 19568 states and 59304 transitions. [2018-12-31 22:48:40,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:48:40,750 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-31 22:48:40,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:40,788 INFO L225 Difference]: With dead ends: 19568 [2018-12-31 22:48:40,788 INFO L226 Difference]: Without dead ends: 19568 [2018-12-31 22:48:40,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:48:40,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19568 states. [2018-12-31 22:48:41,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19568 to 18524. [2018-12-31 22:48:41,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18524 states. [2018-12-31 22:48:41,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18524 states to 18524 states and 56466 transitions. [2018-12-31 22:48:41,514 INFO L78 Accepts]: Start accepts. Automaton has 18524 states and 56466 transitions. Word has length 67 [2018-12-31 22:48:41,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:41,514 INFO L480 AbstractCegarLoop]: Abstraction has 18524 states and 56466 transitions. [2018-12-31 22:48:41,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:48:41,514 INFO L276 IsEmpty]: Start isEmpty. Operand 18524 states and 56466 transitions. [2018-12-31 22:48:41,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 22:48:41,533 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:41,534 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:48:41,534 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:41,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:41,534 INFO L82 PathProgramCache]: Analyzing trace with hash -592808570, now seen corresponding path program 1 times [2018-12-31 22:48:41,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:41,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:41,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:41,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:41,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:41,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:42,183 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 9 [2018-12-31 22:48:42,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:42,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:42,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:48:42,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:48:42,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:48:42,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:48:42,196 INFO L87 Difference]: Start difference. First operand 18524 states and 56466 transitions. Second operand 6 states. [2018-12-31 22:48:43,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:43,302 INFO L93 Difference]: Finished difference Result 21666 states and 64013 transitions. [2018-12-31 22:48:43,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 22:48:43,303 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-31 22:48:43,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:43,342 INFO L225 Difference]: With dead ends: 21666 [2018-12-31 22:48:43,342 INFO L226 Difference]: Without dead ends: 21666 [2018-12-31 22:48:43,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-31 22:48:43,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21666 states. [2018-12-31 22:48:43,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21666 to 18841. [2018-12-31 22:48:43,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18841 states. [2018-12-31 22:48:43,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18841 states to 18841 states and 56340 transitions. [2018-12-31 22:48:43,633 INFO L78 Accepts]: Start accepts. Automaton has 18841 states and 56340 transitions. Word has length 67 [2018-12-31 22:48:43,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:43,633 INFO L480 AbstractCegarLoop]: Abstraction has 18841 states and 56340 transitions. [2018-12-31 22:48:43,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:48:43,633 INFO L276 IsEmpty]: Start isEmpty. Operand 18841 states and 56340 transitions. [2018-12-31 22:48:43,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 22:48:43,648 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:43,648 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] [2018-12-31 22:48:43,648 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:43,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:43,649 INFO L82 PathProgramCache]: Analyzing trace with hash -381457657, now seen corresponding path program 1 times [2018-12-31 22:48:43,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:43,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:43,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:43,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:43,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:43,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:43,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:43,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:43,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:48:43,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:48:43,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:48:43,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:48:43,904 INFO L87 Difference]: Start difference. First operand 18841 states and 56340 transitions. Second operand 5 states. [2018-12-31 22:48:44,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:44,269 INFO L93 Difference]: Finished difference Result 23854 states and 70897 transitions. [2018-12-31 22:48:44,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:48:44,270 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-31 22:48:44,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:44,311 INFO L225 Difference]: With dead ends: 23854 [2018-12-31 22:48:44,311 INFO L226 Difference]: Without dead ends: 23854 [2018-12-31 22:48:44,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:48:44,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23854 states. [2018-12-31 22:48:44,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23854 to 20164. [2018-12-31 22:48:44,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20164 states. [2018-12-31 22:48:44,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20164 states to 20164 states and 59821 transitions. [2018-12-31 22:48:44,626 INFO L78 Accepts]: Start accepts. Automaton has 20164 states and 59821 transitions. Word has length 67 [2018-12-31 22:48:44,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:44,627 INFO L480 AbstractCegarLoop]: Abstraction has 20164 states and 59821 transitions. [2018-12-31 22:48:44,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:48:44,627 INFO L276 IsEmpty]: Start isEmpty. Operand 20164 states and 59821 transitions. [2018-12-31 22:48:44,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 22:48:44,643 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:44,643 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] [2018-12-31 22:48:44,644 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:44,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:44,644 INFO L82 PathProgramCache]: Analyzing trace with hash -891991834, now seen corresponding path program 1 times [2018-12-31 22:48:44,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:44,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:44,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:44,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:44,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:44,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:44,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:44,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:44,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:48:44,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:48:44,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:48:44,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:48:44,960 INFO L87 Difference]: Start difference. First operand 20164 states and 59821 transitions. Second operand 5 states. [2018-12-31 22:48:45,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:45,512 INFO L93 Difference]: Finished difference Result 27231 states and 80368 transitions. [2018-12-31 22:48:45,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 22:48:45,513 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-31 22:48:45,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:45,563 INFO L225 Difference]: With dead ends: 27231 [2018-12-31 22:48:45,563 INFO L226 Difference]: Without dead ends: 27231 [2018-12-31 22:48:45,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:48:45,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27231 states. [2018-12-31 22:48:45,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27231 to 21349. [2018-12-31 22:48:45,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21349 states. [2018-12-31 22:48:45,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21349 states to 21349 states and 63327 transitions. [2018-12-31 22:48:45,980 INFO L78 Accepts]: Start accepts. Automaton has 21349 states and 63327 transitions. Word has length 67 [2018-12-31 22:48:45,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:45,980 INFO L480 AbstractCegarLoop]: Abstraction has 21349 states and 63327 transitions. [2018-12-31 22:48:45,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:48:45,980 INFO L276 IsEmpty]: Start isEmpty. Operand 21349 states and 63327 transitions. [2018-12-31 22:48:45,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 22:48:45,997 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:45,997 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:48:45,997 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:45,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:45,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1595520999, now seen corresponding path program 1 times [2018-12-31 22:48:45,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:45,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:46,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:46,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:46,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:46,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:46,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:46,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:46,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:48:46,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:48:46,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:48:46,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:48:46,168 INFO L87 Difference]: Start difference. First operand 21349 states and 63327 transitions. Second operand 4 states. [2018-12-31 22:48:46,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:46,784 INFO L93 Difference]: Finished difference Result 28445 states and 84501 transitions. [2018-12-31 22:48:46,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 22:48:46,785 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-31 22:48:46,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:46,838 INFO L225 Difference]: With dead ends: 28445 [2018-12-31 22:48:46,838 INFO L226 Difference]: Without dead ends: 28025 [2018-12-31 22:48:46,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:48:46,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28025 states. [2018-12-31 22:48:47,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28025 to 25833. [2018-12-31 22:48:47,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25833 states. [2018-12-31 22:48:47,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25833 states to 25833 states and 76849 transitions. [2018-12-31 22:48:47,252 INFO L78 Accepts]: Start accepts. Automaton has 25833 states and 76849 transitions. Word has length 67 [2018-12-31 22:48:47,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:47,252 INFO L480 AbstractCegarLoop]: Abstraction has 25833 states and 76849 transitions. [2018-12-31 22:48:47,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:48:47,252 INFO L276 IsEmpty]: Start isEmpty. Operand 25833 states and 76849 transitions. [2018-12-31 22:48:47,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 22:48:47,279 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:47,279 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] [2018-12-31 22:48:47,279 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:47,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:47,279 INFO L82 PathProgramCache]: Analyzing trace with hash -201430360, now seen corresponding path program 1 times [2018-12-31 22:48:47,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:47,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:47,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:47,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:47,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:47,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:47,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:47,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:47,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 22:48:47,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 22:48:47,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 22:48:47,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:48:47,461 INFO L87 Difference]: Start difference. First operand 25833 states and 76849 transitions. Second operand 7 states. [2018-12-31 22:48:47,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:47,979 INFO L93 Difference]: Finished difference Result 24259 states and 68850 transitions. [2018-12-31 22:48:47,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 22:48:47,980 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2018-12-31 22:48:47,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:48,021 INFO L225 Difference]: With dead ends: 24259 [2018-12-31 22:48:48,021 INFO L226 Difference]: Without dead ends: 24259 [2018-12-31 22:48:48,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-12-31 22:48:48,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24259 states. [2018-12-31 22:48:48,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24259 to 16777. [2018-12-31 22:48:48,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16777 states. [2018-12-31 22:48:48,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16777 states to 16777 states and 47919 transitions. [2018-12-31 22:48:48,309 INFO L78 Accepts]: Start accepts. Automaton has 16777 states and 47919 transitions. Word has length 67 [2018-12-31 22:48:48,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:48,309 INFO L480 AbstractCegarLoop]: Abstraction has 16777 states and 47919 transitions. [2018-12-31 22:48:48,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 22:48:48,310 INFO L276 IsEmpty]: Start isEmpty. Operand 16777 states and 47919 transitions. [2018-12-31 22:48:48,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 22:48:48,324 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:48,324 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] [2018-12-31 22:48:48,324 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:48,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:48,324 INFO L82 PathProgramCache]: Analyzing trace with hash 686073321, now seen corresponding path program 1 times [2018-12-31 22:48:48,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:48,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:48,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:48,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:48,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:48,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:48,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:48,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:48,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:48:48,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:48:48,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:48:48,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:48:48,460 INFO L87 Difference]: Start difference. First operand 16777 states and 47919 transitions. Second operand 5 states. [2018-12-31 22:48:48,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:48,513 INFO L93 Difference]: Finished difference Result 4693 states and 11228 transitions. [2018-12-31 22:48:48,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 22:48:48,514 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-31 22:48:48,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:48,519 INFO L225 Difference]: With dead ends: 4693 [2018-12-31 22:48:48,519 INFO L226 Difference]: Without dead ends: 3795 [2018-12-31 22:48:48,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:48:48,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3795 states. [2018-12-31 22:48:48,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3795 to 3506. [2018-12-31 22:48:48,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3506 states. [2018-12-31 22:48:48,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3506 states to 3506 states and 8177 transitions. [2018-12-31 22:48:48,667 INFO L78 Accepts]: Start accepts. Automaton has 3506 states and 8177 transitions. Word has length 67 [2018-12-31 22:48:48,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:48,667 INFO L480 AbstractCegarLoop]: Abstraction has 3506 states and 8177 transitions. [2018-12-31 22:48:48,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:48:48,667 INFO L276 IsEmpty]: Start isEmpty. Operand 3506 states and 8177 transitions. [2018-12-31 22:48:48,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-31 22:48:48,672 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:48,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, 1, 1] [2018-12-31 22:48:48,672 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:48,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:48,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1835312380, now seen corresponding path program 1 times [2018-12-31 22:48:48,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:48,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:48,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:48,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:48,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:48,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:48,942 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-31 22:48:49,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:49,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:49,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-31 22:48:49,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 22:48:49,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 22:48:49,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-31 22:48:49,015 INFO L87 Difference]: Start difference. First operand 3506 states and 8177 transitions. Second operand 10 states. [2018-12-31 22:48:51,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:51,428 INFO L93 Difference]: Finished difference Result 6135 states and 14274 transitions. [2018-12-31 22:48:51,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 22:48:51,429 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 84 [2018-12-31 22:48:51,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:51,436 INFO L225 Difference]: With dead ends: 6135 [2018-12-31 22:48:51,436 INFO L226 Difference]: Without dead ends: 4144 [2018-12-31 22:48:51,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-12-31 22:48:51,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4144 states. [2018-12-31 22:48:51,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4144 to 3535. [2018-12-31 22:48:51,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3535 states. [2018-12-31 22:48:51,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3535 states to 3535 states and 8169 transitions. [2018-12-31 22:48:51,481 INFO L78 Accepts]: Start accepts. Automaton has 3535 states and 8169 transitions. Word has length 84 [2018-12-31 22:48:51,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:51,481 INFO L480 AbstractCegarLoop]: Abstraction has 3535 states and 8169 transitions. [2018-12-31 22:48:51,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 22:48:51,481 INFO L276 IsEmpty]: Start isEmpty. Operand 3535 states and 8169 transitions. [2018-12-31 22:48:51,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-31 22:48:51,486 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:51,486 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:48:51,486 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:51,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:51,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1827356332, now seen corresponding path program 2 times [2018-12-31 22:48:51,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:51,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:51,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:51,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:51,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:51,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:51,723 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-31 22:48:51,885 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-12-31 22:48:52,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:52,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:52,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 22:48:52,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 22:48:52,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 22:48:52,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:48:52,152 INFO L87 Difference]: Start difference. First operand 3535 states and 8169 transitions. Second operand 8 states. [2018-12-31 22:48:52,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:52,809 INFO L93 Difference]: Finished difference Result 6333 states and 14681 transitions. [2018-12-31 22:48:52,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 22:48:52,810 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2018-12-31 22:48:52,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:52,815 INFO L225 Difference]: With dead ends: 6333 [2018-12-31 22:48:52,815 INFO L226 Difference]: Without dead ends: 2755 [2018-12-31 22:48:52,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-12-31 22:48:52,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2018-12-31 22:48:52,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 2755. [2018-12-31 22:48:52,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2755 states. [2018-12-31 22:48:52,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2755 states to 2755 states and 6394 transitions. [2018-12-31 22:48:52,846 INFO L78 Accepts]: Start accepts. Automaton has 2755 states and 6394 transitions. Word has length 84 [2018-12-31 22:48:52,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:52,846 INFO L480 AbstractCegarLoop]: Abstraction has 2755 states and 6394 transitions. [2018-12-31 22:48:52,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 22:48:52,846 INFO L276 IsEmpty]: Start isEmpty. Operand 2755 states and 6394 transitions. [2018-12-31 22:48:52,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-31 22:48:52,850 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:52,850 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:48:52,851 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:52,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:52,851 INFO L82 PathProgramCache]: Analyzing trace with hash -536746444, now seen corresponding path program 1 times [2018-12-31 22:48:52,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:52,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:52,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:52,854 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 22:48:52,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:52,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:53,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:53,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:53,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 22:48:53,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 22:48:53,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 22:48:53,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:48:53,051 INFO L87 Difference]: Start difference. First operand 2755 states and 6394 transitions. Second operand 7 states. [2018-12-31 22:48:53,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:53,399 INFO L93 Difference]: Finished difference Result 3202 states and 7448 transitions. [2018-12-31 22:48:53,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:48:53,400 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2018-12-31 22:48:53,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:53,405 INFO L225 Difference]: With dead ends: 3202 [2018-12-31 22:48:53,405 INFO L226 Difference]: Without dead ends: 3202 [2018-12-31 22:48:53,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:48:53,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3202 states. [2018-12-31 22:48:53,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3202 to 2837. [2018-12-31 22:48:53,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2837 states. [2018-12-31 22:48:53,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2837 states to 2837 states and 6623 transitions. [2018-12-31 22:48:53,440 INFO L78 Accepts]: Start accepts. Automaton has 2837 states and 6623 transitions. Word has length 84 [2018-12-31 22:48:53,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:53,441 INFO L480 AbstractCegarLoop]: Abstraction has 2837 states and 6623 transitions. [2018-12-31 22:48:53,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 22:48:53,441 INFO L276 IsEmpty]: Start isEmpty. Operand 2837 states and 6623 transitions. [2018-12-31 22:48:53,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-31 22:48:53,445 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:53,446 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:48:53,446 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:53,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:53,446 INFO L82 PathProgramCache]: Analyzing trace with hash 649061720, now seen corresponding path program 1 times [2018-12-31 22:48:53,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:53,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:53,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:53,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:53,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:53,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:53,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:53,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:53,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 22:48:53,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 22:48:53,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 22:48:53,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:48:53,684 INFO L87 Difference]: Start difference. First operand 2837 states and 6623 transitions. Second operand 7 states. [2018-12-31 22:48:54,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:54,002 INFO L93 Difference]: Finished difference Result 3000 states and 6920 transitions. [2018-12-31 22:48:54,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 22:48:54,003 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2018-12-31 22:48:54,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:54,008 INFO L225 Difference]: With dead ends: 3000 [2018-12-31 22:48:54,008 INFO L226 Difference]: Without dead ends: 3000 [2018-12-31 22:48:54,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-31 22:48:54,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3000 states. [2018-12-31 22:48:54,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3000 to 2708. [2018-12-31 22:48:54,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2708 states. [2018-12-31 22:48:54,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2708 states to 2708 states and 6259 transitions. [2018-12-31 22:48:54,041 INFO L78 Accepts]: Start accepts. Automaton has 2708 states and 6259 transitions. Word has length 84 [2018-12-31 22:48:54,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:54,041 INFO L480 AbstractCegarLoop]: Abstraction has 2708 states and 6259 transitions. [2018-12-31 22:48:54,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 22:48:54,041 INFO L276 IsEmpty]: Start isEmpty. Operand 2708 states and 6259 transitions. [2018-12-31 22:48:54,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-31 22:48:54,045 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:54,045 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:48:54,045 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:54,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:54,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1610675737, now seen corresponding path program 1 times [2018-12-31 22:48:54,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:54,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:54,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:54,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:54,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:54,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:54,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:54,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:54,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 22:48:54,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 22:48:54,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 22:48:54,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:48:54,331 INFO L87 Difference]: Start difference. First operand 2708 states and 6259 transitions. Second operand 8 states. [2018-12-31 22:48:54,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:54,669 INFO L93 Difference]: Finished difference Result 3082 states and 7106 transitions. [2018-12-31 22:48:54,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 22:48:54,670 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2018-12-31 22:48:54,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:54,675 INFO L225 Difference]: With dead ends: 3082 [2018-12-31 22:48:54,675 INFO L226 Difference]: Without dead ends: 3082 [2018-12-31 22:48:54,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-12-31 22:48:54,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3082 states. [2018-12-31 22:48:54,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3082 to 2721. [2018-12-31 22:48:54,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2721 states. [2018-12-31 22:48:54,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2721 states to 2721 states and 6280 transitions. [2018-12-31 22:48:54,711 INFO L78 Accepts]: Start accepts. Automaton has 2721 states and 6280 transitions. Word has length 84 [2018-12-31 22:48:54,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:54,712 INFO L480 AbstractCegarLoop]: Abstraction has 2721 states and 6280 transitions. [2018-12-31 22:48:54,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 22:48:54,712 INFO L276 IsEmpty]: Start isEmpty. Operand 2721 states and 6280 transitions. [2018-12-31 22:48:54,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-31 22:48:54,716 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:54,716 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:48:54,716 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:54,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:54,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1796787878, now seen corresponding path program 3 times [2018-12-31 22:48:54,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:54,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:54,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:54,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:54,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:54,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:54,936 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-31 22:48:55,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:55,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:55,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-31 22:48:55,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 22:48:55,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 22:48:55,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-31 22:48:55,013 INFO L87 Difference]: Start difference. First operand 2721 states and 6280 transitions. Second operand 11 states. [2018-12-31 22:48:56,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:56,069 INFO L93 Difference]: Finished difference Result 4715 states and 10918 transitions. [2018-12-31 22:48:56,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 22:48:56,070 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 84 [2018-12-31 22:48:56,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:56,075 INFO L225 Difference]: With dead ends: 4715 [2018-12-31 22:48:56,075 INFO L226 Difference]: Without dead ends: 3041 [2018-12-31 22:48:56,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2018-12-31 22:48:56,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3041 states. [2018-12-31 22:48:56,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3041 to 2701. [2018-12-31 22:48:56,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2701 states. [2018-12-31 22:48:56,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2701 states to 2701 states and 6238 transitions. [2018-12-31 22:48:56,108 INFO L78 Accepts]: Start accepts. Automaton has 2701 states and 6238 transitions. Word has length 84 [2018-12-31 22:48:56,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:56,108 INFO L480 AbstractCegarLoop]: Abstraction has 2701 states and 6238 transitions. [2018-12-31 22:48:56,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 22:48:56,109 INFO L276 IsEmpty]: Start isEmpty. Operand 2701 states and 6238 transitions. [2018-12-31 22:48:56,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-31 22:48:56,112 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:56,112 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:48:56,113 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:56,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:56,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1396979846, now seen corresponding path program 4 times [2018-12-31 22:48:56,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:56,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:56,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:56,115 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 22:48:56,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:56,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 22:48:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 22:48:56,200 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 22:48:56,357 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-31 22:48:56,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 10:48:56 BasicIcfg [2018-12-31 22:48:56,360 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 22:48:56,361 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 22:48:56,361 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 22:48:56,361 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 22:48:56,362 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:48:04" (3/4) ... [2018-12-31 22:48:56,367 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 22:48:56,595 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 22:48:56,595 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 22:48:56,600 INFO L168 Benchmark]: Toolchain (without parser) took 54952.28 ms. Allocated memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: 3.6 GB). Free memory was 937.9 MB in the beginning and 3.1 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-12-31 22:48:56,601 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 22:48:56,602 INFO L168 Benchmark]: CACSL2BoogieTranslator took 896.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -167.3 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2018-12-31 22:48:56,602 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.67 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-31 22:48:56,602 INFO L168 Benchmark]: Boogie Preprocessor took 91.99 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 22:48:56,603 INFO L168 Benchmark]: RCFGBuilder took 1490.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 11.5 GB. [2018-12-31 22:48:56,605 INFO L168 Benchmark]: TraceAbstraction took 52148.01 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.5 GB). Free memory was 1.1 GB in the beginning and 3.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-12-31 22:48:56,605 INFO L168 Benchmark]: Witness Printer took 234.65 ms. Allocated memory is still 4.6 GB. Free memory is still 3.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 22:48:56,609 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 896.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -167.3 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 79.67 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 91.99 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 1490.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 52148.01 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.5 GB). Free memory was 1.1 GB in the beginning and 3.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 234.65 ms. Allocated memory is still 4.6 GB. Free memory is still 3.1 GB. There was no memory consumed. 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] [L676] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L678] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L679] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L680] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L682] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L683] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L684] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L685] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L686] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L687] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L688] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L689] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L690] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L691] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L692] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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}] [L693] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L694] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L695] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L696] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L698] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L699] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L700] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L776] -1 pthread_t t1637; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L777] FCALL, FORK -1 pthread_create(&t1637, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L778] -1 pthread_t t1638; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L779] FCALL, FORK -1 pthread_create(&t1638, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L734] 0 x$w_buff1 = x$w_buff0 [L735] 0 x$w_buff0 = 1 [L736] 0 x$w_buff1_used = x$w_buff0_used [L737] 0 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L739] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L740] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L741] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L742] 0 x$r_buff0_thd2 = (_Bool)1 [L745] 0 y = 1 [L748] 0 __unbuffered_p1_EAX = y [L751] 0 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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] [L754] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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] [L704] 1 y = 2 [L709] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L710] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L711] 1 x$flush_delayed = weak$$choice2 [L712] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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] [L713] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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] [L754] 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) [L755] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=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] [L755] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L713] 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) [L756] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L756] 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 [L757] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L714] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L714] 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)) [L715] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L715] 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)) [L716] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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))=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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L716] 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)) [L717] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L717] 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)) [L757] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L758] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L758] 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 [L761] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L718] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L718] 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)) [L719] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L719] 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)) [L720] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L721] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L721] 1 x = x$flush_delayed ? x$mem_tmp : x [L722] 1 x$flush_delayed = (_Bool)0 [L727] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L781] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] -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) [L786] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L786] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L787] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L787] -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 [L788] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L788] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L789] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L789] -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 [L792] -1 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, 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=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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 199 locations, 3 error locations. UNSAFE Result, 51.9s OverallTime, 26 OverallIterations, 1 TraceHistogramMax, 22.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6960 SDtfs, 8644 SDslu, 17002 SDs, 0 SdLazy, 7110 SolverSat, 377 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 255 GetRequests, 63 SyntacticMatches, 20 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 7.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61472occurred in iteration=7, 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: 19.6s AutomataMinimizationTime, 25 MinimizatonAttempts, 146320 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 1705 NumberOfCodeBlocks, 1705 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1596 ConstructedInterpolants, 0 QuantifiedInterpolants, 280342 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...