./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi003_power.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_8a89a9a5-3906-41ca-969d-247dd745c2a0/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8a89a9a5-3906-41ca-969d-247dd745c2a0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8a89a9a5-3906-41ca-969d-247dd745c2a0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8a89a9a5-3906-41ca-969d-247dd745c2a0/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi003_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_8a89a9a5-3906-41ca-969d-247dd745c2a0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8a89a9a5-3906-41ca-969d-247dd745c2a0/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 31ae382edabe17ce34422996f792882116394642 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:35:16,993 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:35:16,994 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:35:17,009 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:35:17,010 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:35:17,011 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:35:17,013 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:35:17,023 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:35:17,028 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:35:17,031 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:35:17,033 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:35:17,035 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:35:17,035 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:35:17,038 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:35:17,039 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:35:17,039 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:35:17,040 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:35:17,041 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:35:17,043 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:35:17,047 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:35:17,050 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:35:17,052 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:35:17,055 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:35:17,055 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:35:17,058 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:35:17,058 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:35:17,058 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:35:17,061 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:35:17,061 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:35:17,062 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:35:17,062 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:35:17,063 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:35:17,063 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:35:17,064 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:35:17,066 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:35:17,066 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:35:17,067 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:35:17,067 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:35:17,067 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:35:17,068 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:35:17,069 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:35:17,070 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8a89a9a5-3906-41ca-969d-247dd745c2a0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:35:17,095 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:35:17,105 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:35:17,106 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:35:17,107 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:35:17,107 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:35:17,107 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:35:17,107 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:35:17,108 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:35:17,108 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:35:17,108 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:35:17,108 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:35:17,109 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:35:17,109 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:35:17,109 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:35:17,109 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:35:17,110 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:35:17,110 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:35:17,111 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:35:17,111 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:35:17,112 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:35:17,112 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:35:17,112 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:35:17,112 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:35:17,113 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:35:17,113 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:35:17,113 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:35:17,114 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:35:17,114 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:35:17,114 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_8a89a9a5-3906-41ca-969d-247dd745c2a0/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 -> 31ae382edabe17ce34422996f792882116394642 [2019-11-16 00:35:17,147 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:35:17,157 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:35:17,160 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:35:17,161 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:35:17,161 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:35:17,162 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8a89a9a5-3906-41ca-969d-247dd745c2a0/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi003_power.opt.i [2019-11-16 00:35:17,222 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8a89a9a5-3906-41ca-969d-247dd745c2a0/bin/uautomizer/data/dc4192380/4434f4c2602e4cff8f744bbd8ea35dc0/FLAGbce67e53a [2019-11-16 00:35:17,676 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:35:17,677 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8a89a9a5-3906-41ca-969d-247dd745c2a0/sv-benchmarks/c/pthread-wmm/rfi003_power.opt.i [2019-11-16 00:35:17,692 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8a89a9a5-3906-41ca-969d-247dd745c2a0/bin/uautomizer/data/dc4192380/4434f4c2602e4cff8f744bbd8ea35dc0/FLAGbce67e53a [2019-11-16 00:35:17,997 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8a89a9a5-3906-41ca-969d-247dd745c2a0/bin/uautomizer/data/dc4192380/4434f4c2602e4cff8f744bbd8ea35dc0 [2019-11-16 00:35:17,999 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:35:18,000 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:35:18,001 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:35:18,001 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:35:18,004 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:35:18,005 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:35:17" (1/1) ... [2019-11-16 00:35:18,007 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2afdec8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:18, skipping insertion in model container [2019-11-16 00:35:18,007 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:35:17" (1/1) ... [2019-11-16 00:35:18,012 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:35:18,074 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:35:18,494 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:35:18,511 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:35:18,572 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:35:18,642 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:35:18,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:18 WrapperNode [2019-11-16 00:35:18,643 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:35:18,644 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:35:18,644 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:35:18,644 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:35:18,651 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:18" (1/1) ... [2019-11-16 00:35:18,666 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:18" (1/1) ... [2019-11-16 00:35:18,695 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:35:18,695 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:35:18,696 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:35:18,696 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:35:18,705 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:18" (1/1) ... [2019-11-16 00:35:18,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:18" (1/1) ... [2019-11-16 00:35:18,710 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:18" (1/1) ... [2019-11-16 00:35:18,710 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:18" (1/1) ... [2019-11-16 00:35:18,721 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:18" (1/1) ... [2019-11-16 00:35:18,734 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:18" (1/1) ... [2019-11-16 00:35:18,737 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:18" (1/1) ... [2019-11-16 00:35:18,741 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:35:18,742 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:35:18,742 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:35:18,742 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:35:18,743 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8a89a9a5-3906-41ca-969d-247dd745c2a0/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:35:18,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:35:18,820 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-16 00:35:18,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:35:18,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:35:18,821 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-16 00:35:18,821 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-16 00:35:18,822 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-16 00:35:18,822 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-16 00:35:18,822 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-16 00:35:18,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:35:18,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:35:18,826 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-16 00:35:19,598 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:35:19,599 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-16 00:35:19,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:35:19 BoogieIcfgContainer [2019-11-16 00:35:19,600 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:35:19,601 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:35:19,601 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:35:19,604 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:35:19,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:35:17" (1/3) ... [2019-11-16 00:35:19,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a927896 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:35:19, skipping insertion in model container [2019-11-16 00:35:19,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:18" (2/3) ... [2019-11-16 00:35:19,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a927896 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:35:19, skipping insertion in model container [2019-11-16 00:35:19,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:35:19" (3/3) ... [2019-11-16 00:35:19,606 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi003_power.opt.i [2019-11-16 00:35:19,649 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,649 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,649 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,649 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,649 WARN L315 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,650 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,650 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,650 WARN L315 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,650 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,651 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,651 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,651 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,651 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,651 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,652 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,652 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,652 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,652 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,652 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,652 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,653 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,653 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,653 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,653 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,653 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,654 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,654 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,654 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,654 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,654 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,654 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,655 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,655 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,655 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,655 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,655 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,656 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,656 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,656 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,656 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,656 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,657 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,657 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,657 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,657 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,657 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,657 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,658 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,658 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,658 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,658 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,658 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,659 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,659 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,659 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,659 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,659 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,659 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,660 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,660 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,660 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,660 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,660 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,661 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,661 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,661 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,661 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,661 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,662 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,662 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,662 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,662 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,662 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,662 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,663 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,663 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,663 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,663 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,663 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,664 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,664 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,664 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,664 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,664 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,664 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,665 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,665 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,665 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,665 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,665 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,665 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,666 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,666 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,666 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,667 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,667 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,667 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,667 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,667 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,667 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,668 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,668 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,668 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,668 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,668 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,669 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,669 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,669 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,669 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,669 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,669 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,670 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,670 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,670 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,670 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,677 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,677 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,678 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,678 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,678 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,679 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,679 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,679 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,679 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,680 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,680 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,680 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,680 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:35:19,688 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-16 00:35:19,688 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:35:19,700 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-16 00:35:19,709 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-16 00:35:19,724 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:35:19,725 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:35:19,725 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:35:19,725 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:35:19,725 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:35:19,725 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:35:19,725 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:35:19,725 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:35:19,737 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 129 places, 161 transitions [2019-11-16 00:35:21,659 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25975 states. [2019-11-16 00:35:21,661 INFO L276 IsEmpty]: Start isEmpty. Operand 25975 states. [2019-11-16 00:35:21,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-16 00:35:21,676 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:35:21,677 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] [2019-11-16 00:35:21,681 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:35:21,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:21,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1135396639, now seen corresponding path program 1 times [2019-11-16 00:35:21,694 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:21,695 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322783264] [2019-11-16 00:35:21,695 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:21,696 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:21,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:21,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:21,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:35:21,979 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322783264] [2019-11-16 00:35:21,980 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:35:21,980 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:35:21,980 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379575449] [2019-11-16 00:35:21,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:35:21,985 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:35:21,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:35:21,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:35:21,999 INFO L87 Difference]: Start difference. First operand 25975 states. Second operand 4 states. [2019-11-16 00:35:22,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:35:22,695 INFO L93 Difference]: Finished difference Result 26615 states and 102120 transitions. [2019-11-16 00:35:22,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:35:22,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-11-16 00:35:22,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:35:22,941 INFO L225 Difference]: With dead ends: 26615 [2019-11-16 00:35:22,942 INFO L226 Difference]: Without dead ends: 20359 [2019-11-16 00:35:22,944 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:35:23,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20359 states. [2019-11-16 00:35:23,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20359 to 20359. [2019-11-16 00:35:23,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20359 states. [2019-11-16 00:35:24,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20359 states to 20359 states and 78424 transitions. [2019-11-16 00:35:24,085 INFO L78 Accepts]: Start accepts. Automaton has 20359 states and 78424 transitions. Word has length 38 [2019-11-16 00:35:24,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:35:24,086 INFO L462 AbstractCegarLoop]: Abstraction has 20359 states and 78424 transitions. [2019-11-16 00:35:24,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:35:24,086 INFO L276 IsEmpty]: Start isEmpty. Operand 20359 states and 78424 transitions. [2019-11-16 00:35:24,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-16 00:35:24,098 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:35:24,098 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] [2019-11-16 00:35:24,098 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:35:24,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:24,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1334378173, now seen corresponding path program 1 times [2019-11-16 00:35:24,099 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:24,100 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334977602] [2019-11-16 00:35:24,100 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:24,100 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:24,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:24,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:24,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:35:24,282 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334977602] [2019-11-16 00:35:24,282 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:35:24,282 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:35:24,282 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770888604] [2019-11-16 00:35:24,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:35:24,284 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:35:24,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:35:24,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:35:24,285 INFO L87 Difference]: Start difference. First operand 20359 states and 78424 transitions. Second operand 5 states. [2019-11-16 00:35:25,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:35:25,283 INFO L93 Difference]: Finished difference Result 31837 states and 116041 transitions. [2019-11-16 00:35:25,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:35:25,284 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-11-16 00:35:25,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:35:25,442 INFO L225 Difference]: With dead ends: 31837 [2019-11-16 00:35:25,443 INFO L226 Difference]: Without dead ends: 31285 [2019-11-16 00:35:25,444 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:35:25,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31285 states. [2019-11-16 00:35:26,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31285 to 29704. [2019-11-16 00:35:26,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29704 states. [2019-11-16 00:35:26,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29704 states to 29704 states and 109518 transitions. [2019-11-16 00:35:26,649 INFO L78 Accepts]: Start accepts. Automaton has 29704 states and 109518 transitions. Word has length 46 [2019-11-16 00:35:26,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:35:26,651 INFO L462 AbstractCegarLoop]: Abstraction has 29704 states and 109518 transitions. [2019-11-16 00:35:26,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:35:26,651 INFO L276 IsEmpty]: Start isEmpty. Operand 29704 states and 109518 transitions. [2019-11-16 00:35:26,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-16 00:35:26,658 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:35:26,658 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:35:26,658 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:35:26,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:26,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1293014968, now seen corresponding path program 1 times [2019-11-16 00:35:26,659 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:26,660 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15916937] [2019-11-16 00:35:26,663 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:26,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:26,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:26,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:26,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:35:26,799 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15916937] [2019-11-16 00:35:26,799 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:35:26,800 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:35:26,800 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376667054] [2019-11-16 00:35:26,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:35:26,800 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:35:26,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:35:26,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:35:26,801 INFO L87 Difference]: Start difference. First operand 29704 states and 109518 transitions. Second operand 5 states. [2019-11-16 00:35:27,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:35:27,723 INFO L93 Difference]: Finished difference Result 38695 states and 139690 transitions. [2019-11-16 00:35:27,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:35:27,724 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-11-16 00:35:27,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:35:27,980 INFO L225 Difference]: With dead ends: 38695 [2019-11-16 00:35:27,980 INFO L226 Difference]: Without dead ends: 38247 [2019-11-16 00:35:27,981 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:35:28,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38247 states. [2019-11-16 00:35:28,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38247 to 32950. [2019-11-16 00:35:28,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32950 states. [2019-11-16 00:35:28,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32950 states to 32950 states and 120527 transitions. [2019-11-16 00:35:28,806 INFO L78 Accepts]: Start accepts. Automaton has 32950 states and 120527 transitions. Word has length 47 [2019-11-16 00:35:28,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:35:28,806 INFO L462 AbstractCegarLoop]: Abstraction has 32950 states and 120527 transitions. [2019-11-16 00:35:28,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:35:28,807 INFO L276 IsEmpty]: Start isEmpty. Operand 32950 states and 120527 transitions. [2019-11-16 00:35:28,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-16 00:35:28,815 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:35:28,815 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-16 00:35:28,816 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:35:28,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:28,816 INFO L82 PathProgramCache]: Analyzing trace with hash -458309778, now seen corresponding path program 1 times [2019-11-16 00:35:28,816 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:28,817 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882704256] [2019-11-16 00:35:28,817 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:28,817 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:28,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:28,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:28,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:35:28,864 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882704256] [2019-11-16 00:35:28,864 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:35:28,864 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:35:28,864 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922428036] [2019-11-16 00:35:28,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:35:28,865 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:35:28,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:35:28,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:35:28,865 INFO L87 Difference]: Start difference. First operand 32950 states and 120527 transitions. Second operand 3 states. [2019-11-16 00:35:29,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:35:29,136 INFO L93 Difference]: Finished difference Result 42411 states and 152018 transitions. [2019-11-16 00:35:29,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:35:29,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-16 00:35:29,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:35:29,420 INFO L225 Difference]: With dead ends: 42411 [2019-11-16 00:35:29,420 INFO L226 Difference]: Without dead ends: 42411 [2019-11-16 00:35:29,421 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:35:30,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42411 states. [2019-11-16 00:35:30,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42411 to 37664. [2019-11-16 00:35:30,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37664 states. [2019-11-16 00:35:30,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37664 states to 37664 states and 136331 transitions. [2019-11-16 00:35:30,793 INFO L78 Accepts]: Start accepts. Automaton has 37664 states and 136331 transitions. Word has length 49 [2019-11-16 00:35:30,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:35:30,793 INFO L462 AbstractCegarLoop]: Abstraction has 37664 states and 136331 transitions. [2019-11-16 00:35:30,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:35:30,794 INFO L276 IsEmpty]: Start isEmpty. Operand 37664 states and 136331 transitions. [2019-11-16 00:35:30,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-16 00:35:30,808 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:35:30,808 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] [2019-11-16 00:35:30,809 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:35:30,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:30,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1978906735, now seen corresponding path program 1 times [2019-11-16 00:35:30,809 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:30,810 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636327325] [2019-11-16 00:35:30,810 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:30,810 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:30,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:30,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:30,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:35:30,888 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636327325] [2019-11-16 00:35:30,888 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:35:30,888 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:35:30,888 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690792937] [2019-11-16 00:35:30,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:35:30,889 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:35:30,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:35:30,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:35:30,889 INFO L87 Difference]: Start difference. First operand 37664 states and 136331 transitions. Second operand 6 states. [2019-11-16 00:35:31,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:35:31,677 INFO L93 Difference]: Finished difference Result 48755 states and 172980 transitions. [2019-11-16 00:35:31,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:35:31,678 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-11-16 00:35:31,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:35:31,803 INFO L225 Difference]: With dead ends: 48755 [2019-11-16 00:35:31,804 INFO L226 Difference]: Without dead ends: 48235 [2019-11-16 00:35:31,804 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-16 00:35:32,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48235 states. [2019-11-16 00:35:33,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48235 to 38228. [2019-11-16 00:35:33,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38228 states. [2019-11-16 00:35:33,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38228 states to 38228 states and 138494 transitions. [2019-11-16 00:35:33,126 INFO L78 Accepts]: Start accepts. Automaton has 38228 states and 138494 transitions. Word has length 53 [2019-11-16 00:35:33,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:35:33,126 INFO L462 AbstractCegarLoop]: Abstraction has 38228 states and 138494 transitions. [2019-11-16 00:35:33,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:35:33,126 INFO L276 IsEmpty]: Start isEmpty. Operand 38228 states and 138494 transitions. [2019-11-16 00:35:33,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-16 00:35:33,141 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:35:33,141 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] [2019-11-16 00:35:33,141 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:35:33,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:33,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1933781412, now seen corresponding path program 1 times [2019-11-16 00:35:33,142 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:33,142 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536849537] [2019-11-16 00:35:33,142 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:33,142 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:33,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:33,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:33,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:35:33,290 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536849537] [2019-11-16 00:35:33,290 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:35:33,292 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:35:33,292 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445489093] [2019-11-16 00:35:33,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:35:33,297 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:35:33,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:35:33,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:35:33,297 INFO L87 Difference]: Start difference. First operand 38228 states and 138494 transitions. Second operand 6 states. [2019-11-16 00:35:34,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:35:34,119 INFO L93 Difference]: Finished difference Result 53004 states and 189570 transitions. [2019-11-16 00:35:34,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:35:34,120 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-11-16 00:35:34,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:35:34,227 INFO L225 Difference]: With dead ends: 53004 [2019-11-16 00:35:34,227 INFO L226 Difference]: Without dead ends: 52028 [2019-11-16 00:35:34,227 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:35:34,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52028 states. [2019-11-16 00:35:34,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52028 to 48781. [2019-11-16 00:35:34,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48781 states. [2019-11-16 00:35:35,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48781 states to 48781 states and 175225 transitions. [2019-11-16 00:35:35,761 INFO L78 Accepts]: Start accepts. Automaton has 48781 states and 175225 transitions. Word has length 53 [2019-11-16 00:35:35,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:35:35,761 INFO L462 AbstractCegarLoop]: Abstraction has 48781 states and 175225 transitions. [2019-11-16 00:35:35,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:35:35,762 INFO L276 IsEmpty]: Start isEmpty. Operand 48781 states and 175225 transitions. [2019-11-16 00:35:35,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-16 00:35:35,776 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:35:35,776 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] [2019-11-16 00:35:35,776 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:35:35,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:35,776 INFO L82 PathProgramCache]: Analyzing trace with hash 136830053, now seen corresponding path program 1 times [2019-11-16 00:35:35,777 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:35,777 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779706084] [2019-11-16 00:35:35,777 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:35,777 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:35,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:35,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:35,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:35:35,884 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779706084] [2019-11-16 00:35:35,884 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:35:35,885 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:35:35,885 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312626224] [2019-11-16 00:35:35,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:35:35,885 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:35:35,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:35:35,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:35:35,886 INFO L87 Difference]: Start difference. First operand 48781 states and 175225 transitions. Second operand 7 states. [2019-11-16 00:35:36,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:35:36,929 INFO L93 Difference]: Finished difference Result 70896 states and 244522 transitions. [2019-11-16 00:35:36,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:35:36,930 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-11-16 00:35:36,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:35:37,058 INFO L225 Difference]: With dead ends: 70896 [2019-11-16 00:35:37,059 INFO L226 Difference]: Without dead ends: 70896 [2019-11-16 00:35:37,059 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:35:37,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70896 states. [2019-11-16 00:35:37,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70896 to 57889. [2019-11-16 00:35:37,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57889 states. [2019-11-16 00:35:38,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57889 states to 57889 states and 203149 transitions. [2019-11-16 00:35:38,125 INFO L78 Accepts]: Start accepts. Automaton has 57889 states and 203149 transitions. Word has length 53 [2019-11-16 00:35:38,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:35:38,126 INFO L462 AbstractCegarLoop]: Abstraction has 57889 states and 203149 transitions. [2019-11-16 00:35:38,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:35:38,126 INFO L276 IsEmpty]: Start isEmpty. Operand 57889 states and 203149 transitions. [2019-11-16 00:35:38,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-16 00:35:38,140 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:35:38,141 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] [2019-11-16 00:35:38,141 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:35:38,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:38,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1024333734, now seen corresponding path program 1 times [2019-11-16 00:35:38,142 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:38,142 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902477242] [2019-11-16 00:35:38,142 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:38,142 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:38,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:38,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:38,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:35:38,202 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902477242] [2019-11-16 00:35:38,202 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:35:38,202 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:35:38,202 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665086385] [2019-11-16 00:35:38,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:35:38,203 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:35:38,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:35:38,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:35:38,203 INFO L87 Difference]: Start difference. First operand 57889 states and 203149 transitions. Second operand 3 states. [2019-11-16 00:35:38,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:35:38,377 INFO L93 Difference]: Finished difference Result 43855 states and 152832 transitions. [2019-11-16 00:35:38,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:35:38,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-16 00:35:38,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:35:38,892 INFO L225 Difference]: With dead ends: 43855 [2019-11-16 00:35:38,892 INFO L226 Difference]: Without dead ends: 43351 [2019-11-16 00:35:38,892 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:35:39,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43351 states. [2019-11-16 00:35:39,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43351 to 41885. [2019-11-16 00:35:39,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41885 states. [2019-11-16 00:35:39,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41885 states to 41885 states and 146703 transitions. [2019-11-16 00:35:39,619 INFO L78 Accepts]: Start accepts. Automaton has 41885 states and 146703 transitions. Word has length 53 [2019-11-16 00:35:39,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:35:39,619 INFO L462 AbstractCegarLoop]: Abstraction has 41885 states and 146703 transitions. [2019-11-16 00:35:39,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:35:39,620 INFO L276 IsEmpty]: Start isEmpty. Operand 41885 states and 146703 transitions. [2019-11-16 00:35:39,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-16 00:35:39,631 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:35:39,631 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:35:39,631 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:35:39,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:39,632 INFO L82 PathProgramCache]: Analyzing trace with hash 765117548, now seen corresponding path program 1 times [2019-11-16 00:35:39,632 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:39,632 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423667594] [2019-11-16 00:35:39,632 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:39,632 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:39,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:39,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:39,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:35:39,732 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423667594] [2019-11-16 00:35:39,732 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:35:39,733 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:35:39,733 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347114518] [2019-11-16 00:35:39,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:35:39,734 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:35:39,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:35:39,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:35:39,734 INFO L87 Difference]: Start difference. First operand 41885 states and 146703 transitions. Second operand 6 states. [2019-11-16 00:35:40,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:35:40,553 INFO L93 Difference]: Finished difference Result 54548 states and 184833 transitions. [2019-11-16 00:35:40,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:35:40,554 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-11-16 00:35:40,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:35:40,698 INFO L225 Difference]: With dead ends: 54548 [2019-11-16 00:35:40,698 INFO L226 Difference]: Without dead ends: 54548 [2019-11-16 00:35:40,699 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:35:40,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54548 states. [2019-11-16 00:35:41,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54548 to 45860. [2019-11-16 00:35:41,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45860 states. [2019-11-16 00:35:41,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45860 states to 45860 states and 158166 transitions. [2019-11-16 00:35:41,543 INFO L78 Accepts]: Start accepts. Automaton has 45860 states and 158166 transitions. Word has length 54 [2019-11-16 00:35:41,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:35:41,543 INFO L462 AbstractCegarLoop]: Abstraction has 45860 states and 158166 transitions. [2019-11-16 00:35:41,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:35:41,543 INFO L276 IsEmpty]: Start isEmpty. Operand 45860 states and 158166 transitions. [2019-11-16 00:35:41,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-16 00:35:41,554 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:35:41,554 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:35:41,555 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:35:41,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:41,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1652621229, now seen corresponding path program 1 times [2019-11-16 00:35:41,555 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:41,556 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030428646] [2019-11-16 00:35:41,556 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:41,556 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:41,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:41,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:41,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:35:41,629 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030428646] [2019-11-16 00:35:41,630 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:35:41,630 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:35:41,630 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661838539] [2019-11-16 00:35:41,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:35:41,630 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:35:41,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:35:41,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:35:41,631 INFO L87 Difference]: Start difference. First operand 45860 states and 158166 transitions. Second operand 4 states. [2019-11-16 00:35:41,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:35:41,693 INFO L93 Difference]: Finished difference Result 8162 states and 24870 transitions. [2019-11-16 00:35:41,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:35:41,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-11-16 00:35:41,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:35:41,704 INFO L225 Difference]: With dead ends: 8162 [2019-11-16 00:35:41,704 INFO L226 Difference]: Without dead ends: 6753 [2019-11-16 00:35:41,704 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:35:41,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6753 states. [2019-11-16 00:35:41,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6753 to 6705. [2019-11-16 00:35:41,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6705 states. [2019-11-16 00:35:41,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6705 states to 6705 states and 20039 transitions. [2019-11-16 00:35:41,785 INFO L78 Accepts]: Start accepts. Automaton has 6705 states and 20039 transitions. Word has length 54 [2019-11-16 00:35:41,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:35:41,785 INFO L462 AbstractCegarLoop]: Abstraction has 6705 states and 20039 transitions. [2019-11-16 00:35:41,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:35:41,785 INFO L276 IsEmpty]: Start isEmpty. Operand 6705 states and 20039 transitions. [2019-11-16 00:35:41,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-16 00:35:41,788 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:35:41,788 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] [2019-11-16 00:35:41,788 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:35:41,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:41,789 INFO L82 PathProgramCache]: Analyzing trace with hash 779185304, now seen corresponding path program 1 times [2019-11-16 00:35:41,789 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:41,789 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241101644] [2019-11-16 00:35:41,789 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:41,789 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:41,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:41,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:41,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:35:41,846 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241101644] [2019-11-16 00:35:41,846 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:35:41,846 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:35:41,846 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466497879] [2019-11-16 00:35:41,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:35:41,847 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:35:41,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:35:41,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:35:41,847 INFO L87 Difference]: Start difference. First operand 6705 states and 20039 transitions. Second operand 4 states. [2019-11-16 00:35:42,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:35:42,009 INFO L93 Difference]: Finished difference Result 7890 states and 23388 transitions. [2019-11-16 00:35:42,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:35:42,010 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-11-16 00:35:42,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:35:42,022 INFO L225 Difference]: With dead ends: 7890 [2019-11-16 00:35:42,023 INFO L226 Difference]: Without dead ends: 7890 [2019-11-16 00:35:42,023 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:35:42,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7890 states. [2019-11-16 00:35:42,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7890 to 7212. [2019-11-16 00:35:42,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7212 states. [2019-11-16 00:35:42,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7212 states to 7212 states and 21445 transitions. [2019-11-16 00:35:42,154 INFO L78 Accepts]: Start accepts. Automaton has 7212 states and 21445 transitions. Word has length 63 [2019-11-16 00:35:42,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:35:42,154 INFO L462 AbstractCegarLoop]: Abstraction has 7212 states and 21445 transitions. [2019-11-16 00:35:42,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:35:42,154 INFO L276 IsEmpty]: Start isEmpty. Operand 7212 states and 21445 transitions. [2019-11-16 00:35:42,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-16 00:35:42,165 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:35:42,165 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] [2019-11-16 00:35:42,165 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:35:42,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:42,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1772971657, now seen corresponding path program 1 times [2019-11-16 00:35:42,166 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:42,166 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672235569] [2019-11-16 00:35:42,166 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:42,167 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:42,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:42,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:42,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:35:42,265 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672235569] [2019-11-16 00:35:42,265 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:35:42,265 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:35:42,265 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049665245] [2019-11-16 00:35:42,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:35:42,266 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:35:42,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:35:42,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:35:42,267 INFO L87 Difference]: Start difference. First operand 7212 states and 21445 transitions. Second operand 6 states. [2019-11-16 00:35:42,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:35:42,671 INFO L93 Difference]: Finished difference Result 9267 states and 27194 transitions. [2019-11-16 00:35:42,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:35:42,671 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2019-11-16 00:35:42,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:35:42,682 INFO L225 Difference]: With dead ends: 9267 [2019-11-16 00:35:42,682 INFO L226 Difference]: Without dead ends: 9219 [2019-11-16 00:35:42,682 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:35:42,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9219 states. [2019-11-16 00:35:42,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9219 to 8051. [2019-11-16 00:35:42,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8051 states. [2019-11-16 00:35:42,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8051 states to 8051 states and 23825 transitions. [2019-11-16 00:35:42,780 INFO L78 Accepts]: Start accepts. Automaton has 8051 states and 23825 transitions. Word has length 63 [2019-11-16 00:35:42,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:35:42,780 INFO L462 AbstractCegarLoop]: Abstraction has 8051 states and 23825 transitions. [2019-11-16 00:35:42,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:35:42,780 INFO L276 IsEmpty]: Start isEmpty. Operand 8051 states and 23825 transitions. [2019-11-16 00:35:42,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-16 00:35:42,786 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:35:42,786 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] [2019-11-16 00:35:42,786 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:35:42,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:42,786 INFO L82 PathProgramCache]: Analyzing trace with hash 238487578, now seen corresponding path program 1 times [2019-11-16 00:35:42,786 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:42,786 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219039624] [2019-11-16 00:35:42,787 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:42,787 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:42,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:42,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:42,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:35:42,850 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219039624] [2019-11-16 00:35:42,851 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:35:42,851 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:35:42,851 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7381337] [2019-11-16 00:35:42,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:35:42,851 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:35:42,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:35:42,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:35:42,852 INFO L87 Difference]: Start difference. First operand 8051 states and 23825 transitions. Second operand 4 states. [2019-11-16 00:35:43,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:35:43,138 INFO L93 Difference]: Finished difference Result 10664 states and 31174 transitions. [2019-11-16 00:35:43,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:35:43,139 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-11-16 00:35:43,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:35:43,152 INFO L225 Difference]: With dead ends: 10664 [2019-11-16 00:35:43,152 INFO L226 Difference]: Without dead ends: 10664 [2019-11-16 00:35:43,152 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:35:43,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10664 states. [2019-11-16 00:35:43,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10664 to 9074. [2019-11-16 00:35:43,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9074 states. [2019-11-16 00:35:43,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9074 states to 9074 states and 26644 transitions. [2019-11-16 00:35:43,397 INFO L78 Accepts]: Start accepts. Automaton has 9074 states and 26644 transitions. Word has length 67 [2019-11-16 00:35:43,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:35:43,398 INFO L462 AbstractCegarLoop]: Abstraction has 9074 states and 26644 transitions. [2019-11-16 00:35:43,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:35:43,398 INFO L276 IsEmpty]: Start isEmpty. Operand 9074 states and 26644 transitions. [2019-11-16 00:35:43,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-16 00:35:43,405 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:35:43,405 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] [2019-11-16 00:35:43,405 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:35:43,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:43,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1483252059, now seen corresponding path program 1 times [2019-11-16 00:35:43,406 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:43,406 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546225247] [2019-11-16 00:35:43,406 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:43,406 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:43,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:43,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:43,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:35:43,531 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546225247] [2019-11-16 00:35:43,531 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:35:43,531 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:35:43,531 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209960] [2019-11-16 00:35:43,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:35:43,532 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:35:43,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:35:43,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:35:43,533 INFO L87 Difference]: Start difference. First operand 9074 states and 26644 transitions. Second operand 6 states. [2019-11-16 00:35:44,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:35:44,062 INFO L93 Difference]: Finished difference Result 10384 states and 29895 transitions. [2019-11-16 00:35:44,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:35:44,062 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-11-16 00:35:44,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:35:44,074 INFO L225 Difference]: With dead ends: 10384 [2019-11-16 00:35:44,074 INFO L226 Difference]: Without dead ends: 10384 [2019-11-16 00:35:44,074 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:35:44,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10384 states. [2019-11-16 00:35:44,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10384 to 10081. [2019-11-16 00:35:44,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10081 states. [2019-11-16 00:35:44,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10081 states to 10081 states and 29118 transitions. [2019-11-16 00:35:44,192 INFO L78 Accepts]: Start accepts. Automaton has 10081 states and 29118 transitions. Word has length 67 [2019-11-16 00:35:44,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:35:44,193 INFO L462 AbstractCegarLoop]: Abstraction has 10081 states and 29118 transitions. [2019-11-16 00:35:44,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:35:44,193 INFO L276 IsEmpty]: Start isEmpty. Operand 10081 states and 29118 transitions. [2019-11-16 00:35:44,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-16 00:35:44,201 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:35:44,201 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] [2019-11-16 00:35:44,201 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:35:44,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:44,201 INFO L82 PathProgramCache]: Analyzing trace with hash -593957284, now seen corresponding path program 1 times [2019-11-16 00:35:44,201 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:44,202 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126568469] [2019-11-16 00:35:44,202 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:44,202 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:44,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:44,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:44,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:35:44,342 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126568469] [2019-11-16 00:35:44,342 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:35:44,342 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:35:44,342 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956104004] [2019-11-16 00:35:44,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:35:44,343 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:35:44,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:35:44,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:35:44,343 INFO L87 Difference]: Start difference. First operand 10081 states and 29118 transitions. Second operand 6 states. [2019-11-16 00:35:44,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:35:44,864 INFO L93 Difference]: Finished difference Result 11998 states and 33625 transitions. [2019-11-16 00:35:44,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:35:44,864 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-11-16 00:35:44,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:35:44,878 INFO L225 Difference]: With dead ends: 11998 [2019-11-16 00:35:44,878 INFO L226 Difference]: Without dead ends: 11998 [2019-11-16 00:35:44,878 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:35:44,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11998 states. [2019-11-16 00:35:44,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11998 to 10300. [2019-11-16 00:35:44,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10300 states. [2019-11-16 00:35:45,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10300 states to 10300 states and 29170 transitions. [2019-11-16 00:35:45,008 INFO L78 Accepts]: Start accepts. Automaton has 10300 states and 29170 transitions. Word has length 67 [2019-11-16 00:35:45,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:35:45,008 INFO L462 AbstractCegarLoop]: Abstraction has 10300 states and 29170 transitions. [2019-11-16 00:35:45,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:35:45,008 INFO L276 IsEmpty]: Start isEmpty. Operand 10300 states and 29170 transitions. [2019-11-16 00:35:45,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-16 00:35:45,017 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:35:45,017 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] [2019-11-16 00:35:45,017 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:35:45,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:45,018 INFO L82 PathProgramCache]: Analyzing trace with hash -382606371, now seen corresponding path program 1 times [2019-11-16 00:35:45,018 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:45,018 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28217602] [2019-11-16 00:35:45,018 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:45,018 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:45,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:45,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:45,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:35:45,082 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28217602] [2019-11-16 00:35:45,082 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:35:45,083 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:35:45,083 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087928062] [2019-11-16 00:35:45,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:35:45,083 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:35:45,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:35:45,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:35:45,084 INFO L87 Difference]: Start difference. First operand 10300 states and 29170 transitions. Second operand 5 states. [2019-11-16 00:35:45,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:35:45,460 INFO L93 Difference]: Finished difference Result 12575 states and 35463 transitions. [2019-11-16 00:35:45,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:35:45,460 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-11-16 00:35:45,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:35:45,481 INFO L225 Difference]: With dead ends: 12575 [2019-11-16 00:35:45,482 INFO L226 Difference]: Without dead ends: 12575 [2019-11-16 00:35:45,482 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:35:45,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12575 states. [2019-11-16 00:35:45,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12575 to 11075. [2019-11-16 00:35:45,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11075 states. [2019-11-16 00:35:45,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11075 states to 11075 states and 31104 transitions. [2019-11-16 00:35:45,671 INFO L78 Accepts]: Start accepts. Automaton has 11075 states and 31104 transitions. Word has length 67 [2019-11-16 00:35:45,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:35:45,671 INFO L462 AbstractCegarLoop]: Abstraction has 11075 states and 31104 transitions. [2019-11-16 00:35:45,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:35:45,672 INFO L276 IsEmpty]: Start isEmpty. Operand 11075 states and 31104 transitions. [2019-11-16 00:35:45,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-16 00:35:45,682 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:35:45,682 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] [2019-11-16 00:35:45,682 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:35:45,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:45,683 INFO L82 PathProgramCache]: Analyzing trace with hash -893140548, now seen corresponding path program 1 times [2019-11-16 00:35:45,683 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:45,683 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667646450] [2019-11-16 00:35:45,683 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:45,683 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:45,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:45,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:45,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:35:45,750 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667646450] [2019-11-16 00:35:45,750 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:35:45,751 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:35:45,751 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289308418] [2019-11-16 00:35:45,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:35:45,751 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:35:45,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:35:45,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:35:45,752 INFO L87 Difference]: Start difference. First operand 11075 states and 31104 transitions. Second operand 4 states. [2019-11-16 00:35:46,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:35:46,131 INFO L93 Difference]: Finished difference Result 13631 states and 38379 transitions. [2019-11-16 00:35:46,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:35:46,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-11-16 00:35:46,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:35:46,147 INFO L225 Difference]: With dead ends: 13631 [2019-11-16 00:35:46,148 INFO L226 Difference]: Without dead ends: 13256 [2019-11-16 00:35:46,148 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:35:46,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13256 states. [2019-11-16 00:35:46,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13256 to 12713. [2019-11-16 00:35:46,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12713 states. [2019-11-16 00:35:46,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12713 states to 12713 states and 35688 transitions. [2019-11-16 00:35:46,312 INFO L78 Accepts]: Start accepts. Automaton has 12713 states and 35688 transitions. Word has length 67 [2019-11-16 00:35:46,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:35:46,313 INFO L462 AbstractCegarLoop]: Abstraction has 12713 states and 35688 transitions. [2019-11-16 00:35:46,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:35:46,313 INFO L276 IsEmpty]: Start isEmpty. Operand 12713 states and 35688 transitions. [2019-11-16 00:35:46,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-16 00:35:46,320 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:35:46,321 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] [2019-11-16 00:35:46,321 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:35:46,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:46,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1604875389, now seen corresponding path program 1 times [2019-11-16 00:35:46,321 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:46,321 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453329170] [2019-11-16 00:35:46,321 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:46,321 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:46,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:46,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:46,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:35:46,452 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453329170] [2019-11-16 00:35:46,453 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:35:46,453 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:35:46,453 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481959222] [2019-11-16 00:35:46,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:35:46,454 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:35:46,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:35:46,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:35:46,454 INFO L87 Difference]: Start difference. First operand 12713 states and 35688 transitions. Second operand 7 states. [2019-11-16 00:35:46,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:35:46,901 INFO L93 Difference]: Finished difference Result 15475 states and 42653 transitions. [2019-11-16 00:35:46,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:35:46,901 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-11-16 00:35:46,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:35:46,919 INFO L225 Difference]: With dead ends: 15475 [2019-11-16 00:35:46,919 INFO L226 Difference]: Without dead ends: 15475 [2019-11-16 00:35:46,920 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-16 00:35:46,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15475 states. [2019-11-16 00:35:47,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15475 to 12109. [2019-11-16 00:35:47,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12109 states. [2019-11-16 00:35:47,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12109 states to 12109 states and 33424 transitions. [2019-11-16 00:35:47,077 INFO L78 Accepts]: Start accepts. Automaton has 12109 states and 33424 transitions. Word has length 67 [2019-11-16 00:35:47,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:35:47,077 INFO L462 AbstractCegarLoop]: Abstraction has 12109 states and 33424 transitions. [2019-11-16 00:35:47,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:35:47,077 INFO L276 IsEmpty]: Start isEmpty. Operand 12109 states and 33424 transitions. [2019-11-16 00:35:47,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-16 00:35:47,084 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:35:47,084 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] [2019-11-16 00:35:47,084 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:35:47,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:47,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1802588226, now seen corresponding path program 1 times [2019-11-16 00:35:47,084 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:47,084 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206934585] [2019-11-16 00:35:47,085 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:47,085 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:47,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:47,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:47,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:35:47,155 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206934585] [2019-11-16 00:35:47,156 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:35:47,156 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:35:47,156 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572063829] [2019-11-16 00:35:47,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:35:47,157 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:35:47,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:35:47,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:35:47,157 INFO L87 Difference]: Start difference. First operand 12109 states and 33424 transitions. Second operand 5 states. [2019-11-16 00:35:47,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:35:47,222 INFO L93 Difference]: Finished difference Result 4024 states and 9371 transitions. [2019-11-16 00:35:47,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:35:47,222 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-11-16 00:35:47,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:35:47,225 INFO L225 Difference]: With dead ends: 4024 [2019-11-16 00:35:47,225 INFO L226 Difference]: Without dead ends: 3351 [2019-11-16 00:35:47,225 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:35:47,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3351 states. [2019-11-16 00:35:47,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3351 to 3091. [2019-11-16 00:35:47,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3091 states. [2019-11-16 00:35:47,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3091 states to 3091 states and 7077 transitions. [2019-11-16 00:35:47,257 INFO L78 Accepts]: Start accepts. Automaton has 3091 states and 7077 transitions. Word has length 67 [2019-11-16 00:35:47,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:35:47,258 INFO L462 AbstractCegarLoop]: Abstraction has 3091 states and 7077 transitions. [2019-11-16 00:35:47,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:35:47,258 INFO L276 IsEmpty]: Start isEmpty. Operand 3091 states and 7077 transitions. [2019-11-16 00:35:47,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-16 00:35:47,261 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:35:47,261 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] [2019-11-16 00:35:47,261 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:35:47,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:47,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1669694699, now seen corresponding path program 1 times [2019-11-16 00:35:47,262 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:47,262 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79265801] [2019-11-16 00:35:47,262 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:47,262 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:47,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:47,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:47,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:35:47,396 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79265801] [2019-11-16 00:35:47,397 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:35:47,397 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:35:47,397 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740376699] [2019-11-16 00:35:47,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:35:47,398 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:35:47,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:35:47,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:35:47,399 INFO L87 Difference]: Start difference. First operand 3091 states and 7077 transitions. Second operand 6 states. [2019-11-16 00:35:47,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:35:47,466 INFO L93 Difference]: Finished difference Result 3590 states and 8148 transitions. [2019-11-16 00:35:47,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:35:47,466 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2019-11-16 00:35:47,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:35:47,469 INFO L225 Difference]: With dead ends: 3590 [2019-11-16 00:35:47,470 INFO L226 Difference]: Without dead ends: 3590 [2019-11-16 00:35:47,470 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:35:47,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3590 states. [2019-11-16 00:35:47,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3590 to 3121. [2019-11-16 00:35:47,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2019-11-16 00:35:47,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 7125 transitions. [2019-11-16 00:35:47,501 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 7125 transitions. Word has length 84 [2019-11-16 00:35:47,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:35:47,502 INFO L462 AbstractCegarLoop]: Abstraction has 3121 states and 7125 transitions. [2019-11-16 00:35:47,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:35:47,502 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 7125 transitions. [2019-11-16 00:35:47,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-16 00:35:47,505 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:35:47,505 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] [2019-11-16 00:35:47,505 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:35:47,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:47,506 INFO L82 PathProgramCache]: Analyzing trace with hash 135719106, now seen corresponding path program 1 times [2019-11-16 00:35:47,506 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:47,506 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720110486] [2019-11-16 00:35:47,506 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:47,506 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:47,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:47,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:47,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:35:47,608 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720110486] [2019-11-16 00:35:47,608 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:35:47,608 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:35:47,610 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372537807] [2019-11-16 00:35:47,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:35:47,611 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:35:47,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:35:47,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:35:47,614 INFO L87 Difference]: Start difference. First operand 3121 states and 7125 transitions. Second operand 5 states. [2019-11-16 00:35:47,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:35:47,666 INFO L93 Difference]: Finished difference Result 3121 states and 7116 transitions. [2019-11-16 00:35:47,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:35:47,666 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-11-16 00:35:47,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:35:47,671 INFO L225 Difference]: With dead ends: 3121 [2019-11-16 00:35:47,671 INFO L226 Difference]: Without dead ends: 3121 [2019-11-16 00:35:47,672 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:35:47,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3121 states. [2019-11-16 00:35:47,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3121 to 2807. [2019-11-16 00:35:47,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2807 states. [2019-11-16 00:35:47,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2807 states to 2807 states and 6423 transitions. [2019-11-16 00:35:47,712 INFO L78 Accepts]: Start accepts. Automaton has 2807 states and 6423 transitions. Word has length 84 [2019-11-16 00:35:47,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:35:47,713 INFO L462 AbstractCegarLoop]: Abstraction has 2807 states and 6423 transitions. [2019-11-16 00:35:47,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:35:47,713 INFO L276 IsEmpty]: Start isEmpty. Operand 2807 states and 6423 transitions. [2019-11-16 00:35:47,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-16 00:35:47,717 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:35:47,717 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] [2019-11-16 00:35:47,717 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:35:47,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:47,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1023222787, now seen corresponding path program 1 times [2019-11-16 00:35:47,718 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:47,718 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236874053] [2019-11-16 00:35:47,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:47,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:47,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:47,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:47,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:35:47,817 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236874053] [2019-11-16 00:35:47,817 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:35:47,817 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:35:47,817 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212253835] [2019-11-16 00:35:47,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:35:47,818 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:35:47,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:35:47,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:35:47,819 INFO L87 Difference]: Start difference. First operand 2807 states and 6423 transitions. Second operand 6 states. [2019-11-16 00:35:47,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:35:47,991 INFO L93 Difference]: Finished difference Result 2934 states and 6677 transitions. [2019-11-16 00:35:47,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:35:47,992 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2019-11-16 00:35:47,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:35:47,994 INFO L225 Difference]: With dead ends: 2934 [2019-11-16 00:35:47,994 INFO L226 Difference]: Without dead ends: 2934 [2019-11-16 00:35:47,994 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:35:47,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2934 states. [2019-11-16 00:35:48,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2934 to 2735. [2019-11-16 00:35:48,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2735 states. [2019-11-16 00:35:48,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2735 states to 2735 states and 6254 transitions. [2019-11-16 00:35:48,022 INFO L78 Accepts]: Start accepts. Automaton has 2735 states and 6254 transitions. Word has length 84 [2019-11-16 00:35:48,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:35:48,023 INFO L462 AbstractCegarLoop]: Abstraction has 2735 states and 6254 transitions. [2019-11-16 00:35:48,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:35:48,023 INFO L276 IsEmpty]: Start isEmpty. Operand 2735 states and 6254 transitions. [2019-11-16 00:35:48,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-16 00:35:48,025 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:35:48,026 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] [2019-11-16 00:35:48,026 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:35:48,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:48,026 INFO L82 PathProgramCache]: Analyzing trace with hash -659798873, now seen corresponding path program 1 times [2019-11-16 00:35:48,026 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:48,026 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543566896] [2019-11-16 00:35:48,026 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:48,026 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:48,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:48,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:48,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:35:48,185 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543566896] [2019-11-16 00:35:48,185 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:35:48,185 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-16 00:35:48,186 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982840691] [2019-11-16 00:35:48,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:35:48,189 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:35:48,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:35:48,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:35:48,189 INFO L87 Difference]: Start difference. First operand 2735 states and 6254 transitions. Second operand 9 states. [2019-11-16 00:35:48,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:35:48,753 INFO L93 Difference]: Finished difference Result 9867 states and 22771 transitions. [2019-11-16 00:35:48,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-16 00:35:48,753 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-11-16 00:35:48,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:35:48,759 INFO L225 Difference]: With dead ends: 9867 [2019-11-16 00:35:48,759 INFO L226 Difference]: Without dead ends: 6436 [2019-11-16 00:35:48,760 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2019-11-16 00:35:48,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6436 states. [2019-11-16 00:35:48,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6436 to 2894. [2019-11-16 00:35:48,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2894 states. [2019-11-16 00:35:48,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2894 states to 2894 states and 6592 transitions. [2019-11-16 00:35:48,802 INFO L78 Accepts]: Start accepts. Automaton has 2894 states and 6592 transitions. Word has length 84 [2019-11-16 00:35:48,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:35:48,803 INFO L462 AbstractCegarLoop]: Abstraction has 2894 states and 6592 transitions. [2019-11-16 00:35:48,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:35:48,803 INFO L276 IsEmpty]: Start isEmpty. Operand 2894 states and 6592 transitions. [2019-11-16 00:35:48,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-16 00:35:48,805 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:35:48,805 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] [2019-11-16 00:35:48,805 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:35:48,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:48,806 INFO L82 PathProgramCache]: Analyzing trace with hash 429611939, now seen corresponding path program 2 times [2019-11-16 00:35:48,806 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:48,806 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823237539] [2019-11-16 00:35:48,806 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:48,806 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:48,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:48,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:48,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:35:48,899 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823237539] [2019-11-16 00:35:48,899 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:35:48,899 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:35:48,899 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590958759] [2019-11-16 00:35:48,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:35:48,900 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:35:48,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:35:48,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:35:48,901 INFO L87 Difference]: Start difference. First operand 2894 states and 6592 transitions. Second operand 6 states. [2019-11-16 00:35:49,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:35:49,001 INFO L93 Difference]: Finished difference Result 4917 states and 11222 transitions. [2019-11-16 00:35:49,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:35:49,001 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2019-11-16 00:35:49,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:35:49,004 INFO L225 Difference]: With dead ends: 4917 [2019-11-16 00:35:49,004 INFO L226 Difference]: Without dead ends: 2111 [2019-11-16 00:35:49,004 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:35:49,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2111 states. [2019-11-16 00:35:49,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2111 to 2111. [2019-11-16 00:35:49,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2111 states. [2019-11-16 00:35:49,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2111 states to 2111 states and 4774 transitions. [2019-11-16 00:35:49,026 INFO L78 Accepts]: Start accepts. Automaton has 2111 states and 4774 transitions. Word has length 84 [2019-11-16 00:35:49,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:35:49,026 INFO L462 AbstractCegarLoop]: Abstraction has 2111 states and 4774 transitions. [2019-11-16 00:35:49,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:35:49,027 INFO L276 IsEmpty]: Start isEmpty. Operand 2111 states and 4774 transitions. [2019-11-16 00:35:49,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-16 00:35:49,029 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:35:49,029 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] [2019-11-16 00:35:49,030 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:35:49,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:49,030 INFO L82 PathProgramCache]: Analyzing trace with hash 605039045, now seen corresponding path program 3 times [2019-11-16 00:35:49,030 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:49,030 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208953422] [2019-11-16 00:35:49,031 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:49,031 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:49,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:49,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:35:49,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:35:49,115 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:35:49,116 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-16 00:35:49,279 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-16 00:35:49,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:35:49 BasicIcfg [2019-11-16 00:35:49,280 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:35:49,281 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:35:49,281 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:35:49,281 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:35:49,282 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:35:19" (3/4) ... [2019-11-16 00:35:49,284 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-16 00:35:49,446 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8a89a9a5-3906-41ca-969d-247dd745c2a0/bin/uautomizer/witness.graphml [2019-11-16 00:35:49,447 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:35:49,449 INFO L168 Benchmark]: Toolchain (without parser) took 31447.78 ms. Allocated memory was 1.0 GB in the beginning and 3.3 GB in the end (delta: 2.2 GB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -139.3 MB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2019-11-16 00:35:49,449 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:35:49,450 INFO L168 Benchmark]: CACSL2BoogieTranslator took 642.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.2 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -190.5 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:35:49,450 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:35:49,450 INFO L168 Benchmark]: Boogie Preprocessor took 45.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:35:49,451 INFO L168 Benchmark]: RCFGBuilder took 858.29 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: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:35:49,451 INFO L168 Benchmark]: TraceAbstraction took 29679.60 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 1.1 GB in the end (delta: -54.3 MB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2019-11-16 00:35:49,451 INFO L168 Benchmark]: Witness Printer took 166.06 ms. Allocated memory is still 3.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.3 MB). Peak memory consumption was 52.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:35:49,453 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.19 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 642.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.2 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -190.5 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 858.29 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: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 29679.60 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 1.1 GB in the end (delta: -54.3 MB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. * Witness Printer took 166.06 ms. Allocated memory is still 3.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.3 MB). Peak memory consumption was 52.3 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_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L701] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L702] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L703] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L705] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L706] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L707] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L708] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L709] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L710] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L711] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L712] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L713] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L714] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L715] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L716] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L717] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L718] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L719] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L721] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L722] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L723] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L799] 0 pthread_t t1635; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L800] FCALL, FORK 0 pthread_create(&t1635, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L801] 0 pthread_t t1636; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L802] FCALL, FORK 0 pthread_create(&t1636, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L757] 2 x$w_buff1 = x$w_buff0 [L758] 2 x$w_buff0 = 1 [L759] 2 x$w_buff1_used = x$w_buff0_used [L760] 2 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L762] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L763] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L764] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L765] 2 x$r_buff0_thd2 = (_Bool)1 [L768] 2 y = 1 [L771] 2 __unbuffered_p1_EAX = y [L774] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L727] 1 y = 2 [L732] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L733] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L734] 1 x$flush_delayed = weak$$choice2 [L735] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L737] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L738] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L739] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L740] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L741] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L742] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L742] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 1 x = x$flush_delayed ? x$mem_tmp : x [L745] 1 x$flush_delayed = (_Bool)0 [L750] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L779] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L780] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L781] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L784] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L804] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L809] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L809] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L810] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L810] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L811] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L811] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L812] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L812] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L815] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 195 locations, 3 error locations. Result: UNSAFE, OverallTime: 29.5s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 12.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6269 SDtfs, 7542 SDslu, 14459 SDs, 0 SdLazy, 4616 SolverSat, 349 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 218 GetRequests, 62 SyntacticMatches, 13 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57889occurred 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: 11.5s AutomataMinimizationTime, 24 MinimizatonAttempts, 63718 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1599 NumberOfCodeBlocks, 1599 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1491 ConstructedInterpolants, 0 QuantifiedInterpolants, 264507 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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...