./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/rfi001_tso.oepc_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/rfi001_tso.oepc_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 8779471c632a53a1c78816502893e61b74924e89 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 22:47:52,891 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 22:47:52,893 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 22:47:52,911 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 22:47:52,912 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 22:47:52,914 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 22:47:52,915 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 22:47:52,917 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 22:47:52,918 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 22:47:52,919 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 22:47:52,920 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 22:47:52,921 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 22:47:52,922 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 22:47:52,923 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 22:47:52,924 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 22:47:52,925 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 22:47:52,926 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 22:47:52,930 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 22:47:52,935 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 22:47:52,937 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 22:47:52,938 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 22:47:52,939 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 22:47:52,941 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 22:47:52,941 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 22:47:52,942 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 22:47:52,947 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 22:47:52,952 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 22:47:52,954 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 22:47:52,955 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 22:47:52,957 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 22:47:52,959 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 22:47:52,960 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 22:47:52,960 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 22:47:52,960 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 22:47:52,963 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 22:47:52,964 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 22:47:52,966 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 22:47:52,994 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 22:47:52,995 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 22:47:52,997 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 22:47:52,998 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 22:47:52,998 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 22:47:52,998 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 22:47:52,999 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 22:47:53,000 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 22:47:53,000 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 22:47:53,000 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 22:47:53,000 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 22:47:53,000 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 22:47:53,000 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 22:47:53,001 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 22:47:53,001 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 22:47:53,002 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 22:47:53,002 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 22:47:53,002 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 22:47:53,002 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 22:47:53,003 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 22:47:53,005 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 22:47:53,005 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 22:47:53,005 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 22:47:53,006 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 22:47:53,006 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 22:47:53,006 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 22:47:53,006 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 22:47:53,006 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 22:47:53,006 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 -> 8779471c632a53a1c78816502893e61b74924e89 [2018-12-31 22:47:53,069 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 22:47:53,085 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 22:47:53,092 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 22:47:53,094 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 22:47:53,094 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 22:47:53,095 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/rfi001_tso.oepc_false-unreach-call.i [2018-12-31 22:47:53,166 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f1fb2e09/c5d2dd6a72334654991b77855752bf93/FLAG4fe408a9d [2018-12-31 22:47:53,768 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 22:47:53,768 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/rfi001_tso.oepc_false-unreach-call.i [2018-12-31 22:47:53,783 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f1fb2e09/c5d2dd6a72334654991b77855752bf93/FLAG4fe408a9d [2018-12-31 22:47:54,006 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f1fb2e09/c5d2dd6a72334654991b77855752bf93 [2018-12-31 22:47:54,010 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 22:47:54,012 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 22:47:54,013 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 22:47:54,013 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 22:47:54,016 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 22:47:54,017 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 10:47:54" (1/1) ... [2018-12-31 22:47:54,021 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 31.12 10:47:54, skipping insertion in model container [2018-12-31 22:47:54,021 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 10:47:54" (1/1) ... [2018-12-31 22:47:54,029 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 22:47:54,090 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 22:47:54,621 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 22:47:54,636 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 22:47:54,798 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 22:47:54,919 INFO L195 MainTranslator]: Completed translation [2018-12-31 22:47:54,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:47:54 WrapperNode [2018-12-31 22:47:54,920 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 22:47:54,921 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 22:47:54,921 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 22:47:54,921 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 22:47:54,933 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:47:54" (1/1) ... [2018-12-31 22:47:54,975 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:47:54" (1/1) ... [2018-12-31 22:47:55,030 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 22:47:55,033 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 22:47:55,033 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 22:47:55,033 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 22:47:55,048 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:47:54" (1/1) ... [2018-12-31 22:47:55,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:47:54" (1/1) ... [2018-12-31 22:47:55,055 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:47:54" (1/1) ... [2018-12-31 22:47:55,055 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:47:54" (1/1) ... [2018-12-31 22:47:55,077 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:47:54" (1/1) ... [2018-12-31 22:47:55,086 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:47:54" (1/1) ... [2018-12-31 22:47:55,095 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:47:54" (1/1) ... [2018-12-31 22:47:55,106 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 22:47:55,107 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 22:47:55,107 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 22:47:55,107 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 22:47:55,108 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:47:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 22:47:55,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 22:47:55,181 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-31 22:47:55,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 22:47:55,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 22:47:55,182 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-31 22:47:55,182 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-31 22:47:55,182 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-31 22:47:55,182 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-31 22:47:55,183 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-31 22:47:55,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 22:47:55,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 22:47:55,186 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-31 22:47:56,368 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 22:47:56,369 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-31 22:47:56,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:47:56 BoogieIcfgContainer [2018-12-31 22:47:56,370 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 22:47:56,375 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 22:47:56,375 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 22:47:56,379 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 22:47:56,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 10:47:54" (1/3) ... [2018-12-31 22:47:56,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a4c4075 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 10:47:56, skipping insertion in model container [2018-12-31 22:47:56,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:47:54" (2/3) ... [2018-12-31 22:47:56,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a4c4075 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 10:47:56, skipping insertion in model container [2018-12-31 22:47:56,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:47:56" (3/3) ... [2018-12-31 22:47:56,383 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi001_tso.oepc_false-unreach-call.i [2018-12-31 22:47:56,426 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,427 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,427 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,427 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,427 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,428 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,428 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,428 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,428 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,428 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,429 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,429 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,429 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,429 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,429 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,430 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,430 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,430 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,430 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,431 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,431 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,431 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,431 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,431 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,432 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,432 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,432 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,432 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,433 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,433 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,433 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,433 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,433 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,433 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,434 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,434 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,435 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,435 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,435 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,435 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,435 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,436 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,436 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,436 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,436 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,437 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,437 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,437 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,437 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,437 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,438 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,438 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,438 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,438 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,439 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,441 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,441 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,441 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,441 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,442 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,442 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,442 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,442 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,442 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,445 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,445 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,445 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,445 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,446 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,447 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,447 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,447 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:56,463 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-31 22:47:56,464 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 22:47:56,472 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 22:47:56,490 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 22:47:56,520 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 22:47:56,521 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 22:47:56,521 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 22:47:56,521 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 22:47:56,521 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 22:47:56,522 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 22:47:56,522 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 22:47:56,522 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 22:47:56,523 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 22:47:56,538 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2018-12-31 22:47:58,389 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25089 states. [2018-12-31 22:47:58,391 INFO L276 IsEmpty]: Start isEmpty. Operand 25089 states. [2018-12-31 22:47:58,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-31 22:47:58,401 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:47:58,402 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:47:58,405 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:47:58,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:47:58,413 INFO L82 PathProgramCache]: Analyzing trace with hash 2006103772, now seen corresponding path program 1 times [2018-12-31 22:47:58,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:47:58,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:47:58,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:58,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:47:58,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:58,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:47:58,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:47:58,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:47:58,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:47:58,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:47:58,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:47:58,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:47:58,797 INFO L87 Difference]: Start difference. First operand 25089 states. Second operand 4 states. [2018-12-31 22:47:59,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:47:59,986 INFO L93 Difference]: Finished difference Result 45389 states and 177627 transitions. [2018-12-31 22:47:59,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 22:47:59,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-12-31 22:47:59,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:00,402 INFO L225 Difference]: With dead ends: 45389 [2018-12-31 22:48:00,403 INFO L226 Difference]: Without dead ends: 40629 [2018-12-31 22:48:00,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:48:01,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40629 states. [2018-12-31 22:48:01,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40629 to 23663. [2018-12-31 22:48:01,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23663 states. [2018-12-31 22:48:02,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23663 states to 23663 states and 92544 transitions. [2018-12-31 22:48:02,302 INFO L78 Accepts]: Start accepts. Automaton has 23663 states and 92544 transitions. Word has length 38 [2018-12-31 22:48:02,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:02,305 INFO L480 AbstractCegarLoop]: Abstraction has 23663 states and 92544 transitions. [2018-12-31 22:48:02,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:48:02,305 INFO L276 IsEmpty]: Start isEmpty. Operand 23663 states and 92544 transitions. [2018-12-31 22:48:02,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-31 22:48:02,317 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:02,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] [2018-12-31 22:48:02,318 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:02,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:02,319 INFO L82 PathProgramCache]: Analyzing trace with hash 455349977, now seen corresponding path program 1 times [2018-12-31 22:48:02,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:02,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:02,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:02,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:02,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:02,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:02,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:02,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:02,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:48:02,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:48:02,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:48:02,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:48:02,688 INFO L87 Difference]: Start difference. First operand 23663 states and 92544 transitions. Second operand 5 states. [2018-12-31 22:48:07,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:07,522 INFO L93 Difference]: Finished difference Result 64831 states and 241370 transitions. [2018-12-31 22:48:07,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 22:48:07,523 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-12-31 22:48:07,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:07,837 INFO L225 Difference]: With dead ends: 64831 [2018-12-31 22:48:07,837 INFO L226 Difference]: Without dead ends: 64671 [2018-12-31 22:48:07,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:48:08,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64671 states. [2018-12-31 22:48:09,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64671 to 37143. [2018-12-31 22:48:09,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37143 states. [2018-12-31 22:48:09,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37143 states to 37143 states and 138285 transitions. [2018-12-31 22:48:09,630 INFO L78 Accepts]: Start accepts. Automaton has 37143 states and 138285 transitions. Word has length 45 [2018-12-31 22:48:09,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:09,632 INFO L480 AbstractCegarLoop]: Abstraction has 37143 states and 138285 transitions. [2018-12-31 22:48:09,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:48:09,632 INFO L276 IsEmpty]: Start isEmpty. Operand 37143 states and 138285 transitions. [2018-12-31 22:48:09,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-31 22:48:09,639 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:09,639 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:48:09,639 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:09,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:09,640 INFO L82 PathProgramCache]: Analyzing trace with hash -636463316, now seen corresponding path program 1 times [2018-12-31 22:48:09,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:09,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:09,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:09,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:09,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:09,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:09,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:09,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:09,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 22:48:09,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 22:48:09,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 22:48:09,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 22:48:09,751 INFO L87 Difference]: Start difference. First operand 37143 states and 138285 transitions. Second operand 3 states. [2018-12-31 22:48:10,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:10,040 INFO L93 Difference]: Finished difference Result 37143 states and 138212 transitions. [2018-12-31 22:48:10,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 22:48:10,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-12-31 22:48:10,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:10,165 INFO L225 Difference]: With dead ends: 37143 [2018-12-31 22:48:10,165 INFO L226 Difference]: Without dead ends: 37143 [2018-12-31 22:48:10,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 22:48:10,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37143 states. [2018-12-31 22:48:11,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37143 to 37143. [2018-12-31 22:48:11,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37143 states. [2018-12-31 22:48:11,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37143 states to 37143 states and 138212 transitions. [2018-12-31 22:48:11,985 INFO L78 Accepts]: Start accepts. Automaton has 37143 states and 138212 transitions. Word has length 46 [2018-12-31 22:48:11,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:11,986 INFO L480 AbstractCegarLoop]: Abstraction has 37143 states and 138212 transitions. [2018-12-31 22:48:11,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 22:48:11,986 INFO L276 IsEmpty]: Start isEmpty. Operand 37143 states and 138212 transitions. [2018-12-31 22:48:11,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-31 22:48:11,992 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:11,992 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:48:11,993 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:11,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:11,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1106347019, now seen corresponding path program 1 times [2018-12-31 22:48:11,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:11,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:11,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:11,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:11,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:12,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:12,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:12,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:12,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:48:12,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:48:12,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:48:12,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:48:12,108 INFO L87 Difference]: Start difference. First operand 37143 states and 138212 transitions. Second operand 4 states. [2018-12-31 22:48:12,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:12,209 INFO L93 Difference]: Finished difference Result 12365 states and 41158 transitions. [2018-12-31 22:48:12,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 22:48:12,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-12-31 22:48:12,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:12,239 INFO L225 Difference]: With dead ends: 12365 [2018-12-31 22:48:12,239 INFO L226 Difference]: Without dead ends: 11844 [2018-12-31 22:48:12,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:48:12,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11844 states. [2018-12-31 22:48:12,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11844 to 11844. [2018-12-31 22:48:12,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11844 states. [2018-12-31 22:48:12,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11844 states to 11844 states and 39603 transitions. [2018-12-31 22:48:12,463 INFO L78 Accepts]: Start accepts. Automaton has 11844 states and 39603 transitions. Word has length 46 [2018-12-31 22:48:12,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:12,464 INFO L480 AbstractCegarLoop]: Abstraction has 11844 states and 39603 transitions. [2018-12-31 22:48:12,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:48:12,464 INFO L276 IsEmpty]: Start isEmpty. Operand 11844 states and 39603 transitions. [2018-12-31 22:48:12,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-31 22:48:12,469 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:12,469 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] [2018-12-31 22:48:12,470 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:12,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:12,470 INFO L82 PathProgramCache]: Analyzing trace with hash 122760419, now seen corresponding path program 1 times [2018-12-31 22:48:12,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:12,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:12,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:12,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:12,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:12,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:12,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:12,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:12,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:48:12,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:48:12,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:48:12,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:48:12,729 INFO L87 Difference]: Start difference. First operand 11844 states and 39603 transitions. Second operand 6 states. [2018-12-31 22:48:13,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:13,756 INFO L93 Difference]: Finished difference Result 22828 states and 73905 transitions. [2018-12-31 22:48:13,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:48:13,757 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2018-12-31 22:48:13,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:13,809 INFO L225 Difference]: With dead ends: 22828 [2018-12-31 22:48:13,809 INFO L226 Difference]: Without dead ends: 22828 [2018-12-31 22:48:13,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:48:13,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22828 states. [2018-12-31 22:48:14,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22828 to 14272. [2018-12-31 22:48:14,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14272 states. [2018-12-31 22:48:14,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14272 states to 14272 states and 46099 transitions. [2018-12-31 22:48:14,138 INFO L78 Accepts]: Start accepts. Automaton has 14272 states and 46099 transitions. Word has length 59 [2018-12-31 22:48:14,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:14,138 INFO L480 AbstractCegarLoop]: Abstraction has 14272 states and 46099 transitions. [2018-12-31 22:48:14,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:48:14,138 INFO L276 IsEmpty]: Start isEmpty. Operand 14272 states and 46099 transitions. [2018-12-31 22:48:14,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-31 22:48:14,143 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:14,144 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] [2018-12-31 22:48:14,144 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:14,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:14,144 INFO L82 PathProgramCache]: Analyzing trace with hash -894542234, now seen corresponding path program 1 times [2018-12-31 22:48:14,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:14,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:14,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:14,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:14,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:14,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:14,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:14,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:14,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:48:14,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:48:14,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:48:14,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:48:14,387 INFO L87 Difference]: Start difference. First operand 14272 states and 46099 transitions. Second operand 5 states. [2018-12-31 22:48:14,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:14,452 INFO L93 Difference]: Finished difference Result 2524 states and 6596 transitions. [2018-12-31 22:48:14,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 22:48:14,453 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2018-12-31 22:48:14,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:14,456 INFO L225 Difference]: With dead ends: 2524 [2018-12-31 22:48:14,456 INFO L226 Difference]: Without dead ends: 2112 [2018-12-31 22:48:14,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:48:14,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2112 states. [2018-12-31 22:48:14,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2112 to 2038. [2018-12-31 22:48:14,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2038 states. [2018-12-31 22:48:14,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2038 states to 2038 states and 5307 transitions. [2018-12-31 22:48:14,478 INFO L78 Accepts]: Start accepts. Automaton has 2038 states and 5307 transitions. Word has length 59 [2018-12-31 22:48:14,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:14,479 INFO L480 AbstractCegarLoop]: Abstraction has 2038 states and 5307 transitions. [2018-12-31 22:48:14,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:48:14,479 INFO L276 IsEmpty]: Start isEmpty. Operand 2038 states and 5307 transitions. [2018-12-31 22:48:14,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 22:48:14,484 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:14,484 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] [2018-12-31 22:48:14,484 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:14,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:14,485 INFO L82 PathProgramCache]: Analyzing trace with hash -728205139, now seen corresponding path program 1 times [2018-12-31 22:48:14,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:14,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:14,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:14,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:14,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:14,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:14,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:14,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:14,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:48:14,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:48:14,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:48:14,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:48:14,813 INFO L87 Difference]: Start difference. First operand 2038 states and 5307 transitions. Second operand 4 states. [2018-12-31 22:48:15,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:15,098 INFO L93 Difference]: Finished difference Result 2480 states and 6355 transitions. [2018-12-31 22:48:15,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 22:48:15,099 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-31 22:48:15,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:15,103 INFO L225 Difference]: With dead ends: 2480 [2018-12-31 22:48:15,103 INFO L226 Difference]: Without dead ends: 2480 [2018-12-31 22:48:15,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:48:15,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2480 states. [2018-12-31 22:48:15,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2480 to 2084. [2018-12-31 22:48:15,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2084 states. [2018-12-31 22:48:15,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 2084 states and 5412 transitions. [2018-12-31 22:48:15,129 INFO L78 Accepts]: Start accepts. Automaton has 2084 states and 5412 transitions. Word has length 94 [2018-12-31 22:48:15,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:15,129 INFO L480 AbstractCegarLoop]: Abstraction has 2084 states and 5412 transitions. [2018-12-31 22:48:15,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:48:15,129 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 5412 transitions. [2018-12-31 22:48:15,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 22:48:15,135 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:15,135 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] [2018-12-31 22:48:15,137 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:15,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:15,137 INFO L82 PathProgramCache]: Analyzing trace with hash 241375884, now seen corresponding path program 1 times [2018-12-31 22:48:15,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:15,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:15,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:15,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:15,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:15,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:15,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:15,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:15,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 22:48:15,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 22:48:15,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 22:48:15,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 22:48:15,271 INFO L87 Difference]: Start difference. First operand 2084 states and 5412 transitions. Second operand 3 states. [2018-12-31 22:48:15,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:15,447 INFO L93 Difference]: Finished difference Result 2169 states and 5588 transitions. [2018-12-31 22:48:15,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 22:48:15,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2018-12-31 22:48:15,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:15,452 INFO L225 Difference]: With dead ends: 2169 [2018-12-31 22:48:15,452 INFO L226 Difference]: Without dead ends: 2169 [2018-12-31 22:48:15,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 22:48:15,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2169 states. [2018-12-31 22:48:15,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2169 to 2128. [2018-12-31 22:48:15,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2128 states. [2018-12-31 22:48:15,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2128 states to 2128 states and 5504 transitions. [2018-12-31 22:48:15,481 INFO L78 Accepts]: Start accepts. Automaton has 2128 states and 5504 transitions. Word has length 94 [2018-12-31 22:48:15,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:15,482 INFO L480 AbstractCegarLoop]: Abstraction has 2128 states and 5504 transitions. [2018-12-31 22:48:15,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 22:48:15,482 INFO L276 IsEmpty]: Start isEmpty. Operand 2128 states and 5504 transitions. [2018-12-31 22:48:15,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 22:48:15,489 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:15,489 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] [2018-12-31 22:48:15,489 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:15,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:15,490 INFO L82 PathProgramCache]: Analyzing trace with hash -494467042, now seen corresponding path program 2 times [2018-12-31 22:48:15,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:15,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:15,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:15,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:15,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:15,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:15,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:15,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:15,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:48:15,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:48:15,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:48:15,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:48:15,788 INFO L87 Difference]: Start difference. First operand 2128 states and 5504 transitions. Second operand 5 states. [2018-12-31 22:48:16,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:16,727 INFO L93 Difference]: Finished difference Result 2576 states and 6555 transitions. [2018-12-31 22:48:16,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 22:48:16,728 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-31 22:48:16,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:16,733 INFO L225 Difference]: With dead ends: 2576 [2018-12-31 22:48:16,733 INFO L226 Difference]: Without dead ends: 2576 [2018-12-31 22:48:16,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:48:16,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2576 states. [2018-12-31 22:48:16,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2576 to 2170. [2018-12-31 22:48:16,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2170 states. [2018-12-31 22:48:16,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 5595 transitions. [2018-12-31 22:48:16,759 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 5595 transitions. Word has length 94 [2018-12-31 22:48:16,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:16,760 INFO L480 AbstractCegarLoop]: Abstraction has 2170 states and 5595 transitions. [2018-12-31 22:48:16,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:48:16,760 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 5595 transitions. [2018-12-31 22:48:16,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 22:48:16,764 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:16,764 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] [2018-12-31 22:48:16,764 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:16,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:16,765 INFO L82 PathProgramCache]: Analyzing trace with hash 675201100, now seen corresponding path program 1 times [2018-12-31 22:48:16,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:16,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:16,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:16,767 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 22:48:16,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:16,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:17,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:17,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:17,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:48:17,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:48:17,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:48:17,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:48:17,354 INFO L87 Difference]: Start difference. First operand 2170 states and 5595 transitions. Second operand 6 states. [2018-12-31 22:48:18,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:18,140 INFO L93 Difference]: Finished difference Result 2530 states and 6341 transitions. [2018-12-31 22:48:18,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:48:18,141 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-31 22:48:18,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:18,145 INFO L225 Difference]: With dead ends: 2530 [2018-12-31 22:48:18,145 INFO L226 Difference]: Without dead ends: 2457 [2018-12-31 22:48:18,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:48:18,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2457 states. [2018-12-31 22:48:18,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2457 to 2365. [2018-12-31 22:48:18,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2365 states. [2018-12-31 22:48:18,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2365 states to 2365 states and 6025 transitions. [2018-12-31 22:48:18,169 INFO L78 Accepts]: Start accepts. Automaton has 2365 states and 6025 transitions. Word has length 94 [2018-12-31 22:48:18,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:18,169 INFO L480 AbstractCegarLoop]: Abstraction has 2365 states and 6025 transitions. [2018-12-31 22:48:18,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:48:18,169 INFO L276 IsEmpty]: Start isEmpty. Operand 2365 states and 6025 transitions. [2018-12-31 22:48:18,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 22:48:18,173 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:18,173 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] [2018-12-31 22:48:18,174 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:18,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:18,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1919025717, now seen corresponding path program 2 times [2018-12-31 22:48:18,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:18,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:18,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:18,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:18,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:18,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:18,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:18,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:18,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 22:48:18,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 22:48:18,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 22:48:18,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:48:18,349 INFO L87 Difference]: Start difference. First operand 2365 states and 6025 transitions. Second operand 7 states. [2018-12-31 22:48:19,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:19,028 INFO L93 Difference]: Finished difference Result 2617 states and 6636 transitions. [2018-12-31 22:48:19,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:48:19,029 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-31 22:48:19,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:19,033 INFO L225 Difference]: With dead ends: 2617 [2018-12-31 22:48:19,033 INFO L226 Difference]: Without dead ends: 2617 [2018-12-31 22:48:19,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:48:19,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2617 states. [2018-12-31 22:48:19,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2617 to 2349. [2018-12-31 22:48:19,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2349 states. [2018-12-31 22:48:19,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2349 states to 2349 states and 5992 transitions. [2018-12-31 22:48:19,062 INFO L78 Accepts]: Start accepts. Automaton has 2349 states and 5992 transitions. Word has length 94 [2018-12-31 22:48:19,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:19,062 INFO L480 AbstractCegarLoop]: Abstraction has 2349 states and 5992 transitions. [2018-12-31 22:48:19,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 22:48:19,063 INFO L276 IsEmpty]: Start isEmpty. Operand 2349 states and 5992 transitions. [2018-12-31 22:48:19,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 22:48:19,067 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:19,067 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:48:19,068 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:19,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:19,068 INFO L82 PathProgramCache]: Analyzing trace with hash -508146197, now seen corresponding path program 1 times [2018-12-31 22:48:19,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:19,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:19,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:19,070 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 22:48:19,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:19,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:19,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:19,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:19,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:48:19,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:48:19,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:48:19,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:48:19,241 INFO L87 Difference]: Start difference. First operand 2349 states and 5992 transitions. Second operand 5 states. [2018-12-31 22:48:19,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:19,494 INFO L93 Difference]: Finished difference Result 4672 states and 11987 transitions. [2018-12-31 22:48:19,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:48:19,495 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-31 22:48:19,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:19,503 INFO L225 Difference]: With dead ends: 4672 [2018-12-31 22:48:19,503 INFO L226 Difference]: Without dead ends: 4646 [2018-12-31 22:48:19,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:48:19,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4646 states. [2018-12-31 22:48:19,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4646 to 2432. [2018-12-31 22:48:19,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2432 states. [2018-12-31 22:48:19,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2432 states to 2432 states and 6168 transitions. [2018-12-31 22:48:19,545 INFO L78 Accepts]: Start accepts. Automaton has 2432 states and 6168 transitions. Word has length 94 [2018-12-31 22:48:19,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:19,545 INFO L480 AbstractCegarLoop]: Abstraction has 2432 states and 6168 transitions. [2018-12-31 22:48:19,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:48:19,545 INFO L276 IsEmpty]: Start isEmpty. Operand 2432 states and 6168 transitions. [2018-12-31 22:48:19,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 22:48:19,550 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:19,550 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] [2018-12-31 22:48:19,550 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:19,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:19,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1113421206, now seen corresponding path program 1 times [2018-12-31 22:48:19,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:19,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:19,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:19,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:19,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:19,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:19,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:19,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:19,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:48:19,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:48:19,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:48:19,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:48:19,807 INFO L87 Difference]: Start difference. First operand 2432 states and 6168 transitions. Second operand 5 states. [2018-12-31 22:48:19,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:19,946 INFO L93 Difference]: Finished difference Result 2314 states and 5836 transitions. [2018-12-31 22:48:19,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 22:48:19,948 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-31 22:48:19,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:19,952 INFO L225 Difference]: With dead ends: 2314 [2018-12-31 22:48:19,952 INFO L226 Difference]: Without dead ends: 2314 [2018-12-31 22:48:19,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:48:19,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2018-12-31 22:48:19,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 2310. [2018-12-31 22:48:19,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2310 states. [2018-12-31 22:48:19,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2310 states to 2310 states and 5828 transitions. [2018-12-31 22:48:19,980 INFO L78 Accepts]: Start accepts. Automaton has 2310 states and 5828 transitions. Word has length 94 [2018-12-31 22:48:19,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:19,980 INFO L480 AbstractCegarLoop]: Abstraction has 2310 states and 5828 transitions. [2018-12-31 22:48:19,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:48:19,981 INFO L276 IsEmpty]: Start isEmpty. Operand 2310 states and 5828 transitions. [2018-12-31 22:48:19,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 22:48:19,985 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:19,985 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] [2018-12-31 22:48:19,985 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:19,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:19,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1220650390, now seen corresponding path program 1 times [2018-12-31 22:48:19,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:19,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:19,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:19,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:19,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:20,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:20,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:20,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:20,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:48:20,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:48:20,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:48:20,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:48:20,265 INFO L87 Difference]: Start difference. First operand 2310 states and 5828 transitions. Second operand 4 states. [2018-12-31 22:48:20,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:20,455 INFO L93 Difference]: Finished difference Result 2646 states and 6748 transitions. [2018-12-31 22:48:20,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 22:48:20,456 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-31 22:48:20,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:20,461 INFO L225 Difference]: With dead ends: 2646 [2018-12-31 22:48:20,462 INFO L226 Difference]: Without dead ends: 2646 [2018-12-31 22:48:20,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:48:20,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2646 states. [2018-12-31 22:48:20,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2646 to 2614. [2018-12-31 22:48:20,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2614 states. [2018-12-31 22:48:20,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2614 states to 2614 states and 6668 transitions. [2018-12-31 22:48:20,497 INFO L78 Accepts]: Start accepts. Automaton has 2614 states and 6668 transitions. Word has length 94 [2018-12-31 22:48:20,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:20,497 INFO L480 AbstractCegarLoop]: Abstraction has 2614 states and 6668 transitions. [2018-12-31 22:48:20,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:48:20,497 INFO L276 IsEmpty]: Start isEmpty. Operand 2614 states and 6668 transitions. [2018-12-31 22:48:20,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 22:48:20,502 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:20,502 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] [2018-12-31 22:48:20,502 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:20,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:20,503 INFO L82 PathProgramCache]: Analyzing trace with hash 997107563, now seen corresponding path program 1 times [2018-12-31 22:48:20,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:20,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:20,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:20,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:20,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:20,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:20,959 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-12-31 22:48:21,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:21,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:21,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:48:21,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:48:21,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:48:21,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:48:21,026 INFO L87 Difference]: Start difference. First operand 2614 states and 6668 transitions. Second operand 6 states. [2018-12-31 22:48:21,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:21,334 INFO L93 Difference]: Finished difference Result 2326 states and 5756 transitions. [2018-12-31 22:48:21,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 22:48:21,337 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-31 22:48:21,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:21,342 INFO L225 Difference]: With dead ends: 2326 [2018-12-31 22:48:21,342 INFO L226 Difference]: Without dead ends: 2326 [2018-12-31 22:48:21,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:48:21,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2326 states. [2018-12-31 22:48:21,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2326 to 1857. [2018-12-31 22:48:21,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1857 states. [2018-12-31 22:48:21,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1857 states to 1857 states and 4660 transitions. [2018-12-31 22:48:21,368 INFO L78 Accepts]: Start accepts. Automaton has 1857 states and 4660 transitions. Word has length 94 [2018-12-31 22:48:21,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:21,369 INFO L480 AbstractCegarLoop]: Abstraction has 1857 states and 4660 transitions. [2018-12-31 22:48:21,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:48:21,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1857 states and 4660 transitions. [2018-12-31 22:48:21,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 22:48:21,372 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:21,372 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] [2018-12-31 22:48:21,373 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:21,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:21,373 INFO L82 PathProgramCache]: Analyzing trace with hash -896804400, now seen corresponding path program 1 times [2018-12-31 22:48:21,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:21,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:21,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:21,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:21,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:21,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:21,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:21,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:21,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 22:48:21,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 22:48:21,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 22:48:21,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:48:21,760 INFO L87 Difference]: Start difference. First operand 1857 states and 4660 transitions. Second operand 8 states. [2018-12-31 22:48:22,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:22,642 INFO L93 Difference]: Finished difference Result 5188 states and 13198 transitions. [2018-12-31 22:48:22,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-31 22:48:22,643 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2018-12-31 22:48:22,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:22,650 INFO L225 Difference]: With dead ends: 5188 [2018-12-31 22:48:22,650 INFO L226 Difference]: Without dead ends: 5188 [2018-12-31 22:48:22,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2018-12-31 22:48:22,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5188 states. [2018-12-31 22:48:22,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5188 to 2625. [2018-12-31 22:48:22,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2625 states. [2018-12-31 22:48:22,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2625 states to 2625 states and 6617 transitions. [2018-12-31 22:48:22,693 INFO L78 Accepts]: Start accepts. Automaton has 2625 states and 6617 transitions. Word has length 96 [2018-12-31 22:48:22,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:22,693 INFO L480 AbstractCegarLoop]: Abstraction has 2625 states and 6617 transitions. [2018-12-31 22:48:22,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 22:48:22,693 INFO L276 IsEmpty]: Start isEmpty. Operand 2625 states and 6617 transitions. [2018-12-31 22:48:22,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 22:48:22,700 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:22,700 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] [2018-12-31 22:48:22,700 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:22,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:22,701 INFO L82 PathProgramCache]: Analyzing trace with hash 347960081, now seen corresponding path program 1 times [2018-12-31 22:48:22,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:22,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:22,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:22,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:22,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:22,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:22,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:22,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:22,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:48:22,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:48:22,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:48:22,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:48:22,874 INFO L87 Difference]: Start difference. First operand 2625 states and 6617 transitions. Second operand 5 states. [2018-12-31 22:48:22,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:22,921 INFO L93 Difference]: Finished difference Result 4358 states and 11253 transitions. [2018-12-31 22:48:22,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 22:48:22,922 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-31 22:48:22,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:22,928 INFO L225 Difference]: With dead ends: 4358 [2018-12-31 22:48:22,928 INFO L226 Difference]: Without dead ends: 4358 [2018-12-31 22:48:22,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:48:22,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4358 states. [2018-12-31 22:48:22,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4358 to 2445. [2018-12-31 22:48:22,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2445 states. [2018-12-31 22:48:22,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2445 states to 2445 states and 6177 transitions. [2018-12-31 22:48:22,963 INFO L78 Accepts]: Start accepts. Automaton has 2445 states and 6177 transitions. Word has length 96 [2018-12-31 22:48:22,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:22,963 INFO L480 AbstractCegarLoop]: Abstraction has 2445 states and 6177 transitions. [2018-12-31 22:48:22,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:48:22,963 INFO L276 IsEmpty]: Start isEmpty. Operand 2445 states and 6177 transitions. [2018-12-31 22:48:22,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 22:48:22,967 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:22,967 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] [2018-12-31 22:48:22,968 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:22,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:22,968 INFO L82 PathProgramCache]: Analyzing trace with hash -567038639, now seen corresponding path program 1 times [2018-12-31 22:48:22,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:22,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:22,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:22,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:22,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:22,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:23,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:23,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:23,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:48:23,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:48:23,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:48:23,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:48:23,151 INFO L87 Difference]: Start difference. First operand 2445 states and 6177 transitions. Second operand 5 states. [2018-12-31 22:48:23,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:23,347 INFO L93 Difference]: Finished difference Result 2765 states and 6977 transitions. [2018-12-31 22:48:23,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:48:23,349 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-31 22:48:23,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:23,353 INFO L225 Difference]: With dead ends: 2765 [2018-12-31 22:48:23,354 INFO L226 Difference]: Without dead ends: 2765 [2018-12-31 22:48:23,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:48:23,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2765 states. [2018-12-31 22:48:23,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2765 to 2193. [2018-12-31 22:48:23,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2193 states. [2018-12-31 22:48:23,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2193 states to 2193 states and 5550 transitions. [2018-12-31 22:48:23,389 INFO L78 Accepts]: Start accepts. Automaton has 2193 states and 5550 transitions. Word has length 96 [2018-12-31 22:48:23,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:23,389 INFO L480 AbstractCegarLoop]: Abstraction has 2193 states and 5550 transitions. [2018-12-31 22:48:23,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:48:23,390 INFO L276 IsEmpty]: Start isEmpty. Operand 2193 states and 5550 transitions. [2018-12-31 22:48:23,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 22:48:23,396 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:23,396 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] [2018-12-31 22:48:23,396 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:23,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:23,396 INFO L82 PathProgramCache]: Analyzing trace with hash 677725842, now seen corresponding path program 1 times [2018-12-31 22:48:23,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:23,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:23,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:23,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:23,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:23,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:23,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:23,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:23,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-31 22:48:23,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 22:48:23,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 22:48:23,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-31 22:48:23,591 INFO L87 Difference]: Start difference. First operand 2193 states and 5550 transitions. Second operand 10 states. [2018-12-31 22:48:24,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:24,269 INFO L93 Difference]: Finished difference Result 4108 states and 10563 transitions. [2018-12-31 22:48:24,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 22:48:24,270 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2018-12-31 22:48:24,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:24,274 INFO L225 Difference]: With dead ends: 4108 [2018-12-31 22:48:24,275 INFO L226 Difference]: Without dead ends: 1891 [2018-12-31 22:48:24,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-12-31 22:48:24,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1891 states. [2018-12-31 22:48:24,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1891 to 1891. [2018-12-31 22:48:24,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1891 states. [2018-12-31 22:48:24,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1891 states to 1891 states and 4930 transitions. [2018-12-31 22:48:24,302 INFO L78 Accepts]: Start accepts. Automaton has 1891 states and 4930 transitions. Word has length 96 [2018-12-31 22:48:24,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:24,302 INFO L480 AbstractCegarLoop]: Abstraction has 1891 states and 4930 transitions. [2018-12-31 22:48:24,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 22:48:24,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 4930 transitions. [2018-12-31 22:48:24,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 22:48:24,306 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:24,306 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] [2018-12-31 22:48:24,306 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:24,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:24,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1311116434, now seen corresponding path program 2 times [2018-12-31 22:48:24,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:24,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:24,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:24,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:24,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:24,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:24,570 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-31 22:48:25,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:25,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:25,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-31 22:48:25,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-31 22:48:25,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-31 22:48:25,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-31 22:48:25,328 INFO L87 Difference]: Start difference. First operand 1891 states and 4930 transitions. Second operand 12 states. [2018-12-31 22:48:26,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:26,265 INFO L93 Difference]: Finished difference Result 3562 states and 9378 transitions. [2018-12-31 22:48:26,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-31 22:48:26,267 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2018-12-31 22:48:26,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:26,272 INFO L225 Difference]: With dead ends: 3562 [2018-12-31 22:48:26,272 INFO L226 Difference]: Without dead ends: 2586 [2018-12-31 22:48:26,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-31 22:48:26,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2586 states. [2018-12-31 22:48:26,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2586 to 2420. [2018-12-31 22:48:26,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2420 states. [2018-12-31 22:48:26,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2420 states to 2420 states and 6170 transitions. [2018-12-31 22:48:26,309 INFO L78 Accepts]: Start accepts. Automaton has 2420 states and 6170 transitions. Word has length 96 [2018-12-31 22:48:26,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:26,310 INFO L480 AbstractCegarLoop]: Abstraction has 2420 states and 6170 transitions. [2018-12-31 22:48:26,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-31 22:48:26,310 INFO L276 IsEmpty]: Start isEmpty. Operand 2420 states and 6170 transitions. [2018-12-31 22:48:26,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 22:48:26,315 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:26,315 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] [2018-12-31 22:48:26,315 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:26,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:26,316 INFO L82 PathProgramCache]: Analyzing trace with hash 187348118, now seen corresponding path program 3 times [2018-12-31 22:48:26,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:26,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:26,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:26,318 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 22:48:26,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:26,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 22:48:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 22:48:26,420 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 22:48:26,629 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-31 22:48:26,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 10:48:26 BasicIcfg [2018-12-31 22:48:26,633 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 22:48:26,634 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 22:48:26,634 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 22:48:26,634 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 22:48:26,635 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:47:56" (3/4) ... [2018-12-31 22:48:26,639 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 22:48:26,868 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 22:48:26,868 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 22:48:26,872 INFO L168 Benchmark]: Toolchain (without parser) took 32861.80 ms. Allocated memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: 1.6 GB). Free memory was 954.1 MB in the beginning and 703.5 MB in the end (delta: 250.6 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2018-12-31 22:48:26,874 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 22:48:26,874 INFO L168 Benchmark]: CACSL2BoogieTranslator took 907.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -162.1 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. [2018-12-31 22:48:26,874 INFO L168 Benchmark]: Boogie Procedure Inliner took 112.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-31 22:48:26,875 INFO L168 Benchmark]: Boogie Preprocessor took 73.42 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 22:48:26,876 INFO L168 Benchmark]: RCFGBuilder took 1263.42 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: 45.6 MB). Peak memory consumption was 45.6 MB. Max. memory is 11.5 GB. [2018-12-31 22:48:26,876 INFO L168 Benchmark]: TraceAbstraction took 30258.72 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 1.1 GB in the beginning and 732.1 MB in the end (delta: 326.4 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2018-12-31 22:48:26,876 INFO L168 Benchmark]: Witness Printer took 234.20 ms. Allocated memory is still 2.6 GB. Free memory was 732.1 MB in the beginning and 703.5 MB in the end (delta: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. [2018-12-31 22:48:26,881 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 907.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -162.1 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 112.00 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 73.42 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 1263.42 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: 45.6 MB). Peak memory consumption was 45.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 30258.72 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 1.1 GB in the beginning and 732.1 MB in the end (delta: 326.4 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. * Witness Printer took 234.20 ms. Allocated memory is still 2.6 GB. Free memory was 732.1 MB in the beginning and 703.5 MB in the end (delta: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L681] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L682] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L683] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L684] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L685] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L686] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L687] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L688] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L689] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L690] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L691] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L692] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L693] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L694] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L695] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L697] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L698] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L699] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L765] -1 pthread_t t1615; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L766] FCALL, FORK -1 pthread_create(&t1615, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L767] -1 pthread_t t1616; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L768] FCALL, FORK -1 pthread_create(&t1616, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L723] 0 y$w_buff1 = y$w_buff0 [L724] 0 y$w_buff0 = 2 [L725] 0 y$w_buff1_used = y$w_buff0_used [L726] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L728] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L729] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L730] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L731] 0 y$r_buff0_thd2 = (_Bool)1 [L734] 0 z = 1 [L737] 0 __unbuffered_p1_EAX = z [L740] 0 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L743] EXPR 0 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L703] 1 x = 1 [L706] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L743] 0 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L744] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L709] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L709] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2, z=1] [L745] EXPR 0 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2, z=1] [L745] 0 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 [L709] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2, z=1] [L709] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L710] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L710] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L746] 0 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L747] EXPR 0 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 0 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 [L750] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L711] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L711] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L712] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L712] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L713] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L713] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L716] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L770] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] -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) [L775] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L775] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L776] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L776] -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 [L777] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L777] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L778] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L778] -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 [L781] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L782] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L783] -1 y$flush_delayed = weak$$choice2 [L784] -1 y$mem_tmp = y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L785] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L785] -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) [L786] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L786] -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)) [L787] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] -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)) [L788] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L788] -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)) [L789] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L789] -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)) [L790] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] -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)) [L791] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] -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)) [L792] -1 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L793] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L793] -1 y = y$flush_delayed ? y$mem_tmp : y [L794] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 181 locations, 3 error locations. UNSAFE Result, 30.1s OverallTime, 21 OverallIterations, 1 TraceHistogramMax, 15.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4314 SDtfs, 4147 SDslu, 10538 SDs, 0 SdLazy, 3821 SolverSat, 196 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 201 GetRequests, 59 SyntacticMatches, 18 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37143occurred 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: 6.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 62260 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 1715 NumberOfCodeBlocks, 1715 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1599 ConstructedInterpolants, 0 QuantifiedInterpolants, 314284 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...