./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/podwr000_pso.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e 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/podwr000_pso.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 c789dc64a500d158f8c4f6d503d67910c567fa0f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-91b1670 [2018-11-28 20:17:20,506 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 20:17:20,508 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 20:17:20,521 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 20:17:20,522 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 20:17:20,523 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 20:17:20,524 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 20:17:20,526 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 20:17:20,528 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 20:17:20,529 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 20:17:20,530 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 20:17:20,530 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 20:17:20,531 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 20:17:20,533 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 20:17:20,534 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 20:17:20,535 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 20:17:20,536 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 20:17:20,538 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 20:17:20,541 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 20:17:20,543 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 20:17:20,544 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 20:17:20,546 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 20:17:20,549 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 20:17:20,549 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 20:17:20,549 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 20:17:20,551 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 20:17:20,552 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 20:17:20,553 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 20:17:20,554 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 20:17:20,556 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 20:17:20,556 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 20:17:20,557 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 20:17:20,557 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 20:17:20,557 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 20:17:20,559 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 20:17:20,560 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 20:17:20,560 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 20:17:20,594 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 20:17:20,595 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 20:17:20,596 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 20:17:20,596 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 20:17:20,597 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 20:17:20,597 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 20:17:20,597 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 20:17:20,599 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 20:17:20,599 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 20:17:20,599 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 20:17:20,599 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 20:17:20,599 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 20:17:20,599 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 20:17:20,600 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 20:17:20,600 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 20:17:20,600 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 20:17:20,600 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 20:17:20,600 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 20:17:20,600 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 20:17:20,601 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 20:17:20,601 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 20:17:20,601 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 20:17:20,601 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 20:17:20,601 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 20:17:20,602 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 20:17:20,602 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 20:17:20,602 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 20:17:20,602 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 20:17:20,602 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 20:17:20,602 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 20:17:20,604 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 -> c789dc64a500d158f8c4f6d503d67910c567fa0f [2018-11-28 20:17:20,665 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 20:17:20,684 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 20:17:20,690 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 20:17:20,692 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 20:17:20,692 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 20:17:20,693 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/podwr000_pso.opt_false-unreach-call.i [2018-11-28 20:17:20,764 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45b7e178a/9f98a24c984f486d8d293220809d07f5/FLAG230ea292f [2018-11-28 20:17:21,344 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 20:17:21,345 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/podwr000_pso.opt_false-unreach-call.i [2018-11-28 20:17:21,374 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45b7e178a/9f98a24c984f486d8d293220809d07f5/FLAG230ea292f [2018-11-28 20:17:21,584 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45b7e178a/9f98a24c984f486d8d293220809d07f5 [2018-11-28 20:17:21,587 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 20:17:21,589 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 20:17:21,590 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 20:17:21,590 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 20:17:21,594 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 20:17:21,595 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:17:21" (1/1) ... [2018-11-28 20:17:21,599 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@806a026 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:17:21, skipping insertion in model container [2018-11-28 20:17:21,599 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:17:21" (1/1) ... [2018-11-28 20:17:21,608 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 20:17:21,680 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 20:17:22,237 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 20:17:22,257 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 20:17:22,444 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 20:17:22,543 INFO L195 MainTranslator]: Completed translation [2018-11-28 20:17:22,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:17:22 WrapperNode [2018-11-28 20:17:22,544 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 20:17:22,545 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 20:17:22,545 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 20:17:22,545 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 20:17:22,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:17:22" (1/1) ... [2018-11-28 20:17:22,591 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:17:22" (1/1) ... [2018-11-28 20:17:22,643 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 20:17:22,643 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 20:17:22,643 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 20:17:22,644 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 20:17:22,656 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:17:22" (1/1) ... [2018-11-28 20:17:22,657 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:17:22" (1/1) ... [2018-11-28 20:17:22,662 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:17:22" (1/1) ... [2018-11-28 20:17:22,662 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:17:22" (1/1) ... [2018-11-28 20:17:22,675 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:17:22" (1/1) ... [2018-11-28 20:17:22,680 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:17:22" (1/1) ... [2018-11-28 20:17:22,684 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:17:22" (1/1) ... [2018-11-28 20:17:22,689 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 20:17:22,690 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 20:17:22,690 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 20:17:22,690 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 20:17:22,692 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:17:22" (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-11-28 20:17:22,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 20:17:22,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 20:17:22,781 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-11-28 20:17:22,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 20:17:22,781 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-11-28 20:17:22,782 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-11-28 20:17:22,782 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-11-28 20:17:22,782 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-11-28 20:17:22,782 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-11-28 20:17:22,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 20:17:22,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 20:17:22,786 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-11-28 20:17:24,155 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 20:17:24,156 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 20:17:24,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:17:24 BoogieIcfgContainer [2018-11-28 20:17:24,156 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 20:17:24,158 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 20:17:24,158 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 20:17:24,161 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 20:17:24,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:17:21" (1/3) ... [2018-11-28 20:17:24,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a275fb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:17:24, skipping insertion in model container [2018-11-28 20:17:24,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:17:22" (2/3) ... [2018-11-28 20:17:24,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a275fb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:17:24, skipping insertion in model container [2018-11-28 20:17:24,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:17:24" (3/3) ... [2018-11-28 20:17:24,166 INFO L112 eAbstractionObserver]: Analyzing ICFG podwr000_pso.opt_false-unreach-call.i [2018-11-28 20:17:24,222 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,223 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,223 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,223 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,224 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,224 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,225 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,227 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,227 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,228 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,228 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,228 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,228 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,229 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,229 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,229 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,229 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,234 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,234 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,234 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,234 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,237 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,237 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,237 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,238 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,238 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,238 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,238 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,239 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,239 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,240 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,241 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,241 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,241 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,241 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,241 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,242 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,242 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,244 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,248 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,249 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,249 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,249 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,249 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,249 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,251 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,251 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,251 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,251 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,252 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,252 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,252 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,253 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,255 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,256 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,256 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,256 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,256 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,257 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,257 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,257 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,257 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,257 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,259 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,260 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,262 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,262 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,262 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,263 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,263 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,263 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,263 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,263 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,264 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,264 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,264 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,264 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,268 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,268 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,268 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,268 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,269 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,269 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,269 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,271 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,271 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,272 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,272 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,272 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,272 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,272 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,273 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,275 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,276 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,276 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,276 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,276 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,276 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,277 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,277 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,277 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,277 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,277 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,278 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,278 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,278 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,278 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,278 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,283 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,283 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,284 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,289 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,289 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,289 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,290 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,290 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,290 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,290 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,290 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,293 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,293 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,294 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,294 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,294 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,294 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,295 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,295 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,295 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,295 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,295 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,297 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,297 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,298 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,298 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,298 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,299 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,300 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,300 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,300 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,300 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,301 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,302 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,302 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,302 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,303 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,303 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,303 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,304 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,304 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,304 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,304 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,304 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,305 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,305 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,305 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,305 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,309 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,309 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,310 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,310 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,310 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,310 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,311 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,312 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:17:24,350 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-11-28 20:17:24,351 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 20:17:24,365 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-28 20:17:24,390 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-28 20:17:24,427 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 20:17:24,428 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 20:17:24,428 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 20:17:24,428 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 20:17:24,428 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 20:17:24,429 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 20:17:24,430 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 20:17:24,430 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 20:17:24,430 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 20:17:24,453 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 142places, 180 transitions [2018-11-28 20:17:27,410 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34806 states. [2018-11-28 20:17:27,412 INFO L276 IsEmpty]: Start isEmpty. Operand 34806 states. [2018-11-28 20:17:27,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 20:17:27,424 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:17:27,425 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:17:27,428 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:17:27,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:17:27,436 INFO L82 PathProgramCache]: Analyzing trace with hash -454041356, now seen corresponding path program 1 times [2018-11-28 20:17:27,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:17:27,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:17:27,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:17:27,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:17:27,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:17:27,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:17:27,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:17:27,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:17:27,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:17:27,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:17:27,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:17:27,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:17:27,866 INFO L87 Difference]: Start difference. First operand 34806 states. Second operand 4 states. [2018-11-28 20:17:29,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:17:29,275 INFO L93 Difference]: Finished difference Result 60790 states and 234493 transitions. [2018-11-28 20:17:29,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:17:29,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-11-28 20:17:29,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:17:29,695 INFO L225 Difference]: With dead ends: 60790 [2018-11-28 20:17:29,696 INFO L226 Difference]: Without dead ends: 44270 [2018-11-28 20:17:29,698 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-11-28 20:17:29,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44270 states. [2018-11-28 20:17:31,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44270 to 27338. [2018-11-28 20:17:31,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27338 states. [2018-11-28 20:17:31,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27338 states to 27338 states and 105499 transitions. [2018-11-28 20:17:31,466 INFO L78 Accepts]: Start accepts. Automaton has 27338 states and 105499 transitions. Word has length 33 [2018-11-28 20:17:31,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:17:31,468 INFO L480 AbstractCegarLoop]: Abstraction has 27338 states and 105499 transitions. [2018-11-28 20:17:31,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:17:31,468 INFO L276 IsEmpty]: Start isEmpty. Operand 27338 states and 105499 transitions. [2018-11-28 20:17:31,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-28 20:17:31,487 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:17:31,487 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:17:31,487 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:17:31,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:17:31,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1863363909, now seen corresponding path program 1 times [2018-11-28 20:17:31,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:17:31,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:17:31,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:17:31,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:17:31,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:17:31,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:17:31,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:17:31,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:17:31,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:17:31,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:17:31,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:17:31,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:17:31,717 INFO L87 Difference]: Start difference. First operand 27338 states and 105499 transitions. Second operand 4 states. [2018-11-28 20:17:32,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:17:32,074 INFO L93 Difference]: Finished difference Result 8528 states and 28344 transitions. [2018-11-28 20:17:32,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:17:32,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-11-28 20:17:32,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:17:32,111 INFO L225 Difference]: With dead ends: 8528 [2018-11-28 20:17:32,111 INFO L226 Difference]: Without dead ends: 7466 [2018-11-28 20:17:32,112 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-11-28 20:17:32,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7466 states. [2018-11-28 20:17:32,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7466 to 7466. [2018-11-28 20:17:32,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7466 states. [2018-11-28 20:17:32,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7466 states to 7466 states and 24636 transitions. [2018-11-28 20:17:32,339 INFO L78 Accepts]: Start accepts. Automaton has 7466 states and 24636 transitions. Word has length 45 [2018-11-28 20:17:32,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:17:32,341 INFO L480 AbstractCegarLoop]: Abstraction has 7466 states and 24636 transitions. [2018-11-28 20:17:32,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:17:32,341 INFO L276 IsEmpty]: Start isEmpty. Operand 7466 states and 24636 transitions. [2018-11-28 20:17:32,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-28 20:17:32,346 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:17:32,346 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-11-28 20:17:32,347 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:17:32,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:17:32,347 INFO L82 PathProgramCache]: Analyzing trace with hash 591681941, now seen corresponding path program 1 times [2018-11-28 20:17:32,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:17:32,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:17:32,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:17:32,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:17:32,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:17:32,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:17:32,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:17:32,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:17:32,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:17:32,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:17:32,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:17:32,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:17:32,679 INFO L87 Difference]: Start difference. First operand 7466 states and 24636 transitions. Second operand 5 states. [2018-11-28 20:17:33,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:17:33,878 INFO L93 Difference]: Finished difference Result 13998 states and 45805 transitions. [2018-11-28 20:17:33,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:17:33,879 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-11-28 20:17:33,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:17:33,935 INFO L225 Difference]: With dead ends: 13998 [2018-11-28 20:17:33,936 INFO L226 Difference]: Without dead ends: 13930 [2018-11-28 20:17:33,936 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-11-28 20:17:33,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13930 states. [2018-11-28 20:17:34,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13930 to 9441. [2018-11-28 20:17:34,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9441 states. [2018-11-28 20:17:34,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9441 states to 9441 states and 30542 transitions. [2018-11-28 20:17:34,200 INFO L78 Accepts]: Start accepts. Automaton has 9441 states and 30542 transitions. Word has length 46 [2018-11-28 20:17:34,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:17:34,201 INFO L480 AbstractCegarLoop]: Abstraction has 9441 states and 30542 transitions. [2018-11-28 20:17:34,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:17:34,204 INFO L276 IsEmpty]: Start isEmpty. Operand 9441 states and 30542 transitions. [2018-11-28 20:17:34,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-28 20:17:34,209 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:17:34,209 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:17:34,210 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:17:34,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:17:34,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1652121253, now seen corresponding path program 1 times [2018-11-28 20:17:34,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:17:34,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:17:34,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:17:34,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:17:34,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:17:34,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:17:34,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:17:34,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:17:34,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:17:34,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:17:34,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:17:34,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:17:34,355 INFO L87 Difference]: Start difference. First operand 9441 states and 30542 transitions. Second operand 3 states. [2018-11-28 20:17:34,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:17:34,791 INFO L93 Difference]: Finished difference Result 13279 states and 42641 transitions. [2018-11-28 20:17:34,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:17:34,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-11-28 20:17:34,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:17:34,826 INFO L225 Difference]: With dead ends: 13279 [2018-11-28 20:17:34,826 INFO L226 Difference]: Without dead ends: 13279 [2018-11-28 20:17:34,826 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-11-28 20:17:34,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13279 states. [2018-11-28 20:17:35,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13279 to 9845. [2018-11-28 20:17:35,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9845 states. [2018-11-28 20:17:35,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9845 states to 9845 states and 31508 transitions. [2018-11-28 20:17:35,084 INFO L78 Accepts]: Start accepts. Automaton has 9845 states and 31508 transitions. Word has length 48 [2018-11-28 20:17:35,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:17:35,085 INFO L480 AbstractCegarLoop]: Abstraction has 9845 states and 31508 transitions. [2018-11-28 20:17:35,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:17:35,085 INFO L276 IsEmpty]: Start isEmpty. Operand 9845 states and 31508 transitions. [2018-11-28 20:17:35,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-28 20:17:35,087 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:17:35,088 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:17:35,088 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:17:35,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:17:35,088 INFO L82 PathProgramCache]: Analyzing trace with hash -164023066, now seen corresponding path program 1 times [2018-11-28 20:17:35,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:17:35,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:17:35,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:17:35,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:17:35,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:17:35,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:17:35,392 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-28 20:17:35,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:17:35,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:17:35,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:17:35,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:17:35,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:17:35,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:17:35,740 INFO L87 Difference]: Start difference. First operand 9845 states and 31508 transitions. Second operand 7 states. [2018-11-28 20:17:36,116 WARN L180 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2018-11-28 20:17:37,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:17:37,504 INFO L93 Difference]: Finished difference Result 12285 states and 38673 transitions. [2018-11-28 20:17:37,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 20:17:37,505 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-11-28 20:17:37,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:17:37,532 INFO L225 Difference]: With dead ends: 12285 [2018-11-28 20:17:37,532 INFO L226 Difference]: Without dead ends: 12213 [2018-11-28 20:17:37,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-11-28 20:17:37,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12213 states. [2018-11-28 20:17:37,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12213 to 10849. [2018-11-28 20:17:37,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10849 states. [2018-11-28 20:17:37,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10849 states to 10849 states and 34563 transitions. [2018-11-28 20:17:37,794 INFO L78 Accepts]: Start accepts. Automaton has 10849 states and 34563 transitions. Word has length 52 [2018-11-28 20:17:37,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:17:37,795 INFO L480 AbstractCegarLoop]: Abstraction has 10849 states and 34563 transitions. [2018-11-28 20:17:37,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:17:37,796 INFO L276 IsEmpty]: Start isEmpty. Operand 10849 states and 34563 transitions. [2018-11-28 20:17:37,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-28 20:17:37,809 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:17:37,809 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:17:37,812 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:17:37,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:17:37,812 INFO L82 PathProgramCache]: Analyzing trace with hash 317195842, now seen corresponding path program 1 times [2018-11-28 20:17:37,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:17:37,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:17:37,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:17:37,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:17:37,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:17:37,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:17:38,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:17:38,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:17:38,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:17:38,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:17:38,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:17:38,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:17:38,042 INFO L87 Difference]: Start difference. First operand 10849 states and 34563 transitions. Second operand 4 states. [2018-11-28 20:17:38,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:17:38,670 INFO L93 Difference]: Finished difference Result 12396 states and 39572 transitions. [2018-11-28 20:17:38,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:17:38,670 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-11-28 20:17:38,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:17:38,699 INFO L225 Difference]: With dead ends: 12396 [2018-11-28 20:17:38,700 INFO L226 Difference]: Without dead ends: 12396 [2018-11-28 20:17:38,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:17:38,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12396 states. [2018-11-28 20:17:39,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12396 to 11369. [2018-11-28 20:17:39,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11369 states. [2018-11-28 20:17:39,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11369 states to 11369 states and 36236 transitions. [2018-11-28 20:17:39,314 INFO L78 Accepts]: Start accepts. Automaton has 11369 states and 36236 transitions. Word has length 60 [2018-11-28 20:17:39,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:17:39,317 INFO L480 AbstractCegarLoop]: Abstraction has 11369 states and 36236 transitions. [2018-11-28 20:17:39,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:17:39,317 INFO L276 IsEmpty]: Start isEmpty. Operand 11369 states and 36236 transitions. [2018-11-28 20:17:39,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-28 20:17:39,326 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:17:39,327 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:17:39,327 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:17:39,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:17:39,327 INFO L82 PathProgramCache]: Analyzing trace with hash 2060006177, now seen corresponding path program 1 times [2018-11-28 20:17:39,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:17:39,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:17:39,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:17:39,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:17:39,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:17:39,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:17:39,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:17:39,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:17:39,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:17:39,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:17:39,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:17:39,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:17:39,755 INFO L87 Difference]: Start difference. First operand 11369 states and 36236 transitions. Second operand 6 states. [2018-11-28 20:17:41,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:17:41,492 INFO L93 Difference]: Finished difference Result 20969 states and 66486 transitions. [2018-11-28 20:17:41,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 20:17:41,493 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2018-11-28 20:17:41,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:17:41,535 INFO L225 Difference]: With dead ends: 20969 [2018-11-28 20:17:41,535 INFO L226 Difference]: Without dead ends: 20898 [2018-11-28 20:17:41,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-28 20:17:41,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20898 states. [2018-11-28 20:17:41,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20898 to 13755. [2018-11-28 20:17:41,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13755 states. [2018-11-28 20:17:41,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13755 states to 13755 states and 43280 transitions. [2018-11-28 20:17:41,896 INFO L78 Accepts]: Start accepts. Automaton has 13755 states and 43280 transitions. Word has length 60 [2018-11-28 20:17:41,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:17:41,897 INFO L480 AbstractCegarLoop]: Abstraction has 13755 states and 43280 transitions. [2018-11-28 20:17:41,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:17:41,897 INFO L276 IsEmpty]: Start isEmpty. Operand 13755 states and 43280 transitions. [2018-11-28 20:17:41,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-28 20:17:41,911 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:17:41,911 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:17:41,911 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:17:41,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:17:41,912 INFO L82 PathProgramCache]: Analyzing trace with hash 553940321, now seen corresponding path program 1 times [2018-11-28 20:17:41,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:17:41,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:17:41,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:17:41,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:17:41,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:17:41,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:17:42,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:17:42,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:17:42,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:17:42,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:17:42,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:17:42,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:17:42,180 INFO L87 Difference]: Start difference. First operand 13755 states and 43280 transitions. Second operand 4 states. [2018-11-28 20:17:42,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:17:42,896 INFO L93 Difference]: Finished difference Result 17635 states and 54585 transitions. [2018-11-28 20:17:42,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:17:42,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-11-28 20:17:42,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:17:42,930 INFO L225 Difference]: With dead ends: 17635 [2018-11-28 20:17:42,931 INFO L226 Difference]: Without dead ends: 17635 [2018-11-28 20:17:42,931 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-11-28 20:17:42,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17635 states. [2018-11-28 20:17:43,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17635 to 15793. [2018-11-28 20:17:43,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15793 states. [2018-11-28 20:17:43,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15793 states to 15793 states and 49131 transitions. [2018-11-28 20:17:43,233 INFO L78 Accepts]: Start accepts. Automaton has 15793 states and 49131 transitions. Word has length 64 [2018-11-28 20:17:43,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:17:43,234 INFO L480 AbstractCegarLoop]: Abstraction has 15793 states and 49131 transitions. [2018-11-28 20:17:43,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:17:43,234 INFO L276 IsEmpty]: Start isEmpty. Operand 15793 states and 49131 transitions. [2018-11-28 20:17:43,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-28 20:17:43,250 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:17:43,250 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:17:43,250 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:17:43,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:17:43,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1523269022, now seen corresponding path program 1 times [2018-11-28 20:17:43,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:17:43,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:17:43,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:17:43,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:17:43,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:17:43,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:17:43,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:17:43,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:17:43,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:17:43,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:17:43,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:17:43,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:17:43,392 INFO L87 Difference]: Start difference. First operand 15793 states and 49131 transitions. Second operand 3 states. [2018-11-28 20:17:43,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:17:43,803 INFO L93 Difference]: Finished difference Result 16385 states and 50738 transitions. [2018-11-28 20:17:43,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:17:43,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2018-11-28 20:17:43,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:17:43,833 INFO L225 Difference]: With dead ends: 16385 [2018-11-28 20:17:43,833 INFO L226 Difference]: Without dead ends: 16385 [2018-11-28 20:17:43,833 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-11-28 20:17:43,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16385 states. [2018-11-28 20:17:44,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16385 to 16109. [2018-11-28 20:17:44,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16109 states. [2018-11-28 20:17:44,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16109 states to 16109 states and 49981 transitions. [2018-11-28 20:17:44,549 INFO L78 Accepts]: Start accepts. Automaton has 16109 states and 49981 transitions. Word has length 64 [2018-11-28 20:17:44,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:17:44,549 INFO L480 AbstractCegarLoop]: Abstraction has 16109 states and 49981 transitions. [2018-11-28 20:17:44,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:17:44,549 INFO L276 IsEmpty]: Start isEmpty. Operand 16109 states and 49981 transitions. [2018-11-28 20:17:44,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 20:17:44,562 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:17:44,563 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:17:44,563 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:17:44,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:17:44,563 INFO L82 PathProgramCache]: Analyzing trace with hash 493974152, now seen corresponding path program 1 times [2018-11-28 20:17:44,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:17:44,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:17:44,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:17:44,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:17:44,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:17:44,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:17:44,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:17:44,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:17:44,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:17:44,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:17:44,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:17:44,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:17:44,877 INFO L87 Difference]: Start difference. First operand 16109 states and 49981 transitions. Second operand 6 states. [2018-11-28 20:17:46,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:17:46,277 INFO L93 Difference]: Finished difference Result 19821 states and 60437 transitions. [2018-11-28 20:17:46,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:17:46,278 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-11-28 20:17:46,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:17:46,312 INFO L225 Difference]: With dead ends: 19821 [2018-11-28 20:17:46,312 INFO L226 Difference]: Without dead ends: 19821 [2018-11-28 20:17:46,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:17:46,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19821 states. [2018-11-28 20:17:46,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19821 to 18617. [2018-11-28 20:17:46,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18617 states. [2018-11-28 20:17:46,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18617 states to 18617 states and 57217 transitions. [2018-11-28 20:17:46,611 INFO L78 Accepts]: Start accepts. Automaton has 18617 states and 57217 transitions. Word has length 66 [2018-11-28 20:17:46,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:17:46,611 INFO L480 AbstractCegarLoop]: Abstraction has 18617 states and 57217 transitions. [2018-11-28 20:17:46,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:17:46,611 INFO L276 IsEmpty]: Start isEmpty. Operand 18617 states and 57217 transitions. [2018-11-28 20:17:46,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 20:17:46,624 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:17:46,624 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:17:46,624 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:17:46,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:17:46,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1583235191, now seen corresponding path program 1 times [2018-11-28 20:17:46,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:17:46,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:17:46,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:17:46,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:17:46,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:17:46,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:17:46,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:17:46,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:17:46,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:17:46,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:17:46,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:17:46,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:17:46,827 INFO L87 Difference]: Start difference. First operand 18617 states and 57217 transitions. Second operand 6 states. [2018-11-28 20:17:47,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:17:47,430 INFO L93 Difference]: Finished difference Result 21449 states and 63626 transitions. [2018-11-28 20:17:47,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 20:17:47,432 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-11-28 20:17:47,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:17:47,469 INFO L225 Difference]: With dead ends: 21449 [2018-11-28 20:17:47,469 INFO L226 Difference]: Without dead ends: 21449 [2018-11-28 20:17:47,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:17:47,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21449 states. [2018-11-28 20:17:47,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21449 to 19133. [2018-11-28 20:17:47,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19133 states. [2018-11-28 20:17:47,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19133 states to 19133 states and 57764 transitions. [2018-11-28 20:17:47,787 INFO L78 Accepts]: Start accepts. Automaton has 19133 states and 57764 transitions. Word has length 66 [2018-11-28 20:17:47,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:17:47,787 INFO L480 AbstractCegarLoop]: Abstraction has 19133 states and 57764 transitions. [2018-11-28 20:17:47,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:17:47,787 INFO L276 IsEmpty]: Start isEmpty. Operand 19133 states and 57764 transitions. [2018-11-28 20:17:47,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 20:17:47,800 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:17:47,800 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:17:47,800 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:17:47,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:17:47,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1371884278, now seen corresponding path program 1 times [2018-11-28 20:17:47,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:17:47,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:17:47,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:17:47,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:17:47,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:17:47,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:17:47,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:17:47,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:17:47,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:17:47,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:17:47,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:17:47,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:17:47,971 INFO L87 Difference]: Start difference. First operand 19133 states and 57764 transitions. Second operand 5 states. [2018-11-28 20:17:49,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:17:49,119 INFO L93 Difference]: Finished difference Result 25024 states and 75018 transitions. [2018-11-28 20:17:49,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:17:49,120 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-11-28 20:17:49,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:17:49,164 INFO L225 Difference]: With dead ends: 25024 [2018-11-28 20:17:49,164 INFO L226 Difference]: Without dead ends: 25024 [2018-11-28 20:17:49,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:17:49,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25024 states. [2018-11-28 20:17:49,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25024 to 22709. [2018-11-28 20:17:49,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22709 states. [2018-11-28 20:17:49,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22709 states to 22709 states and 68032 transitions. [2018-11-28 20:17:49,544 INFO L78 Accepts]: Start accepts. Automaton has 22709 states and 68032 transitions. Word has length 66 [2018-11-28 20:17:49,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:17:49,545 INFO L480 AbstractCegarLoop]: Abstraction has 22709 states and 68032 transitions. [2018-11-28 20:17:49,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:17:49,545 INFO L276 IsEmpty]: Start isEmpty. Operand 22709 states and 68032 transitions. [2018-11-28 20:17:49,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 20:17:49,559 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:17:49,560 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:17:49,560 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:17:49,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:17:49,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1882418455, now seen corresponding path program 1 times [2018-11-28 20:17:49,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:17:49,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:17:49,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:17:49,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:17:49,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:17:49,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:17:49,939 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2018-11-28 20:17:50,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:17:50,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:17:50,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:17:50,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:17:50,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:17:50,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:17:50,024 INFO L87 Difference]: Start difference. First operand 22709 states and 68032 transitions. Second operand 6 states. [2018-11-28 20:17:51,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:17:51,078 INFO L93 Difference]: Finished difference Result 30713 states and 93495 transitions. [2018-11-28 20:17:51,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 20:17:51,079 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-11-28 20:17:51,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:17:51,139 INFO L225 Difference]: With dead ends: 30713 [2018-11-28 20:17:51,139 INFO L226 Difference]: Without dead ends: 30609 [2018-11-28 20:17:51,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:17:51,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30609 states. [2018-11-28 20:17:51,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30609 to 27953. [2018-11-28 20:17:51,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27953 states. [2018-11-28 20:17:51,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27953 states to 27953 states and 84685 transitions. [2018-11-28 20:17:51,638 INFO L78 Accepts]: Start accepts. Automaton has 27953 states and 84685 transitions. Word has length 66 [2018-11-28 20:17:51,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:17:51,639 INFO L480 AbstractCegarLoop]: Abstraction has 27953 states and 84685 transitions. [2018-11-28 20:17:51,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:17:51,639 INFO L276 IsEmpty]: Start isEmpty. Operand 27953 states and 84685 transitions. [2018-11-28 20:17:51,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 20:17:51,657 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:17:51,657 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:17:51,657 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:17:51,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:17:51,658 INFO L82 PathProgramCache]: Analyzing trace with hash -74963992, now seen corresponding path program 1 times [2018-11-28 20:17:51,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:17:51,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:17:51,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:17:51,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:17:51,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:17:51,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:17:51,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:17:51,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:17:51,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:17:51,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:17:51,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:17:51,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:17:51,903 INFO L87 Difference]: Start difference. First operand 27953 states and 84685 transitions. Second operand 5 states. [2018-11-28 20:17:52,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:17:52,608 INFO L93 Difference]: Finished difference Result 40003 states and 119732 transitions. [2018-11-28 20:17:52,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:17:52,609 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-11-28 20:17:52,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:17:52,685 INFO L225 Difference]: With dead ends: 40003 [2018-11-28 20:17:52,685 INFO L226 Difference]: Without dead ends: 39851 [2018-11-28 20:17:52,685 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-11-28 20:17:52,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39851 states. [2018-11-28 20:17:53,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39851 to 35599. [2018-11-28 20:17:53,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35599 states. [2018-11-28 20:17:53,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35599 states to 35599 states and 107263 transitions. [2018-11-28 20:17:53,360 INFO L78 Accepts]: Start accepts. Automaton has 35599 states and 107263 transitions. Word has length 66 [2018-11-28 20:17:53,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:17:53,360 INFO L480 AbstractCegarLoop]: Abstraction has 35599 states and 107263 transitions. [2018-11-28 20:17:53,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:17:53,360 INFO L276 IsEmpty]: Start isEmpty. Operand 35599 states and 107263 transitions. [2018-11-28 20:17:53,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 20:17:53,380 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:17:53,380 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:17:53,380 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:17:53,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:17:53,381 INFO L82 PathProgramCache]: Analyzing trace with hash 615597482, now seen corresponding path program 1 times [2018-11-28 20:17:53,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:17:53,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:17:53,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:17:53,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:17:53,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:17:53,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:17:53,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:17:53,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:17:53,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:17:53,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:17:53,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:17:53,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:17:53,463 INFO L87 Difference]: Start difference. First operand 35599 states and 107263 transitions. Second operand 5 states. [2018-11-28 20:17:53,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:17:53,546 INFO L93 Difference]: Finished difference Result 9283 states and 22466 transitions. [2018-11-28 20:17:53,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 20:17:53,547 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-11-28 20:17:53,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:17:53,557 INFO L225 Difference]: With dead ends: 9283 [2018-11-28 20:17:53,557 INFO L226 Difference]: Without dead ends: 7431 [2018-11-28 20:17:53,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:17:53,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7431 states. [2018-11-28 20:17:53,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7431 to 6328. [2018-11-28 20:17:53,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6328 states. [2018-11-28 20:17:53,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6328 states to 6328 states and 14937 transitions. [2018-11-28 20:17:53,663 INFO L78 Accepts]: Start accepts. Automaton has 6328 states and 14937 transitions. Word has length 66 [2018-11-28 20:17:53,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:17:53,663 INFO L480 AbstractCegarLoop]: Abstraction has 6328 states and 14937 transitions. [2018-11-28 20:17:53,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:17:53,664 INFO L276 IsEmpty]: Start isEmpty. Operand 6328 states and 14937 transitions. [2018-11-28 20:17:53,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 20:17:53,672 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:17:53,672 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:17:53,672 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:17:53,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:17:53,673 INFO L82 PathProgramCache]: Analyzing trace with hash 890203314, now seen corresponding path program 1 times [2018-11-28 20:17:53,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:17:53,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:17:53,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:17:53,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:17:53,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:17:53,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:17:54,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:17:54,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:17:54,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:17:54,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:17:54,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:17:54,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:17:54,034 INFO L87 Difference]: Start difference. First operand 6328 states and 14937 transitions. Second operand 3 states. [2018-11-28 20:17:54,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:17:54,087 INFO L93 Difference]: Finished difference Result 8755 states and 20596 transitions. [2018-11-28 20:17:54,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:17:54,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-11-28 20:17:54,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:17:54,099 INFO L225 Difference]: With dead ends: 8755 [2018-11-28 20:17:54,099 INFO L226 Difference]: Without dead ends: 8755 [2018-11-28 20:17:54,099 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-11-28 20:17:54,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8755 states. [2018-11-28 20:17:54,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8755 to 6267. [2018-11-28 20:17:54,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6267 states. [2018-11-28 20:17:54,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6267 states to 6267 states and 14477 transitions. [2018-11-28 20:17:54,179 INFO L78 Accepts]: Start accepts. Automaton has 6267 states and 14477 transitions. Word has length 66 [2018-11-28 20:17:54,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:17:54,179 INFO L480 AbstractCegarLoop]: Abstraction has 6267 states and 14477 transitions. [2018-11-28 20:17:54,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:17:54,180 INFO L276 IsEmpty]: Start isEmpty. Operand 6267 states and 14477 transitions. [2018-11-28 20:17:54,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-28 20:17:54,186 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:17:54,186 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:17:54,187 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:17:54,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:17:54,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1181781029, now seen corresponding path program 1 times [2018-11-28 20:17:54,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:17:54,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:17:54,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:17:54,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:17:54,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:17:54,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:17:54,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:17:54,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:17:54,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:17:54,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:17:54,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:17:54,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:17:54,312 INFO L87 Difference]: Start difference. First operand 6267 states and 14477 transitions. Second operand 5 states. [2018-11-28 20:17:54,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:17:54,536 INFO L93 Difference]: Finished difference Result 7437 states and 17118 transitions. [2018-11-28 20:17:54,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 20:17:54,537 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2018-11-28 20:17:54,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:17:54,546 INFO L225 Difference]: With dead ends: 7437 [2018-11-28 20:17:54,547 INFO L226 Difference]: Without dead ends: 7437 [2018-11-28 20:17:54,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:17:54,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7437 states. [2018-11-28 20:17:54,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7437 to 6711. [2018-11-28 20:17:54,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6711 states. [2018-11-28 20:17:54,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6711 states to 6711 states and 15481 transitions. [2018-11-28 20:17:54,625 INFO L78 Accepts]: Start accepts. Automaton has 6711 states and 15481 transitions. Word has length 72 [2018-11-28 20:17:54,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:17:54,626 INFO L480 AbstractCegarLoop]: Abstraction has 6711 states and 15481 transitions. [2018-11-28 20:17:54,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:17:54,626 INFO L276 IsEmpty]: Start isEmpty. Operand 6711 states and 15481 transitions. [2018-11-28 20:17:54,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-28 20:17:54,633 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:17:54,633 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:17:54,633 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:17:54,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:17:54,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1370375932, now seen corresponding path program 1 times [2018-11-28 20:17:54,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:17:54,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:17:54,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:17:54,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:17:54,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:17:54,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:17:54,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:17:54,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:17:54,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 20:17:54,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 20:17:54,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 20:17:54,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:17:54,895 INFO L87 Difference]: Start difference. First operand 6711 states and 15481 transitions. Second operand 9 states. [2018-11-28 20:17:55,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:17:55,735 INFO L93 Difference]: Finished difference Result 8913 states and 20402 transitions. [2018-11-28 20:17:55,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 20:17:55,737 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2018-11-28 20:17:55,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:17:55,748 INFO L225 Difference]: With dead ends: 8913 [2018-11-28 20:17:55,748 INFO L226 Difference]: Without dead ends: 8794 [2018-11-28 20:17:55,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-11-28 20:17:55,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8794 states. [2018-11-28 20:17:55,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8794 to 6808. [2018-11-28 20:17:55,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6808 states. [2018-11-28 20:17:55,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6808 states to 6808 states and 15574 transitions. [2018-11-28 20:17:55,837 INFO L78 Accepts]: Start accepts. Automaton has 6808 states and 15574 transitions. Word has length 72 [2018-11-28 20:17:55,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:17:55,837 INFO L480 AbstractCegarLoop]: Abstraction has 6808 states and 15574 transitions. [2018-11-28 20:17:55,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 20:17:55,837 INFO L276 IsEmpty]: Start isEmpty. Operand 6808 states and 15574 transitions. [2018-11-28 20:17:55,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 20:17:55,847 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:17:55,847 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:17:55,848 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:17:55,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:17:55,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1666827177, now seen corresponding path program 1 times [2018-11-28 20:17:55,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:17:55,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:17:55,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:17:55,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:17:55,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:17:55,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:17:56,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:17:56,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:17:56,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:17:56,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:17:56,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:17:56,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:17:56,078 INFO L87 Difference]: Start difference. First operand 6808 states and 15574 transitions. Second operand 4 states. [2018-11-28 20:17:57,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:17:57,028 INFO L93 Difference]: Finished difference Result 10575 states and 24061 transitions. [2018-11-28 20:17:57,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:17:57,029 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-11-28 20:17:57,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:17:57,042 INFO L225 Difference]: With dead ends: 10575 [2018-11-28 20:17:57,043 INFO L226 Difference]: Without dead ends: 10575 [2018-11-28 20:17:57,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:17:57,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10575 states. [2018-11-28 20:17:57,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10575 to 7928. [2018-11-28 20:17:57,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7928 states. [2018-11-28 20:17:57,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7928 states to 7928 states and 17908 transitions. [2018-11-28 20:17:57,149 INFO L78 Accepts]: Start accepts. Automaton has 7928 states and 17908 transitions. Word has length 91 [2018-11-28 20:17:57,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:17:57,150 INFO L480 AbstractCegarLoop]: Abstraction has 7928 states and 17908 transitions. [2018-11-28 20:17:57,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:17:57,150 INFO L276 IsEmpty]: Start isEmpty. Operand 7928 states and 17908 transitions. [2018-11-28 20:17:57,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 20:17:57,158 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:17:57,159 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-28 20:17:57,159 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:17:57,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:17:57,159 INFO L82 PathProgramCache]: Analyzing trace with hash 496143053, now seen corresponding path program 1 times [2018-11-28 20:17:57,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:17:57,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:17:57,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:17:57,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:17:57,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:17:57,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:17:57,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:17:57,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:17:57,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:17:57,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:17:57,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:17:57,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:17:57,397 INFO L87 Difference]: Start difference. First operand 7928 states and 17908 transitions. Second operand 4 states. [2018-11-28 20:17:57,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:17:57,810 INFO L93 Difference]: Finished difference Result 8493 states and 19201 transitions. [2018-11-28 20:17:57,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:17:57,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-11-28 20:17:57,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:17:57,821 INFO L225 Difference]: With dead ends: 8493 [2018-11-28 20:17:57,822 INFO L226 Difference]: Without dead ends: 8493 [2018-11-28 20:17:57,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:17:57,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8493 states. [2018-11-28 20:17:57,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8493 to 7834. [2018-11-28 20:17:57,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7834 states. [2018-11-28 20:17:57,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7834 states to 7834 states and 17803 transitions. [2018-11-28 20:17:57,913 INFO L78 Accepts]: Start accepts. Automaton has 7834 states and 17803 transitions. Word has length 91 [2018-11-28 20:17:57,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:17:57,914 INFO L480 AbstractCegarLoop]: Abstraction has 7834 states and 17803 transitions. [2018-11-28 20:17:57,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:17:57,914 INFO L276 IsEmpty]: Start isEmpty. Operand 7834 states and 17803 transitions. [2018-11-28 20:17:57,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 20:17:57,923 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:17:57,923 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:17:57,923 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:17:57,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:17:57,924 INFO L82 PathProgramCache]: Analyzing trace with hash -471503779, now seen corresponding path program 1 times [2018-11-28 20:17:57,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:17:57,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:17:57,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:17:57,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:17:57,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:17:57,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:17:58,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:17:58,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:17:58,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:17:58,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:17:58,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:17:58,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:17:58,059 INFO L87 Difference]: Start difference. First operand 7834 states and 17803 transitions. Second operand 7 states. [2018-11-28 20:17:59,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:17:59,919 INFO L93 Difference]: Finished difference Result 9672 states and 21911 transitions. [2018-11-28 20:17:59,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:17:59,920 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-11-28 20:17:59,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:17:59,932 INFO L225 Difference]: With dead ends: 9672 [2018-11-28 20:17:59,932 INFO L226 Difference]: Without dead ends: 9672 [2018-11-28 20:17:59,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:17:59,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9672 states. [2018-11-28 20:18:00,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9672 to 7946. [2018-11-28 20:18:00,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7946 states. [2018-11-28 20:18:00,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7946 states to 7946 states and 18123 transitions. [2018-11-28 20:18:00,033 INFO L78 Accepts]: Start accepts. Automaton has 7946 states and 18123 transitions. Word has length 93 [2018-11-28 20:18:00,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:18:00,034 INFO L480 AbstractCegarLoop]: Abstraction has 7946 states and 18123 transitions. [2018-11-28 20:18:00,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:18:00,034 INFO L276 IsEmpty]: Start isEmpty. Operand 7946 states and 18123 transitions. [2018-11-28 20:18:00,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 20:18:00,044 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:18:00,044 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:18:00,045 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:18:00,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:18:00,046 INFO L82 PathProgramCache]: Analyzing trace with hash -2034999584, now seen corresponding path program 1 times [2018-11-28 20:18:00,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:18:00,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:18:00,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:00,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:18:00,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:00,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:18:00,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:18:00,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:18:00,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:18:00,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:18:00,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:18:00,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:18:00,263 INFO L87 Difference]: Start difference. First operand 7946 states and 18123 transitions. Second operand 5 states. [2018-11-28 20:18:00,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:18:00,397 INFO L93 Difference]: Finished difference Result 8853 states and 20081 transitions. [2018-11-28 20:18:00,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:18:00,398 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-11-28 20:18:00,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:18:00,408 INFO L225 Difference]: With dead ends: 8853 [2018-11-28 20:18:00,408 INFO L226 Difference]: Without dead ends: 8853 [2018-11-28 20:18:00,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:18:00,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8853 states. [2018-11-28 20:18:00,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8853 to 6842. [2018-11-28 20:18:00,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6842 states. [2018-11-28 20:18:00,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6842 states to 6842 states and 15642 transitions. [2018-11-28 20:18:00,499 INFO L78 Accepts]: Start accepts. Automaton has 6842 states and 15642 transitions. Word has length 93 [2018-11-28 20:18:00,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:18:00,500 INFO L480 AbstractCegarLoop]: Abstraction has 6842 states and 15642 transitions. [2018-11-28 20:18:00,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:18:00,500 INFO L276 IsEmpty]: Start isEmpty. Operand 6842 states and 15642 transitions. [2018-11-28 20:18:00,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 20:18:00,508 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:18:00,508 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:18:00,508 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:18:00,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:18:00,508 INFO L82 PathProgramCache]: Analyzing trace with hash 2005231167, now seen corresponding path program 1 times [2018-11-28 20:18:00,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:18:00,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:18:00,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:00,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:18:00,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:00,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:18:00,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:18:00,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:18:00,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:18:00,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:18:00,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:18:00,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:18:00,644 INFO L87 Difference]: Start difference. First operand 6842 states and 15642 transitions. Second operand 5 states. [2018-11-28 20:18:01,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:18:01,269 INFO L93 Difference]: Finished difference Result 11344 states and 26131 transitions. [2018-11-28 20:18:01,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 20:18:01,270 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-11-28 20:18:01,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:18:01,285 INFO L225 Difference]: With dead ends: 11344 [2018-11-28 20:18:01,285 INFO L226 Difference]: Without dead ends: 11266 [2018-11-28 20:18:01,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:18:01,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11266 states. [2018-11-28 20:18:01,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11266 to 7983. [2018-11-28 20:18:01,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7983 states. [2018-11-28 20:18:01,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7983 states to 7983 states and 18289 transitions. [2018-11-28 20:18:01,401 INFO L78 Accepts]: Start accepts. Automaton has 7983 states and 18289 transitions. Word has length 93 [2018-11-28 20:18:01,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:18:01,402 INFO L480 AbstractCegarLoop]: Abstraction has 7983 states and 18289 transitions. [2018-11-28 20:18:01,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:18:01,402 INFO L276 IsEmpty]: Start isEmpty. Operand 7983 states and 18289 transitions. [2018-11-28 20:18:01,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 20:18:01,414 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:18:01,414 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:18:01,414 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:18:01,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:18:01,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1044971648, now seen corresponding path program 1 times [2018-11-28 20:18:01,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:18:01,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:18:01,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:01,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:18:01,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:01,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:18:01,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:18:01,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:18:01,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:18:01,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:18:01,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:18:01,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:18:01,936 INFO L87 Difference]: Start difference. First operand 7983 states and 18289 transitions. Second operand 6 states. [2018-11-28 20:18:03,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:18:03,192 INFO L93 Difference]: Finished difference Result 10118 states and 23011 transitions. [2018-11-28 20:18:03,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 20:18:03,193 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-11-28 20:18:03,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:18:03,206 INFO L225 Difference]: With dead ends: 10118 [2018-11-28 20:18:03,206 INFO L226 Difference]: Without dead ends: 10039 [2018-11-28 20:18:03,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-28 20:18:03,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10039 states. [2018-11-28 20:18:03,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10039 to 7582. [2018-11-28 20:18:03,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7582 states. [2018-11-28 20:18:03,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7582 states to 7582 states and 17399 transitions. [2018-11-28 20:18:03,311 INFO L78 Accepts]: Start accepts. Automaton has 7582 states and 17399 transitions. Word has length 93 [2018-11-28 20:18:03,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:18:03,311 INFO L480 AbstractCegarLoop]: Abstraction has 7582 states and 17399 transitions. [2018-11-28 20:18:03,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:18:03,311 INFO L276 IsEmpty]: Start isEmpty. Operand 7582 states and 17399 transitions. [2018-11-28 20:18:03,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 20:18:03,321 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:18:03,321 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:18:03,321 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:18:03,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:18:03,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1661415981, now seen corresponding path program 1 times [2018-11-28 20:18:03,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:18:03,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:18:03,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:03,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:18:03,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:03,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:18:03,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:18:03,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:18:03,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 20:18:03,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 20:18:03,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 20:18:03,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:18:03,830 INFO L87 Difference]: Start difference. First operand 7582 states and 17399 transitions. Second operand 9 states. [2018-11-28 20:18:04,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:18:04,661 INFO L93 Difference]: Finished difference Result 10662 states and 24405 transitions. [2018-11-28 20:18:04,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-28 20:18:04,663 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2018-11-28 20:18:04,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:18:04,677 INFO L225 Difference]: With dead ends: 10662 [2018-11-28 20:18:04,677 INFO L226 Difference]: Without dead ends: 10630 [2018-11-28 20:18:04,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-11-28 20:18:04,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10630 states. [2018-11-28 20:18:04,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10630 to 9163. [2018-11-28 20:18:04,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9163 states. [2018-11-28 20:18:04,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9163 states to 9163 states and 20929 transitions. [2018-11-28 20:18:04,802 INFO L78 Accepts]: Start accepts. Automaton has 9163 states and 20929 transitions. Word has length 93 [2018-11-28 20:18:04,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:18:04,802 INFO L480 AbstractCegarLoop]: Abstraction has 9163 states and 20929 transitions. [2018-11-28 20:18:04,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 20:18:04,802 INFO L276 IsEmpty]: Start isEmpty. Operand 9163 states and 20929 transitions. [2018-11-28 20:18:04,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 20:18:04,813 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:18:04,813 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:18:04,815 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:18:04,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:18:04,815 INFO L82 PathProgramCache]: Analyzing trace with hash 836599956, now seen corresponding path program 1 times [2018-11-28 20:18:04,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:18:04,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:18:04,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:04,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:18:04,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:04,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:18:04,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:18:04,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:18:04,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 20:18:04,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 20:18:04,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 20:18:04,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:18:04,945 INFO L87 Difference]: Start difference. First operand 9163 states and 20929 transitions. Second operand 8 states. [2018-11-28 20:18:05,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:18:05,453 INFO L93 Difference]: Finished difference Result 14219 states and 32893 transitions. [2018-11-28 20:18:05,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 20:18:05,455 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2018-11-28 20:18:05,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:18:05,473 INFO L225 Difference]: With dead ends: 14219 [2018-11-28 20:18:05,473 INFO L226 Difference]: Without dead ends: 14219 [2018-11-28 20:18:05,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-11-28 20:18:05,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14219 states. [2018-11-28 20:18:05,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14219 to 9753. [2018-11-28 20:18:05,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9753 states. [2018-11-28 20:18:05,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9753 states to 9753 states and 22460 transitions. [2018-11-28 20:18:05,623 INFO L78 Accepts]: Start accepts. Automaton has 9753 states and 22460 transitions. Word has length 93 [2018-11-28 20:18:05,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:18:05,623 INFO L480 AbstractCegarLoop]: Abstraction has 9753 states and 22460 transitions. [2018-11-28 20:18:05,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 20:18:05,624 INFO L276 IsEmpty]: Start isEmpty. Operand 9753 states and 22460 transitions. [2018-11-28 20:18:05,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 20:18:05,635 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:18:05,635 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:18:05,636 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:18:05,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:18:05,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1724103637, now seen corresponding path program 1 times [2018-11-28 20:18:05,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:18:05,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:18:05,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:05,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:18:05,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:05,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:18:05,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:18:05,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:18:05,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:18:05,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:18:05,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:18:05,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:18:05,833 INFO L87 Difference]: Start difference. First operand 9753 states and 22460 transitions. Second operand 7 states. [2018-11-28 20:18:06,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:18:06,035 INFO L93 Difference]: Finished difference Result 13588 states and 31510 transitions. [2018-11-28 20:18:06,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:18:06,036 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-11-28 20:18:06,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:18:06,052 INFO L225 Difference]: With dead ends: 13588 [2018-11-28 20:18:06,053 INFO L226 Difference]: Without dead ends: 13588 [2018-11-28 20:18:06,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-28 20:18:06,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13588 states. [2018-11-28 20:18:06,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13588 to 9833. [2018-11-28 20:18:06,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9833 states. [2018-11-28 20:18:06,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9833 states to 9833 states and 22391 transitions. [2018-11-28 20:18:06,191 INFO L78 Accepts]: Start accepts. Automaton has 9833 states and 22391 transitions. Word has length 93 [2018-11-28 20:18:06,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:18:06,191 INFO L480 AbstractCegarLoop]: Abstraction has 9833 states and 22391 transitions. [2018-11-28 20:18:06,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:18:06,192 INFO L276 IsEmpty]: Start isEmpty. Operand 9833 states and 22391 transitions. [2018-11-28 20:18:06,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 20:18:06,203 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:18:06,203 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:18:06,204 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:18:06,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:18:06,204 INFO L82 PathProgramCache]: Analyzing trace with hash -7871915, now seen corresponding path program 1 times [2018-11-28 20:18:06,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:18:06,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:18:06,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:06,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:18:06,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:06,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:18:06,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:18:06,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:18:06,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:18:06,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:18:06,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:18:06,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:18:06,375 INFO L87 Difference]: Start difference. First operand 9833 states and 22391 transitions. Second operand 6 states. [2018-11-28 20:18:06,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:18:06,542 INFO L93 Difference]: Finished difference Result 9353 states and 20935 transitions. [2018-11-28 20:18:06,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:18:06,543 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-11-28 20:18:06,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:18:06,554 INFO L225 Difference]: With dead ends: 9353 [2018-11-28 20:18:06,554 INFO L226 Difference]: Without dead ends: 9353 [2018-11-28 20:18:06,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:18:06,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9353 states. [2018-11-28 20:18:06,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9353 to 5822. [2018-11-28 20:18:06,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5822 states. [2018-11-28 20:18:06,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5822 states to 5822 states and 13049 transitions. [2018-11-28 20:18:06,646 INFO L78 Accepts]: Start accepts. Automaton has 5822 states and 13049 transitions. Word has length 93 [2018-11-28 20:18:06,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:18:06,646 INFO L480 AbstractCegarLoop]: Abstraction has 5822 states and 13049 transitions. [2018-11-28 20:18:06,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:18:06,646 INFO L276 IsEmpty]: Start isEmpty. Operand 5822 states and 13049 transitions. [2018-11-28 20:18:06,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-28 20:18:06,653 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:18:06,653 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:18:06,653 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:18:06,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:18:06,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1803035193, now seen corresponding path program 1 times [2018-11-28 20:18:06,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:18:06,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:18:06,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:06,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:18:06,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:06,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:18:06,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:18:06,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:18:06,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:18:06,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:18:06,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:18:06,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:18:06,892 INFO L87 Difference]: Start difference. First operand 5822 states and 13049 transitions. Second operand 5 states. [2018-11-28 20:18:06,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:18:06,937 INFO L93 Difference]: Finished difference Result 5822 states and 13033 transitions. [2018-11-28 20:18:06,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:18:06,939 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2018-11-28 20:18:06,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:18:06,947 INFO L225 Difference]: With dead ends: 5822 [2018-11-28 20:18:06,947 INFO L226 Difference]: Without dead ends: 5822 [2018-11-28 20:18:06,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:18:06,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5822 states. [2018-11-28 20:18:07,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5822 to 5822. [2018-11-28 20:18:07,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5822 states. [2018-11-28 20:18:07,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5822 states to 5822 states and 13033 transitions. [2018-11-28 20:18:07,012 INFO L78 Accepts]: Start accepts. Automaton has 5822 states and 13033 transitions. Word has length 95 [2018-11-28 20:18:07,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:18:07,012 INFO L480 AbstractCegarLoop]: Abstraction has 5822 states and 13033 transitions. [2018-11-28 20:18:07,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:18:07,012 INFO L276 IsEmpty]: Start isEmpty. Operand 5822 states and 13033 transitions. [2018-11-28 20:18:07,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-28 20:18:07,020 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:18:07,020 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:18:07,021 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:18:07,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:18:07,021 INFO L82 PathProgramCache]: Analyzing trace with hash -915531512, now seen corresponding path program 1 times [2018-11-28 20:18:07,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:18:07,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:18:07,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:07,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:18:07,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:07,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:18:07,338 WARN L180 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-28 20:18:07,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:18:07,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:18:07,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 20:18:07,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 20:18:07,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 20:18:07,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-28 20:18:07,520 INFO L87 Difference]: Start difference. First operand 5822 states and 13033 transitions. Second operand 11 states. [2018-11-28 20:18:09,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:18:09,331 INFO L93 Difference]: Finished difference Result 10998 states and 24764 transitions. [2018-11-28 20:18:09,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 20:18:09,332 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2018-11-28 20:18:09,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:18:09,342 INFO L225 Difference]: With dead ends: 10998 [2018-11-28 20:18:09,342 INFO L226 Difference]: Without dead ends: 7682 [2018-11-28 20:18:09,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-11-28 20:18:09,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7682 states. [2018-11-28 20:18:09,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7682 to 5708. [2018-11-28 20:18:09,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5708 states. [2018-11-28 20:18:09,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5708 states to 5708 states and 12720 transitions. [2018-11-28 20:18:09,412 INFO L78 Accepts]: Start accepts. Automaton has 5708 states and 12720 transitions. Word has length 95 [2018-11-28 20:18:09,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:18:09,412 INFO L480 AbstractCegarLoop]: Abstraction has 5708 states and 12720 transitions. [2018-11-28 20:18:09,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 20:18:09,413 INFO L276 IsEmpty]: Start isEmpty. Operand 5708 states and 12720 transitions. [2018-11-28 20:18:09,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-28 20:18:09,419 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:18:09,419 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-28 20:18:09,420 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:18:09,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:18:09,420 INFO L82 PathProgramCache]: Analyzing trace with hash 2034339057, now seen corresponding path program 1 times [2018-11-28 20:18:09,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:18:09,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:18:09,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:09,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:18:09,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:09,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:18:09,826 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-11-28 20:18:10,054 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 16 [2018-11-28 20:18:10,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:18:10,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:18:10,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:18:10,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:18:10,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:18:10,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:18:10,066 INFO L87 Difference]: Start difference. First operand 5708 states and 12720 transitions. Second operand 6 states. [2018-11-28 20:18:10,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:18:10,244 INFO L93 Difference]: Finished difference Result 6462 states and 14232 transitions. [2018-11-28 20:18:10,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:18:10,245 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2018-11-28 20:18:10,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:18:10,254 INFO L225 Difference]: With dead ends: 6462 [2018-11-28 20:18:10,254 INFO L226 Difference]: Without dead ends: 6432 [2018-11-28 20:18:10,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:18:10,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6432 states. [2018-11-28 20:18:10,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6432 to 5653. [2018-11-28 20:18:10,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5653 states. [2018-11-28 20:18:10,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5653 states to 5653 states and 12502 transitions. [2018-11-28 20:18:10,323 INFO L78 Accepts]: Start accepts. Automaton has 5653 states and 12502 transitions. Word has length 95 [2018-11-28 20:18:10,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:18:10,323 INFO L480 AbstractCegarLoop]: Abstraction has 5653 states and 12502 transitions. [2018-11-28 20:18:10,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:18:10,323 INFO L276 IsEmpty]: Start isEmpty. Operand 5653 states and 12502 transitions. [2018-11-28 20:18:10,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-28 20:18:10,329 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:18:10,330 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:18:10,330 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:18:10,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:18:10,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1697868305, now seen corresponding path program 2 times [2018-11-28 20:18:10,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:18:10,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:18:10,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:10,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:18:10,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:10,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:18:10,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:18:10,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:18:10,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:18:10,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:18:10,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:18:10,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:18:10,497 INFO L87 Difference]: Start difference. First operand 5653 states and 12502 transitions. Second operand 6 states. [2018-11-28 20:18:10,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:18:10,716 INFO L93 Difference]: Finished difference Result 6090 states and 13395 transitions. [2018-11-28 20:18:10,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:18:10,718 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2018-11-28 20:18:10,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:18:10,726 INFO L225 Difference]: With dead ends: 6090 [2018-11-28 20:18:10,726 INFO L226 Difference]: Without dead ends: 6090 [2018-11-28 20:18:10,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:18:10,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6090 states. [2018-11-28 20:18:10,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6090 to 5579. [2018-11-28 20:18:10,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5579 states. [2018-11-28 20:18:10,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5579 states to 5579 states and 12324 transitions. [2018-11-28 20:18:10,794 INFO L78 Accepts]: Start accepts. Automaton has 5579 states and 12324 transitions. Word has length 95 [2018-11-28 20:18:10,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:18:10,794 INFO L480 AbstractCegarLoop]: Abstraction has 5579 states and 12324 transitions. [2018-11-28 20:18:10,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:18:10,794 INFO L276 IsEmpty]: Start isEmpty. Operand 5579 states and 12324 transitions. [2018-11-28 20:18:10,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-28 20:18:10,801 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:18:10,801 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:18:10,801 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:18:10,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:18:10,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1930862478, now seen corresponding path program 2 times [2018-11-28 20:18:10,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:18:10,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:18:10,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:10,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 20:18:10,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:18:10,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 20:18:10,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 20:18:10,883 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 20:18:11,055 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-11-28 20:18:11,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:18:11 BasicIcfg [2018-11-28 20:18:11,060 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 20:18:11,060 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 20:18:11,060 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 20:18:11,060 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 20:18:11,061 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:17:24" (3/4) ... [2018-11-28 20:18:11,069 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 20:18:11,305 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 20:18:11,309 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 20:18:11,310 INFO L168 Benchmark]: Toolchain (without parser) took 49722.04 ms. Allocated memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: 1.8 GB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -161.1 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2018-11-28 20:18:11,312 INFO L168 Benchmark]: CDTParser took 0.43 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 20:18:11,312 INFO L168 Benchmark]: CACSL2BoogieTranslator took 954.75 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -132.5 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2018-11-28 20:18:11,313 INFO L168 Benchmark]: Boogie Procedure Inliner took 98.11 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-11-28 20:18:11,313 INFO L168 Benchmark]: Boogie Preprocessor took 46.12 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 20:18:11,313 INFO L168 Benchmark]: RCFGBuilder took 1466.83 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.7 MB). Peak memory consumption was 47.7 MB. Max. memory is 11.5 GB. [2018-11-28 20:18:11,313 INFO L168 Benchmark]: TraceAbstraction took 46902.25 ms. Allocated memory was 1.1 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -127.3 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2018-11-28 20:18:11,317 INFO L168 Benchmark]: Witness Printer took 248.73 ms. Allocated memory is still 2.9 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 38.6 MB). Peak memory consumption was 38.6 MB. Max. memory is 11.5 GB. [2018-11-28 20:18:11,320 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.43 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 954.75 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -132.5 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 98.11 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.12 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1466.83 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.7 MB). Peak memory consumption was 47.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 46902.25 ms. Allocated memory was 1.1 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -127.3 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. * Witness Printer took 248.73 ms. Allocated memory is still 2.9 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 38.6 MB). Peak memory consumption was 38.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L675] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L681] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L682] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L683] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L684] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L685] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L686] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L687] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L688] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L689] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L690] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L691] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L692] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L693] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L694] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L695] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L696] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L697] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L770] -1 pthread_t t1553; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] FCALL, FORK -1 pthread_create(&t1553, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L701] 0 y$w_buff1 = y$w_buff0 [L702] 0 y$w_buff0 = 1 [L703] 0 y$w_buff1_used = y$w_buff0_used [L704] 0 y$w_buff0_used = (_Bool)1 [L772] -1 pthread_t t1554; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] FCALL, FORK -1 pthread_create(&t1554, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L706] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L707] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L708] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L709] 0 y$r_buff0_thd1 = (_Bool)1 [L712] 0 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L715] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 x = 1 [L732] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L733] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L734] 1 y$flush_delayed = weak$$choice2 [L735] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L737] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L737] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L738] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L739] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L740] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L741] EXPR 1 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L742] EXPR 1 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L743] 1 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L715] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L744] 1 y = y$flush_delayed ? y$mem_tmp : y [L745] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L716] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L716] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L717] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L718] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L718] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L719] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L722] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L748] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L748] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L750] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L751] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L752] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L780] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L781] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L782] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L782] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L783] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L786] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 222 locations, 3 error locations. UNSAFE Result, 46.6s OverallTime, 33 OverallIterations, 1 TraceHistogramMax, 25.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8461 SDtfs, 9386 SDslu, 19599 SDs, 0 SdLazy, 8854 SolverSat, 448 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 323 GetRequests, 84 SyntacticMatches, 31 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 9.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35599occurred in iteration=14, 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: 8.6s AutomataMinimizationTime, 32 MinimizatonAttempts, 84819 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 2479 NumberOfCodeBlocks, 2479 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2352 ConstructedInterpolants, 0 QuantifiedInterpolants, 525251 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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...