./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix031_pso.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_babd6d1c-d9b9-455b-9dd4-aaf4c7d2d242/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_babd6d1c-d9b9-455b-9dd4-aaf4c7d2d242/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_babd6d1c-d9b9-455b-9dd4-aaf4c7d2d242/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_babd6d1c-d9b9-455b-9dd4-aaf4c7d2d242/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix031_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_babd6d1c-d9b9-455b-9dd4-aaf4c7d2d242/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_babd6d1c-d9b9-455b-9dd4-aaf4c7d2d242/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 5673c8fc999c6c2aa4e3139a5db49468705e6072 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-15 23:34:48,009 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:34:48,011 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:34:48,021 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:34:48,021 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:34:48,022 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:34:48,024 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:34:48,026 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:34:48,028 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:34:48,029 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:34:48,030 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:34:48,031 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:34:48,031 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:34:48,032 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:34:48,033 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:34:48,034 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:34:48,035 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:34:48,036 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:34:48,037 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:34:48,039 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:34:48,041 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:34:48,042 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:34:48,043 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:34:48,044 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:34:48,046 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:34:48,047 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:34:48,047 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:34:48,048 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:34:48,049 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:34:48,050 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:34:48,050 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:34:48,051 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:34:48,051 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:34:48,052 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:34:48,053 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:34:48,053 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:34:48,054 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:34:48,054 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:34:48,055 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:34:48,055 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:34:48,056 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:34:48,058 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_babd6d1c-d9b9-455b-9dd4-aaf4c7d2d242/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:34:48,071 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:34:48,071 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:34:48,073 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:34:48,073 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:34:48,074 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:34:48,074 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:34:48,074 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:34:48,074 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:34:48,075 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:34:48,075 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:34:48,076 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:34:48,076 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:34:48,076 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:34:48,077 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:34:48,077 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:34:48,077 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:34:48,077 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:34:48,078 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:34:48,078 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:34:48,078 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:34:48,078 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:34:48,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:34:48,079 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:34:48,079 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:34:48,080 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:34:48,080 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:34:48,080 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:34:48,080 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:34:48,081 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_babd6d1c-d9b9-455b-9dd4-aaf4c7d2d242/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 -> 5673c8fc999c6c2aa4e3139a5db49468705e6072 [2019-11-15 23:34:48,114 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:34:48,125 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:34:48,129 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:34:48,131 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:34:48,132 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:34:48,132 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_babd6d1c-d9b9-455b-9dd4-aaf4c7d2d242/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix031_pso.opt.i [2019-11-15 23:34:48,196 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_babd6d1c-d9b9-455b-9dd4-aaf4c7d2d242/bin/uautomizer/data/a5efef63f/d92374f1081d4d8f9798b809ccb30c72/FLAG5f620f0df [2019-11-15 23:34:48,619 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:34:48,620 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_babd6d1c-d9b9-455b-9dd4-aaf4c7d2d242/sv-benchmarks/c/pthread-wmm/mix031_pso.opt.i [2019-11-15 23:34:48,637 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_babd6d1c-d9b9-455b-9dd4-aaf4c7d2d242/bin/uautomizer/data/a5efef63f/d92374f1081d4d8f9798b809ccb30c72/FLAG5f620f0df [2019-11-15 23:34:48,910 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_babd6d1c-d9b9-455b-9dd4-aaf4c7d2d242/bin/uautomizer/data/a5efef63f/d92374f1081d4d8f9798b809ccb30c72 [2019-11-15 23:34:48,913 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:34:48,914 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:34:48,915 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:34:48,915 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:34:48,919 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:34:48,919 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:34:48" (1/1) ... [2019-11-15 23:34:48,922 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2adc5693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:34:48, skipping insertion in model container [2019-11-15 23:34:48,922 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:34:48" (1/1) ... [2019-11-15 23:34:48,929 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:34:48,986 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:34:49,479 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:34:49,491 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:34:49,560 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:34:49,625 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:34:49,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:34:49 WrapperNode [2019-11-15 23:34:49,626 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:34:49,627 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:34:49,627 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:34:49,627 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:34:49,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:34:49" (1/1) ... [2019-11-15 23:34:49,653 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:34:49" (1/1) ... [2019-11-15 23:34:49,681 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:34:49,681 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:34:49,681 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:34:49,682 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:34:49,689 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:34:49" (1/1) ... [2019-11-15 23:34:49,689 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:34:49" (1/1) ... [2019-11-15 23:34:49,693 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:34:49" (1/1) ... [2019-11-15 23:34:49,694 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:34:49" (1/1) ... [2019-11-15 23:34:49,705 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:34:49" (1/1) ... [2019-11-15 23:34:49,716 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:34:49" (1/1) ... [2019-11-15 23:34:49,720 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:34:49" (1/1) ... [2019-11-15 23:34:49,724 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:34:49,725 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:34:49,725 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:34:49,725 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:34:49,729 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:34:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_babd6d1c-d9b9-455b-9dd4-aaf4c7d2d242/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-15 23:34:49,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:34:49,804 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-15 23:34:49,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:34:49,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:34:49,805 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-15 23:34:49,806 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-15 23:34:49,806 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-15 23:34:49,806 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-15 23:34:49,806 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-15 23:34:49,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:34:49,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:34:49,809 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-15 23:34:50,480 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:34:50,481 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 23:34:50,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:34:50 BoogieIcfgContainer [2019-11-15 23:34:50,483 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:34:50,483 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:34:50,484 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:34:50,486 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:34:50,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:34:48" (1/3) ... [2019-11-15 23:34:50,487 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c94d287 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:34:50, skipping insertion in model container [2019-11-15 23:34:50,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:34:49" (2/3) ... [2019-11-15 23:34:50,488 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c94d287 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:34:50, skipping insertion in model container [2019-11-15 23:34:50,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:34:50" (3/3) ... [2019-11-15 23:34:50,497 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_pso.opt.i [2019-11-15 23:34:50,536 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,537 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,537 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,537 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,537 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,537 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,537 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,537 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,538 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,538 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,538 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,539 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,539 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,539 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,539 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,539 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,539 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,540 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,540 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,540 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,540 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,540 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,541 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,541 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,541 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,541 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,541 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,541 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,542 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,542 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,542 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,542 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,542 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,542 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,543 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,543 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,543 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,543 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,543 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,543 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,544 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,544 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,544 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,544 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,544 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,544 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,548 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,549 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,549 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,549 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,549 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,550 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,551 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,551 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,551 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,551 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,552 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,552 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,552 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,552 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,552 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,552 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,553 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,553 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,553 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,553 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,553 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,553 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,554 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,554 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,554 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,554 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,554 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,555 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,555 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,555 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,555 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,555 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,555 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,556 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,556 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,556 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,556 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,556 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,557 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,557 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,557 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,557 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,557 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,558 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,558 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,558 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,558 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,558 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,559 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,559 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,559 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,559 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,559 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,560 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,565 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,567 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,568 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,568 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,568 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,568 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,569 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,569 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,570 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,571 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,571 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,571 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,572 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,572 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,573 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,573 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,573 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,574 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,574 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,574 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,574 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,575 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,575 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,575 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,576 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,576 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,576 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,576 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:50,584 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-15 23:34:50,584 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:34:50,597 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-15 23:34:50,607 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-15 23:34:50,623 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:34:50,623 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:34:50,623 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:34:50,623 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:34:50,623 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:34:50,623 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:34:50,623 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:34:50,623 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:34:50,634 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 132 places, 164 transitions [2019-11-15 23:34:52,586 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25978 states. [2019-11-15 23:34:52,588 INFO L276 IsEmpty]: Start isEmpty. Operand 25978 states. [2019-11-15 23:34:52,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-15 23:34:52,602 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:34:52,603 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] [2019-11-15 23:34:52,606 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:34:52,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:34:52,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1332151771, now seen corresponding path program 1 times [2019-11-15 23:34:52,619 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:34:52,620 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863235731] [2019-11-15 23:34:52,620 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:52,621 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:52,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:34:52,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:34:52,970 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-15 23:34:52,971 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863235731] [2019-11-15 23:34:52,972 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:34:52,972 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:34:52,973 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337487225] [2019-11-15 23:34:52,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:34:52,977 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:34:52,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:34:52,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:34:52,993 INFO L87 Difference]: Start difference. First operand 25978 states. Second operand 4 states. [2019-11-15 23:34:53,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:34:53,533 INFO L93 Difference]: Finished difference Result 26618 states and 102123 transitions. [2019-11-15 23:34:53,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:34:53,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-11-15 23:34:53,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:34:53,749 INFO L225 Difference]: With dead ends: 26618 [2019-11-15 23:34:53,749 INFO L226 Difference]: Without dead ends: 20362 [2019-11-15 23:34:53,751 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-15 23:34:54,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20362 states. [2019-11-15 23:34:54,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20362 to 20362. [2019-11-15 23:34:54,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20362 states. [2019-11-15 23:34:54,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20362 states to 20362 states and 78427 transitions. [2019-11-15 23:34:54,902 INFO L78 Accepts]: Start accepts. Automaton has 20362 states and 78427 transitions. Word has length 41 [2019-11-15 23:34:54,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:34:54,904 INFO L462 AbstractCegarLoop]: Abstraction has 20362 states and 78427 transitions. [2019-11-15 23:34:54,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:34:54,904 INFO L276 IsEmpty]: Start isEmpty. Operand 20362 states and 78427 transitions. [2019-11-15 23:34:54,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 23:34:54,916 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:34:54,916 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] [2019-11-15 23:34:54,916 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:34:54,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:34:54,916 INFO L82 PathProgramCache]: Analyzing trace with hash 2021761746, now seen corresponding path program 1 times [2019-11-15 23:34:54,917 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:34:54,917 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775993928] [2019-11-15 23:34:54,917 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:54,917 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:54,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:34:54,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:34:55,031 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-15 23:34:55,032 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775993928] [2019-11-15 23:34:55,033 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:34:55,033 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:34:55,033 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280936734] [2019-11-15 23:34:55,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:34:55,036 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:34:55,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:34:55,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:34:55,037 INFO L87 Difference]: Start difference. First operand 20362 states and 78427 transitions. Second operand 5 states. [2019-11-15 23:34:55,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:34:55,740 INFO L93 Difference]: Finished difference Result 31840 states and 116044 transitions. [2019-11-15 23:34:55,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:34:55,741 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-11-15 23:34:55,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:34:55,884 INFO L225 Difference]: With dead ends: 31840 [2019-11-15 23:34:55,884 INFO L226 Difference]: Without dead ends: 31288 [2019-11-15 23:34:55,885 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-15 23:34:56,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31288 states. [2019-11-15 23:34:56,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31288 to 29707. [2019-11-15 23:34:56,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29707 states. [2019-11-15 23:34:57,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29707 states to 29707 states and 109521 transitions. [2019-11-15 23:34:57,087 INFO L78 Accepts]: Start accepts. Automaton has 29707 states and 109521 transitions. Word has length 49 [2019-11-15 23:34:57,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:34:57,088 INFO L462 AbstractCegarLoop]: Abstraction has 29707 states and 109521 transitions. [2019-11-15 23:34:57,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:34:57,089 INFO L276 IsEmpty]: Start isEmpty. Operand 29707 states and 109521 transitions. [2019-11-15 23:34:57,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-15 23:34:57,094 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:34:57,094 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-15 23:34:57,094 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:34:57,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:34:57,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1608863874, now seen corresponding path program 1 times [2019-11-15 23:34:57,095 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:34:57,095 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78813482] [2019-11-15 23:34:57,096 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:57,096 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:57,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:34:57,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:34:57,167 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-15 23:34:57,167 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78813482] [2019-11-15 23:34:57,168 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:34:57,168 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:34:57,168 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483941423] [2019-11-15 23:34:57,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:34:57,169 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:34:57,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:34:57,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:34:57,169 INFO L87 Difference]: Start difference. First operand 29707 states and 109521 transitions. Second operand 5 states. [2019-11-15 23:34:58,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:34:58,102 INFO L93 Difference]: Finished difference Result 38698 states and 139693 transitions. [2019-11-15 23:34:58,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:34:58,103 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-11-15 23:34:58,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:34:58,195 INFO L225 Difference]: With dead ends: 38698 [2019-11-15 23:34:58,195 INFO L226 Difference]: Without dead ends: 38250 [2019-11-15 23:34:58,195 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-15 23:34:58,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38250 states. [2019-11-15 23:34:59,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38250 to 32953. [2019-11-15 23:34:59,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32953 states. [2019-11-15 23:34:59,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32953 states to 32953 states and 120530 transitions. [2019-11-15 23:34:59,679 INFO L78 Accepts]: Start accepts. Automaton has 32953 states and 120530 transitions. Word has length 50 [2019-11-15 23:34:59,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:34:59,679 INFO L462 AbstractCegarLoop]: Abstraction has 32953 states and 120530 transitions. [2019-11-15 23:34:59,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:34:59,680 INFO L276 IsEmpty]: Start isEmpty. Operand 32953 states and 120530 transitions. [2019-11-15 23:34:59,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 23:34:59,687 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:34:59,687 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] [2019-11-15 23:34:59,687 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:34:59,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:34:59,689 INFO L82 PathProgramCache]: Analyzing trace with hash -321514024, now seen corresponding path program 1 times [2019-11-15 23:34:59,689 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:34:59,689 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104543027] [2019-11-15 23:34:59,689 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:59,690 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:59,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:34:59,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:34:59,732 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-15 23:34:59,732 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104543027] [2019-11-15 23:34:59,732 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:34:59,732 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:34:59,733 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672098141] [2019-11-15 23:34:59,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:34:59,733 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:34:59,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:34:59,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:34:59,734 INFO L87 Difference]: Start difference. First operand 32953 states and 120530 transitions. Second operand 3 states. [2019-11-15 23:34:59,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:34:59,928 INFO L93 Difference]: Finished difference Result 42414 states and 152021 transitions. [2019-11-15 23:34:59,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:34:59,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-15 23:34:59,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:35:00,026 INFO L225 Difference]: With dead ends: 42414 [2019-11-15 23:35:00,026 INFO L226 Difference]: Without dead ends: 42414 [2019-11-15 23:35:00,027 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-15 23:35:00,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42414 states. [2019-11-15 23:35:00,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42414 to 37667. [2019-11-15 23:35:00,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37667 states. [2019-11-15 23:35:00,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37667 states to 37667 states and 136334 transitions. [2019-11-15 23:35:00,801 INFO L78 Accepts]: Start accepts. Automaton has 37667 states and 136334 transitions. Word has length 52 [2019-11-15 23:35:00,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:35:00,801 INFO L462 AbstractCegarLoop]: Abstraction has 37667 states and 136334 transitions. [2019-11-15 23:35:00,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:35:00,801 INFO L276 IsEmpty]: Start isEmpty. Operand 37667 states and 136334 transitions. [2019-11-15 23:35:00,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 23:35:00,812 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:35:00,812 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] [2019-11-15 23:35:00,813 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:35:00,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:35:00,813 INFO L82 PathProgramCache]: Analyzing trace with hash 720601645, now seen corresponding path program 1 times [2019-11-15 23:35:00,813 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:35:00,814 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777958497] [2019-11-15 23:35:00,814 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:00,814 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:00,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:35:00,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:35:00,892 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-15 23:35:00,893 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777958497] [2019-11-15 23:35:00,893 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:35:00,893 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:35:00,893 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617630388] [2019-11-15 23:35:00,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:35:00,893 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:35:00,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:35:00,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:35:00,894 INFO L87 Difference]: Start difference. First operand 37667 states and 136334 transitions. Second operand 6 states. [2019-11-15 23:35:02,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:35:02,258 INFO L93 Difference]: Finished difference Result 48758 states and 172983 transitions. [2019-11-15 23:35:02,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 23:35:02,258 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-11-15 23:35:02,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:35:02,375 INFO L225 Difference]: With dead ends: 48758 [2019-11-15 23:35:02,375 INFO L226 Difference]: Without dead ends: 48238 [2019-11-15 23:35:02,375 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:35:02,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48238 states. [2019-11-15 23:35:03,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48238 to 38231. [2019-11-15 23:35:03,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38231 states. [2019-11-15 23:35:03,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38231 states to 38231 states and 138497 transitions. [2019-11-15 23:35:03,231 INFO L78 Accepts]: Start accepts. Automaton has 38231 states and 138497 transitions. Word has length 56 [2019-11-15 23:35:03,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:35:03,231 INFO L462 AbstractCegarLoop]: Abstraction has 38231 states and 138497 transitions. [2019-11-15 23:35:03,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:35:03,231 INFO L276 IsEmpty]: Start isEmpty. Operand 38231 states and 138497 transitions. [2019-11-15 23:35:03,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 23:35:03,243 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:35:03,243 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] [2019-11-15 23:35:03,244 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:35:03,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:35:03,244 INFO L82 PathProgramCache]: Analyzing trace with hash 347104516, now seen corresponding path program 1 times [2019-11-15 23:35:03,244 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:35:03,244 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554715712] [2019-11-15 23:35:03,244 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:03,244 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:03,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:35:03,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:35:03,362 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-15 23:35:03,363 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554715712] [2019-11-15 23:35:03,363 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:35:03,363 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:35:03,363 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433634044] [2019-11-15 23:35:03,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:35:03,364 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:35:03,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:35:03,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:35:03,365 INFO L87 Difference]: Start difference. First operand 38231 states and 138497 transitions. Second operand 6 states. [2019-11-15 23:35:04,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:35:04,133 INFO L93 Difference]: Finished difference Result 53007 states and 189573 transitions. [2019-11-15 23:35:04,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:35:04,134 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-11-15 23:35:04,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:35:04,864 INFO L225 Difference]: With dead ends: 53007 [2019-11-15 23:35:04,864 INFO L226 Difference]: Without dead ends: 52031 [2019-11-15 23:35:04,864 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-15 23:35:05,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52031 states. [2019-11-15 23:35:05,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52031 to 48784. [2019-11-15 23:35:05,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48784 states. [2019-11-15 23:35:05,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48784 states to 48784 states and 175228 transitions. [2019-11-15 23:35:05,663 INFO L78 Accepts]: Start accepts. Automaton has 48784 states and 175228 transitions. Word has length 56 [2019-11-15 23:35:05,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:35:05,664 INFO L462 AbstractCegarLoop]: Abstraction has 48784 states and 175228 transitions. [2019-11-15 23:35:05,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:35:05,664 INFO L276 IsEmpty]: Start isEmpty. Operand 48784 states and 175228 transitions. [2019-11-15 23:35:05,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 23:35:05,676 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:35:05,676 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] [2019-11-15 23:35:05,676 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:35:05,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:35:05,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1449846843, now seen corresponding path program 1 times [2019-11-15 23:35:05,677 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:35:05,677 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384915978] [2019-11-15 23:35:05,677 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:05,677 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:05,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:35:05,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:35:05,792 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-15 23:35:05,793 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384915978] [2019-11-15 23:35:05,793 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:35:05,794 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:35:05,794 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691617755] [2019-11-15 23:35:05,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:35:05,794 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:35:05,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:35:05,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:35:05,795 INFO L87 Difference]: Start difference. First operand 48784 states and 175228 transitions. Second operand 7 states. [2019-11-15 23:35:06,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:35:06,778 INFO L93 Difference]: Finished difference Result 70899 states and 244525 transitions. [2019-11-15 23:35:06,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:35:06,778 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-11-15 23:35:06,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:35:06,907 INFO L225 Difference]: With dead ends: 70899 [2019-11-15 23:35:06,907 INFO L226 Difference]: Without dead ends: 70899 [2019-11-15 23:35:06,907 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-15 23:35:07,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70899 states. [2019-11-15 23:35:08,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70899 to 57892. [2019-11-15 23:35:08,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57892 states. [2019-11-15 23:35:08,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57892 states to 57892 states and 203152 transitions. [2019-11-15 23:35:08,375 INFO L78 Accepts]: Start accepts. Automaton has 57892 states and 203152 transitions. Word has length 56 [2019-11-15 23:35:08,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:35:08,375 INFO L462 AbstractCegarLoop]: Abstraction has 57892 states and 203152 transitions. [2019-11-15 23:35:08,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:35:08,376 INFO L276 IsEmpty]: Start isEmpty. Operand 57892 states and 203152 transitions. [2019-11-15 23:35:08,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 23:35:08,389 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:35:08,389 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] [2019-11-15 23:35:08,389 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:35:08,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:35:08,389 INFO L82 PathProgramCache]: Analyzing trace with hash -562343162, now seen corresponding path program 1 times [2019-11-15 23:35:08,389 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:35:08,390 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163680591] [2019-11-15 23:35:08,390 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:08,390 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:08,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:35:08,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:35:08,464 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-15 23:35:08,464 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163680591] [2019-11-15 23:35:08,464 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:35:08,464 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:35:08,464 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074088483] [2019-11-15 23:35:08,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:35:08,465 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:35:08,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:35:08,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:35:08,465 INFO L87 Difference]: Start difference. First operand 57892 states and 203152 transitions. Second operand 4 states. [2019-11-15 23:35:08,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:35:08,533 INFO L93 Difference]: Finished difference Result 10862 states and 33397 transitions. [2019-11-15 23:35:08,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:35:08,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-11-15 23:35:08,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:35:08,550 INFO L225 Difference]: With dead ends: 10862 [2019-11-15 23:35:08,550 INFO L226 Difference]: Without dead ends: 9363 [2019-11-15 23:35:08,550 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-15 23:35:08,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9363 states. [2019-11-15 23:35:08,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9363 to 9315. [2019-11-15 23:35:08,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9315 states. [2019-11-15 23:35:08,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9315 states to 9315 states and 28347 transitions. [2019-11-15 23:35:08,703 INFO L78 Accepts]: Start accepts. Automaton has 9315 states and 28347 transitions. Word has length 56 [2019-11-15 23:35:08,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:35:08,704 INFO L462 AbstractCegarLoop]: Abstraction has 9315 states and 28347 transitions. [2019-11-15 23:35:08,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:35:08,704 INFO L276 IsEmpty]: Start isEmpty. Operand 9315 states and 28347 transitions. [2019-11-15 23:35:08,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 23:35:08,710 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:35:08,710 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] [2019-11-15 23:35:08,711 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:35:08,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:35:08,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1198712563, now seen corresponding path program 1 times [2019-11-15 23:35:08,711 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:35:08,712 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182580054] [2019-11-15 23:35:08,712 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:08,712 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:08,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:35:08,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:35:08,811 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-15 23:35:08,811 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182580054] [2019-11-15 23:35:08,811 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:35:08,812 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:35:08,812 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762380474] [2019-11-15 23:35:08,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:35:08,812 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:35:08,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:35:08,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:35:08,813 INFO L87 Difference]: Start difference. First operand 9315 states and 28347 transitions. Second operand 6 states. [2019-11-15 23:35:09,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:35:09,268 INFO L93 Difference]: Finished difference Result 12169 states and 36413 transitions. [2019-11-15 23:35:09,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 23:35:09,269 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-11-15 23:35:09,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:35:09,289 INFO L225 Difference]: With dead ends: 12169 [2019-11-15 23:35:09,289 INFO L226 Difference]: Without dead ends: 12121 [2019-11-15 23:35:09,290 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:35:09,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12121 states. [2019-11-15 23:35:09,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12121 to 10054. [2019-11-15 23:35:09,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10054 states. [2019-11-15 23:35:09,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10054 states to 10054 states and 30403 transitions. [2019-11-15 23:35:09,474 INFO L78 Accepts]: Start accepts. Automaton has 10054 states and 30403 transitions. Word has length 66 [2019-11-15 23:35:09,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:35:09,474 INFO L462 AbstractCegarLoop]: Abstraction has 10054 states and 30403 transitions. [2019-11-15 23:35:09,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:35:09,474 INFO L276 IsEmpty]: Start isEmpty. Operand 10054 states and 30403 transitions. [2019-11-15 23:35:09,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 23:35:09,482 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:35:09,482 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-15 23:35:09,483 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:35:09,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:35:09,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1184079748, now seen corresponding path program 1 times [2019-11-15 23:35:09,483 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:35:09,484 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351745093] [2019-11-15 23:35:09,484 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:09,484 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:09,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:35:09,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:35:09,539 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-15 23:35:09,539 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351745093] [2019-11-15 23:35:09,539 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:35:09,540 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:35:09,540 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951393930] [2019-11-15 23:35:09,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:35:09,540 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:35:09,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:35:09,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:35:09,541 INFO L87 Difference]: Start difference. First operand 10054 states and 30403 transitions. Second operand 4 states. [2019-11-15 23:35:09,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:35:09,780 INFO L93 Difference]: Finished difference Result 12503 states and 37312 transitions. [2019-11-15 23:35:09,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:35:09,780 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-11-15 23:35:09,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:35:09,795 INFO L225 Difference]: With dead ends: 12503 [2019-11-15 23:35:09,797 INFO L226 Difference]: Without dead ends: 12503 [2019-11-15 23:35:09,802 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-15 23:35:09,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12503 states. [2019-11-15 23:35:09,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12503 to 11357. [2019-11-15 23:35:09,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11357 states. [2019-11-15 23:35:09,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11357 states to 11357 states and 34001 transitions. [2019-11-15 23:35:09,939 INFO L78 Accepts]: Start accepts. Automaton has 11357 states and 34001 transitions. Word has length 68 [2019-11-15 23:35:09,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:35:09,939 INFO L462 AbstractCegarLoop]: Abstraction has 11357 states and 34001 transitions. [2019-11-15 23:35:09,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:35:09,939 INFO L276 IsEmpty]: Start isEmpty. Operand 11357 states and 34001 transitions. [2019-11-15 23:35:09,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 23:35:09,946 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:35:09,946 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-15 23:35:09,946 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:35:09,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:35:09,947 INFO L82 PathProgramCache]: Analyzing trace with hash -893129595, now seen corresponding path program 1 times [2019-11-15 23:35:09,947 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:35:09,947 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996100459] [2019-11-15 23:35:09,947 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:09,948 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:09,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:35:09,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:35:10,005 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-15 23:35:10,006 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996100459] [2019-11-15 23:35:10,006 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:35:10,006 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:35:10,006 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202564937] [2019-11-15 23:35:10,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:35:10,007 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:35:10,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:35:10,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:35:10,007 INFO L87 Difference]: Start difference. First operand 11357 states and 34001 transitions. Second operand 3 states. [2019-11-15 23:35:10,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:35:10,181 INFO L93 Difference]: Finished difference Result 11826 states and 35256 transitions. [2019-11-15 23:35:10,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:35:10,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-11-15 23:35:10,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:35:10,194 INFO L225 Difference]: With dead ends: 11826 [2019-11-15 23:35:10,195 INFO L226 Difference]: Without dead ends: 11826 [2019-11-15 23:35:10,195 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-15 23:35:10,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11826 states. [2019-11-15 23:35:10,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11826 to 11607. [2019-11-15 23:35:10,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11607 states. [2019-11-15 23:35:10,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11607 states to 11607 states and 34665 transitions. [2019-11-15 23:35:10,329 INFO L78 Accepts]: Start accepts. Automaton has 11607 states and 34665 transitions. Word has length 68 [2019-11-15 23:35:10,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:35:10,329 INFO L462 AbstractCegarLoop]: Abstraction has 11607 states and 34665 transitions. [2019-11-15 23:35:10,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:35:10,330 INFO L276 IsEmpty]: Start isEmpty. Operand 11607 states and 34665 transitions. [2019-11-15 23:35:10,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-15 23:35:10,339 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:35:10,339 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] [2019-11-15 23:35:10,339 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:35:10,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:35:10,339 INFO L82 PathProgramCache]: Analyzing trace with hash -786414864, now seen corresponding path program 1 times [2019-11-15 23:35:10,339 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:35:10,339 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534216954] [2019-11-15 23:35:10,339 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:10,339 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:10,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:35:10,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:35:10,443 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-15 23:35:10,444 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534216954] [2019-11-15 23:35:10,444 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:35:10,444 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:35:10,444 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856964103] [2019-11-15 23:35:10,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:35:10,444 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:35:10,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:35:10,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:35:10,445 INFO L87 Difference]: Start difference. First operand 11607 states and 34665 transitions. Second operand 6 states. [2019-11-15 23:35:10,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:35:10,968 INFO L93 Difference]: Finished difference Result 12859 states and 37854 transitions. [2019-11-15 23:35:10,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:35:10,968 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-11-15 23:35:10,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:35:10,984 INFO L225 Difference]: With dead ends: 12859 [2019-11-15 23:35:10,984 INFO L226 Difference]: Without dead ends: 12859 [2019-11-15 23:35:10,985 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-15 23:35:11,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12859 states. [2019-11-15 23:35:11,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12859 to 12392. [2019-11-15 23:35:11,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12392 states. [2019-11-15 23:35:11,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12392 states to 12392 states and 36620 transitions. [2019-11-15 23:35:11,157 INFO L78 Accepts]: Start accepts. Automaton has 12392 states and 36620 transitions. Word has length 70 [2019-11-15 23:35:11,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:35:11,157 INFO L462 AbstractCegarLoop]: Abstraction has 12392 states and 36620 transitions. [2019-11-15 23:35:11,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:35:11,158 INFO L276 IsEmpty]: Start isEmpty. Operand 12392 states and 36620 transitions. [2019-11-15 23:35:11,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-15 23:35:11,172 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:35:11,172 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] [2019-11-15 23:35:11,173 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:35:11,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:35:11,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1431343089, now seen corresponding path program 1 times [2019-11-15 23:35:11,173 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:35:11,174 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017768446] [2019-11-15 23:35:11,174 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:11,174 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:11,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:35:11,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:35:11,294 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-15 23:35:11,294 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017768446] [2019-11-15 23:35:11,294 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:35:11,294 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:35:11,295 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587003206] [2019-11-15 23:35:11,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:35:11,295 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:35:11,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:35:11,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:35:11,296 INFO L87 Difference]: Start difference. First operand 12392 states and 36620 transitions. Second operand 6 states. [2019-11-15 23:35:11,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:35:11,631 INFO L93 Difference]: Finished difference Result 14551 states and 41773 transitions. [2019-11-15 23:35:11,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:35:11,631 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-11-15 23:35:11,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:35:11,650 INFO L225 Difference]: With dead ends: 14551 [2019-11-15 23:35:11,650 INFO L226 Difference]: Without dead ends: 14551 [2019-11-15 23:35:11,650 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-15 23:35:11,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14551 states. [2019-11-15 23:35:11,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14551 to 13003. [2019-11-15 23:35:11,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13003 states. [2019-11-15 23:35:11,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13003 states to 13003 states and 37704 transitions. [2019-11-15 23:35:11,825 INFO L78 Accepts]: Start accepts. Automaton has 13003 states and 37704 transitions. Word has length 70 [2019-11-15 23:35:11,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:35:11,826 INFO L462 AbstractCegarLoop]: Abstraction has 13003 states and 37704 transitions. [2019-11-15 23:35:11,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:35:11,826 INFO L276 IsEmpty]: Start isEmpty. Operand 13003 states and 37704 transitions. [2019-11-15 23:35:11,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-15 23:35:11,837 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:35:11,837 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] [2019-11-15 23:35:11,837 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:35:11,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:35:11,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1642694002, now seen corresponding path program 1 times [2019-11-15 23:35:11,838 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:35:11,838 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904676096] [2019-11-15 23:35:11,838 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:11,838 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:11,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:35:11,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:35:11,901 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-15 23:35:11,901 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904676096] [2019-11-15 23:35:11,901 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:35:11,901 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:35:11,902 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344682528] [2019-11-15 23:35:11,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:35:11,902 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:35:11,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:35:11,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:35:11,902 INFO L87 Difference]: Start difference. First operand 13003 states and 37704 transitions. Second operand 5 states. [2019-11-15 23:35:12,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:35:12,286 INFO L93 Difference]: Finished difference Result 17566 states and 50786 transitions. [2019-11-15 23:35:12,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:35:12,286 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-11-15 23:35:12,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:35:12,310 INFO L225 Difference]: With dead ends: 17566 [2019-11-15 23:35:12,310 INFO L226 Difference]: Without dead ends: 17566 [2019-11-15 23:35:12,310 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:35:12,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17566 states. [2019-11-15 23:35:12,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17566 to 13782. [2019-11-15 23:35:12,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13782 states. [2019-11-15 23:35:12,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13782 states to 13782 states and 39962 transitions. [2019-11-15 23:35:12,519 INFO L78 Accepts]: Start accepts. Automaton has 13782 states and 39962 transitions. Word has length 70 [2019-11-15 23:35:12,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:35:12,519 INFO L462 AbstractCegarLoop]: Abstraction has 13782 states and 39962 transitions. [2019-11-15 23:35:12,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:35:12,519 INFO L276 IsEmpty]: Start isEmpty. Operand 13782 states and 39962 transitions. [2019-11-15 23:35:12,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-15 23:35:12,529 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:35:12,529 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] [2019-11-15 23:35:12,530 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:35:12,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:35:12,530 INFO L82 PathProgramCache]: Analyzing trace with hash -164760461, now seen corresponding path program 1 times [2019-11-15 23:35:12,530 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:35:12,531 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109340002] [2019-11-15 23:35:12,531 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:12,531 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:12,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:35:12,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:35:12,589 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-15 23:35:12,589 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109340002] [2019-11-15 23:35:12,589 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:35:12,590 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:35:12,590 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524881411] [2019-11-15 23:35:12,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:35:12,590 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:35:12,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:35:12,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:35:12,591 INFO L87 Difference]: Start difference. First operand 13782 states and 39962 transitions. Second operand 4 states. [2019-11-15 23:35:13,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:35:13,058 INFO L93 Difference]: Finished difference Result 19773 states and 57600 transitions. [2019-11-15 23:35:13,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:35:13,058 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-11-15 23:35:13,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:35:13,082 INFO L225 Difference]: With dead ends: 19773 [2019-11-15 23:35:13,082 INFO L226 Difference]: Without dead ends: 19497 [2019-11-15 23:35:13,082 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-15 23:35:13,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19497 states. [2019-11-15 23:35:13,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19497 to 17877. [2019-11-15 23:35:13,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17877 states. [2019-11-15 23:35:13,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17877 states to 17877 states and 52151 transitions. [2019-11-15 23:35:13,307 INFO L78 Accepts]: Start accepts. Automaton has 17877 states and 52151 transitions. Word has length 70 [2019-11-15 23:35:13,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:35:13,307 INFO L462 AbstractCegarLoop]: Abstraction has 17877 states and 52151 transitions. [2019-11-15 23:35:13,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:35:13,307 INFO L276 IsEmpty]: Start isEmpty. Operand 17877 states and 52151 transitions. [2019-11-15 23:35:13,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-15 23:35:13,316 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:35:13,316 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] [2019-11-15 23:35:13,316 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:35:13,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:35:13,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1961711820, now seen corresponding path program 1 times [2019-11-15 23:35:13,317 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:35:13,317 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359652665] [2019-11-15 23:35:13,317 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:13,317 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:13,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:35:13,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:35:13,475 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-15 23:35:13,477 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359652665] [2019-11-15 23:35:13,478 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:35:13,478 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:35:13,478 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770180479] [2019-11-15 23:35:13,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:35:13,478 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:35:13,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:35:13,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:35:13,479 INFO L87 Difference]: Start difference. First operand 17877 states and 52151 transitions. Second operand 7 states. [2019-11-15 23:35:13,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:35:13,854 INFO L93 Difference]: Finished difference Result 15643 states and 43105 transitions. [2019-11-15 23:35:13,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:35:13,854 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2019-11-15 23:35:13,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:35:13,873 INFO L225 Difference]: With dead ends: 15643 [2019-11-15 23:35:13,873 INFO L226 Difference]: Without dead ends: 15643 [2019-11-15 23:35:13,873 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:35:13,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15643 states. [2019-11-15 23:35:14,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15643 to 12478. [2019-11-15 23:35:14,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12478 states. [2019-11-15 23:35:14,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12478 states to 12478 states and 34355 transitions. [2019-11-15 23:35:14,033 INFO L78 Accepts]: Start accepts. Automaton has 12478 states and 34355 transitions. Word has length 70 [2019-11-15 23:35:14,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:35:14,034 INFO L462 AbstractCegarLoop]: Abstraction has 12478 states and 34355 transitions. [2019-11-15 23:35:14,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:35:14,034 INFO L276 IsEmpty]: Start isEmpty. Operand 12478 states and 34355 transitions. [2019-11-15 23:35:14,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-15 23:35:14,043 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:35:14,043 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] [2019-11-15 23:35:14,043 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:35:14,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:35:14,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1074208139, now seen corresponding path program 1 times [2019-11-15 23:35:14,044 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:35:14,044 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910966196] [2019-11-15 23:35:14,044 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:14,044 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:14,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:35:14,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:35:14,135 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-15 23:35:14,135 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910966196] [2019-11-15 23:35:14,135 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:35:14,136 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:35:14,136 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166054766] [2019-11-15 23:35:14,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:35:14,136 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:35:14,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:35:14,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:35:14,137 INFO L87 Difference]: Start difference. First operand 12478 states and 34355 transitions. Second operand 5 states. [2019-11-15 23:35:14,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:35:14,187 INFO L93 Difference]: Finished difference Result 4027 states and 9374 transitions. [2019-11-15 23:35:14,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:35:14,188 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-11-15 23:35:14,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:35:14,192 INFO L225 Difference]: With dead ends: 4027 [2019-11-15 23:35:14,192 INFO L226 Difference]: Without dead ends: 3354 [2019-11-15 23:35:14,193 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-15 23:35:14,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3354 states. [2019-11-15 23:35:14,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3354 to 3094. [2019-11-15 23:35:14,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3094 states. [2019-11-15 23:35:14,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3094 states to 3094 states and 7080 transitions. [2019-11-15 23:35:14,226 INFO L78 Accepts]: Start accepts. Automaton has 3094 states and 7080 transitions. Word has length 70 [2019-11-15 23:35:14,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:35:14,226 INFO L462 AbstractCegarLoop]: Abstraction has 3094 states and 7080 transitions. [2019-11-15 23:35:14,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:35:14,226 INFO L276 IsEmpty]: Start isEmpty. Operand 3094 states and 7080 transitions. [2019-11-15 23:35:14,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 23:35:14,230 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:35:14,230 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] [2019-11-15 23:35:14,230 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:35:14,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:35:14,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1028818369, now seen corresponding path program 1 times [2019-11-15 23:35:14,231 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:35:14,231 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923373583] [2019-11-15 23:35:14,231 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:14,231 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:14,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:35:14,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:35:14,373 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-15 23:35:14,374 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923373583] [2019-11-15 23:35:14,374 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:35:14,374 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:35:14,374 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727259766] [2019-11-15 23:35:14,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:35:14,375 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:35:14,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:35:14,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:35:14,375 INFO L87 Difference]: Start difference. First operand 3094 states and 7080 transitions. Second operand 7 states. [2019-11-15 23:35:14,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:35:14,975 INFO L93 Difference]: Finished difference Result 3733 states and 8441 transitions. [2019-11-15 23:35:14,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 23:35:14,976 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 87 [2019-11-15 23:35:14,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:35:14,980 INFO L225 Difference]: With dead ends: 3733 [2019-11-15 23:35:14,980 INFO L226 Difference]: Without dead ends: 3702 [2019-11-15 23:35:14,981 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-11-15 23:35:14,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3702 states. [2019-11-15 23:35:15,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3702 to 3248. [2019-11-15 23:35:15,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3248 states. [2019-11-15 23:35:15,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3248 states to 3248 states and 7403 transitions. [2019-11-15 23:35:15,027 INFO L78 Accepts]: Start accepts. Automaton has 3248 states and 7403 transitions. Word has length 87 [2019-11-15 23:35:15,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:35:15,027 INFO L462 AbstractCegarLoop]: Abstraction has 3248 states and 7403 transitions. [2019-11-15 23:35:15,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:35:15,027 INFO L276 IsEmpty]: Start isEmpty. Operand 3248 states and 7403 transitions. [2019-11-15 23:35:15,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 23:35:15,031 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:35:15,031 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] [2019-11-15 23:35:15,032 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:35:15,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:35:15,032 INFO L82 PathProgramCache]: Analyzing trace with hash 774081824, now seen corresponding path program 1 times [2019-11-15 23:35:15,032 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:35:15,032 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361707871] [2019-11-15 23:35:15,032 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:15,033 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:15,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:35:15,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:35:15,235 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-15 23:35:15,235 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361707871] [2019-11-15 23:35:15,235 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:35:15,236 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 23:35:15,236 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178981950] [2019-11-15 23:35:15,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:35:15,237 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:35:15,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:35:15,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:35:15,238 INFO L87 Difference]: Start difference. First operand 3248 states and 7403 transitions. Second operand 8 states. [2019-11-15 23:35:15,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:35:15,320 INFO L93 Difference]: Finished difference Result 5452 states and 12512 transitions. [2019-11-15 23:35:15,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:35:15,320 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 87 [2019-11-15 23:35:15,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:35:15,322 INFO L225 Difference]: With dead ends: 5452 [2019-11-15 23:35:15,322 INFO L226 Difference]: Without dead ends: 2297 [2019-11-15 23:35:15,322 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:35:15,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2297 states. [2019-11-15 23:35:15,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2297 to 2297. [2019-11-15 23:35:15,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2297 states. [2019-11-15 23:35:15,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2297 states to 2297 states and 5261 transitions. [2019-11-15 23:35:15,342 INFO L78 Accepts]: Start accepts. Automaton has 2297 states and 5261 transitions. Word has length 87 [2019-11-15 23:35:15,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:35:15,342 INFO L462 AbstractCegarLoop]: Abstraction has 2297 states and 5261 transitions. [2019-11-15 23:35:15,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:35:15,343 INFO L276 IsEmpty]: Start isEmpty. Operand 2297 states and 5261 transitions. [2019-11-15 23:35:15,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 23:35:15,344 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:35:15,344 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] [2019-11-15 23:35:15,345 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:35:15,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:35:15,345 INFO L82 PathProgramCache]: Analyzing trace with hash -143330158, now seen corresponding path program 1 times [2019-11-15 23:35:15,345 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:35:15,345 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354185796] [2019-11-15 23:35:15,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:15,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:15,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:35:15,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:35:15,414 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-15 23:35:15,414 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354185796] [2019-11-15 23:35:15,415 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:35:15,415 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:35:15,415 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362297163] [2019-11-15 23:35:15,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:35:15,416 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:35:15,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:35:15,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:35:15,416 INFO L87 Difference]: Start difference. First operand 2297 states and 5261 transitions. Second operand 5 states. [2019-11-15 23:35:15,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:35:15,721 INFO L93 Difference]: Finished difference Result 2596 states and 5880 transitions. [2019-11-15 23:35:15,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:35:15,722 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-11-15 23:35:15,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:35:15,725 INFO L225 Difference]: With dead ends: 2596 [2019-11-15 23:35:15,725 INFO L226 Difference]: Without dead ends: 2574 [2019-11-15 23:35:15,725 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:35:15,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2574 states. [2019-11-15 23:35:15,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2574 to 2321. [2019-11-15 23:35:15,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2321 states. [2019-11-15 23:35:15,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2321 states to 2321 states and 5318 transitions. [2019-11-15 23:35:15,766 INFO L78 Accepts]: Start accepts. Automaton has 2321 states and 5318 transitions. Word has length 87 [2019-11-15 23:35:15,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:35:15,766 INFO L462 AbstractCegarLoop]: Abstraction has 2321 states and 5318 transitions. [2019-11-15 23:35:15,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:35:15,767 INFO L276 IsEmpty]: Start isEmpty. Operand 2321 states and 5318 transitions. [2019-11-15 23:35:15,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 23:35:15,770 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:35:15,771 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] [2019-11-15 23:35:15,771 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:35:15,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:35:15,771 INFO L82 PathProgramCache]: Analyzing trace with hash -179317104, now seen corresponding path program 1 times [2019-11-15 23:35:15,772 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:35:15,772 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930478548] [2019-11-15 23:35:15,772 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:15,772 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:15,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:35:15,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:35:15,900 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-15 23:35:15,900 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930478548] [2019-11-15 23:35:15,901 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:35:15,901 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:35:15,901 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077780856] [2019-11-15 23:35:15,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:35:15,902 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:35:15,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:35:15,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:35:15,903 INFO L87 Difference]: Start difference. First operand 2321 states and 5318 transitions. Second operand 6 states. [2019-11-15 23:35:16,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:35:16,098 INFO L93 Difference]: Finished difference Result 2522 states and 5754 transitions. [2019-11-15 23:35:16,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:35:16,099 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2019-11-15 23:35:16,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:35:16,101 INFO L225 Difference]: With dead ends: 2522 [2019-11-15 23:35:16,101 INFO L226 Difference]: Without dead ends: 2522 [2019-11-15 23:35:16,101 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:35:16,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2522 states. [2019-11-15 23:35:16,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2522 to 2263. [2019-11-15 23:35:16,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2263 states. [2019-11-15 23:35:16,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2263 states to 2263 states and 5196 transitions. [2019-11-15 23:35:16,128 INFO L78 Accepts]: Start accepts. Automaton has 2263 states and 5196 transitions. Word has length 87 [2019-11-15 23:35:16,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:35:16,128 INFO L462 AbstractCegarLoop]: Abstraction has 2263 states and 5196 transitions. [2019-11-15 23:35:16,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:35:16,128 INFO L276 IsEmpty]: Start isEmpty. Operand 2263 states and 5196 transitions. [2019-11-15 23:35:16,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 23:35:16,131 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:35:16,131 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] [2019-11-15 23:35:16,131 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:35:16,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:35:16,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1282262895, now seen corresponding path program 1 times [2019-11-15 23:35:16,132 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:35:16,132 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777860130] [2019-11-15 23:35:16,132 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:16,133 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:16,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:35:16,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:35:16,266 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-15 23:35:16,266 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777860130] [2019-11-15 23:35:16,266 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:35:16,267 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 23:35:16,267 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587536586] [2019-11-15 23:35:16,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:35:16,267 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:35:16,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:35:16,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:35:16,268 INFO L87 Difference]: Start difference. First operand 2263 states and 5196 transitions. Second operand 8 states. [2019-11-15 23:35:16,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:35:16,564 INFO L93 Difference]: Finished difference Result 2548 states and 5805 transitions. [2019-11-15 23:35:16,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:35:16,565 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 87 [2019-11-15 23:35:16,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:35:16,567 INFO L225 Difference]: With dead ends: 2548 [2019-11-15 23:35:16,567 INFO L226 Difference]: Without dead ends: 2548 [2019-11-15 23:35:16,568 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:35:16,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2548 states. [2019-11-15 23:35:16,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2548 to 2304. [2019-11-15 23:35:16,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2304 states. [2019-11-15 23:35:16,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2304 states to 2304 states and 5275 transitions. [2019-11-15 23:35:16,598 INFO L78 Accepts]: Start accepts. Automaton has 2304 states and 5275 transitions. Word has length 87 [2019-11-15 23:35:16,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:35:16,599 INFO L462 AbstractCegarLoop]: Abstraction has 2304 states and 5275 transitions. [2019-11-15 23:35:16,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:35:16,599 INFO L276 IsEmpty]: Start isEmpty. Operand 2304 states and 5275 transitions. [2019-11-15 23:35:16,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 23:35:16,602 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:35:16,602 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] [2019-11-15 23:35:16,602 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:35:16,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:35:16,602 INFO L82 PathProgramCache]: Analyzing trace with hash -2125200720, now seen corresponding path program 2 times [2019-11-15 23:35:16,603 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:35:16,603 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59791068] [2019-11-15 23:35:16,603 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:16,603 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:16,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:35:16,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:35:16,789 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-15 23:35:16,790 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59791068] [2019-11-15 23:35:16,790 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:35:16,790 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 23:35:16,790 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927288783] [2019-11-15 23:35:16,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 23:35:16,793 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:35:16,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:35:16,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:35:16,794 INFO L87 Difference]: Start difference. First operand 2304 states and 5275 transitions. Second operand 10 states. [2019-11-15 23:35:17,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:35:17,141 INFO L93 Difference]: Finished difference Result 3950 states and 9032 transitions. [2019-11-15 23:35:17,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 23:35:17,142 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 87 [2019-11-15 23:35:17,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:35:17,144 INFO L225 Difference]: With dead ends: 3950 [2019-11-15 23:35:17,145 INFO L226 Difference]: Without dead ends: 2571 [2019-11-15 23:35:17,145 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-11-15 23:35:17,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2019-11-15 23:35:17,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2341. [2019-11-15 23:35:17,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2341 states. [2019-11-15 23:35:17,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2341 states to 2341 states and 5306 transitions. [2019-11-15 23:35:17,175 INFO L78 Accepts]: Start accepts. Automaton has 2341 states and 5306 transitions. Word has length 87 [2019-11-15 23:35:17,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:35:17,176 INFO L462 AbstractCegarLoop]: Abstraction has 2341 states and 5306 transitions. [2019-11-15 23:35:17,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 23:35:17,176 INFO L276 IsEmpty]: Start isEmpty. Operand 2341 states and 5306 transitions. [2019-11-15 23:35:17,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 23:35:17,178 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:35:17,179 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] [2019-11-15 23:35:17,179 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:35:17,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:35:17,180 INFO L82 PathProgramCache]: Analyzing trace with hash -2066470162, now seen corresponding path program 3 times [2019-11-15 23:35:17,181 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:35:17,181 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138110733] [2019-11-15 23:35:17,181 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:17,181 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:17,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:35:17,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:35:17,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:35:17,312 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:35:17,312 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 23:35:17,529 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-15 23:35:17,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:35:17 BasicIcfg [2019-11-15 23:35:17,530 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:35:17,531 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:35:17,531 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:35:17,531 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:35:17,532 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:34:50" (3/4) ... [2019-11-15 23:35:17,534 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 23:35:17,703 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_babd6d1c-d9b9-455b-9dd4-aaf4c7d2d242/bin/uautomizer/witness.graphml [2019-11-15 23:35:17,703 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:35:17,705 INFO L168 Benchmark]: Toolchain (without parser) took 28790.38 ms. Allocated memory was 1.0 GB in the beginning and 3.3 GB in the end (delta: 2.2 GB). Free memory was 939.4 MB in the beginning and 2.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 615.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:35:17,705 INFO L168 Benchmark]: CDTParser took 0.61 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-15 23:35:17,706 INFO L168 Benchmark]: CACSL2BoogieTranslator took 711.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -169.8 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:35:17,706 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.97 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:35:17,706 INFO L168 Benchmark]: Boogie Preprocessor took 43.44 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-15 23:35:17,706 INFO L168 Benchmark]: RCFGBuilder took 757.81 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: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. [2019-11-15 23:35:17,707 INFO L168 Benchmark]: TraceAbstraction took 27047.04 ms. Allocated memory was 1.2 GB in the beginning and 3.3 GB in the end (delta: 2.1 GB). Free memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2019-11-15 23:35:17,707 INFO L168 Benchmark]: Witness Printer took 172.38 ms. Allocated memory is still 3.3 GB. Free memory was 2.6 GB in the beginning and 2.6 GB in the end (delta: 52.0 MB). Peak memory consumption was 52.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:35:17,709 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.61 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 711.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -169.8 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.97 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.44 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 757.81 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: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 27047.04 ms. Allocated memory was 1.2 GB in the beginning and 3.3 GB in the end (delta: 2.1 GB). Free memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. * Witness Printer took 172.38 ms. Allocated memory is still 3.3 GB. Free memory was 2.6 GB in the beginning and 2.6 GB in the end (delta: 52.0 MB). Peak memory consumption was 52.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L699] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L701] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L703] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L705] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0] [L706] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0] [L707] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L709] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L711] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L712] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L713] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L714] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L715] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L716] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L717] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L718] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L719] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L720] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L721] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L722] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L723] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L724] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L725] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L727] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L728] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L729] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L809] 0 pthread_t t839; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L810] FCALL, FORK 0 pthread_create(&t839, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L811] 0 pthread_t t840; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L812] FCALL, FORK 0 pthread_create(&t840, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L767] 2 y$w_buff1 = y$w_buff0 [L768] 2 y$w_buff0 = 1 [L769] 2 y$w_buff1_used = y$w_buff0_used [L770] 2 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L772] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L773] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L774] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L775] 2 y$r_buff0_thd2 = (_Bool)1 [L778] 2 z = 1 [L781] 2 __unbuffered_p1_EAX = z [L784] 2 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 1 a = 1 [L736] 1 x = 1 [L739] 1 __unbuffered_p0_EAX = x [L742] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L743] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L744] 1 y$flush_delayed = weak$$choice2 [L745] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L788] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L788] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L789] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L747] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L748] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L789] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L749] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L750] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L751] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L752] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L752] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 1 y = y$flush_delayed ? y$mem_tmp : y [L755] 1 y$flush_delayed = (_Bool)0 [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L819] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L819] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L820] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L821] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L825] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 198 locations, 3 error locations. Result: UNSAFE, OverallTime: 26.9s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 12.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6286 SDtfs, 7579 SDslu, 14192 SDs, 0 SdLazy, 5349 SolverSat, 369 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 223 GetRequests, 57 SyntacticMatches, 13 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57892occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.4s AutomataMinimizationTime, 23 MinimizatonAttempts, 53650 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1647 NumberOfCodeBlocks, 1647 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1537 ConstructedInterpolants, 0 QuantifiedInterpolants, 293850 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...