./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix034_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_7a536eae-7459-498b-b42f-afbd7e3d3ef9/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7a536eae-7459-498b-b42f-afbd7e3d3ef9/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7a536eae-7459-498b-b42f-afbd7e3d3ef9/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7a536eae-7459-498b-b42f-afbd7e3d3ef9/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix034_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_7a536eae-7459-498b-b42f-afbd7e3d3ef9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7a536eae-7459-498b-b42f-afbd7e3d3ef9/bin/uautomizer --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 586905fd6d18b653e017f1f614979fdf0ba4a3cb ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-cad4683 [2019-11-16 00:01:21,012 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:01:21,014 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:01:21,027 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:01:21,028 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:01:21,029 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:01:21,031 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:01:21,040 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:01:21,044 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:01:21,048 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:01:21,048 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:01:21,049 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:01:21,049 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:01:21,050 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:01:21,051 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:01:21,052 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:01:21,052 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:01:21,053 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:01:21,054 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:01:21,056 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:01:21,057 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:01:21,058 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:01:21,059 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:01:21,059 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:01:21,064 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:01:21,065 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:01:21,065 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:01:21,066 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:01:21,067 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:01:21,068 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:01:21,069 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:01:21,069 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:01:21,070 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:01:21,070 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:01:21,073 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:01:21,073 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:01:21,074 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:01:21,074 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:01:21,074 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:01:21,077 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:01:21,078 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:01:21,079 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7a536eae-7459-498b-b42f-afbd7e3d3ef9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:01:21,104 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:01:21,104 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:01:21,105 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:01:21,105 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:01:21,105 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:01:21,106 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:01:21,106 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:01:21,106 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:01:21,106 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:01:21,106 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:01:21,107 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:01:21,107 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:01:21,107 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:01:21,107 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:01:21,107 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:01:21,108 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:01:21,108 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:01:21,108 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:01:21,108 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:01:21,109 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:01:21,109 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:01:21,109 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:01:21,109 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:01:21,109 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:01:21,110 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:01:21,110 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:01:21,110 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:01:21,110 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:01:21,110 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_7a536eae-7459-498b-b42f-afbd7e3d3ef9/bin/uautomizer 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 -> 586905fd6d18b653e017f1f614979fdf0ba4a3cb [2019-11-16 00:01:21,159 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:01:21,171 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:01:21,174 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:01:21,176 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:01:21,176 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:01:21,177 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7a536eae-7459-498b-b42f-afbd7e3d3ef9/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix034_rmo.opt.i [2019-11-16 00:01:21,236 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7a536eae-7459-498b-b42f-afbd7e3d3ef9/bin/uautomizer/data/eeb26dd9d/2dcb521b0be64c7aaf5cb44db95889f3/FLAG225b9e5ca [2019-11-16 00:01:21,734 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:01:21,735 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7a536eae-7459-498b-b42f-afbd7e3d3ef9/sv-benchmarks/c/pthread-wmm/mix034_rmo.opt.i [2019-11-16 00:01:21,756 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7a536eae-7459-498b-b42f-afbd7e3d3ef9/bin/uautomizer/data/eeb26dd9d/2dcb521b0be64c7aaf5cb44db95889f3/FLAG225b9e5ca [2019-11-16 00:01:22,042 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7a536eae-7459-498b-b42f-afbd7e3d3ef9/bin/uautomizer/data/eeb26dd9d/2dcb521b0be64c7aaf5cb44db95889f3 [2019-11-16 00:01:22,045 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:01:22,046 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:01:22,047 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:01:22,047 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:01:22,050 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:01:22,051 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:01:22" (1/1) ... [2019-11-16 00:01:22,054 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@433af1c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:01:22, skipping insertion in model container [2019-11-16 00:01:22,054 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:01:22" (1/1) ... [2019-11-16 00:01:22,060 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:01:22,100 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:01:22,550 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:01:22,562 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:01:22,618 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:01:22,693 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:01:22,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:01:22 WrapperNode [2019-11-16 00:01:22,694 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:01:22,695 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:01:22,695 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:01:22,695 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:01:22,702 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:01:22" (1/1) ... [2019-11-16 00:01:22,718 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:01:22" (1/1) ... [2019-11-16 00:01:22,743 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:01:22,744 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:01:22,744 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:01:22,744 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:01:22,753 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:01:22" (1/1) ... [2019-11-16 00:01:22,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:01:22" (1/1) ... [2019-11-16 00:01:22,758 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:01:22" (1/1) ... [2019-11-16 00:01:22,758 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:01:22" (1/1) ... [2019-11-16 00:01:22,769 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:01:22" (1/1) ... [2019-11-16 00:01:22,774 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:01:22" (1/1) ... [2019-11-16 00:01:22,777 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:01:22" (1/1) ... [2019-11-16 00:01:22,782 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:01:22,782 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:01:22,782 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:01:22,782 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:01:22,783 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:01:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7a536eae-7459-498b-b42f-afbd7e3d3ef9/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:01:22,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:01:22,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-16 00:01:22,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:01:22,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:01:22,847 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-16 00:01:22,847 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-16 00:01:22,847 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-16 00:01:22,847 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-16 00:01:22,847 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-16 00:01:22,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:01:22,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:01:22,851 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-16 00:01:23,537 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:01:23,537 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-16 00:01:23,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:01:23 BoogieIcfgContainer [2019-11-16 00:01:23,538 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:01:23,539 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:01:23,539 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:01:23,542 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:01:23,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:01:22" (1/3) ... [2019-11-16 00:01:23,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d80e097 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:01:23, skipping insertion in model container [2019-11-16 00:01:23,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:01:22" (2/3) ... [2019-11-16 00:01:23,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d80e097 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:01:23, skipping insertion in model container [2019-11-16 00:01:23,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:01:23" (3/3) ... [2019-11-16 00:01:23,545 INFO L109 eAbstractionObserver]: Analyzing ICFG mix034_rmo.opt.i [2019-11-16 00:01:23,608 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,608 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,608 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,608 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,608 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,609 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,609 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,609 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,609 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,609 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,610 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,610 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,610 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,610 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,610 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,611 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,611 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,611 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,611 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,611 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,611 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,612 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,612 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,612 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,612 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,612 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,613 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,613 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,613 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,613 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,614 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,614 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,614 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,614 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,617 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,617 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,617 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,617 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,617 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,618 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,618 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,618 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,619 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,619 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,619 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,619 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,620 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,620 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,620 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,620 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,621 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,621 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,621 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,621 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,621 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,621 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,622 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,622 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,622 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,623 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,623 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,623 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,623 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,623 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,623 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,624 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,624 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,624 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,624 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,624 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,625 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,625 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,625 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,625 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,626 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,626 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,626 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,626 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,626 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,626 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,627 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,627 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,627 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,627 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,627 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,627 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,628 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,628 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,628 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,628 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,629 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,629 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,629 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,629 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,630 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,630 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,630 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,630 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,630 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,630 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,631 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,633 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,634 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,634 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,634 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,635 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,635 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,636 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,636 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,636 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,636 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,637 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,637 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,644 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,645 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,645 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,645 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,645 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,645 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,645 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,645 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,646 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,646 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,646 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,646 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,646 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,646 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,647 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,647 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,647 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,647 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,647 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,647 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,647 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,648 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,648 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,648 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,648 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,648 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,648 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,649 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,649 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,649 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,649 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,649 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,649 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,649 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,650 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,650 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,650 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,650 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,650 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:01:23,656 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-16 00:01:23,656 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:01:23,665 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-16 00:01:23,675 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-16 00:01:23,695 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:01:23,695 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:01:23,695 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:01:23,695 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:01:23,695 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:01:23,696 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:01:23,696 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:01:23,696 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:01:23,712 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 142 places, 180 transitions [2019-11-16 00:01:26,050 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32592 states. [2019-11-16 00:01:26,052 INFO L276 IsEmpty]: Start isEmpty. Operand 32592 states. [2019-11-16 00:01:26,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-16 00:01:26,063 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:26,064 INFO L380 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] [2019-11-16 00:01:26,067 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:26,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:26,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1615524494, now seen corresponding path program 1 times [2019-11-16 00:01:26,079 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:26,080 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738879297] [2019-11-16 00:01:26,081 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:26,081 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:26,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:26,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:26,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:01:26,355 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738879297] [2019-11-16 00:01:26,355 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:01:26,356 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:01:26,356 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900944718] [2019-11-16 00:01:26,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:01:26,360 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:26,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:01:26,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:01:26,376 INFO L87 Difference]: Start difference. First operand 32592 states. Second operand 4 states. [2019-11-16 00:01:27,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:27,003 INFO L93 Difference]: Finished difference Result 33592 states and 129569 transitions. [2019-11-16 00:01:27,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:01:27,005 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-16 00:01:27,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:27,255 INFO L225 Difference]: With dead ends: 33592 [2019-11-16 00:01:27,256 INFO L226 Difference]: Without dead ends: 25704 [2019-11-16 00:01:27,257 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:01:27,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25704 states. [2019-11-16 00:01:28,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25704 to 25704. [2019-11-16 00:01:28,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25704 states. [2019-11-16 00:01:28,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25704 states to 25704 states and 99585 transitions. [2019-11-16 00:01:28,661 INFO L78 Accepts]: Start accepts. Automaton has 25704 states and 99585 transitions. Word has length 35 [2019-11-16 00:01:28,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:28,661 INFO L462 AbstractCegarLoop]: Abstraction has 25704 states and 99585 transitions. [2019-11-16 00:01:28,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:01:28,661 INFO L276 IsEmpty]: Start isEmpty. Operand 25704 states and 99585 transitions. [2019-11-16 00:01:28,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-16 00:01:28,670 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:28,670 INFO L380 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] [2019-11-16 00:01:28,670 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:28,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:28,671 INFO L82 PathProgramCache]: Analyzing trace with hash -815760078, now seen corresponding path program 1 times [2019-11-16 00:01:28,671 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:28,671 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972500738] [2019-11-16 00:01:28,671 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:28,671 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:28,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:28,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:28,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:01:28,785 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972500738] [2019-11-16 00:01:28,785 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:01:28,785 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:01:28,785 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90259432] [2019-11-16 00:01:28,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:01:28,787 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:28,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:01:28,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:01:28,787 INFO L87 Difference]: Start difference. First operand 25704 states and 99585 transitions. Second operand 5 states. [2019-11-16 00:01:29,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:29,669 INFO L93 Difference]: Finished difference Result 41082 states and 150432 transitions. [2019-11-16 00:01:29,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:01:29,670 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-11-16 00:01:29,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:29,800 INFO L225 Difference]: With dead ends: 41082 [2019-11-16 00:01:29,800 INFO L226 Difference]: Without dead ends: 40546 [2019-11-16 00:01:29,802 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:01:30,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40546 states. [2019-11-16 00:01:31,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40546 to 38926. [2019-11-16 00:01:31,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38926 states. [2019-11-16 00:01:31,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38926 states to 38926 states and 143582 transitions. [2019-11-16 00:01:31,255 INFO L78 Accepts]: Start accepts. Automaton has 38926 states and 143582 transitions. Word has length 47 [2019-11-16 00:01:31,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:31,257 INFO L462 AbstractCegarLoop]: Abstraction has 38926 states and 143582 transitions. [2019-11-16 00:01:31,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:01:31,258 INFO L276 IsEmpty]: Start isEmpty. Operand 38926 states and 143582 transitions. [2019-11-16 00:01:31,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-16 00:01:31,266 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:31,266 INFO L380 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] [2019-11-16 00:01:31,266 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:31,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:31,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1217511206, now seen corresponding path program 1 times [2019-11-16 00:01:31,267 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:31,267 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884188411] [2019-11-16 00:01:31,268 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:31,268 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:31,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:31,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:31,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:01:31,375 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884188411] [2019-11-16 00:01:31,375 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:01:31,375 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:01:31,375 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123911632] [2019-11-16 00:01:31,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:01:31,376 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:31,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:01:31,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:01:31,376 INFO L87 Difference]: Start difference. First operand 38926 states and 143582 transitions. Second operand 5 states. [2019-11-16 00:01:31,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:31,939 INFO L93 Difference]: Finished difference Result 49779 states and 180634 transitions. [2019-11-16 00:01:31,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:01:31,940 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-11-16 00:01:31,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:32,124 INFO L225 Difference]: With dead ends: 49779 [2019-11-16 00:01:32,125 INFO L226 Difference]: Without dead ends: 49275 [2019-11-16 00:01:32,125 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:01:33,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49275 states. [2019-11-16 00:01:33,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49275 to 42678. [2019-11-16 00:01:33,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42678 states. [2019-11-16 00:01:33,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42678 states to 42678 states and 156593 transitions. [2019-11-16 00:01:33,801 INFO L78 Accepts]: Start accepts. Automaton has 42678 states and 156593 transitions. Word has length 48 [2019-11-16 00:01:33,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:33,802 INFO L462 AbstractCegarLoop]: Abstraction has 42678 states and 156593 transitions. [2019-11-16 00:01:33,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:01:33,802 INFO L276 IsEmpty]: Start isEmpty. Operand 42678 states and 156593 transitions. [2019-11-16 00:01:33,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-16 00:01:33,809 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:33,810 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:01:33,810 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:33,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:33,811 INFO L82 PathProgramCache]: Analyzing trace with hash -825933952, now seen corresponding path program 1 times [2019-11-16 00:01:33,811 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:33,811 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773732501] [2019-11-16 00:01:33,811 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:33,812 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:33,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:33,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:33,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:01:33,867 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773732501] [2019-11-16 00:01:33,867 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:01:33,868 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:01:33,868 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833150599] [2019-11-16 00:01:33,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:01:33,871 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:33,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:01:33,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:01:33,872 INFO L87 Difference]: Start difference. First operand 42678 states and 156593 transitions. Second operand 3 states. [2019-11-16 00:01:34,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:34,136 INFO L93 Difference]: Finished difference Result 61088 states and 221431 transitions. [2019-11-16 00:01:34,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:01:34,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-16 00:01:34,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:35,058 INFO L225 Difference]: With dead ends: 61088 [2019-11-16 00:01:35,058 INFO L226 Difference]: Without dead ends: 61088 [2019-11-16 00:01:35,059 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:01:35,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61088 states. [2019-11-16 00:01:35,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61088 to 48017. [2019-11-16 00:01:35,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48017 states. [2019-11-16 00:01:36,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48017 states to 48017 states and 174180 transitions. [2019-11-16 00:01:36,001 INFO L78 Accepts]: Start accepts. Automaton has 48017 states and 174180 transitions. Word has length 50 [2019-11-16 00:01:36,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:36,001 INFO L462 AbstractCegarLoop]: Abstraction has 48017 states and 174180 transitions. [2019-11-16 00:01:36,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:01:36,001 INFO L276 IsEmpty]: Start isEmpty. Operand 48017 states and 174180 transitions. [2019-11-16 00:01:36,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-16 00:01:36,013 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:36,013 INFO L380 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] [2019-11-16 00:01:36,013 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:36,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:36,014 INFO L82 PathProgramCache]: Analyzing trace with hash 810527103, now seen corresponding path program 1 times [2019-11-16 00:01:36,014 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:36,014 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951285510] [2019-11-16 00:01:36,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:36,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:36,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:36,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:36,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:01:36,140 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951285510] [2019-11-16 00:01:36,141 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:01:36,141 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:01:36,141 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941161741] [2019-11-16 00:01:36,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:01:36,142 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:36,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:01:36,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:01:36,142 INFO L87 Difference]: Start difference. First operand 48017 states and 174180 transitions. Second operand 6 states. [2019-11-16 00:01:36,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:36,976 INFO L93 Difference]: Finished difference Result 63757 states and 229380 transitions. [2019-11-16 00:01:36,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:01:36,977 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-11-16 00:01:36,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:37,121 INFO L225 Difference]: With dead ends: 63757 [2019-11-16 00:01:37,122 INFO L226 Difference]: Without dead ends: 63757 [2019-11-16 00:01:37,122 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:01:37,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63757 states. [2019-11-16 00:01:39,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63757 to 59950. [2019-11-16 00:01:39,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59950 states. [2019-11-16 00:01:39,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59950 states to 59950 states and 215673 transitions. [2019-11-16 00:01:39,134 INFO L78 Accepts]: Start accepts. Automaton has 59950 states and 215673 transitions. Word has length 54 [2019-11-16 00:01:39,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:39,134 INFO L462 AbstractCegarLoop]: Abstraction has 59950 states and 215673 transitions. [2019-11-16 00:01:39,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:01:39,134 INFO L276 IsEmpty]: Start isEmpty. Operand 59950 states and 215673 transitions. [2019-11-16 00:01:39,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-16 00:01:39,147 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:39,147 INFO L380 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] [2019-11-16 00:01:39,148 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:39,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:39,148 INFO L82 PathProgramCache]: Analyzing trace with hash -986424256, now seen corresponding path program 1 times [2019-11-16 00:01:39,148 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:39,148 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260051741] [2019-11-16 00:01:39,148 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:39,149 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:39,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:39,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:39,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:01:39,285 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260051741] [2019-11-16 00:01:39,286 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:01:39,286 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:01:39,286 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374050042] [2019-11-16 00:01:39,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:01:39,287 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:39,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:01:39,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:01:39,287 INFO L87 Difference]: Start difference. First operand 59950 states and 215673 transitions. Second operand 7 states. [2019-11-16 00:01:40,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:40,375 INFO L93 Difference]: Finished difference Result 83686 states and 290098 transitions. [2019-11-16 00:01:40,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:01:40,375 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-11-16 00:01:40,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:40,527 INFO L225 Difference]: With dead ends: 83686 [2019-11-16 00:01:40,528 INFO L226 Difference]: Without dead ends: 83686 [2019-11-16 00:01:40,528 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:01:44,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83686 states. [2019-11-16 00:01:45,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83686 to 71013. [2019-11-16 00:01:45,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71013 states. [2019-11-16 00:01:45,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71013 states to 71013 states and 249887 transitions. [2019-11-16 00:01:45,349 INFO L78 Accepts]: Start accepts. Automaton has 71013 states and 249887 transitions. Word has length 54 [2019-11-16 00:01:45,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:45,350 INFO L462 AbstractCegarLoop]: Abstraction has 71013 states and 249887 transitions. [2019-11-16 00:01:45,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:01:45,350 INFO L276 IsEmpty]: Start isEmpty. Operand 71013 states and 249887 transitions. [2019-11-16 00:01:45,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-16 00:01:45,361 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:45,361 INFO L380 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] [2019-11-16 00:01:45,361 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:45,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:45,362 INFO L82 PathProgramCache]: Analyzing trace with hash -98920575, now seen corresponding path program 1 times [2019-11-16 00:01:45,362 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:45,362 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893318927] [2019-11-16 00:01:45,362 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:45,362 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:45,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:45,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:45,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:01:45,419 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893318927] [2019-11-16 00:01:45,419 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:01:45,419 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:01:45,419 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532158802] [2019-11-16 00:01:45,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:01:45,419 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:45,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:01:45,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:01:45,420 INFO L87 Difference]: Start difference. First operand 71013 states and 249887 transitions. Second operand 3 states. [2019-11-16 00:01:45,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:45,693 INFO L93 Difference]: Finished difference Result 54022 states and 188919 transitions. [2019-11-16 00:01:45,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:01:45,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-16 00:01:45,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:45,822 INFO L225 Difference]: With dead ends: 54022 [2019-11-16 00:01:45,822 INFO L226 Difference]: Without dead ends: 54022 [2019-11-16 00:01:45,822 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:01:46,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54022 states. [2019-11-16 00:01:46,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54022 to 53407. [2019-11-16 00:01:46,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53407 states. [2019-11-16 00:01:46,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53407 states to 53407 states and 187038 transitions. [2019-11-16 00:01:46,746 INFO L78 Accepts]: Start accepts. Automaton has 53407 states and 187038 transitions. Word has length 54 [2019-11-16 00:01:46,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:46,747 INFO L462 AbstractCegarLoop]: Abstraction has 53407 states and 187038 transitions. [2019-11-16 00:01:46,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:01:46,747 INFO L276 IsEmpty]: Start isEmpty. Operand 53407 states and 187038 transitions. [2019-11-16 00:01:46,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-16 00:01:46,754 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:46,754 INFO L380 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] [2019-11-16 00:01:46,754 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:46,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:46,754 INFO L82 PathProgramCache]: Analyzing trace with hash -698836789, now seen corresponding path program 1 times [2019-11-16 00:01:46,755 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:46,755 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574192220] [2019-11-16 00:01:46,755 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:46,755 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:46,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:46,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:46,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:01:46,818 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574192220] [2019-11-16 00:01:46,818 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:01:46,818 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:01:46,818 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597755291] [2019-11-16 00:01:46,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:01:46,819 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:46,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:01:46,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:01:46,819 INFO L87 Difference]: Start difference. First operand 53407 states and 187038 transitions. Second operand 6 states. [2019-11-16 00:01:48,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:48,060 INFO L93 Difference]: Finished difference Result 68647 states and 237302 transitions. [2019-11-16 00:01:48,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:01:48,060 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-11-16 00:01:48,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:48,193 INFO L225 Difference]: With dead ends: 68647 [2019-11-16 00:01:48,193 INFO L226 Difference]: Without dead ends: 68079 [2019-11-16 00:01:48,194 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:01:48,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68079 states. [2019-11-16 00:01:49,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68079 to 53491. [2019-11-16 00:01:49,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53491 states. [2019-11-16 00:01:49,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53491 states to 53491 states and 187735 transitions. [2019-11-16 00:01:49,287 INFO L78 Accepts]: Start accepts. Automaton has 53491 states and 187735 transitions. Word has length 54 [2019-11-16 00:01:49,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:49,287 INFO L462 AbstractCegarLoop]: Abstraction has 53491 states and 187735 transitions. [2019-11-16 00:01:49,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:01:49,288 INFO L276 IsEmpty]: Start isEmpty. Operand 53491 states and 187735 transitions. [2019-11-16 00:01:49,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-16 00:01:49,298 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:49,298 INFO L380 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] [2019-11-16 00:01:49,298 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:49,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:49,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1459554400, now seen corresponding path program 1 times [2019-11-16 00:01:49,299 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:49,299 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542227049] [2019-11-16 00:01:49,299 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:49,299 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:49,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:49,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:49,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:01:49,391 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542227049] [2019-11-16 00:01:49,392 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:01:49,392 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:01:49,392 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705839263] [2019-11-16 00:01:49,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:01:49,393 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:49,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:01:49,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:01:49,393 INFO L87 Difference]: Start difference. First operand 53491 states and 187735 transitions. Second operand 6 states. [2019-11-16 00:01:50,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:50,141 INFO L93 Difference]: Finished difference Result 67850 states and 231361 transitions. [2019-11-16 00:01:50,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:01:50,150 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-11-16 00:01:50,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:50,282 INFO L225 Difference]: With dead ends: 67850 [2019-11-16 00:01:50,283 INFO L226 Difference]: Without dead ends: 67850 [2019-11-16 00:01:50,283 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:01:50,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67850 states. [2019-11-16 00:01:51,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67850 to 59082. [2019-11-16 00:01:51,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59082 states. [2019-11-16 00:01:52,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59082 states to 59082 states and 204131 transitions. [2019-11-16 00:01:52,048 INFO L78 Accepts]: Start accepts. Automaton has 59082 states and 204131 transitions. Word has length 55 [2019-11-16 00:01:52,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:52,049 INFO L462 AbstractCegarLoop]: Abstraction has 59082 states and 204131 transitions. [2019-11-16 00:01:52,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:01:52,049 INFO L276 IsEmpty]: Start isEmpty. Operand 59082 states and 204131 transitions. [2019-11-16 00:01:52,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-16 00:01:52,058 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:52,058 INFO L380 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] [2019-11-16 00:01:52,058 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:52,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:52,059 INFO L82 PathProgramCache]: Analyzing trace with hash -572050719, now seen corresponding path program 1 times [2019-11-16 00:01:52,059 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:52,059 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795280558] [2019-11-16 00:01:52,059 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:52,060 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:52,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:52,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:52,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:01:52,114 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795280558] [2019-11-16 00:01:52,114 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:01:52,114 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:01:52,114 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005967925] [2019-11-16 00:01:52,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:01:52,114 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:52,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:01:52,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:01:52,115 INFO L87 Difference]: Start difference. First operand 59082 states and 204131 transitions. Second operand 4 states. [2019-11-16 00:01:52,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:52,180 INFO L93 Difference]: Finished difference Result 10213 states and 31247 transitions. [2019-11-16 00:01:52,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:01:52,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-11-16 00:01:52,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:52,195 INFO L225 Difference]: With dead ends: 10213 [2019-11-16 00:01:52,195 INFO L226 Difference]: Without dead ends: 8508 [2019-11-16 00:01:52,200 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:01:52,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8508 states. [2019-11-16 00:01:52,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8508 to 8460. [2019-11-16 00:01:52,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8460 states. [2019-11-16 00:01:52,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8460 states to 8460 states and 25326 transitions. [2019-11-16 00:01:52,298 INFO L78 Accepts]: Start accepts. Automaton has 8460 states and 25326 transitions. Word has length 55 [2019-11-16 00:01:52,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:52,298 INFO L462 AbstractCegarLoop]: Abstraction has 8460 states and 25326 transitions. [2019-11-16 00:01:52,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:01:52,298 INFO L276 IsEmpty]: Start isEmpty. Operand 8460 states and 25326 transitions. [2019-11-16 00:01:52,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-16 00:01:52,301 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:52,301 INFO L380 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] [2019-11-16 00:01:52,301 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:52,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:52,302 INFO L82 PathProgramCache]: Analyzing trace with hash 672105094, now seen corresponding path program 1 times [2019-11-16 00:01:52,302 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:52,302 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903536171] [2019-11-16 00:01:52,302 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:52,302 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:52,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:52,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:52,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:01:52,370 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903536171] [2019-11-16 00:01:52,370 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:01:52,370 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:01:52,370 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468597084] [2019-11-16 00:01:52,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:01:52,371 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:52,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:01:52,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:01:52,371 INFO L87 Difference]: Start difference. First operand 8460 states and 25326 transitions. Second operand 6 states. [2019-11-16 00:01:52,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:52,727 INFO L93 Difference]: Finished difference Result 10741 states and 31734 transitions. [2019-11-16 00:01:52,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:01:52,728 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-11-16 00:01:52,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:52,740 INFO L225 Difference]: With dead ends: 10741 [2019-11-16 00:01:52,740 INFO L226 Difference]: Without dead ends: 10680 [2019-11-16 00:01:52,741 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:01:52,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10680 states. [2019-11-16 00:01:52,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10680 to 9961. [2019-11-16 00:01:52,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9961 states. [2019-11-16 00:01:52,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9961 states to 9961 states and 29612 transitions. [2019-11-16 00:01:52,858 INFO L78 Accepts]: Start accepts. Automaton has 9961 states and 29612 transitions. Word has length 62 [2019-11-16 00:01:52,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:52,858 INFO L462 AbstractCegarLoop]: Abstraction has 9961 states and 29612 transitions. [2019-11-16 00:01:52,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:01:52,859 INFO L276 IsEmpty]: Start isEmpty. Operand 9961 states and 29612 transitions. [2019-11-16 00:01:52,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-16 00:01:52,863 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:52,863 INFO L380 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] [2019-11-16 00:01:52,864 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:52,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:52,864 INFO L82 PathProgramCache]: Analyzing trace with hash -727186746, now seen corresponding path program 1 times [2019-11-16 00:01:52,864 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:52,864 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253422508] [2019-11-16 00:01:52,865 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:52,865 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:52,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:52,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:52,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:01:52,920 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253422508] [2019-11-16 00:01:52,920 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:01:52,920 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:01:52,920 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37792401] [2019-11-16 00:01:52,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:01:52,921 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:52,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:01:52,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:01:52,921 INFO L87 Difference]: Start difference. First operand 9961 states and 29612 transitions. Second operand 4 states. [2019-11-16 00:01:53,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:53,212 INFO L93 Difference]: Finished difference Result 12779 states and 37556 transitions. [2019-11-16 00:01:53,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:01:53,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-11-16 00:01:53,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:53,228 INFO L225 Difference]: With dead ends: 12779 [2019-11-16 00:01:53,228 INFO L226 Difference]: Without dead ends: 12779 [2019-11-16 00:01:53,228 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:01:53,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12779 states. [2019-11-16 00:01:53,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12779 to 11120. [2019-11-16 00:01:53,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11120 states. [2019-11-16 00:01:53,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11120 states to 11120 states and 32800 transitions. [2019-11-16 00:01:53,360 INFO L78 Accepts]: Start accepts. Automaton has 11120 states and 32800 transitions. Word has length 68 [2019-11-16 00:01:53,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:53,360 INFO L462 AbstractCegarLoop]: Abstraction has 11120 states and 32800 transitions. [2019-11-16 00:01:53,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:01:53,360 INFO L276 IsEmpty]: Start isEmpty. Operand 11120 states and 32800 transitions. [2019-11-16 00:01:53,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-16 00:01:53,365 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:53,365 INFO L380 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] [2019-11-16 00:01:53,366 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:53,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:53,366 INFO L82 PathProgramCache]: Analyzing trace with hash 517577735, now seen corresponding path program 1 times [2019-11-16 00:01:53,366 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:53,366 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620620742] [2019-11-16 00:01:53,366 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:53,366 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:53,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:53,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:53,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:01:53,462 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620620742] [2019-11-16 00:01:53,462 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:01:53,462 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:01:53,462 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903036300] [2019-11-16 00:01:53,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:01:53,462 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:53,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:01:53,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:01:53,463 INFO L87 Difference]: Start difference. First operand 11120 states and 32800 transitions. Second operand 6 states. [2019-11-16 00:01:53,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:53,903 INFO L93 Difference]: Finished difference Result 12254 states and 35521 transitions. [2019-11-16 00:01:53,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:01:53,904 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-11-16 00:01:53,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:53,917 INFO L225 Difference]: With dead ends: 12254 [2019-11-16 00:01:53,917 INFO L226 Difference]: Without dead ends: 12254 [2019-11-16 00:01:53,917 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:01:53,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12254 states. [2019-11-16 00:01:54,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12254 to 11959. [2019-11-16 00:01:54,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11959 states. [2019-11-16 00:01:54,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11959 states to 11959 states and 34775 transitions. [2019-11-16 00:01:54,052 INFO L78 Accepts]: Start accepts. Automaton has 11959 states and 34775 transitions. Word has length 68 [2019-11-16 00:01:54,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:54,052 INFO L462 AbstractCegarLoop]: Abstraction has 11959 states and 34775 transitions. [2019-11-16 00:01:54,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:01:54,052 INFO L276 IsEmpty]: Start isEmpty. Operand 11959 states and 34775 transitions. [2019-11-16 00:01:54,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-16 00:01:54,059 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:54,059 INFO L380 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] [2019-11-16 00:01:54,059 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:54,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:54,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1559631608, now seen corresponding path program 1 times [2019-11-16 00:01:54,060 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:54,060 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108999888] [2019-11-16 00:01:54,060 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:54,060 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:54,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:54,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:54,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:01:54,140 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108999888] [2019-11-16 00:01:54,140 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:01:54,140 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:01:54,140 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106455971] [2019-11-16 00:01:54,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:01:54,140 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:54,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:01:54,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:01:54,141 INFO L87 Difference]: Start difference. First operand 11959 states and 34775 transitions. Second operand 6 states. [2019-11-16 00:01:54,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:54,582 INFO L93 Difference]: Finished difference Result 13808 states and 38964 transitions. [2019-11-16 00:01:54,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:01:54,582 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-11-16 00:01:54,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:54,598 INFO L225 Difference]: With dead ends: 13808 [2019-11-16 00:01:54,598 INFO L226 Difference]: Without dead ends: 13808 [2019-11-16 00:01:54,598 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:01:54,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13808 states. [2019-11-16 00:01:54,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13808 to 12522. [2019-11-16 00:01:54,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12522 states. [2019-11-16 00:01:54,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12522 states to 12522 states and 35774 transitions. [2019-11-16 00:01:54,747 INFO L78 Accepts]: Start accepts. Automaton has 12522 states and 35774 transitions. Word has length 68 [2019-11-16 00:01:54,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:54,747 INFO L462 AbstractCegarLoop]: Abstraction has 12522 states and 35774 transitions. [2019-11-16 00:01:54,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:01:54,748 INFO L276 IsEmpty]: Start isEmpty. Operand 12522 states and 35774 transitions. [2019-11-16 00:01:54,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-16 00:01:54,755 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:54,755 INFO L380 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] [2019-11-16 00:01:54,756 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:54,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:54,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1348280695, now seen corresponding path program 1 times [2019-11-16 00:01:54,756 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:54,756 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368492688] [2019-11-16 00:01:54,756 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:54,756 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:54,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:54,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:54,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:01:54,814 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368492688] [2019-11-16 00:01:54,814 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:01:54,814 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:01:54,815 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736574846] [2019-11-16 00:01:54,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:01:54,815 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:54,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:01:54,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:01:54,816 INFO L87 Difference]: Start difference. First operand 12522 states and 35774 transitions. Second operand 5 states. [2019-11-16 00:01:55,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:55,130 INFO L93 Difference]: Finished difference Result 16038 states and 45579 transitions. [2019-11-16 00:01:55,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:01:55,131 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-11-16 00:01:55,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:55,149 INFO L225 Difference]: With dead ends: 16038 [2019-11-16 00:01:55,149 INFO L226 Difference]: Without dead ends: 16038 [2019-11-16 00:01:55,149 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:01:55,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16038 states. [2019-11-16 00:01:55,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16038 to 14892. [2019-11-16 00:01:55,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14892 states. [2019-11-16 00:01:55,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14892 states to 14892 states and 42227 transitions. [2019-11-16 00:01:55,322 INFO L78 Accepts]: Start accepts. Automaton has 14892 states and 42227 transitions. Word has length 68 [2019-11-16 00:01:55,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:55,322 INFO L462 AbstractCegarLoop]: Abstraction has 14892 states and 42227 transitions. [2019-11-16 00:01:55,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:01:55,323 INFO L276 IsEmpty]: Start isEmpty. Operand 14892 states and 42227 transitions. [2019-11-16 00:01:55,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-16 00:01:55,331 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:55,331 INFO L380 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] [2019-11-16 00:01:55,331 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:55,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:55,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1858814872, now seen corresponding path program 1 times [2019-11-16 00:01:55,332 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:55,332 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905733390] [2019-11-16 00:01:55,332 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:55,332 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:55,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:55,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:55,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:01:55,386 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905733390] [2019-11-16 00:01:55,388 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:01:55,391 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:01:55,391 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293914183] [2019-11-16 00:01:55,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:01:55,392 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:55,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:01:55,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:01:55,392 INFO L87 Difference]: Start difference. First operand 14892 states and 42227 transitions. Second operand 4 states. [2019-11-16 00:01:55,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:55,853 INFO L93 Difference]: Finished difference Result 18321 states and 52088 transitions. [2019-11-16 00:01:55,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:01:55,853 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-11-16 00:01:55,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:55,873 INFO L225 Difference]: With dead ends: 18321 [2019-11-16 00:01:55,874 INFO L226 Difference]: Without dead ends: 18144 [2019-11-16 00:01:55,874 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:01:55,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18144 states. [2019-11-16 00:01:56,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18144 to 17301. [2019-11-16 00:01:56,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17301 states. [2019-11-16 00:01:56,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17301 states to 17301 states and 49086 transitions. [2019-11-16 00:01:56,073 INFO L78 Accepts]: Start accepts. Automaton has 17301 states and 49086 transitions. Word has length 68 [2019-11-16 00:01:56,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:56,073 INFO L462 AbstractCegarLoop]: Abstraction has 17301 states and 49086 transitions. [2019-11-16 00:01:56,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:01:56,073 INFO L276 IsEmpty]: Start isEmpty. Operand 17301 states and 49086 transitions. [2019-11-16 00:01:56,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-16 00:01:56,078 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:56,079 INFO L380 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] [2019-11-16 00:01:56,079 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:56,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:56,079 INFO L82 PathProgramCache]: Analyzing trace with hash 639201065, now seen corresponding path program 1 times [2019-11-16 00:01:56,079 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:56,079 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828995695] [2019-11-16 00:01:56,079 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:56,079 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:56,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:56,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:56,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:01:56,155 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828995695] [2019-11-16 00:01:56,156 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:01:56,156 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:01:56,156 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170328501] [2019-11-16 00:01:56,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:01:56,157 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:56,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:01:56,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:01:56,157 INFO L87 Difference]: Start difference. First operand 17301 states and 49086 transitions. Second operand 5 states. [2019-11-16 00:01:56,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:56,244 INFO L93 Difference]: Finished difference Result 16587 states and 45829 transitions. [2019-11-16 00:01:56,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:01:56,245 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-11-16 00:01:56,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:56,262 INFO L225 Difference]: With dead ends: 16587 [2019-11-16 00:01:56,262 INFO L226 Difference]: Without dead ends: 16587 [2019-11-16 00:01:56,262 INFO L600 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 [2019-11-16 00:01:56,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16587 states. [2019-11-16 00:01:56,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16587 to 14096. [2019-11-16 00:01:56,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14096 states. [2019-11-16 00:01:56,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14096 states to 14096 states and 38807 transitions. [2019-11-16 00:01:56,425 INFO L78 Accepts]: Start accepts. Automaton has 14096 states and 38807 transitions. Word has length 68 [2019-11-16 00:01:56,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:56,425 INFO L462 AbstractCegarLoop]: Abstraction has 14096 states and 38807 transitions. [2019-11-16 00:01:56,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:01:56,425 INFO L276 IsEmpty]: Start isEmpty. Operand 14096 states and 38807 transitions. [2019-11-16 00:01:56,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-16 00:01:56,430 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:56,430 INFO L380 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] [2019-11-16 00:01:56,430 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:56,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:56,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1526704746, now seen corresponding path program 1 times [2019-11-16 00:01:56,430 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:56,431 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464770253] [2019-11-16 00:01:56,431 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:56,431 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:56,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:56,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:56,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:01:56,496 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464770253] [2019-11-16 00:01:56,497 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:01:56,497 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:01:56,497 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479044085] [2019-11-16 00:01:56,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:01:56,498 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:56,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:01:56,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:01:56,498 INFO L87 Difference]: Start difference. First operand 14096 states and 38807 transitions. Second operand 5 states. [2019-11-16 00:01:56,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:56,556 INFO L93 Difference]: Finished difference Result 5057 states and 11952 transitions. [2019-11-16 00:01:56,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:01:56,556 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-11-16 00:01:56,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:56,560 INFO L225 Difference]: With dead ends: 5057 [2019-11-16 00:01:56,560 INFO L226 Difference]: Without dead ends: 4415 [2019-11-16 00:01:56,560 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:01:56,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4415 states. [2019-11-16 00:01:56,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4415 to 4403. [2019-11-16 00:01:56,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4403 states. [2019-11-16 00:01:56,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4403 states to 4403 states and 10064 transitions. [2019-11-16 00:01:56,606 INFO L78 Accepts]: Start accepts. Automaton has 4403 states and 10064 transitions. Word has length 68 [2019-11-16 00:01:56,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:56,606 INFO L462 AbstractCegarLoop]: Abstraction has 4403 states and 10064 transitions. [2019-11-16 00:01:56,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:01:56,607 INFO L276 IsEmpty]: Start isEmpty. Operand 4403 states and 10064 transitions. [2019-11-16 00:01:56,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-16 00:01:56,610 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:56,611 INFO L380 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] [2019-11-16 00:01:56,611 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:56,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:56,611 INFO L82 PathProgramCache]: Analyzing trace with hash 237281463, now seen corresponding path program 1 times [2019-11-16 00:01:56,612 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:56,612 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414376317] [2019-11-16 00:01:56,612 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:56,612 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:56,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:56,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:56,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:01:56,648 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414376317] [2019-11-16 00:01:56,649 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:01:56,649 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:01:56,649 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716877096] [2019-11-16 00:01:56,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:01:56,650 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:56,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:01:56,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:01:56,650 INFO L87 Difference]: Start difference. First operand 4403 states and 10064 transitions. Second operand 3 states. [2019-11-16 00:01:56,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:56,690 INFO L93 Difference]: Finished difference Result 5379 states and 12070 transitions. [2019-11-16 00:01:56,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:01:56,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-11-16 00:01:56,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:56,697 INFO L225 Difference]: With dead ends: 5379 [2019-11-16 00:01:56,697 INFO L226 Difference]: Without dead ends: 5379 [2019-11-16 00:01:56,698 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:01:56,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5379 states. [2019-11-16 00:01:56,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5379 to 4363. [2019-11-16 00:01:56,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4363 states. [2019-11-16 00:01:56,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4363 states to 4363 states and 9681 transitions. [2019-11-16 00:01:56,774 INFO L78 Accepts]: Start accepts. Automaton has 4363 states and 9681 transitions. Word has length 68 [2019-11-16 00:01:56,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:56,774 INFO L462 AbstractCegarLoop]: Abstraction has 4363 states and 9681 transitions. [2019-11-16 00:01:56,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:01:56,774 INFO L276 IsEmpty]: Start isEmpty. Operand 4363 states and 9681 transitions. [2019-11-16 00:01:56,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-16 00:01:56,780 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:56,780 INFO L380 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] [2019-11-16 00:01:56,780 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:56,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:56,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1029691817, now seen corresponding path program 1 times [2019-11-16 00:01:56,781 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:56,781 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797544306] [2019-11-16 00:01:56,781 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:56,782 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:56,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:56,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:56,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:01:56,876 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797544306] [2019-11-16 00:01:56,876 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:01:56,876 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:01:56,876 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475882474] [2019-11-16 00:01:56,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:01:56,877 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:56,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:01:56,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:01:56,878 INFO L87 Difference]: Start difference. First operand 4363 states and 9681 transitions. Second operand 7 states. [2019-11-16 00:01:57,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:57,380 INFO L93 Difference]: Finished difference Result 5136 states and 11285 transitions. [2019-11-16 00:01:57,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:01:57,380 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-11-16 00:01:57,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:57,386 INFO L225 Difference]: With dead ends: 5136 [2019-11-16 00:01:57,386 INFO L226 Difference]: Without dead ends: 5083 [2019-11-16 00:01:57,386 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-11-16 00:01:57,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5083 states. [2019-11-16 00:01:57,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5083 to 4435. [2019-11-16 00:01:57,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4435 states. [2019-11-16 00:01:57,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4435 states to 4435 states and 9733 transitions. [2019-11-16 00:01:57,444 INFO L78 Accepts]: Start accepts. Automaton has 4435 states and 9733 transitions. Word has length 74 [2019-11-16 00:01:57,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:57,444 INFO L462 AbstractCegarLoop]: Abstraction has 4435 states and 9733 transitions. [2019-11-16 00:01:57,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:01:57,444 INFO L276 IsEmpty]: Start isEmpty. Operand 4435 states and 9733 transitions. [2019-11-16 00:01:57,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-16 00:01:57,449 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:57,449 INFO L380 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] [2019-11-16 00:01:57,450 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:57,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:57,450 INFO L82 PathProgramCache]: Analyzing trace with hash 2110925138, now seen corresponding path program 1 times [2019-11-16 00:01:57,450 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:57,450 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624592473] [2019-11-16 00:01:57,451 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:57,451 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:57,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:57,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:57,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:01:57,524 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624592473] [2019-11-16 00:01:57,525 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:01:57,525 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:01:57,525 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075938246] [2019-11-16 00:01:57,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:01:57,526 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:57,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:01:57,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:01:57,527 INFO L87 Difference]: Start difference. First operand 4435 states and 9733 transitions. Second operand 5 states. [2019-11-16 00:01:57,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:57,797 INFO L93 Difference]: Finished difference Result 5310 states and 11604 transitions. [2019-11-16 00:01:57,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:01:57,798 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-11-16 00:01:57,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:57,802 INFO L225 Difference]: With dead ends: 5310 [2019-11-16 00:01:57,802 INFO L226 Difference]: Without dead ends: 5310 [2019-11-16 00:01:57,802 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:01:57,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5310 states. [2019-11-16 00:01:57,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5310 to 4567. [2019-11-16 00:01:57,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4567 states. [2019-11-16 00:01:57,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4567 states to 4567 states and 10023 transitions. [2019-11-16 00:01:57,842 INFO L78 Accepts]: Start accepts. Automaton has 4567 states and 10023 transitions. Word has length 95 [2019-11-16 00:01:57,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:57,842 INFO L462 AbstractCegarLoop]: Abstraction has 4567 states and 10023 transitions. [2019-11-16 00:01:57,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:01:57,842 INFO L276 IsEmpty]: Start isEmpty. Operand 4567 states and 10023 transitions. [2019-11-16 00:01:57,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-16 00:01:57,846 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:57,846 INFO L380 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] [2019-11-16 00:01:57,846 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:57,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:57,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1072928632, now seen corresponding path program 2 times [2019-11-16 00:01:57,847 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:57,847 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588021556] [2019-11-16 00:01:57,847 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:57,847 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:57,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:57,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:57,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:01:57,942 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588021556] [2019-11-16 00:01:57,942 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:01:57,942 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:01:57,942 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077219622] [2019-11-16 00:01:57,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:01:57,943 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:57,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:01:57,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:01:57,943 INFO L87 Difference]: Start difference. First operand 4567 states and 10023 transitions. Second operand 4 states. [2019-11-16 00:01:58,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:58,068 INFO L93 Difference]: Finished difference Result 5426 states and 11844 transitions. [2019-11-16 00:01:58,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:01:58,069 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-16 00:01:58,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:58,074 INFO L225 Difference]: With dead ends: 5426 [2019-11-16 00:01:58,074 INFO L226 Difference]: Without dead ends: 5426 [2019-11-16 00:01:58,075 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:01:58,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5426 states. [2019-11-16 00:01:58,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5426 to 4715. [2019-11-16 00:01:58,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4715 states. [2019-11-16 00:01:58,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4715 states to 4715 states and 10327 transitions. [2019-11-16 00:01:58,121 INFO L78 Accepts]: Start accepts. Automaton has 4715 states and 10327 transitions. Word has length 95 [2019-11-16 00:01:58,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:58,121 INFO L462 AbstractCegarLoop]: Abstraction has 4715 states and 10327 transitions. [2019-11-16 00:01:58,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:01:58,122 INFO L276 IsEmpty]: Start isEmpty. Operand 4715 states and 10327 transitions. [2019-11-16 00:01:58,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-16 00:01:58,125 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:58,125 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:01:58,125 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:58,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:58,125 INFO L82 PathProgramCache]: Analyzing trace with hash -96023015, now seen corresponding path program 1 times [2019-11-16 00:01:58,125 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:58,126 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151272656] [2019-11-16 00:01:58,126 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:58,126 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:58,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:58,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:01:58,211 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151272656] [2019-11-16 00:01:58,211 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:01:58,212 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:01:58,212 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113937951] [2019-11-16 00:01:58,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:01:58,212 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:58,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:01:58,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:01:58,213 INFO L87 Difference]: Start difference. First operand 4715 states and 10327 transitions. Second operand 6 states. [2019-11-16 00:01:58,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:58,438 INFO L93 Difference]: Finished difference Result 4815 states and 10551 transitions. [2019-11-16 00:01:58,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:01:58,439 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-11-16 00:01:58,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:58,442 INFO L225 Difference]: With dead ends: 4815 [2019-11-16 00:01:58,442 INFO L226 Difference]: Without dead ends: 4815 [2019-11-16 00:01:58,443 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:01:58,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4815 states. [2019-11-16 00:01:58,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4815 to 4602. [2019-11-16 00:01:58,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4602 states. [2019-11-16 00:01:58,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4602 states to 4602 states and 10104 transitions. [2019-11-16 00:01:58,481 INFO L78 Accepts]: Start accepts. Automaton has 4602 states and 10104 transitions. Word has length 97 [2019-11-16 00:01:58,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:58,481 INFO L462 AbstractCegarLoop]: Abstraction has 4602 states and 10104 transitions. [2019-11-16 00:01:58,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:01:58,481 INFO L276 IsEmpty]: Start isEmpty. Operand 4602 states and 10104 transitions. [2019-11-16 00:01:58,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-16 00:01:58,485 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:58,485 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:01:58,485 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:58,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:58,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1365627418, now seen corresponding path program 1 times [2019-11-16 00:01:58,485 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:58,486 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392007015] [2019-11-16 00:01:58,486 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:58,486 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:58,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:58,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:58,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:01:58,545 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392007015] [2019-11-16 00:01:58,545 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:01:58,545 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:01:58,546 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903425624] [2019-11-16 00:01:58,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:01:58,546 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:58,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:01:58,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:01:58,547 INFO L87 Difference]: Start difference. First operand 4602 states and 10104 transitions. Second operand 4 states. [2019-11-16 00:01:58,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:58,834 INFO L93 Difference]: Finished difference Result 5807 states and 12707 transitions. [2019-11-16 00:01:58,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:01:58,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-16 00:01:58,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:58,840 INFO L225 Difference]: With dead ends: 5807 [2019-11-16 00:01:58,841 INFO L226 Difference]: Without dead ends: 5767 [2019-11-16 00:01:58,841 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:01:58,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5767 states. [2019-11-16 00:01:58,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5767 to 5494. [2019-11-16 00:01:58,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5494 states. [2019-11-16 00:01:58,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5494 states to 5494 states and 12035 transitions. [2019-11-16 00:01:58,908 INFO L78 Accepts]: Start accepts. Automaton has 5494 states and 12035 transitions. Word has length 97 [2019-11-16 00:01:58,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:58,909 INFO L462 AbstractCegarLoop]: Abstraction has 5494 states and 12035 transitions. [2019-11-16 00:01:58,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:01:58,909 INFO L276 IsEmpty]: Start isEmpty. Operand 5494 states and 12035 transitions. [2019-11-16 00:01:58,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-16 00:01:58,914 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:58,915 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:01:58,915 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:58,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:58,915 INFO L82 PathProgramCache]: Analyzing trace with hash -711581925, now seen corresponding path program 1 times [2019-11-16 00:01:58,915 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:58,916 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041473032] [2019-11-16 00:01:58,916 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:58,916 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:58,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:58,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:59,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:01:59,079 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041473032] [2019-11-16 00:01:59,080 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:01:59,080 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-16 00:01:59,080 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677726892] [2019-11-16 00:01:59,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:01:59,080 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:59,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:01:59,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:01:59,081 INFO L87 Difference]: Start difference. First operand 5494 states and 12035 transitions. Second operand 9 states. [2019-11-16 00:01:59,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:59,598 INFO L93 Difference]: Finished difference Result 6169 states and 13359 transitions. [2019-11-16 00:01:59,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-16 00:01:59,598 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-11-16 00:01:59,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:59,603 INFO L225 Difference]: With dead ends: 6169 [2019-11-16 00:01:59,603 INFO L226 Difference]: Without dead ends: 6169 [2019-11-16 00:01:59,604 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-11-16 00:01:59,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6169 states. [2019-11-16 00:01:59,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6169 to 5161. [2019-11-16 00:01:59,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5161 states. [2019-11-16 00:01:59,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5161 states to 5161 states and 11249 transitions. [2019-11-16 00:01:59,652 INFO L78 Accepts]: Start accepts. Automaton has 5161 states and 11249 transitions. Word has length 97 [2019-11-16 00:01:59,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:59,652 INFO L462 AbstractCegarLoop]: Abstraction has 5161 states and 11249 transitions. [2019-11-16 00:01:59,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:01:59,652 INFO L276 IsEmpty]: Start isEmpty. Operand 5161 states and 11249 transitions. [2019-11-16 00:01:59,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-16 00:01:59,657 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:59,657 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:01:59,657 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:59,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:59,658 INFO L82 PathProgramCache]: Analyzing trace with hash -500231012, now seen corresponding path program 1 times [2019-11-16 00:01:59,658 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:59,658 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806994897] [2019-11-16 00:01:59,658 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:59,658 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:59,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:59,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:59,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:01:59,811 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806994897] [2019-11-16 00:01:59,811 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:01:59,811 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-16 00:01:59,811 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237956713] [2019-11-16 00:01:59,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:01:59,812 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:59,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:01:59,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:01:59,812 INFO L87 Difference]: Start difference. First operand 5161 states and 11249 transitions. Second operand 10 states. [2019-11-16 00:02:00,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:00,380 INFO L93 Difference]: Finished difference Result 16368 states and 36295 transitions. [2019-11-16 00:02:00,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-16 00:02:00,381 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-11-16 00:02:00,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:00,389 INFO L225 Difference]: With dead ends: 16368 [2019-11-16 00:02:00,389 INFO L226 Difference]: Without dead ends: 10730 [2019-11-16 00:02:00,389 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-11-16 00:02:00,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10730 states. [2019-11-16 00:02:00,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10730 to 5200. [2019-11-16 00:02:00,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5200 states. [2019-11-16 00:02:00,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5200 states to 5200 states and 11285 transitions. [2019-11-16 00:02:00,455 INFO L78 Accepts]: Start accepts. Automaton has 5200 states and 11285 transitions. Word has length 97 [2019-11-16 00:02:00,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:00,455 INFO L462 AbstractCegarLoop]: Abstraction has 5200 states and 11285 transitions. [2019-11-16 00:02:00,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:02:00,455 INFO L276 IsEmpty]: Start isEmpty. Operand 5200 states and 11285 transitions. [2019-11-16 00:02:00,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-16 00:02:00,459 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:00,459 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:02:00,460 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:02:00,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:00,460 INFO L82 PathProgramCache]: Analyzing trace with hash -307609594, now seen corresponding path program 2 times [2019-11-16 00:02:00,460 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:00,461 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599508293] [2019-11-16 00:02:00,461 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:00,461 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:00,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:00,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:02:00,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:02:00,546 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:02:00,546 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-16 00:02:00,713 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-16 00:02:00,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:02:00 BasicIcfg [2019-11-16 00:02:00,716 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:02:00,716 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:02:00,717 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:02:00,717 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:02:00,717 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:01:23" (3/4) ... [2019-11-16 00:02:00,725 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-16 00:02:00,889 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_7a536eae-7459-498b-b42f-afbd7e3d3ef9/bin/uautomizer/witness.graphml [2019-11-16 00:02:00,889 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:02:00,892 INFO L168 Benchmark]: Toolchain (without parser) took 38844.58 ms. Allocated memory was 1.0 GB in the beginning and 4.9 GB in the end (delta: 3.8 GB). Free memory was 944.7 MB in the beginning and 3.3 GB in the end (delta: -2.4 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-11-16 00:02:00,892 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:02:00,892 INFO L168 Benchmark]: CACSL2BoogieTranslator took 647.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 185.6 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -199.3 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:02:00,893 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.63 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:02:00,893 INFO L168 Benchmark]: Boogie Preprocessor took 38.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:02:00,893 INFO L168 Benchmark]: RCFGBuilder took 756.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.4 MB). Peak memory consumption was 52.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:02:00,893 INFO L168 Benchmark]: TraceAbstraction took 37176.95 ms. Allocated memory was 1.2 GB in the beginning and 4.9 GB in the end (delta: 3.7 GB). Free memory was 1.1 GB in the beginning and 3.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-11-16 00:02:00,894 INFO L168 Benchmark]: Witness Printer took 172.91 ms. Allocated memory is still 4.9 GB. Free memory was 3.4 GB in the beginning and 3.3 GB in the end (delta: 69.1 MB). Peak memory consumption was 69.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:02:00,895 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 647.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 185.6 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -199.3 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.63 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. * Boogie Preprocessor took 38.10 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 756.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.4 MB). Peak memory consumption was 52.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 37176.95 ms. Allocated memory was 1.2 GB in the beginning and 4.9 GB in the end (delta: 3.7 GB). Free memory was 1.1 GB in the beginning and 3.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 172.91 ms. Allocated memory is still 4.9 GB. Free memory was 3.4 GB in the beginning and 3.3 GB in the end (delta: 69.1 MB). Peak memory consumption was 69.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L698] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L700] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L701] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L702] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L704] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L706] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L708] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L709] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L710] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L711] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L712] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L713] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L714] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0] [L715] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L716] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L717] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0] [L718] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L719] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L720] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L721] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L722] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L723] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L724] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L803] 0 pthread_t t907; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L804] FCALL, FORK 0 pthread_create(&t907, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L805] 0 pthread_t t908; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L728] 1 z$w_buff1 = z$w_buff0 [L729] 1 z$w_buff0 = 1 [L730] 1 z$w_buff1_used = z$w_buff0_used [L731] 1 z$w_buff0_used = (_Bool)1 [L806] FCALL, FORK 0 pthread_create(&t908, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L733] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L734] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L735] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 1 [L759] 2 y = 1 [L762] 2 __unbuffered_p1_EAX = y [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 z$flush_delayed = weak$$choice2 [L768] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L745] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L745] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L770] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L772] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L773] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L775] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L777] EXPR 2 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 z = z$flush_delayed ? z$mem_tmp : z [L778] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L781] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L782] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L782] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L783] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L783] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L784] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L784] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L785] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L785] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L808] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L813] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L814] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L814] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L815] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L815] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L816] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L816] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L819] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 220 locations, 3 error locations. Result: UNSAFE, OverallTime: 37.0s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 13.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7474 SDtfs, 8640 SDslu, 16425 SDs, 0 SdLazy, 6242 SolverSat, 401 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 254 GetRequests, 70 SyntacticMatches, 18 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71013occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 17.7s AutomataMinimizationTime, 26 MinimizatonAttempts, 80380 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1861 NumberOfCodeBlocks, 1861 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1738 ConstructedInterpolants, 0 QuantifiedInterpolants, 319368 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...