./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix042_rmo.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/mix042_rmo.opt_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a99d57a1eed70a2c92247fcea50713c025ae5730 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 21:14:36,494 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 21:14:36,496 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 21:14:36,515 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 21:14:36,516 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 21:14:36,518 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 21:14:36,520 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 21:14:36,523 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 21:14:36,526 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 21:14:36,529 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 21:14:36,533 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 21:14:36,534 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 21:14:36,535 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 21:14:36,539 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 21:14:36,545 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 21:14:36,547 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 21:14:36,551 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 21:14:36,554 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 21:14:36,560 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 21:14:36,563 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 21:14:36,566 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 21:14:36,569 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 21:14:36,573 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 21:14:36,577 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 21:14:36,578 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 21:14:36,579 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 21:14:36,580 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 21:14:36,583 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 21:14:36,585 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 21:14:36,587 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 21:14:36,589 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 21:14:36,589 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 21:14:36,590 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 21:14:36,590 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 21:14:36,593 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 21:14:36,594 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 21:14:36,594 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 21:14:36,626 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 21:14:36,627 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 21:14:36,628 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 21:14:36,628 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 21:14:36,628 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 21:14:36,629 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 21:14:36,629 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 21:14:36,629 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 21:14:36,629 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 21:14:36,629 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 21:14:36,630 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 21:14:36,632 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 21:14:36,632 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 21:14:36,632 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 21:14:36,632 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 21:14:36,633 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 21:14:36,633 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 21:14:36,633 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 21:14:36,634 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 21:14:36,634 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 21:14:36,634 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 21:14:36,634 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 21:14:36,634 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 21:14:36,634 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 21:14:36,637 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 21:14:36,637 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 21:14:36,637 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 21:14:36,637 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 21:14:36,639 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 -> a99d57a1eed70a2c92247fcea50713c025ae5730 [2018-12-31 21:14:36,696 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 21:14:36,713 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 21:14:36,717 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 21:14:36,718 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 21:14:36,719 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 21:14:36,720 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix042_rmo.opt_false-unreach-call.i [2018-12-31 21:14:36,795 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/785f37883/9af71e168089448e9c1eb547c89ed8e3/FLAGa7b2850fe [2018-12-31 21:14:37,339 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 21:14:37,340 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix042_rmo.opt_false-unreach-call.i [2018-12-31 21:14:37,360 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/785f37883/9af71e168089448e9c1eb547c89ed8e3/FLAGa7b2850fe [2018-12-31 21:14:37,602 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/785f37883/9af71e168089448e9c1eb547c89ed8e3 [2018-12-31 21:14:37,605 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 21:14:37,607 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 21:14:37,608 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 21:14:37,608 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 21:14:37,612 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 21:14:37,613 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:14:37" (1/1) ... [2018-12-31 21:14:37,616 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7361d832 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:14:37, skipping insertion in model container [2018-12-31 21:14:37,616 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:14:37" (1/1) ... [2018-12-31 21:14:37,625 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 21:14:37,695 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 21:14:38,246 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 21:14:38,272 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 21:14:38,420 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 21:14:38,513 INFO L195 MainTranslator]: Completed translation [2018-12-31 21:14:38,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:14:38 WrapperNode [2018-12-31 21:14:38,513 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 21:14:38,514 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 21:14:38,514 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 21:14:38,515 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 21:14:38,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:14:38" (1/1) ... [2018-12-31 21:14:38,551 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:14:38" (1/1) ... [2018-12-31 21:14:38,600 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 21:14:38,601 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 21:14:38,601 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 21:14:38,601 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 21:14:38,612 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:14:38" (1/1) ... [2018-12-31 21:14:38,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:14:38" (1/1) ... [2018-12-31 21:14:38,619 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:14:38" (1/1) ... [2018-12-31 21:14:38,619 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:14:38" (1/1) ... [2018-12-31 21:14:38,633 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:14:38" (1/1) ... [2018-12-31 21:14:38,638 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:14:38" (1/1) ... [2018-12-31 21:14:38,642 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:14:38" (1/1) ... [2018-12-31 21:14:38,648 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 21:14:38,649 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 21:14:38,649 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 21:14:38,649 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 21:14:38,652 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:14:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 21:14:38,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 21:14:38,732 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-31 21:14:38,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 21:14:38,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 21:14:38,732 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-31 21:14:38,732 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-31 21:14:38,732 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-31 21:14:38,733 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-31 21:14:38,733 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-31 21:14:38,733 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-31 21:14:38,733 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-31 21:14:38,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 21:14:38,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 21:14:38,735 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-31 21:14:40,012 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 21:14:40,013 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-31 21:14:40,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:14:40 BoogieIcfgContainer [2018-12-31 21:14:40,014 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 21:14:40,016 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 21:14:40,016 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 21:14:40,019 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 21:14:40,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 09:14:37" (1/3) ... [2018-12-31 21:14:40,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f2476ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:14:40, skipping insertion in model container [2018-12-31 21:14:40,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:14:38" (2/3) ... [2018-12-31 21:14:40,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f2476ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:14:40, skipping insertion in model container [2018-12-31 21:14:40,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:14:40" (3/3) ... [2018-12-31 21:14:40,022 INFO L112 eAbstractionObserver]: Analyzing ICFG mix042_rmo.opt_false-unreach-call.i [2018-12-31 21:14:40,078 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,079 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,079 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,080 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,080 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,080 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,080 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,082 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,082 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,082 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,083 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,084 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,085 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,085 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,085 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,085 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,087 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,088 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,088 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,088 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,088 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,089 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,089 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,089 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,089 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,089 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,092 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,093 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,093 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,093 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,094 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,094 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,094 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,094 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,094 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,095 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,096 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,096 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,097 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,098 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,098 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,098 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,098 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,098 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,101 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,101 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,103 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,103 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,103 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,103 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,103 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,104 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,105 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,105 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,105 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,108 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,108 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,108 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,108 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,109 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,110 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,110 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,110 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,110 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,110 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,112 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,112 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,112 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,112 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,113 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,113 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,113 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,114 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,118 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,118 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,118 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,120 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,120 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,120 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,121 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,121 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,121 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:14:40,169 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-31 21:14:40,170 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 21:14:40,180 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 21:14:40,198 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 21:14:40,226 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 21:14:40,227 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 21:14:40,227 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 21:14:40,228 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 21:14:40,228 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 21:14:40,228 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 21:14:40,228 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 21:14:40,228 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 21:14:40,228 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 21:14:40,244 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 158places, 195 transitions [2018-12-31 21:15:05,089 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 128915 states. [2018-12-31 21:15:05,092 INFO L276 IsEmpty]: Start isEmpty. Operand 128915 states. [2018-12-31 21:15:05,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-31 21:15:05,106 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:15:05,108 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:15:05,111 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:15:05,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:15:05,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1862294190, now seen corresponding path program 1 times [2018-12-31 21:15:05,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:15:05,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:15:05,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:15:05,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:15:05,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:15:05,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:15:05,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:15:05,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:15:05,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 21:15:05,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 21:15:05,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 21:15:05,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:15:05,538 INFO L87 Difference]: Start difference. First operand 128915 states. Second operand 4 states. [2018-12-31 21:15:08,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:15:08,516 INFO L93 Difference]: Finished difference Result 233475 states and 1098327 transitions. [2018-12-31 21:15:08,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 21:15:08,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-12-31 21:15:08,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:15:09,917 INFO L225 Difference]: With dead ends: 233475 [2018-12-31 21:15:09,917 INFO L226 Difference]: Without dead ends: 203725 [2018-12-31 21:15:09,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:15:11,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203725 states. [2018-12-31 21:15:22,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203725 to 118895. [2018-12-31 21:15:22,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118895 states. [2018-12-31 21:15:24,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118895 states to 118895 states and 559778 transitions. [2018-12-31 21:15:24,547 INFO L78 Accepts]: Start accepts. Automaton has 118895 states and 559778 transitions. Word has length 46 [2018-12-31 21:15:24,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:15:24,549 INFO L480 AbstractCegarLoop]: Abstraction has 118895 states and 559778 transitions. [2018-12-31 21:15:24,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 21:15:24,549 INFO L276 IsEmpty]: Start isEmpty. Operand 118895 states and 559778 transitions. [2018-12-31 21:15:24,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-31 21:15:24,564 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:15:24,565 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:15:24,565 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:15:24,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:15:24,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1986059105, now seen corresponding path program 1 times [2018-12-31 21:15:24,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:15:24,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:15:24,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:15:24,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:15:24,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:15:24,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:15:24,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-12-31 21:15:24,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:15:24,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 21:15:24,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 21:15:24,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 21:15:24,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 21:15:24,683 INFO L87 Difference]: Start difference. First operand 118895 states and 559778 transitions. Second operand 3 states. [2018-12-31 21:15:25,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:15:25,650 INFO L93 Difference]: Finished difference Result 118895 states and 557818 transitions. [2018-12-31 21:15:25,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 21:15:25,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2018-12-31 21:15:25,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:15:26,335 INFO L225 Difference]: With dead ends: 118895 [2018-12-31 21:15:26,335 INFO L226 Difference]: Without dead ends: 118895 [2018-12-31 21:15:26,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 21:15:27,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118895 states. [2018-12-31 21:15:29,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118895 to 118895. [2018-12-31 21:15:29,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118895 states. [2018-12-31 21:15:38,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118895 states to 118895 states and 557818 transitions. [2018-12-31 21:15:38,890 INFO L78 Accepts]: Start accepts. Automaton has 118895 states and 557818 transitions. Word has length 53 [2018-12-31 21:15:38,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:15:38,891 INFO L480 AbstractCegarLoop]: Abstraction has 118895 states and 557818 transitions. [2018-12-31 21:15:38,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 21:15:38,891 INFO L276 IsEmpty]: Start isEmpty. Operand 118895 states and 557818 transitions. [2018-12-31 21:15:38,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-31 21:15:38,897 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:15:38,897 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:15:38,897 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:15:38,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:15:38,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1856976386, now seen corresponding path program 1 times [2018-12-31 21:15:38,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:15:38,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:15:38,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:15:38,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:15:38,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:15:38,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:15:39,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:15:39,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:15:39,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 21:15:39,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 21:15:39,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 21:15:39,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:15:39,074 INFO L87 Difference]: Start difference. First operand 118895 states and 557818 transitions. Second operand 5 states. [2018-12-31 21:15:42,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:15:42,313 INFO L93 Difference]: Finished difference Result 325275 states and 1468252 transitions. [2018-12-31 21:15:42,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 21:15:42,314 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-12-31 21:15:42,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:15:44,086 INFO L225 Difference]: With dead ends: 325275 [2018-12-31 21:15:44,087 INFO L226 Difference]: Without dead ends: 324275 [2018-12-31 21:15:44,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 21:15:48,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324275 states. [2018-12-31 21:16:01,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324275 to 186425. [2018-12-31 21:16:01,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186425 states. [2018-12-31 21:16:02,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186425 states to 186425 states and 840917 transitions. [2018-12-31 21:16:02,231 INFO L78 Accepts]: Start accepts. Automaton has 186425 states and 840917 transitions. Word has length 53 [2018-12-31 21:16:02,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:16:02,231 INFO L480 AbstractCegarLoop]: Abstraction has 186425 states and 840917 transitions. [2018-12-31 21:16:02,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 21:16:02,232 INFO L276 IsEmpty]: Start isEmpty. Operand 186425 states and 840917 transitions. [2018-12-31 21:16:02,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-31 21:16:02,243 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:16:02,243 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] [2018-12-31 21:16:02,243 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:16:02,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:16:02,244 INFO L82 PathProgramCache]: Analyzing trace with hash 713101365, now seen corresponding path program 1 times [2018-12-31 21:16:02,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:16:02,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:16:02,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:16:02,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:16:02,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:16:02,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:16:02,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:16:02,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:16:02,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 21:16:02,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 21:16:02,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 21:16:02,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:16:02,392 INFO L87 Difference]: Start difference. First operand 186425 states and 840917 transitions. Second operand 4 states. [2018-12-31 21:16:05,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:16:05,442 INFO L93 Difference]: Finished difference Result 163601 states and 725475 transitions. [2018-12-31 21:16:05,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 21:16:05,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-12-31 21:16:05,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:16:06,122 INFO L225 Difference]: With dead ends: 163601 [2018-12-31 21:16:06,123 INFO L226 Difference]: Without dead ends: 160996 [2018-12-31 21:16:06,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:16:07,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160996 states. [2018-12-31 21:16:11,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160996 to 160996. [2018-12-31 21:16:11,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160996 states. [2018-12-31 21:16:12,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160996 states to 160996 states and 716803 transitions. [2018-12-31 21:16:12,172 INFO L78 Accepts]: Start accepts. Automaton has 160996 states and 716803 transitions. Word has length 54 [2018-12-31 21:16:12,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:16:12,172 INFO L480 AbstractCegarLoop]: Abstraction has 160996 states and 716803 transitions. [2018-12-31 21:16:12,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 21:16:12,172 INFO L276 IsEmpty]: Start isEmpty. Operand 160996 states and 716803 transitions. [2018-12-31 21:16:12,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-31 21:16:12,182 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:16:12,183 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] [2018-12-31 21:16:12,183 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:16:12,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:16:12,184 INFO L82 PathProgramCache]: Analyzing trace with hash -955671519, now seen corresponding path program 1 times [2018-12-31 21:16:12,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:16:12,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:16:12,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:16:12,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:16:12,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:16:12,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:16:12,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:16:12,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:16:12,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 21:16:12,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 21:16:12,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 21:16:12,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:16:12,448 INFO L87 Difference]: Start difference. First operand 160996 states and 716803 transitions. Second operand 5 states. [2018-12-31 21:16:12,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:16:12,783 INFO L93 Difference]: Finished difference Result 51408 states and 209124 transitions. [2018-12-31 21:16:12,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 21:16:12,783 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2018-12-31 21:16:12,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:16:19,050 INFO L225 Difference]: With dead ends: 51408 [2018-12-31 21:16:19,051 INFO L226 Difference]: Without dead ends: 49096 [2018-12-31 21:16:19,051 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-12-31 21:16:19,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49096 states. [2018-12-31 21:16:19,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49096 to 49096. [2018-12-31 21:16:19,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49096 states. [2018-12-31 21:16:20,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49096 states to 49096 states and 200470 transitions. [2018-12-31 21:16:20,039 INFO L78 Accepts]: Start accepts. Automaton has 49096 states and 200470 transitions. Word has length 55 [2018-12-31 21:16:20,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:16:20,039 INFO L480 AbstractCegarLoop]: Abstraction has 49096 states and 200470 transitions. [2018-12-31 21:16:20,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 21:16:20,039 INFO L276 IsEmpty]: Start isEmpty. Operand 49096 states and 200470 transitions. [2018-12-31 21:16:20,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-31 21:16:20,058 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:16:20,058 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:16:20,059 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:16:20,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:16:20,059 INFO L82 PathProgramCache]: Analyzing trace with hash 49065616, now seen corresponding path program 1 times [2018-12-31 21:16:20,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:16:20,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:16:20,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:16:20,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:16:20,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:16:20,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:16:20,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:16:20,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:16:20,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 21:16:20,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 21:16:20,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 21:16:20,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:16:20,283 INFO L87 Difference]: Start difference. First operand 49096 states and 200470 transitions. Second operand 4 states. [2018-12-31 21:16:21,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:16:21,054 INFO L93 Difference]: Finished difference Result 70364 states and 282259 transitions. [2018-12-31 21:16:21,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 21:16:21,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-12-31 21:16:21,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:16:21,270 INFO L225 Difference]: With dead ends: 70364 [2018-12-31 21:16:21,270 INFO L226 Difference]: Without dead ends: 70364 [2018-12-31 21:16:21,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:16:21,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70364 states. [2018-12-31 21:16:23,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70364 to 53660. [2018-12-31 21:16:23,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53660 states. [2018-12-31 21:16:23,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53660 states to 53660 states and 217411 transitions. [2018-12-31 21:16:23,235 INFO L78 Accepts]: Start accepts. Automaton has 53660 states and 217411 transitions. Word has length 68 [2018-12-31 21:16:23,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:16:23,235 INFO L480 AbstractCegarLoop]: Abstraction has 53660 states and 217411 transitions. [2018-12-31 21:16:23,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 21:16:23,236 INFO L276 IsEmpty]: Start isEmpty. Operand 53660 states and 217411 transitions. [2018-12-31 21:16:23,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-31 21:16:23,255 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:16:23,255 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:16:23,256 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:16:23,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:16:23,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1791875951, now seen corresponding path program 1 times [2018-12-31 21:16:23,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:16:23,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:16:23,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:16:23,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:16:23,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:16:23,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:16:23,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:16:23,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:16:23,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 21:16:23,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 21:16:23,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 21:16:23,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:16:23,408 INFO L87 Difference]: Start difference. First operand 53660 states and 217411 transitions. Second operand 4 states. [2018-12-31 21:16:24,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:16:24,807 INFO L93 Difference]: Finished difference Result 76151 states and 304549 transitions. [2018-12-31 21:16:24,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 21:16:24,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-12-31 21:16:24,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:16:25,038 INFO L225 Difference]: With dead ends: 76151 [2018-12-31 21:16:25,038 INFO L226 Difference]: Without dead ends: 76151 [2018-12-31 21:16:25,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:16:25,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76151 states. [2018-12-31 21:16:26,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76151 to 67784. [2018-12-31 21:16:26,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67784 states. [2018-12-31 21:16:27,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67784 states to 67784 states and 273064 transitions. [2018-12-31 21:16:27,574 INFO L78 Accepts]: Start accepts. Automaton has 67784 states and 273064 transitions. Word has length 68 [2018-12-31 21:16:27,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:16:27,575 INFO L480 AbstractCegarLoop]: Abstraction has 67784 states and 273064 transitions. [2018-12-31 21:16:27,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 21:16:27,575 INFO L276 IsEmpty]: Start isEmpty. Operand 67784 states and 273064 transitions. [2018-12-31 21:16:27,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-31 21:16:27,599 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:16:27,599 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:16:27,599 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:16:27,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:16:27,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1149781648, now seen corresponding path program 1 times [2018-12-31 21:16:27,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:16:27,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:16:27,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:16:27,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:16:27,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:16:27,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:16:27,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:16:27,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:16:27,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 21:16:27,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 21:16:27,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 21:16:27,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 21:16:27,802 INFO L87 Difference]: Start difference. First operand 67784 states and 273064 transitions. Second operand 6 states. [2018-12-31 21:16:27,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:16:27,910 INFO L93 Difference]: Finished difference Result 12584 states and 42632 transitions. [2018-12-31 21:16:27,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 21:16:27,911 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-12-31 21:16:27,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:16:27,934 INFO L225 Difference]: With dead ends: 12584 [2018-12-31 21:16:27,934 INFO L226 Difference]: Without dead ends: 10492 [2018-12-31 21:16:27,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-31 21:16:27,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10492 states. [2018-12-31 21:16:28,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10492 to 9957. [2018-12-31 21:16:28,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9957 states. [2018-12-31 21:16:28,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9957 states to 9957 states and 33657 transitions. [2018-12-31 21:16:28,087 INFO L78 Accepts]: Start accepts. Automaton has 9957 states and 33657 transitions. Word has length 68 [2018-12-31 21:16:28,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:16:28,087 INFO L480 AbstractCegarLoop]: Abstraction has 9957 states and 33657 transitions. [2018-12-31 21:16:28,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 21:16:28,088 INFO L276 IsEmpty]: Start isEmpty. Operand 9957 states and 33657 transitions. [2018-12-31 21:16:28,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-31 21:16:28,106 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:16:28,106 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:16:28,106 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:16:28,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:16:28,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1585405424, now seen corresponding path program 1 times [2018-12-31 21:16:28,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:16:28,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:16:28,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:16:28,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:16:28,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:16:28,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:16:28,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:16:28,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:16:28,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 21:16:28,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 21:16:28,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 21:16:28,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:16:28,267 INFO L87 Difference]: Start difference. First operand 9957 states and 33657 transitions. Second operand 4 states. [2018-12-31 21:16:28,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:16:28,490 INFO L93 Difference]: Finished difference Result 12407 states and 41192 transitions. [2018-12-31 21:16:28,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 21:16:28,491 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2018-12-31 21:16:28,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:16:28,516 INFO L225 Difference]: With dead ends: 12407 [2018-12-31 21:16:28,516 INFO L226 Difference]: Without dead ends: 12267 [2018-12-31 21:16:28,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:16:28,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12267 states. [2018-12-31 21:16:28,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12267 to 10642. [2018-12-31 21:16:28,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10642 states. [2018-12-31 21:16:28,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10642 states to 10642 states and 35730 transitions. [2018-12-31 21:16:28,687 INFO L78 Accepts]: Start accepts. Automaton has 10642 states and 35730 transitions. Word has length 101 [2018-12-31 21:16:28,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:16:28,688 INFO L480 AbstractCegarLoop]: Abstraction has 10642 states and 35730 transitions. [2018-12-31 21:16:28,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 21:16:28,688 INFO L276 IsEmpty]: Start isEmpty. Operand 10642 states and 35730 transitions. [2018-12-31 21:16:28,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-31 21:16:28,708 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:16:28,708 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:16:28,708 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:16:28,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:16:28,709 INFO L82 PathProgramCache]: Analyzing trace with hash -615824401, now seen corresponding path program 1 times [2018-12-31 21:16:28,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:16:28,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:16:28,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:16:28,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:16:28,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:16:28,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:16:28,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:16:28,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:16:28,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 21:16:28,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 21:16:28,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 21:16:28,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:16:28,804 INFO L87 Difference]: Start difference. First operand 10642 states and 35730 transitions. Second operand 4 states. [2018-12-31 21:16:29,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:16:29,154 INFO L93 Difference]: Finished difference Result 14462 states and 48704 transitions. [2018-12-31 21:16:29,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 21:16:29,155 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2018-12-31 21:16:29,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:16:29,185 INFO L225 Difference]: With dead ends: 14462 [2018-12-31 21:16:29,185 INFO L226 Difference]: Without dead ends: 14462 [2018-12-31 21:16:29,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:16:29,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14462 states. [2018-12-31 21:16:29,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14462 to 10047. [2018-12-31 21:16:29,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10047 states. [2018-12-31 21:16:29,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10047 states to 10047 states and 33479 transitions. [2018-12-31 21:16:29,383 INFO L78 Accepts]: Start accepts. Automaton has 10047 states and 33479 transitions. Word has length 101 [2018-12-31 21:16:29,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:16:29,384 INFO L480 AbstractCegarLoop]: Abstraction has 10047 states and 33479 transitions. [2018-12-31 21:16:29,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 21:16:29,384 INFO L276 IsEmpty]: Start isEmpty. Operand 10047 states and 33479 transitions. [2018-12-31 21:16:29,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-31 21:16:29,404 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:16:29,404 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:16:29,405 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:16:29,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:16:29,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1351667327, now seen corresponding path program 2 times [2018-12-31 21:16:29,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:16:29,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:16:29,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:16:29,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:16:29,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:16:29,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:16:29,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:16:29,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:16:29,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 21:16:29,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 21:16:29,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 21:16:29,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:16:29,872 INFO L87 Difference]: Start difference. First operand 10047 states and 33479 transitions. Second operand 5 states. [2018-12-31 21:16:30,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:16:30,541 INFO L93 Difference]: Finished difference Result 11837 states and 39016 transitions. [2018-12-31 21:16:30,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 21:16:30,549 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2018-12-31 21:16:30,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:16:30,574 INFO L225 Difference]: With dead ends: 11837 [2018-12-31 21:16:30,574 INFO L226 Difference]: Without dead ends: 11697 [2018-12-31 21:16:30,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 21:16:30,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11697 states. [2018-12-31 21:16:30,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11697 to 10012. [2018-12-31 21:16:30,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10012 states. [2018-12-31 21:16:30,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10012 states to 10012 states and 33331 transitions. [2018-12-31 21:16:30,738 INFO L78 Accepts]: Start accepts. Automaton has 10012 states and 33331 transitions. Word has length 101 [2018-12-31 21:16:30,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:16:30,739 INFO L480 AbstractCegarLoop]: Abstraction has 10012 states and 33331 transitions. [2018-12-31 21:16:30,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 21:16:30,739 INFO L276 IsEmpty]: Start isEmpty. Operand 10012 states and 33331 transitions. [2018-12-31 21:16:30,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-31 21:16:30,754 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:16:30,754 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:16:30,754 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:16:30,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:16:30,755 INFO L82 PathProgramCache]: Analyzing trace with hash 438817525, now seen corresponding path program 1 times [2018-12-31 21:16:30,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:16:30,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:16:30,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:16:30,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 21:16:30,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:16:30,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:16:30,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:16:30,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:16:30,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 21:16:30,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 21:16:30,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 21:16:30,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:16:30,962 INFO L87 Difference]: Start difference. First operand 10012 states and 33331 transitions. Second operand 4 states. [2018-12-31 21:16:31,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:16:31,667 INFO L93 Difference]: Finished difference Result 17923 states and 59930 transitions. [2018-12-31 21:16:31,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 21:16:31,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2018-12-31 21:16:31,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:16:31,705 INFO L225 Difference]: With dead ends: 17923 [2018-12-31 21:16:31,705 INFO L226 Difference]: Without dead ends: 17783 [2018-12-31 21:16:31,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:16:31,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17783 states. [2018-12-31 21:16:31,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17783 to 9642. [2018-12-31 21:16:31,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9642 states. [2018-12-31 21:16:31,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9642 states to 9642 states and 31905 transitions. [2018-12-31 21:16:31,906 INFO L78 Accepts]: Start accepts. Automaton has 9642 states and 31905 transitions. Word has length 103 [2018-12-31 21:16:31,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:16:31,906 INFO L480 AbstractCegarLoop]: Abstraction has 9642 states and 31905 transitions. [2018-12-31 21:16:31,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 21:16:31,906 INFO L276 IsEmpty]: Start isEmpty. Operand 9642 states and 31905 transitions. [2018-12-31 21:16:31,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-31 21:16:31,922 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:16:31,922 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:16:31,923 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:16:31,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:16:31,923 INFO L82 PathProgramCache]: Analyzing trace with hash 768583286, now seen corresponding path program 1 times [2018-12-31 21:16:31,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:16:31,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:16:31,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:16:31,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:16:31,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:16:31,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:16:32,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:16:32,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:16:32,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 21:16:32,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 21:16:32,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 21:16:32,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 21:16:32,238 INFO L87 Difference]: Start difference. First operand 9642 states and 31905 transitions. Second operand 7 states. [2018-12-31 21:16:32,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:16:32,691 INFO L93 Difference]: Finished difference Result 11265 states and 36879 transitions. [2018-12-31 21:16:32,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 21:16:32,692 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2018-12-31 21:16:32,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:16:32,714 INFO L225 Difference]: With dead ends: 11265 [2018-12-31 21:16:32,714 INFO L226 Difference]: Without dead ends: 11265 [2018-12-31 21:16:32,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 21:16:32,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11265 states. [2018-12-31 21:16:32,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11265 to 10097. [2018-12-31 21:16:32,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10097 states. [2018-12-31 21:16:32,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10097 states to 10097 states and 33119 transitions. [2018-12-31 21:16:32,888 INFO L78 Accepts]: Start accepts. Automaton has 10097 states and 33119 transitions. Word has length 103 [2018-12-31 21:16:32,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:16:32,888 INFO L480 AbstractCegarLoop]: Abstraction has 10097 states and 33119 transitions. [2018-12-31 21:16:32,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 21:16:32,888 INFO L276 IsEmpty]: Start isEmpty. Operand 10097 states and 33119 transitions. [2018-12-31 21:16:32,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-31 21:16:32,904 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:16:32,905 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:16:32,905 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:16:32,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:16:32,905 INFO L82 PathProgramCache]: Analyzing trace with hash -414764011, now seen corresponding path program 1 times [2018-12-31 21:16:32,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:16:32,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:16:32,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:16:32,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:16:32,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:16:32,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:16:33,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:16:33,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:16:33,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 21:16:33,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 21:16:33,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 21:16:33,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:16:33,133 INFO L87 Difference]: Start difference. First operand 10097 states and 33119 transitions. Second operand 5 states. [2018-12-31 21:16:33,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:16:33,401 INFO L93 Difference]: Finished difference Result 8865 states and 29060 transitions. [2018-12-31 21:16:33,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 21:16:33,402 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2018-12-31 21:16:33,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:16:33,421 INFO L225 Difference]: With dead ends: 8865 [2018-12-31 21:16:33,421 INFO L226 Difference]: Without dead ends: 8865 [2018-12-31 21:16:33,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-31 21:16:33,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8865 states. [2018-12-31 21:16:33,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8865 to 8405. [2018-12-31 21:16:33,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8405 states. [2018-12-31 21:16:33,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8405 states to 8405 states and 27742 transitions. [2018-12-31 21:16:33,555 INFO L78 Accepts]: Start accepts. Automaton has 8405 states and 27742 transitions. Word has length 103 [2018-12-31 21:16:33,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:16:33,555 INFO L480 AbstractCegarLoop]: Abstraction has 8405 states and 27742 transitions. [2018-12-31 21:16:33,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 21:16:33,555 INFO L276 IsEmpty]: Start isEmpty. Operand 8405 states and 27742 transitions. [2018-12-31 21:16:33,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-31 21:16:33,567 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:16:33,567 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:16:33,568 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:16:33,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:16:33,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1337447594, now seen corresponding path program 1 times [2018-12-31 21:16:33,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:16:33,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:16:33,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:16:33,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:16:33,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:16:33,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:16:33,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:16:33,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:16:33,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 21:16:33,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 21:16:33,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 21:16:33,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:16:33,971 INFO L87 Difference]: Start difference. First operand 8405 states and 27742 transitions. Second operand 4 states. [2018-12-31 21:16:34,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:16:34,251 INFO L93 Difference]: Finished difference Result 9749 states and 32430 transitions. [2018-12-31 21:16:34,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 21:16:34,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2018-12-31 21:16:34,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:16:34,272 INFO L225 Difference]: With dead ends: 9749 [2018-12-31 21:16:34,272 INFO L226 Difference]: Without dead ends: 9749 [2018-12-31 21:16:34,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:16:34,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9749 states. [2018-12-31 21:16:34,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9749 to 9621. [2018-12-31 21:16:34,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9621 states. [2018-12-31 21:16:34,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9621 states to 9621 states and 32014 transitions. [2018-12-31 21:16:34,432 INFO L78 Accepts]: Start accepts. Automaton has 9621 states and 32014 transitions. Word has length 103 [2018-12-31 21:16:34,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:16:34,432 INFO L480 AbstractCegarLoop]: Abstraction has 9621 states and 32014 transitions. [2018-12-31 21:16:34,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 21:16:34,432 INFO L276 IsEmpty]: Start isEmpty. Operand 9621 states and 32014 transitions. [2018-12-31 21:16:34,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-31 21:16:34,451 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:16:34,451 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:16:34,451 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:16:34,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:16:34,452 INFO L82 PathProgramCache]: Analyzing trace with hash 880310359, now seen corresponding path program 1 times [2018-12-31 21:16:34,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:16:34,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:16:34,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:16:34,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:16:34,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:16:34,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:16:34,868 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-12-31 21:16:35,367 WARN L181 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 16 [2018-12-31 21:16:35,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-12-31 21:16:35,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:16:35,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 21:16:35,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 21:16:35,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 21:16:35,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 21:16:35,399 INFO L87 Difference]: Start difference. First operand 9621 states and 32014 transitions. Second operand 6 states. [2018-12-31 21:16:36,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:16:36,235 INFO L93 Difference]: Finished difference Result 8469 states and 27566 transitions. [2018-12-31 21:16:36,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 21:16:36,236 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 103 [2018-12-31 21:16:36,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:16:36,252 INFO L225 Difference]: With dead ends: 8469 [2018-12-31 21:16:36,252 INFO L226 Difference]: Without dead ends: 8469 [2018-12-31 21:16:36,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-31 21:16:36,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8469 states. [2018-12-31 21:16:36,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8469 to 7044. [2018-12-31 21:16:36,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7044 states. [2018-12-31 21:16:36,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7044 states to 7044 states and 23160 transitions. [2018-12-31 21:16:36,375 INFO L78 Accepts]: Start accepts. Automaton has 7044 states and 23160 transitions. Word has length 103 [2018-12-31 21:16:36,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:16:36,375 INFO L480 AbstractCegarLoop]: Abstraction has 7044 states and 23160 transitions. [2018-12-31 21:16:36,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 21:16:36,375 INFO L276 IsEmpty]: Start isEmpty. Operand 7044 states and 23160 transitions. [2018-12-31 21:16:36,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-31 21:16:36,390 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:16:36,390 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:16:36,391 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:16:36,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:16:36,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1107120250, now seen corresponding path program 1 times [2018-12-31 21:16:36,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:16:36,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:16:36,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:16:36,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:16:36,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:16:36,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:16:36,810 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-12-31 21:16:36,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:16:36,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:16:36,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 21:16:36,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 21:16:36,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 21:16:36,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 21:16:36,869 INFO L87 Difference]: Start difference. First operand 7044 states and 23160 transitions. Second operand 6 states. [2018-12-31 21:16:37,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:16:37,049 INFO L93 Difference]: Finished difference Result 7489 states and 24256 transitions. [2018-12-31 21:16:37,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 21:16:37,051 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2018-12-31 21:16:37,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:16:37,065 INFO L225 Difference]: With dead ends: 7489 [2018-12-31 21:16:37,065 INFO L226 Difference]: Without dead ends: 7389 [2018-12-31 21:16:37,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-31 21:16:37,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7389 states. [2018-12-31 21:16:37,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7389 to 6909. [2018-12-31 21:16:37,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6909 states. [2018-12-31 21:16:37,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6909 states to 6909 states and 22657 transitions. [2018-12-31 21:16:37,180 INFO L78 Accepts]: Start accepts. Automaton has 6909 states and 22657 transitions. Word has length 105 [2018-12-31 21:16:37,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:16:37,180 INFO L480 AbstractCegarLoop]: Abstraction has 6909 states and 22657 transitions. [2018-12-31 21:16:37,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 21:16:37,181 INFO L276 IsEmpty]: Start isEmpty. Operand 6909 states and 22657 transitions. [2018-12-31 21:16:37,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-31 21:16:37,191 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:16:37,191 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:16:37,192 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:16:37,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:16:37,192 INFO L82 PathProgramCache]: Analyzing trace with hash -828540037, now seen corresponding path program 1 times [2018-12-31 21:16:37,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:16:37,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:16:37,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:16:37,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:16:37,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:16:37,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:16:37,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:16:37,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:16:37,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 21:16:37,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 21:16:37,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 21:16:37,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:16:37,459 INFO L87 Difference]: Start difference. First operand 6909 states and 22657 transitions. Second operand 5 states. [2018-12-31 21:16:37,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:16:37,532 INFO L93 Difference]: Finished difference Result 11413 states and 38128 transitions. [2018-12-31 21:16:37,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 21:16:37,533 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2018-12-31 21:16:37,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:16:37,556 INFO L225 Difference]: With dead ends: 11413 [2018-12-31 21:16:37,556 INFO L226 Difference]: Without dead ends: 11413 [2018-12-31 21:16:37,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-31 21:16:37,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11413 states. [2018-12-31 21:16:37,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11413 to 6789. [2018-12-31 21:16:37,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6789 states. [2018-12-31 21:16:37,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6789 states to 6789 states and 22086 transitions. [2018-12-31 21:16:37,699 INFO L78 Accepts]: Start accepts. Automaton has 6789 states and 22086 transitions. Word has length 105 [2018-12-31 21:16:37,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:16:37,699 INFO L480 AbstractCegarLoop]: Abstraction has 6789 states and 22086 transitions. [2018-12-31 21:16:37,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 21:16:37,699 INFO L276 IsEmpty]: Start isEmpty. Operand 6789 states and 22086 transitions. [2018-12-31 21:16:37,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-31 21:16:37,710 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:16:37,710 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:16:37,710 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:16:37,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:16:37,711 INFO L82 PathProgramCache]: Analyzing trace with hash 141040986, now seen corresponding path program 1 times [2018-12-31 21:16:37,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:16:37,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:16:37,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:16:37,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:16:37,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:16:37,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:16:37,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:16:37,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:16:37,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 21:16:37,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 21:16:37,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 21:16:37,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:16:37,995 INFO L87 Difference]: Start difference. First operand 6789 states and 22086 transitions. Second operand 5 states. [2018-12-31 21:16:38,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:16:38,270 INFO L93 Difference]: Finished difference Result 9541 states and 31286 transitions. [2018-12-31 21:16:38,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 21:16:38,271 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2018-12-31 21:16:38,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:16:38,290 INFO L225 Difference]: With dead ends: 9541 [2018-12-31 21:16:38,290 INFO L226 Difference]: Without dead ends: 9541 [2018-12-31 21:16:38,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 21:16:38,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9541 states. [2018-12-31 21:16:38,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9541 to 8453. [2018-12-31 21:16:38,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8453 states. [2018-12-31 21:16:38,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8453 states to 8453 states and 27750 transitions. [2018-12-31 21:16:38,439 INFO L78 Accepts]: Start accepts. Automaton has 8453 states and 27750 transitions. Word has length 105 [2018-12-31 21:16:38,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:16:38,439 INFO L480 AbstractCegarLoop]: Abstraction has 8453 states and 27750 transitions. [2018-12-31 21:16:38,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 21:16:38,439 INFO L276 IsEmpty]: Start isEmpty. Operand 8453 states and 27750 transitions. [2018-12-31 21:16:38,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-31 21:16:38,452 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:16:38,452 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:16:38,452 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:16:38,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:16:38,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1385805467, now seen corresponding path program 1 times [2018-12-31 21:16:38,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:16:38,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:16:38,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:16:38,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:16:38,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:16:38,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:16:38,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:16:38,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:16:38,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 21:16:38,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 21:16:38,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 21:16:38,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-31 21:16:38,678 INFO L87 Difference]: Start difference. First operand 8453 states and 27750 transitions. Second operand 9 states. [2018-12-31 21:16:38,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:16:38,949 INFO L93 Difference]: Finished difference Result 15513 states and 51589 transitions. [2018-12-31 21:16:38,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 21:16:38,949 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2018-12-31 21:16:38,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:16:38,965 INFO L225 Difference]: With dead ends: 15513 [2018-12-31 21:16:38,965 INFO L226 Difference]: Without dead ends: 7793 [2018-12-31 21:16:38,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-12-31 21:16:38,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7793 states. [2018-12-31 21:16:39,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7793 to 7793. [2018-12-31 21:16:39,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7793 states. [2018-12-31 21:16:39,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7793 states to 7793 states and 25830 transitions. [2018-12-31 21:16:39,088 INFO L78 Accepts]: Start accepts. Automaton has 7793 states and 25830 transitions. Word has length 105 [2018-12-31 21:16:39,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:16:39,089 INFO L480 AbstractCegarLoop]: Abstraction has 7793 states and 25830 transitions. [2018-12-31 21:16:39,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 21:16:39,089 INFO L276 IsEmpty]: Start isEmpty. Operand 7793 states and 25830 transitions. [2018-12-31 21:16:39,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-31 21:16:39,101 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:16:39,101 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:16:39,101 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:16:39,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:16:39,102 INFO L82 PathProgramCache]: Analyzing trace with hash -911189529, now seen corresponding path program 2 times [2018-12-31 21:16:39,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:16:39,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:16:39,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:16:39,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:16:39,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:16:39,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:16:39,478 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-12-31 21:16:39,785 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 6 [2018-12-31 21:16:39,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:16:39,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:16:39,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-31 21:16:39,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 21:16:39,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 21:16:39,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-31 21:16:39,833 INFO L87 Difference]: Start difference. First operand 7793 states and 25830 transitions. Second operand 10 states. [2018-12-31 21:16:40,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:16:40,271 INFO L93 Difference]: Finished difference Result 15885 states and 53203 transitions. [2018-12-31 21:16:40,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-31 21:16:40,271 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2018-12-31 21:16:40,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:16:40,292 INFO L225 Difference]: With dead ends: 15885 [2018-12-31 21:16:40,292 INFO L226 Difference]: Without dead ends: 6992 [2018-12-31 21:16:40,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2018-12-31 21:16:40,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6992 states. [2018-12-31 21:16:40,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6992 to 6992. [2018-12-31 21:16:40,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6992 states. [2018-12-31 21:16:40,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6992 states to 6992 states and 23649 transitions. [2018-12-31 21:16:40,414 INFO L78 Accepts]: Start accepts. Automaton has 6992 states and 23649 transitions. Word has length 105 [2018-12-31 21:16:40,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:16:40,415 INFO L480 AbstractCegarLoop]: Abstraction has 6992 states and 23649 transitions. [2018-12-31 21:16:40,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 21:16:40,415 INFO L276 IsEmpty]: Start isEmpty. Operand 6992 states and 23649 transitions. [2018-12-31 21:16:40,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-31 21:16:40,426 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:16:40,426 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:16:40,427 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:16:40,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:16:40,427 INFO L82 PathProgramCache]: Analyzing trace with hash -486297935, now seen corresponding path program 3 times [2018-12-31 21:16:40,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:16:40,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:16:40,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:16:40,430 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 21:16:40,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:16:40,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:16:40,672 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-31 21:16:40,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:16:40,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:16:40,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-31 21:16:40,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-31 21:16:40,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-31 21:16:40,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-31 21:16:40,822 INFO L87 Difference]: Start difference. First operand 6992 states and 23649 transitions. Second operand 12 states. [2018-12-31 21:16:41,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:16:41,675 INFO L93 Difference]: Finished difference Result 13420 states and 45630 transitions. [2018-12-31 21:16:41,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-31 21:16:41,676 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 105 [2018-12-31 21:16:41,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:16:41,700 INFO L225 Difference]: With dead ends: 13420 [2018-12-31 21:16:41,700 INFO L226 Difference]: Without dead ends: 9516 [2018-12-31 21:16:41,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-31 21:16:41,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9516 states. [2018-12-31 21:16:41,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9516 to 8908. [2018-12-31 21:16:41,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8908 states. [2018-12-31 21:16:41,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8908 states to 8908 states and 29542 transitions. [2018-12-31 21:16:41,859 INFO L78 Accepts]: Start accepts. Automaton has 8908 states and 29542 transitions. Word has length 105 [2018-12-31 21:16:41,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:16:41,859 INFO L480 AbstractCegarLoop]: Abstraction has 8908 states and 29542 transitions. [2018-12-31 21:16:41,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-31 21:16:41,859 INFO L276 IsEmpty]: Start isEmpty. Operand 8908 states and 29542 transitions. [2018-12-31 21:16:41,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-31 21:16:41,873 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:16:41,873 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:16:41,874 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:16:41,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:16:41,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1610066251, now seen corresponding path program 4 times [2018-12-31 21:16:41,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:16:41,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:16:41,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:16:41,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 21:16:41,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:16:41,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 21:16:41,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 21:16:41,989 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 21:16:42,167 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-31 21:16:42,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 09:16:42 BasicIcfg [2018-12-31 21:16:42,170 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 21:16:42,170 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 21:16:42,170 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 21:16:42,170 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 21:16:42,171 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:14:40" (3/4) ... [2018-12-31 21:16:42,176 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 21:16:42,408 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 21:16:42,412 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 21:16:42,413 INFO L168 Benchmark]: Toolchain (without parser) took 124807.46 ms. Allocated memory was 1.0 GB in the beginning and 6.7 GB in the end (delta: 5.7 GB). Free memory was 952.7 MB in the beginning and 3.9 GB in the end (delta: -2.9 GB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. [2018-12-31 21:16:42,414 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 21:16:42,416 INFO L168 Benchmark]: CACSL2BoogieTranslator took 906.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -165.4 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2018-12-31 21:16:42,416 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-31 21:16:42,417 INFO L168 Benchmark]: Boogie Preprocessor took 48.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 21:16:42,417 INFO L168 Benchmark]: RCFGBuilder took 1365.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.2 MB). Peak memory consumption was 52.2 MB. Max. memory is 11.5 GB. [2018-12-31 21:16:42,417 INFO L168 Benchmark]: TraceAbstraction took 122154.18 ms. Allocated memory was 1.2 GB in the beginning and 6.7 GB in the end (delta: 5.5 GB). Free memory was 1.1 GB in the beginning and 3.9 GB in the end (delta: -2.8 GB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. [2018-12-31 21:16:42,418 INFO L168 Benchmark]: Witness Printer took 242.19 ms. Allocated memory is still 6.7 GB. Free memory was 3.9 GB in the beginning and 3.9 GB in the end (delta: 32.1 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. [2018-12-31 21:16:42,426 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 906.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -165.4 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 85.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1365.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.2 MB). Peak memory consumption was 52.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 122154.18 ms. Allocated memory was 1.2 GB in the beginning and 6.7 GB in the end (delta: 5.5 GB). Free memory was 1.1 GB in the beginning and 3.9 GB in the end (delta: -2.8 GB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. * Witness Printer took 242.19 ms. Allocated memory is still 6.7 GB. Free memory was 3.9 GB in the beginning and 3.9 GB in the end (delta: 32.1 MB). Peak memory consumption was 32.1 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: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L678] -1 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L680] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L681] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L682] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L684] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L686] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L687] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L688] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L689] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L690] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L691] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L692] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0] [L693] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0] [L694] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L695] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L696] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L697] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L698] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L699] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L700] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L701] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L702] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L704] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L705] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L706] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L788] -1 pthread_t t1122; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L789] FCALL, FORK -1 pthread_create(&t1122, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L790] -1 pthread_t t1123; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L791] FCALL, FORK -1 pthread_create(&t1123, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L792] -1 pthread_t t1124; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L793] FCALL, FORK -1 pthread_create(&t1124, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L745] 0 y$w_buff1 = y$w_buff0 [L746] 0 y$w_buff0 = 2 [L747] 0 y$w_buff1_used = y$w_buff0_used [L748] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L750] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L751] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L752] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L753] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L754] 0 y$r_buff0_thd3 = (_Bool)1 [L757] 0 z = 1 [L760] 0 __unbuffered_p2_EAX = z [L763] 0 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0: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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0: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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L710] 1 a = 1 [L713] 1 __unbuffered_p0_EAX = x [L718] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0: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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L725] 2 x = 1 [L728] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 0 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L767] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L731] EXPR 2 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_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L731] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, 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=2, z=1] [L768] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, 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=2, z=1] [L768] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L731] EXPR 2 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_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, 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)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2, z=1] [L731] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L732] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, 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, z=1] [L732] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L769] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L770] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L770] 0 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L773] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] EXPR 2 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=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, 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, z=1] [L733] 2 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 [L734] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, 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, z=1] [L734] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L735] EXPR 2 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=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, 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, z=1] [L735] 2 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 [L738] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L795] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 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=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 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=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] -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) [L800] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L801] 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=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] -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 [L802] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L802] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L803] 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=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L803] -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 [L806] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L807] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L808] -1 y$flush_delayed = weak$$choice2 [L809] -1 y$mem_tmp = y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L811] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L812] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L812] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L813] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L814] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L815] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L816] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] -1 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] -1 y = y$flush_delayed ? y$mem_tmp : y [L819] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 201 locations, 3 error locations. UNSAFE Result, 121.9s OverallTime, 23 OverallIterations, 1 TraceHistogramMax, 30.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5205 SDtfs, 5497 SDslu, 11577 SDs, 0 SdLazy, 2609 SolverSat, 219 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 203 GetRequests, 61 SyntacticMatches, 17 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=186425occurred in iteration=3, 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: 59.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 274133 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 2018 NumberOfCodeBlocks, 2018 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1891 ConstructedInterpolants, 0 QuantifiedInterpolants, 401709 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...