./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/safe031_pso.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/safe031_pso.opt_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 52f250ce523e42d8ac81c9c1780b17f1f4712371 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 00:39:49,815 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 00:39:49,816 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 00:39:49,829 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 00:39:49,830 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 00:39:49,831 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 00:39:49,832 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 00:39:49,834 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 00:39:49,836 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 00:39:49,837 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 00:39:49,838 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 00:39:49,839 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 00:39:49,840 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 00:39:49,841 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 00:39:49,842 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 00:39:49,843 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 00:39:49,844 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 00:39:49,848 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 00:39:49,853 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 00:39:49,858 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 00:39:49,859 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 00:39:49,866 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 00:39:49,868 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 00:39:49,869 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 00:39:49,869 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 00:39:49,872 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 00:39:49,884 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 00:39:49,885 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 00:39:49,888 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 00:39:49,890 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 00:39:49,892 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 00:39:49,893 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 00:39:49,893 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 00:39:49,894 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 00:39:49,899 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 00:39:49,900 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 00:39:49,901 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-01 00:39:49,932 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 00:39:49,932 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 00:39:49,934 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 00:39:49,939 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 00:39:49,939 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 00:39:49,939 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 00:39:49,940 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 00:39:49,940 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 00:39:49,940 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 00:39:49,940 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 00:39:49,940 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-01 00:39:49,940 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 00:39:49,941 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-01 00:39:49,941 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 00:39:49,941 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 00:39:49,942 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 00:39:49,942 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-01 00:39:49,942 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 00:39:49,942 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 00:39:49,942 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 00:39:49,942 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 00:39:49,943 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 00:39:49,943 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 00:39:49,943 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 00:39:49,943 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-01 00:39:49,943 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 00:39:49,943 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 00:39:49,945 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-01 00:39:49,946 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 -> 52f250ce523e42d8ac81c9c1780b17f1f4712371 [2019-01-01 00:39:50,011 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 00:39:50,027 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 00:39:50,032 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 00:39:50,034 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 00:39:50,034 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 00:39:50,035 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/safe031_pso.opt_false-unreach-call.i [2019-01-01 00:39:50,109 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95995f7eb/673ba414091e4f8dab414824745ebf3b/FLAG6d91fbaf6 [2019-01-01 00:39:50,697 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 00:39:50,698 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/safe031_pso.opt_false-unreach-call.i [2019-01-01 00:39:50,719 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95995f7eb/673ba414091e4f8dab414824745ebf3b/FLAG6d91fbaf6 [2019-01-01 00:39:50,920 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95995f7eb/673ba414091e4f8dab414824745ebf3b [2019-01-01 00:39:50,925 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 00:39:50,926 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 00:39:50,928 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 00:39:50,928 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 00:39:50,933 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 00:39:50,934 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 12:39:50" (1/1) ... [2019-01-01 00:39:50,938 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@556facdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:39:50, skipping insertion in model container [2019-01-01 00:39:50,938 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 12:39:50" (1/1) ... [2019-01-01 00:39:50,947 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 00:39:51,023 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 00:39:51,548 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 00:39:51,565 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 00:39:51,769 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 00:39:51,857 INFO L195 MainTranslator]: Completed translation [2019-01-01 00:39:51,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:39:51 WrapperNode [2019-01-01 00:39:51,857 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 00:39:51,858 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 00:39:51,859 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 00:39:51,859 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 00:39:51,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:39:51" (1/1) ... [2019-01-01 00:39:51,899 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:39:51" (1/1) ... [2019-01-01 00:39:51,953 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 00:39:51,953 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 00:39:51,953 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 00:39:51,954 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 00:39:51,967 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:39:51" (1/1) ... [2019-01-01 00:39:51,967 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:39:51" (1/1) ... [2019-01-01 00:39:51,973 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:39:51" (1/1) ... [2019-01-01 00:39:51,974 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:39:51" (1/1) ... [2019-01-01 00:39:51,987 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:39:51" (1/1) ... [2019-01-01 00:39:51,992 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:39:51" (1/1) ... [2019-01-01 00:39:51,997 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:39:51" (1/1) ... [2019-01-01 00:39:52,003 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 00:39:52,004 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 00:39:52,004 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 00:39:52,004 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 00:39:52,006 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:39:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 00:39:52,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 00:39:52,106 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-01 00:39:52,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 00:39:52,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 00:39:52,107 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-01 00:39:52,107 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-01 00:39:52,107 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-01 00:39:52,107 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-01 00:39:52,107 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-01-01 00:39:52,107 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-01-01 00:39:52,107 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-01 00:39:52,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 00:39:52,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 00:39:52,113 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-01 00:39:53,406 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 00:39:53,407 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-01 00:39:53,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 12:39:53 BoogieIcfgContainer [2019-01-01 00:39:53,410 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 00:39:53,411 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 00:39:53,411 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 00:39:53,415 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 00:39:53,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 12:39:50" (1/3) ... [2019-01-01 00:39:53,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cbf60b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 12:39:53, skipping insertion in model container [2019-01-01 00:39:53,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:39:51" (2/3) ... [2019-01-01 00:39:53,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cbf60b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 12:39:53, skipping insertion in model container [2019-01-01 00:39:53,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 12:39:53" (3/3) ... [2019-01-01 00:39:53,419 INFO L112 eAbstractionObserver]: Analyzing ICFG safe031_pso.opt_false-unreach-call.i [2019-01-01 00:39:53,472 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,472 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,472 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,472 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,473 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,473 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,473 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,473 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,473 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,475 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,476 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,480 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,480 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,480 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,481 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,483 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,483 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,483 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,483 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,483 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,484 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,484 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,484 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,484 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,484 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,485 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,485 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,485 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,487 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,487 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,488 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,488 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,488 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,489 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,489 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,489 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,489 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,489 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,490 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,490 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,490 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,490 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,490 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,493 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,494 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,494 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,495 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,495 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,495 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,495 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,495 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,497 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,497 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,497 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,498 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,498 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,498 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,498 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,499 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,499 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,499 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,499 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,499 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,500 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,500 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,500 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,500 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,500 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,502 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,502 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,502 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,502 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,503 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,503 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,503 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,503 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,505 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,505 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,505 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,505 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,506 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,509 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:39:53,542 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-01 00:39:53,543 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 00:39:53,558 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-01 00:39:53,580 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-01 00:39:53,608 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 00:39:53,609 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 00:39:53,609 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-01 00:39:53,609 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 00:39:53,609 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 00:39:53,610 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 00:39:53,610 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 00:39:53,610 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 00:39:53,610 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 00:39:53,628 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 155places, 192 transitions [2019-01-01 00:40:17,900 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 128912 states. [2019-01-01 00:40:17,902 INFO L276 IsEmpty]: Start isEmpty. Operand 128912 states. [2019-01-01 00:40:17,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-01 00:40:17,922 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:40:17,924 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:40:17,926 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:40:17,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:40:17,934 INFO L82 PathProgramCache]: Analyzing trace with hash 961127934, now seen corresponding path program 1 times [2019-01-01 00:40:17,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:40:17,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:40:18,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:40:18,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:40:18,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:40:18,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:40:18,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:40:18,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:40:18,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:40:18,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:40:18,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:40:18,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:40:18,423 INFO L87 Difference]: Start difference. First operand 128912 states. Second operand 4 states. [2019-01-01 00:40:21,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:40:21,043 INFO L93 Difference]: Finished difference Result 233472 states and 1098324 transitions. [2019-01-01 00:40:21,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 00:40:21,045 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-01-01 00:40:21,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:40:22,472 INFO L225 Difference]: With dead ends: 233472 [2019-01-01 00:40:22,473 INFO L226 Difference]: Without dead ends: 203722 [2019-01-01 00:40:22,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:40:31,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203722 states. [2019-01-01 00:40:34,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203722 to 118892. [2019-01-01 00:40:34,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118892 states. [2019-01-01 00:40:36,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118892 states to 118892 states and 559775 transitions. [2019-01-01 00:40:36,846 INFO L78 Accepts]: Start accepts. Automaton has 118892 states and 559775 transitions. Word has length 43 [2019-01-01 00:40:36,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:40:36,848 INFO L480 AbstractCegarLoop]: Abstraction has 118892 states and 559775 transitions. [2019-01-01 00:40:36,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:40:36,848 INFO L276 IsEmpty]: Start isEmpty. Operand 118892 states and 559775 transitions. [2019-01-01 00:40:36,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-01 00:40:36,864 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:40:36,864 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] [2019-01-01 00:40:36,865 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:40:36,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:40:36,865 INFO L82 PathProgramCache]: Analyzing trace with hash -94457539, now seen corresponding path program 1 times [2019-01-01 00:40:36,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:40:36,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:40:36,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:40:36,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:40:36,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:40:36,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:40:37,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:40:37,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:40:37,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 00:40:37,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 00:40:37,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 00:40:37,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:40:37,017 INFO L87 Difference]: Start difference. First operand 118892 states and 559775 transitions. Second operand 5 states. [2019-01-01 00:40:41,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:40:41,028 INFO L93 Difference]: Finished difference Result 325272 states and 1470479 transitions. [2019-01-01 00:40:41,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 00:40:41,029 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-01-01 00:40:41,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:40:42,507 INFO L225 Difference]: With dead ends: 325272 [2019-01-01 00:40:42,507 INFO L226 Difference]: Without dead ends: 324272 [2019-01-01 00:40:42,509 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 [2019-01-01 00:40:54,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324272 states. [2019-01-01 00:40:59,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324272 to 186422. [2019-01-01 00:40:59,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186422 states. [2019-01-01 00:41:00,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186422 states to 186422 states and 842874 transitions. [2019-01-01 00:41:00,525 INFO L78 Accepts]: Start accepts. Automaton has 186422 states and 842874 transitions. Word has length 50 [2019-01-01 00:41:00,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:41:00,526 INFO L480 AbstractCegarLoop]: Abstraction has 186422 states and 842874 transitions. [2019-01-01 00:41:00,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 00:41:00,526 INFO L276 IsEmpty]: Start isEmpty. Operand 186422 states and 842874 transitions. [2019-01-01 00:41:00,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-01 00:41:00,537 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:41:00,538 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:41:00,538 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:41:00,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:41:00,538 INFO L82 PathProgramCache]: Analyzing trace with hash 945118259, now seen corresponding path program 1 times [2019-01-01 00:41:00,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:41:00,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:41:00,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:41:00,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:41:00,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:41:00,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:41:00,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:41:00,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:41:00,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:41:00,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:41:00,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:41:00,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:41:00,730 INFO L87 Difference]: Start difference. First operand 186422 states and 842874 transitions. Second operand 4 states. [2019-01-01 00:41:01,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:41:01,709 INFO L93 Difference]: Finished difference Result 163598 states and 727062 transitions. [2019-01-01 00:41:01,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 00:41:01,710 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-01-01 00:41:01,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:41:02,287 INFO L225 Difference]: With dead ends: 163598 [2019-01-01 00:41:02,288 INFO L226 Difference]: Without dead ends: 160993 [2019-01-01 00:41:02,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:41:03,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160993 states. [2019-01-01 00:41:08,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160993 to 160993. [2019-01-01 00:41:08,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160993 states. [2019-01-01 00:41:08,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160993 states to 160993 states and 718375 transitions. [2019-01-01 00:41:09,000 INFO L78 Accepts]: Start accepts. Automaton has 160993 states and 718375 transitions. Word has length 51 [2019-01-01 00:41:09,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:41:09,000 INFO L480 AbstractCegarLoop]: Abstraction has 160993 states and 718375 transitions. [2019-01-01 00:41:09,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:41:09,000 INFO L276 IsEmpty]: Start isEmpty. Operand 160993 states and 718375 transitions. [2019-01-01 00:41:09,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-01 00:41:09,009 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:41:09,009 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] [2019-01-01 00:41:09,010 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:41:09,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:41:09,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1718120939, now seen corresponding path program 1 times [2019-01-01 00:41:09,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:41:09,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:41:09,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:41:09,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:41:09,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:41:09,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:41:09,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:41:09,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:41:09,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 00:41:09,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 00:41:09,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 00:41:09,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:41:09,132 INFO L87 Difference]: Start difference. First operand 160993 states and 718375 transitions. Second operand 5 states. [2019-01-01 00:41:09,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:41:09,521 INFO L93 Difference]: Finished difference Result 51405 states and 209168 transitions. [2019-01-01 00:41:09,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 00:41:09,521 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-01-01 00:41:09,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:41:09,693 INFO L225 Difference]: With dead ends: 51405 [2019-01-01 00:41:09,694 INFO L226 Difference]: Without dead ends: 49093 [2019-01-01 00:41:09,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:41:09,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49093 states. [2019-01-01 00:41:12,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49093 to 49093. [2019-01-01 00:41:12,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49093 states. [2019-01-01 00:41:12,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49093 states to 49093 states and 200502 transitions. [2019-01-01 00:41:12,865 INFO L78 Accepts]: Start accepts. Automaton has 49093 states and 200502 transitions. Word has length 52 [2019-01-01 00:41:12,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:41:12,865 INFO L480 AbstractCegarLoop]: Abstraction has 49093 states and 200502 transitions. [2019-01-01 00:41:12,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 00:41:12,865 INFO L276 IsEmpty]: Start isEmpty. Operand 49093 states and 200502 transitions. [2019-01-01 00:41:12,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-01 00:41:12,884 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:41:12,884 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] [2019-01-01 00:41:12,884 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:41:12,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:41:12,886 INFO L82 PathProgramCache]: Analyzing trace with hash 50693845, now seen corresponding path program 1 times [2019-01-01 00:41:12,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:41:12,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:41:12,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:41:12,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:41:12,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:41:12,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:41:12,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:41:12,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:41:12,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:41:12,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:41:13,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:41:13,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:41:13,000 INFO L87 Difference]: Start difference. First operand 49093 states and 200502 transitions. Second operand 4 states. [2019-01-01 00:41:13,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:41:13,880 INFO L93 Difference]: Finished difference Result 70361 states and 282266 transitions. [2019-01-01 00:41:13,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 00:41:13,881 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-01-01 00:41:13,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:41:14,097 INFO L225 Difference]: With dead ends: 70361 [2019-01-01 00:41:14,097 INFO L226 Difference]: Without dead ends: 70361 [2019-01-01 00:41:14,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:41:14,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70361 states. [2019-01-01 00:41:15,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70361 to 53657. [2019-01-01 00:41:15,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53657 states. [2019-01-01 00:41:16,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53657 states to 53657 states and 217418 transitions. [2019-01-01 00:41:16,275 INFO L78 Accepts]: Start accepts. Automaton has 53657 states and 217418 transitions. Word has length 65 [2019-01-01 00:41:16,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:41:16,275 INFO L480 AbstractCegarLoop]: Abstraction has 53657 states and 217418 transitions. [2019-01-01 00:41:16,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:41:16,276 INFO L276 IsEmpty]: Start isEmpty. Operand 53657 states and 217418 transitions. [2019-01-01 00:41:16,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-01 00:41:16,296 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:41:16,296 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] [2019-01-01 00:41:16,296 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:41:16,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:41:16,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1256698635, now seen corresponding path program 1 times [2019-01-01 00:41:16,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:41:16,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:41:16,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:41:16,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:41:16,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:41:16,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:41:16,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:41:16,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:41:16,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:41:16,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:41:16,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:41:16,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:41:16,661 INFO L87 Difference]: Start difference. First operand 53657 states and 217418 transitions. Second operand 6 states. [2019-01-01 00:41:16,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:41:16,843 INFO L93 Difference]: Finished difference Result 11001 states and 37626 transitions. [2019-01-01 00:41:16,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:41:16,845 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-01-01 00:41:16,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:41:16,867 INFO L225 Difference]: With dead ends: 11001 [2019-01-01 00:41:16,867 INFO L226 Difference]: Without dead ends: 9289 [2019-01-01 00:41:16,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-01-01 00:41:16,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9289 states. [2019-01-01 00:41:16,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9289 to 8774. [2019-01-01 00:41:16,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8774 states. [2019-01-01 00:41:17,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8774 states to 8774 states and 29930 transitions. [2019-01-01 00:41:17,011 INFO L78 Accepts]: Start accepts. Automaton has 8774 states and 29930 transitions. Word has length 65 [2019-01-01 00:41:17,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:41:17,011 INFO L480 AbstractCegarLoop]: Abstraction has 8774 states and 29930 transitions. [2019-01-01 00:41:17,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:41:17,011 INFO L276 IsEmpty]: Start isEmpty. Operand 8774 states and 29930 transitions. [2019-01-01 00:41:17,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-01 00:41:17,027 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:41:17,027 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] [2019-01-01 00:41:17,028 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:41:17,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:41:17,028 INFO L82 PathProgramCache]: Analyzing trace with hash -65901941, now seen corresponding path program 1 times [2019-01-01 00:41:17,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:41:17,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:41:17,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:41:17,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:41:17,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:41:17,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:41:17,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:41:17,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:41:17,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 00:41:17,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 00:41:17,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 00:41:17,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 00:41:17,155 INFO L87 Difference]: Start difference. First operand 8774 states and 29930 transitions. Second operand 3 states. [2019-01-01 00:41:17,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:41:17,400 INFO L93 Difference]: Finished difference Result 9194 states and 31211 transitions. [2019-01-01 00:41:17,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 00:41:17,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-01-01 00:41:17,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:41:17,418 INFO L225 Difference]: With dead ends: 9194 [2019-01-01 00:41:17,418 INFO L226 Difference]: Without dead ends: 9194 [2019-01-01 00:41:17,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 00:41:17,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9194 states. [2019-01-01 00:41:17,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9194 to 8964. [2019-01-01 00:41:17,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8964 states. [2019-01-01 00:41:17,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8964 states to 8964 states and 30512 transitions. [2019-01-01 00:41:17,567 INFO L78 Accepts]: Start accepts. Automaton has 8964 states and 30512 transitions. Word has length 98 [2019-01-01 00:41:17,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:41:17,567 INFO L480 AbstractCegarLoop]: Abstraction has 8964 states and 30512 transitions. [2019-01-01 00:41:17,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 00:41:17,568 INFO L276 IsEmpty]: Start isEmpty. Operand 8964 states and 30512 transitions. [2019-01-01 00:41:17,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-01 00:41:17,584 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:41:17,584 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] [2019-01-01 00:41:17,585 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:41:17,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:41:17,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1926134572, now seen corresponding path program 1 times [2019-01-01 00:41:17,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:41:17,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:41:17,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:41:17,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:41:17,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:41:17,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:41:17,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:41:17,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:41:17,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 00:41:17,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 00:41:17,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 00:41:17,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:41:17,831 INFO L87 Difference]: Start difference. First operand 8964 states and 30512 transitions. Second operand 5 states. [2019-01-01 00:41:18,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:41:18,195 INFO L93 Difference]: Finished difference Result 11109 states and 37228 transitions. [2019-01-01 00:41:18,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 00:41:18,196 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-01-01 00:41:18,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:41:18,218 INFO L225 Difference]: With dead ends: 11109 [2019-01-01 00:41:18,218 INFO L226 Difference]: Without dead ends: 11109 [2019-01-01 00:41:18,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-01 00:41:18,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11109 states. [2019-01-01 00:41:18,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11109 to 9409. [2019-01-01 00:41:18,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9409 states. [2019-01-01 00:41:18,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9409 states to 9409 states and 31878 transitions. [2019-01-01 00:41:18,385 INFO L78 Accepts]: Start accepts. Automaton has 9409 states and 31878 transitions. Word has length 98 [2019-01-01 00:41:18,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:41:18,385 INFO L480 AbstractCegarLoop]: Abstraction has 9409 states and 31878 transitions. [2019-01-01 00:41:18,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 00:41:18,386 INFO L276 IsEmpty]: Start isEmpty. Operand 9409 states and 31878 transitions. [2019-01-01 00:41:18,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-01 00:41:18,404 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:41:18,405 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] [2019-01-01 00:41:18,405 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:41:18,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:41:18,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1918375213, now seen corresponding path program 2 times [2019-01-01 00:41:18,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:41:18,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:41:18,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:41:18,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:41:18,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:41:18,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:41:18,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:41:18,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:41:18,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:41:18,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:41:18,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:41:18,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:41:18,569 INFO L87 Difference]: Start difference. First operand 9409 states and 31878 transitions. Second operand 4 states. [2019-01-01 00:41:18,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:41:18,947 INFO L93 Difference]: Finished difference Result 14489 states and 49275 transitions. [2019-01-01 00:41:18,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 00:41:18,948 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-01-01 00:41:18,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:41:18,976 INFO L225 Difference]: With dead ends: 14489 [2019-01-01 00:41:18,976 INFO L226 Difference]: Without dead ends: 14489 [2019-01-01 00:41:18,977 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 [2019-01-01 00:41:19,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14489 states. [2019-01-01 00:41:19,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14489 to 9619. [2019-01-01 00:41:19,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9619 states. [2019-01-01 00:41:19,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9619 states to 9619 states and 32516 transitions. [2019-01-01 00:41:19,169 INFO L78 Accepts]: Start accepts. Automaton has 9619 states and 32516 transitions. Word has length 98 [2019-01-01 00:41:19,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:41:19,169 INFO L480 AbstractCegarLoop]: Abstraction has 9619 states and 32516 transitions. [2019-01-01 00:41:19,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:41:19,169 INFO L276 IsEmpty]: Start isEmpty. Operand 9619 states and 32516 transitions. [2019-01-01 00:41:19,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-01 00:41:19,188 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:41:19,188 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] [2019-01-01 00:41:19,188 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:41:19,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:41:19,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1701823397, now seen corresponding path program 1 times [2019-01-01 00:41:19,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:41:19,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:41:19,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:41:19,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 00:41:19,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:41:19,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:41:19,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:41:19,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:41:19,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:41:19,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:41:19,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:41:19,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:41:19,404 INFO L87 Difference]: Start difference. First operand 9619 states and 32516 transitions. Second operand 4 states. [2019-01-01 00:41:19,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:41:19,712 INFO L93 Difference]: Finished difference Result 17455 states and 58935 transitions. [2019-01-01 00:41:19,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 00:41:19,712 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-01-01 00:41:19,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:41:19,746 INFO L225 Difference]: With dead ends: 17455 [2019-01-01 00:41:19,746 INFO L226 Difference]: Without dead ends: 17455 [2019-01-01 00:41:19,746 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 [2019-01-01 00:41:19,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17455 states. [2019-01-01 00:41:19,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17455 to 9369. [2019-01-01 00:41:19,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9369 states. [2019-01-01 00:41:19,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9369 states to 9369 states and 31381 transitions. [2019-01-01 00:41:19,938 INFO L78 Accepts]: Start accepts. Automaton has 9369 states and 31381 transitions. Word has length 100 [2019-01-01 00:41:19,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:41:19,938 INFO L480 AbstractCegarLoop]: Abstraction has 9369 states and 31381 transitions. [2019-01-01 00:41:19,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:41:19,939 INFO L276 IsEmpty]: Start isEmpty. Operand 9369 states and 31381 transitions. [2019-01-01 00:41:19,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-01 00:41:19,955 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:41:19,956 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:41:19,956 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:41:19,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:41:19,956 INFO L82 PathProgramCache]: Analyzing trace with hash 518476100, now seen corresponding path program 1 times [2019-01-01 00:41:19,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:41:19,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:41:19,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:41:19,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:41:19,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:41:19,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:41:20,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:41:20,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:41:20,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:41:20,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:41:20,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:41:20,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:41:20,126 INFO L87 Difference]: Start difference. First operand 9369 states and 31381 transitions. Second operand 6 states. [2019-01-01 00:41:20,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:41:20,585 INFO L93 Difference]: Finished difference Result 11429 states and 37809 transitions. [2019-01-01 00:41:20,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 00:41:20,586 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-01-01 00:41:20,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:41:20,607 INFO L225 Difference]: With dead ends: 11429 [2019-01-01 00:41:20,607 INFO L226 Difference]: Without dead ends: 11429 [2019-01-01 00:41:20,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:41:20,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11429 states. [2019-01-01 00:41:20,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11429 to 9714. [2019-01-01 00:41:20,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9714 states. [2019-01-01 00:41:20,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9714 states to 9714 states and 32502 transitions. [2019-01-01 00:41:20,771 INFO L78 Accepts]: Start accepts. Automaton has 9714 states and 32502 transitions. Word has length 100 [2019-01-01 00:41:20,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:41:20,771 INFO L480 AbstractCegarLoop]: Abstraction has 9714 states and 32502 transitions. [2019-01-01 00:41:20,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:41:20,771 INFO L276 IsEmpty]: Start isEmpty. Operand 9714 states and 32502 transitions. [2019-01-01 00:41:20,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-01 00:41:20,785 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:41:20,786 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] [2019-01-01 00:41:20,786 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:41:20,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:41:20,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1488057123, now seen corresponding path program 1 times [2019-01-01 00:41:20,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:41:20,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:41:20,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:41:20,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:41:20,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:41:20,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:41:21,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:41:21,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:41:21,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:41:21,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:41:21,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:41:21,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:41:21,184 INFO L87 Difference]: Start difference. First operand 9714 states and 32502 transitions. Second operand 6 states. [2019-01-01 00:41:21,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:41:21,497 INFO L93 Difference]: Finished difference Result 8993 states and 29767 transitions. [2019-01-01 00:41:21,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 00:41:21,498 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-01-01 00:41:21,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:41:21,515 INFO L225 Difference]: With dead ends: 8993 [2019-01-01 00:41:21,515 INFO L226 Difference]: Without dead ends: 8993 [2019-01-01 00:41:21,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-01 00:41:21,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8993 states. [2019-01-01 00:41:21,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8993 to 8644. [2019-01-01 00:41:21,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8644 states. [2019-01-01 00:41:21,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8644 states to 8644 states and 28746 transitions. [2019-01-01 00:41:21,656 INFO L78 Accepts]: Start accepts. Automaton has 8644 states and 28746 transitions. Word has length 100 [2019-01-01 00:41:21,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:41:21,656 INFO L480 AbstractCegarLoop]: Abstraction has 8644 states and 28746 transitions. [2019-01-01 00:41:21,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:41:21,656 INFO L276 IsEmpty]: Start isEmpty. Operand 8644 states and 28746 transitions. [2019-01-01 00:41:21,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-01 00:41:21,671 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:41:21,671 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] [2019-01-01 00:41:21,671 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:41:21,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:41:21,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1510968987, now seen corresponding path program 1 times [2019-01-01 00:41:21,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:41:21,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:41:21,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:41:21,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:41:21,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:41:21,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:41:22,075 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2019-01-01 00:41:22,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:41:22,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:41:22,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 00:41:22,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 00:41:22,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 00:41:22,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:41:22,087 INFO L87 Difference]: Start difference. First operand 8644 states and 28746 transitions. Second operand 7 states. [2019-01-01 00:41:22,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:41:22,528 INFO L93 Difference]: Finished difference Result 10137 states and 33301 transitions. [2019-01-01 00:41:22,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:41:22,529 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2019-01-01 00:41:22,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:41:22,548 INFO L225 Difference]: With dead ends: 10137 [2019-01-01 00:41:22,548 INFO L226 Difference]: Without dead ends: 10137 [2019-01-01 00:41:22,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:41:22,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10137 states. [2019-01-01 00:41:22,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10137 to 9044. [2019-01-01 00:41:22,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9044 states. [2019-01-01 00:41:22,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9044 states to 9044 states and 29796 transitions. [2019-01-01 00:41:22,686 INFO L78 Accepts]: Start accepts. Automaton has 9044 states and 29796 transitions. Word has length 100 [2019-01-01 00:41:22,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:41:22,687 INFO L480 AbstractCegarLoop]: Abstraction has 9044 states and 29796 transitions. [2019-01-01 00:41:22,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 00:41:22,687 INFO L276 IsEmpty]: Start isEmpty. Operand 9044 states and 29796 transitions. [2019-01-01 00:41:22,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-01 00:41:22,699 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:41:22,699 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] [2019-01-01 00:41:22,700 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:41:22,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:41:22,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1600651012, now seen corresponding path program 1 times [2019-01-01 00:41:22,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:41:22,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:41:22,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:41:22,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:41:22,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:41:22,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:41:23,179 WARN L181 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 14 [2019-01-01 00:41:23,433 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2019-01-01 00:41:23,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:41:23,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:41:23,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 00:41:23,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 00:41:23,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 00:41:23,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:41:23,446 INFO L87 Difference]: Start difference. First operand 9044 states and 29796 transitions. Second operand 5 states. [2019-01-01 00:41:23,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:41:23,668 INFO L93 Difference]: Finished difference Result 8252 states and 27064 transitions. [2019-01-01 00:41:23,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 00:41:23,669 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-01-01 00:41:23,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:41:23,683 INFO L225 Difference]: With dead ends: 8252 [2019-01-01 00:41:23,683 INFO L226 Difference]: Without dead ends: 8252 [2019-01-01 00:41:23,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:41:23,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8252 states. [2019-01-01 00:41:23,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8252 to 8012. [2019-01-01 00:41:23,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8012 states. [2019-01-01 00:41:23,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8012 states to 8012 states and 26387 transitions. [2019-01-01 00:41:23,799 INFO L78 Accepts]: Start accepts. Automaton has 8012 states and 26387 transitions. Word has length 100 [2019-01-01 00:41:23,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:41:23,799 INFO L480 AbstractCegarLoop]: Abstraction has 8012 states and 26387 transitions. [2019-01-01 00:41:23,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 00:41:23,800 INFO L276 IsEmpty]: Start isEmpty. Operand 8012 states and 26387 transitions. [2019-01-01 00:41:23,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-01 00:41:23,811 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:41:23,812 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] [2019-01-01 00:41:23,812 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:41:23,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:41:23,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1151954373, now seen corresponding path program 1 times [2019-01-01 00:41:23,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:41:23,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:41:23,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:41:23,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:41:23,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:41:23,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:41:23,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:41:23,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:41:23,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:41:23,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:41:23,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:41:23,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:41:23,947 INFO L87 Difference]: Start difference. First operand 8012 states and 26387 transitions. Second operand 4 states. [2019-01-01 00:41:24,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:41:24,143 INFO L93 Difference]: Finished difference Result 9356 states and 31075 transitions. [2019-01-01 00:41:24,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 00:41:24,144 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-01-01 00:41:24,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:41:24,162 INFO L225 Difference]: With dead ends: 9356 [2019-01-01 00:41:24,162 INFO L226 Difference]: Without dead ends: 9356 [2019-01-01 00:41:24,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:41:24,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9356 states. [2019-01-01 00:41:24,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9356 to 9228. [2019-01-01 00:41:24,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9228 states. [2019-01-01 00:41:24,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9228 states to 9228 states and 30659 transitions. [2019-01-01 00:41:24,299 INFO L78 Accepts]: Start accepts. Automaton has 9228 states and 30659 transitions. Word has length 100 [2019-01-01 00:41:24,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:41:24,300 INFO L480 AbstractCegarLoop]: Abstraction has 9228 states and 30659 transitions. [2019-01-01 00:41:24,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:41:24,300 INFO L276 IsEmpty]: Start isEmpty. Operand 9228 states and 30659 transitions. [2019-01-01 00:41:24,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-01 00:41:24,317 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:41:24,317 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] [2019-01-01 00:41:24,318 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:41:24,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:41:24,318 INFO L82 PathProgramCache]: Analyzing trace with hash -925254970, now seen corresponding path program 1 times [2019-01-01 00:41:24,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:41:24,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:41:24,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:41:24,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:41:24,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:41:24,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:41:24,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:41:24,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:41:24,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:41:24,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:41:24,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:41:24,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:41:24,573 INFO L87 Difference]: Start difference. First operand 9228 states and 30659 transitions. Second operand 6 states. [2019-01-01 00:41:24,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:41:24,795 INFO L93 Difference]: Finished difference Result 8076 states and 26211 transitions. [2019-01-01 00:41:24,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 00:41:24,796 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-01-01 00:41:24,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:41:24,812 INFO L225 Difference]: With dead ends: 8076 [2019-01-01 00:41:24,812 INFO L226 Difference]: Without dead ends: 8076 [2019-01-01 00:41:24,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:41:24,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8076 states. [2019-01-01 00:41:24,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8076 to 6651. [2019-01-01 00:41:24,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6651 states. [2019-01-01 00:41:24,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6651 states to 6651 states and 21805 transitions. [2019-01-01 00:41:24,927 INFO L78 Accepts]: Start accepts. Automaton has 6651 states and 21805 transitions. Word has length 100 [2019-01-01 00:41:24,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:41:24,928 INFO L480 AbstractCegarLoop]: Abstraction has 6651 states and 21805 transitions. [2019-01-01 00:41:24,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:41:24,928 INFO L276 IsEmpty]: Start isEmpty. Operand 6651 states and 21805 transitions. [2019-01-01 00:41:24,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-01 00:41:24,941 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:41:24,941 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] [2019-01-01 00:41:24,941 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:41:24,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:41:24,941 INFO L82 PathProgramCache]: Analyzing trace with hash -461333349, now seen corresponding path program 1 times [2019-01-01 00:41:24,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:41:24,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:41:24,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:41:24,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:41:24,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:41:24,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:41:25,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:41:25,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:41:25,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 00:41:25,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 00:41:25,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 00:41:25,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:41:25,175 INFO L87 Difference]: Start difference. First operand 6651 states and 21805 transitions. Second operand 7 states. [2019-01-01 00:41:26,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:41:26,562 INFO L93 Difference]: Finished difference Result 12208 states and 39612 transitions. [2019-01-01 00:41:26,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-01 00:41:26,563 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2019-01-01 00:41:26,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:41:26,586 INFO L225 Difference]: With dead ends: 12208 [2019-01-01 00:41:26,586 INFO L226 Difference]: Without dead ends: 12208 [2019-01-01 00:41:26,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-01-01 00:41:26,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12208 states. [2019-01-01 00:41:26,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12208 to 9633. [2019-01-01 00:41:26,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9633 states. [2019-01-01 00:41:26,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9633 states to 9633 states and 31663 transitions. [2019-01-01 00:41:26,766 INFO L78 Accepts]: Start accepts. Automaton has 9633 states and 31663 transitions. Word has length 102 [2019-01-01 00:41:26,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:41:26,767 INFO L480 AbstractCegarLoop]: Abstraction has 9633 states and 31663 transitions. [2019-01-01 00:41:26,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 00:41:26,767 INFO L276 IsEmpty]: Start isEmpty. Operand 9633 states and 31663 transitions. [2019-01-01 00:41:26,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-01 00:41:26,782 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:41:26,782 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] [2019-01-01 00:41:26,782 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:41:26,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:41:26,783 INFO L82 PathProgramCache]: Analyzing trace with hash 783431132, now seen corresponding path program 1 times [2019-01-01 00:41:26,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:41:26,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:41:26,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:41:26,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:41:26,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:41:26,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:41:27,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:41:27,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:41:27,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:41:27,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:41:27,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:41:27,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:41:27,009 INFO L87 Difference]: Start difference. First operand 9633 states and 31663 transitions. Second operand 6 states. [2019-01-01 00:41:27,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:41:27,280 INFO L93 Difference]: Finished difference Result 9833 states and 32038 transitions. [2019-01-01 00:41:27,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 00:41:27,281 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2019-01-01 00:41:27,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:41:27,299 INFO L225 Difference]: With dead ends: 9833 [2019-01-01 00:41:27,299 INFO L226 Difference]: Without dead ends: 9833 [2019-01-01 00:41:27,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-01-01 00:41:27,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9833 states. [2019-01-01 00:41:27,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9833 to 9558. [2019-01-01 00:41:27,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9558 states. [2019-01-01 00:41:27,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9558 states to 9558 states and 31283 transitions. [2019-01-01 00:41:27,456 INFO L78 Accepts]: Start accepts. Automaton has 9558 states and 31283 transitions. Word has length 102 [2019-01-01 00:41:27,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:41:27,456 INFO L480 AbstractCegarLoop]: Abstraction has 9558 states and 31283 transitions. [2019-01-01 00:41:27,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:41:27,457 INFO L276 IsEmpty]: Start isEmpty. Operand 9558 states and 31283 transitions. [2019-01-01 00:41:27,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-01 00:41:27,471 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:41:27,471 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] [2019-01-01 00:41:27,471 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:41:27,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:41:27,472 INFO L82 PathProgramCache]: Analyzing trace with hash -131567588, now seen corresponding path program 1 times [2019-01-01 00:41:27,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:41:27,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:41:27,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:41:27,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:41:27,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:41:27,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:41:27,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:41:27,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:41:27,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:41:27,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:41:27,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:41:27,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:41:27,808 INFO L87 Difference]: Start difference. First operand 9558 states and 31283 transitions. Second operand 6 states. [2019-01-01 00:41:28,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:41:28,244 INFO L93 Difference]: Finished difference Result 12102 states and 38933 transitions. [2019-01-01 00:41:28,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 00:41:28,245 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2019-01-01 00:41:28,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:41:28,267 INFO L225 Difference]: With dead ends: 12102 [2019-01-01 00:41:28,267 INFO L226 Difference]: Without dead ends: 12102 [2019-01-01 00:41:28,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-01 00:41:28,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12102 states. [2019-01-01 00:41:28,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12102 to 9808. [2019-01-01 00:41:28,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9808 states. [2019-01-01 00:41:28,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9808 states to 9808 states and 31903 transitions. [2019-01-01 00:41:28,437 INFO L78 Accepts]: Start accepts. Automaton has 9808 states and 31903 transitions. Word has length 102 [2019-01-01 00:41:28,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:41:28,437 INFO L480 AbstractCegarLoop]: Abstraction has 9808 states and 31903 transitions. [2019-01-01 00:41:28,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:41:28,437 INFO L276 IsEmpty]: Start isEmpty. Operand 9808 states and 31903 transitions. [2019-01-01 00:41:28,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-01 00:41:28,451 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:41:28,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] [2019-01-01 00:41:28,452 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:41:28,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:41:28,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1001623005, now seen corresponding path program 1 times [2019-01-01 00:41:28,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:41:28,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:41:28,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:41:28,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:41:28,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:41:28,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:41:28,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:41:28,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:41:28,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 00:41:28,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 00:41:28,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 00:41:28,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:41:28,829 INFO L87 Difference]: Start difference. First operand 9808 states and 31903 transitions. Second operand 5 states. [2019-01-01 00:41:30,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:41:30,027 INFO L93 Difference]: Finished difference Result 11088 states and 36063 transitions. [2019-01-01 00:41:30,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:41:30,028 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-01-01 00:41:30,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:41:30,048 INFO L225 Difference]: With dead ends: 11088 [2019-01-01 00:41:30,049 INFO L226 Difference]: Without dead ends: 11088 [2019-01-01 00:41:30,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:41:30,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11088 states. [2019-01-01 00:41:30,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11088 to 8640. [2019-01-01 00:41:30,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8640 states. [2019-01-01 00:41:30,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8640 states to 8640 states and 28214 transitions. [2019-01-01 00:41:30,188 INFO L78 Accepts]: Start accepts. Automaton has 8640 states and 28214 transitions. Word has length 102 [2019-01-01 00:41:30,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:41:30,189 INFO L480 AbstractCegarLoop]: Abstraction has 8640 states and 28214 transitions. [2019-01-01 00:41:30,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 00:41:30,189 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states and 28214 transitions. [2019-01-01 00:41:30,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-01 00:41:30,200 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:41:30,201 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] [2019-01-01 00:41:30,201 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:41:30,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:41:30,201 INFO L82 PathProgramCache]: Analyzing trace with hash -2048579810, now seen corresponding path program 1 times [2019-01-01 00:41:30,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:41:30,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:41:30,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:41:30,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:41:30,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:41:30,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:41:30,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:41:30,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:41:30,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 00:41:30,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 00:41:30,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 00:41:30,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:41:30,550 INFO L87 Difference]: Start difference. First operand 8640 states and 28214 transitions. Second operand 7 states. [2019-01-01 00:41:30,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:41:30,963 INFO L93 Difference]: Finished difference Result 15906 states and 52553 transitions. [2019-01-01 00:41:30,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 00:41:30,964 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2019-01-01 00:41:30,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:41:30,980 INFO L225 Difference]: With dead ends: 15906 [2019-01-01 00:41:30,980 INFO L226 Difference]: Without dead ends: 8010 [2019-01-01 00:41:30,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-01-01 00:41:30,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8010 states. [2019-01-01 00:41:31,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8010 to 7980. [2019-01-01 00:41:31,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7980 states. [2019-01-01 00:41:31,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7980 states to 7980 states and 26278 transitions. [2019-01-01 00:41:31,103 INFO L78 Accepts]: Start accepts. Automaton has 7980 states and 26278 transitions. Word has length 102 [2019-01-01 00:41:31,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:41:31,103 INFO L480 AbstractCegarLoop]: Abstraction has 7980 states and 26278 transitions. [2019-01-01 00:41:31,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 00:41:31,103 INFO L276 IsEmpty]: Start isEmpty. Operand 7980 states and 26278 transitions. [2019-01-01 00:41:31,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-01 00:41:31,117 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:41:31,117 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] [2019-01-01 00:41:31,117 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:41:31,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:41:31,118 INFO L82 PathProgramCache]: Analyzing trace with hash 84668374, now seen corresponding path program 2 times [2019-01-01 00:41:31,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:41:31,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:41:31,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:41:31,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:41:31,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:41:31,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:41:31,480 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-01 00:41:31,664 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-01 00:41:31,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:41:31,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:41:31,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-01 00:41:31,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 00:41:31,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 00:41:31,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-01-01 00:41:31,872 INFO L87 Difference]: Start difference. First operand 7980 states and 26278 transitions. Second operand 10 states. [2019-01-01 00:41:32,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:41:32,543 INFO L93 Difference]: Finished difference Result 14722 states and 49217 transitions. [2019-01-01 00:41:32,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 00:41:32,544 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 102 [2019-01-01 00:41:32,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:41:32,561 INFO L225 Difference]: With dead ends: 14722 [2019-01-01 00:41:32,561 INFO L226 Difference]: Without dead ends: 6821 [2019-01-01 00:41:32,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-01-01 00:41:32,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6821 states. [2019-01-01 00:41:32,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6821 to 6821. [2019-01-01 00:41:32,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6821 states. [2019-01-01 00:41:32,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6821 states to 6821 states and 23131 transitions. [2019-01-01 00:41:32,681 INFO L78 Accepts]: Start accepts. Automaton has 6821 states and 23131 transitions. Word has length 102 [2019-01-01 00:41:32,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:41:32,681 INFO L480 AbstractCegarLoop]: Abstraction has 6821 states and 23131 transitions. [2019-01-01 00:41:32,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 00:41:32,681 INFO L276 IsEmpty]: Start isEmpty. Operand 6821 states and 23131 transitions. [2019-01-01 00:41:32,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-01 00:41:32,693 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:41:32,693 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] [2019-01-01 00:41:32,694 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:41:32,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:41:32,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1082345370, now seen corresponding path program 1 times [2019-01-01 00:41:32,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:41:32,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:41:32,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:41:32,696 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 00:41:32,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:41:32,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:41:33,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:41:33,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:41:33,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 00:41:33,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 00:41:33,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 00:41:33,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:41:33,145 INFO L87 Difference]: Start difference. First operand 6821 states and 23131 transitions. Second operand 7 states. [2019-01-01 00:41:33,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:41:33,623 INFO L93 Difference]: Finished difference Result 8957 states and 29585 transitions. [2019-01-01 00:41:33,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 00:41:33,624 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2019-01-01 00:41:33,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:41:33,640 INFO L225 Difference]: With dead ends: 8957 [2019-01-01 00:41:33,640 INFO L226 Difference]: Without dead ends: 8821 [2019-01-01 00:41:33,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-01-01 00:41:33,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8821 states. [2019-01-01 00:41:33,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8821 to 6805. [2019-01-01 00:41:33,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6805 states. [2019-01-01 00:41:33,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6805 states to 6805 states and 23039 transitions. [2019-01-01 00:41:33,756 INFO L78 Accepts]: Start accepts. Automaton has 6805 states and 23039 transitions. Word has length 102 [2019-01-01 00:41:33,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:41:33,757 INFO L480 AbstractCegarLoop]: Abstraction has 6805 states and 23039 transitions. [2019-01-01 00:41:33,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 00:41:33,757 INFO L276 IsEmpty]: Start isEmpty. Operand 6805 states and 23039 transitions. [2019-01-01 00:41:33,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-01 00:41:33,766 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:41:33,766 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] [2019-01-01 00:41:33,767 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:41:33,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:41:33,767 INFO L82 PathProgramCache]: Analyzing trace with hash -853314917, now seen corresponding path program 1 times [2019-01-01 00:41:33,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:41:33,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:41:33,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:41:33,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:41:33,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:41:33,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:41:34,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:41:34,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:41:34,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 00:41:34,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 00:41:34,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 00:41:34,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:41:34,084 INFO L87 Difference]: Start difference. First operand 6805 states and 23039 transitions. Second operand 5 states. [2019-01-01 00:41:34,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:41:34,213 INFO L93 Difference]: Finished difference Result 6805 states and 22971 transitions. [2019-01-01 00:41:34,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 00:41:34,214 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-01-01 00:41:34,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:41:34,228 INFO L225 Difference]: With dead ends: 6805 [2019-01-01 00:41:34,228 INFO L226 Difference]: Without dead ends: 6805 [2019-01-01 00:41:34,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:41:34,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6805 states. [2019-01-01 00:41:34,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6805 to 6789. [2019-01-01 00:41:34,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6789 states. [2019-01-01 00:41:34,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6789 states to 6789 states and 22927 transitions. [2019-01-01 00:41:34,339 INFO L78 Accepts]: Start accepts. Automaton has 6789 states and 22927 transitions. Word has length 102 [2019-01-01 00:41:34,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:41:34,339 INFO L480 AbstractCegarLoop]: Abstraction has 6789 states and 22927 transitions. [2019-01-01 00:41:34,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 00:41:34,339 INFO L276 IsEmpty]: Start isEmpty. Operand 6789 states and 22927 transitions. [2019-01-01 00:41:34,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-01 00:41:34,350 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:41:34,350 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] [2019-01-01 00:41:34,351 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:41:34,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:41:34,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1740911900, now seen corresponding path program 3 times [2019-01-01 00:41:34,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:41:34,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:41:34,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:41:34,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:41:34,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:41:34,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:41:34,598 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-01 00:41:34,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:41:34,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:41:34,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-01 00:41:34,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 00:41:34,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 00:41:34,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-01 00:41:34,807 INFO L87 Difference]: Start difference. First operand 6789 states and 22927 transitions. Second operand 12 states. [2019-01-01 00:41:35,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:41:35,505 INFO L93 Difference]: Finished difference Result 13177 states and 44650 transitions. [2019-01-01 00:41:35,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-01 00:41:35,506 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 102 [2019-01-01 00:41:35,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:41:35,524 INFO L225 Difference]: With dead ends: 13177 [2019-01-01 00:41:35,524 INFO L226 Difference]: Without dead ends: 9273 [2019-01-01 00:41:35,525 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 [2019-01-01 00:41:35,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9273 states. [2019-01-01 00:41:35,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9273 to 8665. [2019-01-01 00:41:35,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8665 states. [2019-01-01 00:41:35,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8665 states to 8665 states and 28570 transitions. [2019-01-01 00:41:35,670 INFO L78 Accepts]: Start accepts. Automaton has 8665 states and 28570 transitions. Word has length 102 [2019-01-01 00:41:35,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:41:35,670 INFO L480 AbstractCegarLoop]: Abstraction has 8665 states and 28570 transitions. [2019-01-01 00:41:35,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 00:41:35,670 INFO L276 IsEmpty]: Start isEmpty. Operand 8665 states and 28570 transitions. [2019-01-01 00:41:35,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-01 00:41:35,683 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:41:35,684 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] [2019-01-01 00:41:35,684 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:41:35,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:41:35,684 INFO L82 PathProgramCache]: Analyzing trace with hash -141622302, now seen corresponding path program 4 times [2019-01-01 00:41:35,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:41:35,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:41:35,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:41:35,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 00:41:35,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:41:35,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 00:41:35,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 00:41:35,788 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-01 00:41:36,054 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-01 00:41:36,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 12:41:36 BasicIcfg [2019-01-01 00:41:36,057 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 00:41:36,058 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 00:41:36,058 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 00:41:36,058 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 00:41:36,060 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 12:39:53" (3/4) ... [2019-01-01 00:41:36,064 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-01 00:41:36,290 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 00:41:36,290 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 00:41:36,294 INFO L168 Benchmark]: Toolchain (without parser) took 105365.70 ms. Allocated memory was 1.0 GB in the beginning and 6.5 GB in the end (delta: 5.5 GB). Free memory was 946.0 MB in the beginning and 2.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. [2019-01-01 00:41:36,295 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 00:41:36,295 INFO L168 Benchmark]: CACSL2BoogieTranslator took 930.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -173.8 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-01-01 00:41:36,296 INFO L168 Benchmark]: Boogie Procedure Inliner took 94.68 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. [2019-01-01 00:41:36,296 INFO L168 Benchmark]: Boogie Preprocessor took 49.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 00:41:36,296 INFO L168 Benchmark]: RCFGBuilder took 1406.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 11.5 GB. [2019-01-01 00:41:36,296 INFO L168 Benchmark]: TraceAbstraction took 102646.23 ms. Allocated memory was 1.2 GB in the beginning and 6.5 GB in the end (delta: 5.3 GB). Free memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 3.8 GB. Max. memory is 11.5 GB. [2019-01-01 00:41:36,299 INFO L168 Benchmark]: Witness Printer took 232.20 ms. Allocated memory is still 6.5 GB. Free memory was 2.6 GB in the beginning and 2.6 GB in the end (delta: 31.8 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. [2019-01-01 00:41:36,301 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 930.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -173.8 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 94.68 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 49.96 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 1406.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 102646.23 ms. Allocated memory was 1.2 GB in the beginning and 6.5 GB in the end (delta: 5.3 GB). Free memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 3.8 GB. Max. memory is 11.5 GB. * Witness Printer took 232.20 ms. Allocated memory is still 6.5 GB. Free memory was 2.6 GB in the beginning and 2.6 GB in the end (delta: 31.8 MB). Peak memory consumption was 31.8 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] [L675] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0] [L676] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L678] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L680] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L681] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L682] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L683] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L684] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L685] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L686] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L687] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L688] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L689] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, 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] [L690] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L691] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L692] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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}] [L693] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L694] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L695] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L696] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L698] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L699] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, 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] [L700] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L778] -1 pthread_t t2524; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L779] FCALL, FORK -1 pthread_create(&t2524, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L780] -1 pthread_t t2525; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L781] FCALL, FORK -1 pthread_create(&t2525, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L782] -1 pthread_t t2526; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L783] FCALL, FORK -1 pthread_create(&t2526, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L741] 0 y$w_buff1 = y$w_buff0 [L742] 0 y$w_buff0 = 2 [L743] 0 y$w_buff1_used = y$w_buff0_used [L744] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L746] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L747] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L748] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L749] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L750] 0 y$r_buff0_thd3 = (_Bool)1 [L753] 0 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L704] 1 z = 2 [L709] 1 __unbuffered_p0_EAX = x [L714] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=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=2] [L756] 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=1, __unbuffered_p0_EAX=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=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=2] [L721] 2 x = 1 [L724] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, 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=2] [L727] 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, 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=2] [L727] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, 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, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=2] [L727] 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, 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_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=2] [L727] 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) [L728] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, 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_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L728] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L729] 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=1, __unbuffered_p0_EAX=0, 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_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=2] [L729] 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 [L730] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, 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_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L756] 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) [L730] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L731] 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=1, __unbuffered_p0_EAX=0, 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_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=2] [L731] 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 [L734] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, 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=2] [L757] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, 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=2] [L757] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L758] 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=2, __unbuffered_p0_EAX=0, 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=2] [L758] 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 [L759] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, 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=2] [L759] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L760] 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=2, __unbuffered_p0_EAX=0, 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=2] [L760] 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 [L763] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, 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=2] [L785] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, 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=2] [L789] 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, 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=2] [L789] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, 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=2] [L789] 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, 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=2] [L789] -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) [L790] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, 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=2] [L790] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L791] 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, 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=2] [L791] -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 [L792] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, 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=2] [L792] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L793] 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, 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=2] [L793] -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 [L796] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L797] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L798] -1 y$flush_delayed = weak$$choice2 [L799] -1 y$mem_tmp = y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, 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=2] [L800] 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, 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=2] [L800] -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) [L801] 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, 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=2] [L801] -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)) [L802] 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, 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=2] [L802] -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)) [L803] 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, 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=2] [L803] -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)) [L804] 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, 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=2] [L804] -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)) [L805] 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, 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=2] [L805] -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)) [L806] 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, 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=2] [L806] -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)) [L807] -1 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, 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=2] [L808] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, 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=2] [L808] -1 y = y$flush_delayed ? y$mem_tmp : y [L809] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, 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=2] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, 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=2] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, 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=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 198 locations, 3 error locations. UNSAFE Result, 102.4s OverallTime, 26 OverallIterations, 1 TraceHistogramMax, 22.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5523 SDtfs, 5430 SDslu, 13066 SDs, 0 SdLazy, 4074 SolverSat, 247 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 249 GetRequests, 75 SyntacticMatches, 19 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 7.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=186422occurred in iteration=2, 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: 47.3s AutomataMinimizationTime, 25 MinimizatonAttempts, 269997 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 2340 NumberOfCodeBlocks, 2340 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2213 ConstructedInterpolants, 0 QuantifiedInterpolants, 472608 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...