./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe033_pso.oepc.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_80099ee4-1bce-4e1e-a8ee-52f451665809/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_80099ee4-1bce-4e1e-a8ee-52f451665809/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_80099ee4-1bce-4e1e-a8ee-52f451665809/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_80099ee4-1bce-4e1e-a8ee-52f451665809/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe033_pso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_80099ee4-1bce-4e1e-a8ee-52f451665809/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_80099ee4-1bce-4e1e-a8ee-52f451665809/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 9356c038883eaf32b3f62e36a61d1d73667dc10d .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:19:25,733 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:19:25,734 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:19:25,745 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:19:25,745 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:19:25,746 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:19:25,748 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:19:25,750 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:19:25,752 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:19:25,753 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:19:25,754 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:19:25,755 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:19:25,755 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:19:25,756 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:19:25,757 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:19:25,758 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:19:25,759 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:19:25,760 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:19:25,762 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:19:25,764 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:19:25,765 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:19:25,766 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:19:25,768 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:19:25,768 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:19:25,771 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:19:25,771 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:19:25,772 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:19:25,773 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:19:25,773 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:19:25,774 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:19:25,774 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:19:25,775 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:19:25,776 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:19:25,777 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:19:25,778 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:19:25,778 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:19:25,778 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:19:25,779 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:19:25,779 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:19:25,780 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:19:25,781 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:19:25,781 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_80099ee4-1bce-4e1e-a8ee-52f451665809/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:19:25,794 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:19:25,794 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:19:25,795 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:19:25,796 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:19:25,796 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:19:25,796 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:19:25,797 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:19:25,797 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:19:25,797 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:19:25,797 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:19:25,798 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:19:25,798 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:19:25,798 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:19:25,798 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:19:25,798 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:19:25,799 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:19:25,799 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:19:25,799 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:19:25,799 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:19:25,800 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:19:25,800 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:19:25,800 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:19:25,800 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:19:25,801 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:19:25,801 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:19:25,801 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:19:25,801 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:19:25,802 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:19:25,802 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_80099ee4-1bce-4e1e-a8ee-52f451665809/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 -> 9356c038883eaf32b3f62e36a61d1d73667dc10d [2019-11-16 00:19:25,828 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:19:25,838 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:19:25,841 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:19:25,842 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:19:25,843 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:19:25,844 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_80099ee4-1bce-4e1e-a8ee-52f451665809/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe033_pso.oepc.i [2019-11-16 00:19:25,896 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_80099ee4-1bce-4e1e-a8ee-52f451665809/bin/uautomizer/data/5d2a2f81b/a0f5a636d76e407ea916d8d84f3ac5a0/FLAG681c8adce [2019-11-16 00:19:26,320 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:19:26,321 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_80099ee4-1bce-4e1e-a8ee-52f451665809/sv-benchmarks/c/pthread-wmm/safe033_pso.oepc.i [2019-11-16 00:19:26,335 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_80099ee4-1bce-4e1e-a8ee-52f451665809/bin/uautomizer/data/5d2a2f81b/a0f5a636d76e407ea916d8d84f3ac5a0/FLAG681c8adce [2019-11-16 00:19:26,640 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_80099ee4-1bce-4e1e-a8ee-52f451665809/bin/uautomizer/data/5d2a2f81b/a0f5a636d76e407ea916d8d84f3ac5a0 [2019-11-16 00:19:26,642 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:19:26,643 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:19:26,644 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:19:26,644 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:19:26,647 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:19:26,648 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:19:26" (1/1) ... [2019-11-16 00:19:26,650 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6634d154 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:26, skipping insertion in model container [2019-11-16 00:19:26,651 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:19:26" (1/1) ... [2019-11-16 00:19:26,658 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:19:26,702 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:19:27,139 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:19:27,151 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:19:27,211 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:19:27,280 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:19:27,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:27 WrapperNode [2019-11-16 00:19:27,281 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:19:27,282 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:19:27,282 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:19:27,282 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:19:27,291 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:19:27" (1/1) ... [2019-11-16 00:19:27,308 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:19:27" (1/1) ... [2019-11-16 00:19:27,339 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:19:27,341 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:19:27,342 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:19:27,342 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:19:27,352 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:27" (1/1) ... [2019-11-16 00:19:27,352 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:27" (1/1) ... [2019-11-16 00:19:27,357 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:27" (1/1) ... [2019-11-16 00:19:27,357 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:27" (1/1) ... [2019-11-16 00:19:27,368 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:27" (1/1) ... [2019-11-16 00:19:27,373 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:27" (1/1) ... [2019-11-16 00:19:27,376 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:27" (1/1) ... [2019-11-16 00:19:27,381 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:19:27,381 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:19:27,382 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:19:27,382 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:19:27,383 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_80099ee4-1bce-4e1e-a8ee-52f451665809/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:19:27,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:19:27,448 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-16 00:19:27,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:19:27,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:19:27,449 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-16 00:19:27,450 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-16 00:19:27,450 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-16 00:19:27,450 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-16 00:19:27,450 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-16 00:19:27,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:19:27,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:19:27,453 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:19:28,137 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:19:28,137 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-16 00:19:28,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:19:28 BoogieIcfgContainer [2019-11-16 00:19:28,138 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:19:28,139 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:19:28,139 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:19:28,142 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:19:28,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:19:26" (1/3) ... [2019-11-16 00:19:28,143 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aad2aae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:19:28, skipping insertion in model container [2019-11-16 00:19:28,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:27" (2/3) ... [2019-11-16 00:19:28,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aad2aae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:19:28, skipping insertion in model container [2019-11-16 00:19:28,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:19:28" (3/3) ... [2019-11-16 00:19:28,148 INFO L109 eAbstractionObserver]: Analyzing ICFG safe033_pso.oepc.i [2019-11-16 00:19:28,192 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,192 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,192 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,192 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,193 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,193 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,193 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,193 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,193 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,194 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,194 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,194 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,194 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,195 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,195 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,195 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,195 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,195 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,195 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,196 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,196 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,196 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,196 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,196 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,197 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,197 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,197 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,197 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,197 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,197 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,198 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,198 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,198 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,198 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,198 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,199 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,199 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,199 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,199 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,200 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,200 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,201 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,201 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,202 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,202 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,203 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,204 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,204 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,204 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,204 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,204 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,205 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,205 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,205 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,205 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,206 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,206 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,206 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,206 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,206 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,207 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,207 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,208 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,208 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,208 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,209 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,209 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,210 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,210 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,210 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,211 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,212 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,212 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,212 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,212 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,213 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,213 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,213 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,213 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,213 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,213 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,213 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,213 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,214 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,214 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,214 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,214 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,214 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,215 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,215 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,215 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,215 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,215 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,216 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,216 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,216 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,216 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,216 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,216 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,217 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,217 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,217 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,217 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,218 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,218 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,218 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,218 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,218 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,218 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,219 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,219 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,219 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,219 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,219 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,219 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,219 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,220 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,220 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,220 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,220 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,220 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,220 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,221 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,221 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,221 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,221 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,221 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,222 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:19:28,227 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-16 00:19:28,227 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:19:28,235 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-16 00:19:28,246 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-16 00:19:28,267 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:19:28,268 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:19:28,268 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:19:28,268 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:19:28,268 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:19:28,268 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:19:28,268 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:19:28,269 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:19:28,289 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 127 places, 159 transitions [2019-11-16 00:19:30,135 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25973 states. [2019-11-16 00:19:30,136 INFO L276 IsEmpty]: Start isEmpty. Operand 25973 states. [2019-11-16 00:19:30,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-16 00:19:30,145 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:30,146 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] [2019-11-16 00:19:30,148 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:30,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:30,153 INFO L82 PathProgramCache]: Analyzing trace with hash 531989487, now seen corresponding path program 1 times [2019-11-16 00:19:30,159 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:30,160 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777739202] [2019-11-16 00:19:30,160 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:30,160 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:30,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:30,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:30,435 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:19:30,440 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777739202] [2019-11-16 00:19:30,441 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:30,442 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:19:30,442 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978878027] [2019-11-16 00:19:30,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:19:30,447 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:30,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:19:30,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:19:30,464 INFO L87 Difference]: Start difference. First operand 25973 states. Second operand 4 states. [2019-11-16 00:19:31,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:31,081 INFO L93 Difference]: Finished difference Result 26613 states and 102118 transitions. [2019-11-16 00:19:31,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:19:31,083 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-11-16 00:19:31,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:31,318 INFO L225 Difference]: With dead ends: 26613 [2019-11-16 00:19:31,318 INFO L226 Difference]: Without dead ends: 20357 [2019-11-16 00:19:31,320 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:19:31,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20357 states. [2019-11-16 00:19:32,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20357 to 20357. [2019-11-16 00:19:32,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20357 states. [2019-11-16 00:19:32,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20357 states to 20357 states and 78422 transitions. [2019-11-16 00:19:32,546 INFO L78 Accepts]: Start accepts. Automaton has 20357 states and 78422 transitions. Word has length 36 [2019-11-16 00:19:32,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:32,547 INFO L462 AbstractCegarLoop]: Abstraction has 20357 states and 78422 transitions. [2019-11-16 00:19:32,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:19:32,548 INFO L276 IsEmpty]: Start isEmpty. Operand 20357 states and 78422 transitions. [2019-11-16 00:19:32,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-16 00:19:32,561 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:32,562 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] [2019-11-16 00:19:32,562 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:32,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:32,563 INFO L82 PathProgramCache]: Analyzing trace with hash 998522529, now seen corresponding path program 1 times [2019-11-16 00:19:32,563 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:32,563 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700953124] [2019-11-16 00:19:32,564 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:32,564 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:32,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:32,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:32,702 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:19:32,702 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700953124] [2019-11-16 00:19:32,702 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:32,702 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:19:32,703 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566109413] [2019-11-16 00:19:32,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:19:32,704 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:32,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:19:32,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:19:32,705 INFO L87 Difference]: Start difference. First operand 20357 states and 78422 transitions. Second operand 5 states. [2019-11-16 00:19:33,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:33,713 INFO L93 Difference]: Finished difference Result 31835 states and 116039 transitions. [2019-11-16 00:19:33,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:19:33,713 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-11-16 00:19:33,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:33,853 INFO L225 Difference]: With dead ends: 31835 [2019-11-16 00:19:33,854 INFO L226 Difference]: Without dead ends: 31283 [2019-11-16 00:19:33,855 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:19:34,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31283 states. [2019-11-16 00:19:35,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31283 to 29702. [2019-11-16 00:19:35,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29702 states. [2019-11-16 00:19:35,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29702 states to 29702 states and 109516 transitions. [2019-11-16 00:19:35,097 INFO L78 Accepts]: Start accepts. Automaton has 29702 states and 109516 transitions. Word has length 44 [2019-11-16 00:19:35,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:35,099 INFO L462 AbstractCegarLoop]: Abstraction has 29702 states and 109516 transitions. [2019-11-16 00:19:35,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:19:35,100 INFO L276 IsEmpty]: Start isEmpty. Operand 29702 states and 109516 transitions. [2019-11-16 00:19:35,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-16 00:19:35,107 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:35,107 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] [2019-11-16 00:19:35,108 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:35,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:35,108 INFO L82 PathProgramCache]: Analyzing trace with hash -192170192, now seen corresponding path program 1 times [2019-11-16 00:19:35,108 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:35,109 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901191151] [2019-11-16 00:19:35,111 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:35,112 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:35,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:35,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:35,230 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:19:35,230 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901191151] [2019-11-16 00:19:35,231 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:35,231 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:19:35,231 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150927881] [2019-11-16 00:19:35,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:19:35,232 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:35,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:19:35,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:19:35,232 INFO L87 Difference]: Start difference. First operand 29702 states and 109516 transitions. Second operand 5 states. [2019-11-16 00:19:36,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:36,123 INFO L93 Difference]: Finished difference Result 38693 states and 139688 transitions. [2019-11-16 00:19:36,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:19:36,124 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-16 00:19:36,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:36,331 INFO L225 Difference]: With dead ends: 38693 [2019-11-16 00:19:36,331 INFO L226 Difference]: Without dead ends: 38245 [2019-11-16 00:19:36,332 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:19:36,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38245 states. [2019-11-16 00:19:37,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38245 to 32948. [2019-11-16 00:19:37,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32948 states. [2019-11-16 00:19:37,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32948 states to 32948 states and 120525 transitions. [2019-11-16 00:19:37,189 INFO L78 Accepts]: Start accepts. Automaton has 32948 states and 120525 transitions. Word has length 45 [2019-11-16 00:19:37,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:37,190 INFO L462 AbstractCegarLoop]: Abstraction has 32948 states and 120525 transitions. [2019-11-16 00:19:37,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:19:37,190 INFO L276 IsEmpty]: Start isEmpty. Operand 32948 states and 120525 transitions. [2019-11-16 00:19:37,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-16 00:19:37,197 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:37,198 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:19:37,198 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:37,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:37,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1923602230, now seen corresponding path program 1 times [2019-11-16 00:19:37,199 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:37,199 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21126161] [2019-11-16 00:19:37,201 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:37,201 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:37,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:37,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:37,256 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:19:37,257 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21126161] [2019-11-16 00:19:37,257 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:37,257 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:19:37,257 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966221954] [2019-11-16 00:19:37,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:19:37,258 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:37,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:19:37,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:19:37,258 INFO L87 Difference]: Start difference. First operand 32948 states and 120525 transitions. Second operand 3 states. [2019-11-16 00:19:37,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:37,481 INFO L93 Difference]: Finished difference Result 42409 states and 152016 transitions. [2019-11-16 00:19:37,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:19:37,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-11-16 00:19:37,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:37,581 INFO L225 Difference]: With dead ends: 42409 [2019-11-16 00:19:37,581 INFO L226 Difference]: Without dead ends: 42409 [2019-11-16 00:19:37,582 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:19:37,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42409 states. [2019-11-16 00:19:38,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42409 to 37662. [2019-11-16 00:19:38,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37662 states. [2019-11-16 00:19:38,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37662 states to 37662 states and 136329 transitions. [2019-11-16 00:19:38,761 INFO L78 Accepts]: Start accepts. Automaton has 37662 states and 136329 transitions. Word has length 47 [2019-11-16 00:19:38,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:38,761 INFO L462 AbstractCegarLoop]: Abstraction has 37662 states and 136329 transitions. [2019-11-16 00:19:38,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:19:38,761 INFO L276 IsEmpty]: Start isEmpty. Operand 37662 states and 136329 transitions. [2019-11-16 00:19:38,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-16 00:19:38,777 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:38,778 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] [2019-11-16 00:19:38,778 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:38,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:38,778 INFO L82 PathProgramCache]: Analyzing trace with hash -629683857, now seen corresponding path program 1 times [2019-11-16 00:19:38,779 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:38,779 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766347534] [2019-11-16 00:19:38,779 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:38,779 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:38,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:38,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:38,859 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:19:38,859 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766347534] [2019-11-16 00:19:38,860 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:38,860 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:19:38,860 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819403103] [2019-11-16 00:19:38,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:19:38,860 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:38,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:19:38,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:19:38,861 INFO L87 Difference]: Start difference. First operand 37662 states and 136329 transitions. Second operand 6 states. [2019-11-16 00:19:39,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:39,563 INFO L93 Difference]: Finished difference Result 48753 states and 172978 transitions. [2019-11-16 00:19:39,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:19:39,564 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-11-16 00:19:39,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:39,696 INFO L225 Difference]: With dead ends: 48753 [2019-11-16 00:19:39,696 INFO L226 Difference]: Without dead ends: 48233 [2019-11-16 00:19:39,698 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:19:39,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48233 states. [2019-11-16 00:19:40,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48233 to 38226. [2019-11-16 00:19:40,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38226 states. [2019-11-16 00:19:40,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38226 states to 38226 states and 138492 transitions. [2019-11-16 00:19:40,906 INFO L78 Accepts]: Start accepts. Automaton has 38226 states and 138492 transitions. Word has length 51 [2019-11-16 00:19:40,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:40,906 INFO L462 AbstractCegarLoop]: Abstraction has 38226 states and 138492 transitions. [2019-11-16 00:19:40,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:19:40,906 INFO L276 IsEmpty]: Start isEmpty. Operand 38226 states and 138492 transitions. [2019-11-16 00:19:40,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-16 00:19:40,920 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:40,920 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] [2019-11-16 00:19:40,920 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:40,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:40,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1938707736, now seen corresponding path program 1 times [2019-11-16 00:19:40,921 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:40,921 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121098335] [2019-11-16 00:19:40,921 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:40,921 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:40,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:40,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:41,040 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:19:41,040 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121098335] [2019-11-16 00:19:41,040 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:41,041 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:19:41,041 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184752234] [2019-11-16 00:19:41,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:19:41,041 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:41,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:19:41,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:19:41,042 INFO L87 Difference]: Start difference. First operand 38226 states and 138492 transitions. Second operand 6 states. [2019-11-16 00:19:41,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:41,843 INFO L93 Difference]: Finished difference Result 53002 states and 189568 transitions. [2019-11-16 00:19:41,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:19:41,844 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-11-16 00:19:41,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:41,988 INFO L225 Difference]: With dead ends: 53002 [2019-11-16 00:19:41,989 INFO L226 Difference]: Without dead ends: 52026 [2019-11-16 00:19:41,989 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:19:42,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52026 states. [2019-11-16 00:19:42,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52026 to 48779. [2019-11-16 00:19:42,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48779 states. [2019-11-16 00:19:42,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48779 states to 48779 states and 175223 transitions. [2019-11-16 00:19:42,886 INFO L78 Accepts]: Start accepts. Automaton has 48779 states and 175223 transitions. Word has length 51 [2019-11-16 00:19:42,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:42,887 INFO L462 AbstractCegarLoop]: Abstraction has 48779 states and 175223 transitions. [2019-11-16 00:19:42,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:19:42,887 INFO L276 IsEmpty]: Start isEmpty. Operand 48779 states and 175223 transitions. [2019-11-16 00:19:42,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-16 00:19:42,902 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:42,902 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] [2019-11-16 00:19:42,902 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:42,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:42,903 INFO L82 PathProgramCache]: Analyzing trace with hash 559308201, now seen corresponding path program 1 times [2019-11-16 00:19:42,903 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:42,903 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673325716] [2019-11-16 00:19:42,903 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:42,903 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:42,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:42,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:43,010 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:19:43,010 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673325716] [2019-11-16 00:19:43,011 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:43,011 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:19:43,011 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763947811] [2019-11-16 00:19:43,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:19:43,012 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:43,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:19:43,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:19:43,013 INFO L87 Difference]: Start difference. First operand 48779 states and 175223 transitions. Second operand 7 states. [2019-11-16 00:19:44,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:44,313 INFO L93 Difference]: Finished difference Result 70894 states and 244520 transitions. [2019-11-16 00:19:44,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:19:44,314 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-11-16 00:19:44,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:44,450 INFO L225 Difference]: With dead ends: 70894 [2019-11-16 00:19:44,451 INFO L226 Difference]: Without dead ends: 70894 [2019-11-16 00:19:44,451 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:19:44,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70894 states. [2019-11-16 00:19:45,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70894 to 57887. [2019-11-16 00:19:45,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57887 states. [2019-11-16 00:19:45,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57887 states to 57887 states and 203147 transitions. [2019-11-16 00:19:45,517 INFO L78 Accepts]: Start accepts. Automaton has 57887 states and 203147 transitions. Word has length 51 [2019-11-16 00:19:45,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:45,517 INFO L462 AbstractCegarLoop]: Abstraction has 57887 states and 203147 transitions. [2019-11-16 00:19:45,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:19:45,518 INFO L276 IsEmpty]: Start isEmpty. Operand 57887 states and 203147 transitions. [2019-11-16 00:19:45,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-16 00:19:45,530 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:45,530 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] [2019-11-16 00:19:45,531 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:45,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:45,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1446811882, now seen corresponding path program 1 times [2019-11-16 00:19:45,531 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:45,531 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238619996] [2019-11-16 00:19:45,531 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:45,531 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:45,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:45,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:45,585 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:19:45,586 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238619996] [2019-11-16 00:19:45,586 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:45,586 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:19:45,586 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744623] [2019-11-16 00:19:45,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:19:45,587 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:45,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:19:45,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:19:45,587 INFO L87 Difference]: Start difference. First operand 57887 states and 203147 transitions. Second operand 3 states. [2019-11-16 00:19:45,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:45,800 INFO L93 Difference]: Finished difference Result 43853 states and 152830 transitions. [2019-11-16 00:19:45,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:19:45,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-11-16 00:19:45,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:45,908 INFO L225 Difference]: With dead ends: 43853 [2019-11-16 00:19:45,908 INFO L226 Difference]: Without dead ends: 43349 [2019-11-16 00:19:45,909 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:19:46,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43349 states. [2019-11-16 00:19:46,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43349 to 41883. [2019-11-16 00:19:46,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41883 states. [2019-11-16 00:19:47,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41883 states to 41883 states and 146701 transitions. [2019-11-16 00:19:47,083 INFO L78 Accepts]: Start accepts. Automaton has 41883 states and 146701 transitions. Word has length 51 [2019-11-16 00:19:47,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:47,083 INFO L462 AbstractCegarLoop]: Abstraction has 41883 states and 146701 transitions. [2019-11-16 00:19:47,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:19:47,083 INFO L276 IsEmpty]: Start isEmpty. Operand 41883 states and 146701 transitions. [2019-11-16 00:19:47,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-16 00:19:47,094 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:47,094 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:19:47,094 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:47,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:47,095 INFO L82 PathProgramCache]: Analyzing trace with hash 371712380, now seen corresponding path program 1 times [2019-11-16 00:19:47,095 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:47,095 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662589180] [2019-11-16 00:19:47,095 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:47,095 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:47,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:47,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:47,195 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:19:47,195 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662589180] [2019-11-16 00:19:47,196 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:47,196 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:19:47,196 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965821970] [2019-11-16 00:19:47,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:19:47,196 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:47,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:19:47,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:19:47,197 INFO L87 Difference]: Start difference. First operand 41883 states and 146701 transitions. Second operand 6 states. [2019-11-16 00:19:47,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:47,860 INFO L93 Difference]: Finished difference Result 54546 states and 184831 transitions. [2019-11-16 00:19:47,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:19:47,860 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-11-16 00:19:47,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:47,971 INFO L225 Difference]: With dead ends: 54546 [2019-11-16 00:19:47,971 INFO L226 Difference]: Without dead ends: 54546 [2019-11-16 00:19:47,972 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:19:48,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54546 states. [2019-11-16 00:19:48,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54546 to 45858. [2019-11-16 00:19:48,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45858 states. [2019-11-16 00:19:48,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45858 states to 45858 states and 158164 transitions. [2019-11-16 00:19:48,812 INFO L78 Accepts]: Start accepts. Automaton has 45858 states and 158164 transitions. Word has length 52 [2019-11-16 00:19:48,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:48,813 INFO L462 AbstractCegarLoop]: Abstraction has 45858 states and 158164 transitions. [2019-11-16 00:19:48,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:19:48,813 INFO L276 IsEmpty]: Start isEmpty. Operand 45858 states and 158164 transitions. [2019-11-16 00:19:48,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-16 00:19:48,824 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:48,824 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:19:48,824 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:48,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:48,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1259216061, now seen corresponding path program 1 times [2019-11-16 00:19:48,825 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:48,825 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513132185] [2019-11-16 00:19:48,826 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:48,826 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:48,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:48,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:48,893 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:19:48,894 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513132185] [2019-11-16 00:19:48,894 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:48,894 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:19:48,894 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579964306] [2019-11-16 00:19:48,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:19:48,895 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:48,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:19:48,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:19:48,895 INFO L87 Difference]: Start difference. First operand 45858 states and 158164 transitions. Second operand 4 states. [2019-11-16 00:19:48,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:48,947 INFO L93 Difference]: Finished difference Result 8160 states and 24868 transitions. [2019-11-16 00:19:48,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:19:48,947 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-16 00:19:48,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:48,959 INFO L225 Difference]: With dead ends: 8160 [2019-11-16 00:19:48,959 INFO L226 Difference]: Without dead ends: 6751 [2019-11-16 00:19:48,960 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:19:48,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6751 states. [2019-11-16 00:19:49,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6751 to 6703. [2019-11-16 00:19:49,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6703 states. [2019-11-16 00:19:49,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6703 states to 6703 states and 20037 transitions. [2019-11-16 00:19:49,072 INFO L78 Accepts]: Start accepts. Automaton has 6703 states and 20037 transitions. Word has length 52 [2019-11-16 00:19:49,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:49,072 INFO L462 AbstractCegarLoop]: Abstraction has 6703 states and 20037 transitions. [2019-11-16 00:19:49,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:19:49,072 INFO L276 IsEmpty]: Start isEmpty. Operand 6703 states and 20037 transitions. [2019-11-16 00:19:49,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-16 00:19:49,077 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:49,077 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] [2019-11-16 00:19:49,077 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:49,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:49,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1556006386, now seen corresponding path program 1 times [2019-11-16 00:19:49,078 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:49,078 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548484916] [2019-11-16 00:19:49,078 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:49,078 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:49,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:49,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:49,159 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:19:49,159 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548484916] [2019-11-16 00:19:49,160 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:49,160 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:19:49,160 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82684697] [2019-11-16 00:19:49,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:19:49,160 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:49,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:19:49,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:19:49,161 INFO L87 Difference]: Start difference. First operand 6703 states and 20037 transitions. Second operand 4 states. [2019-11-16 00:19:49,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:49,307 INFO L93 Difference]: Finished difference Result 7888 states and 23386 transitions. [2019-11-16 00:19:49,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:19:49,308 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-11-16 00:19:49,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:49,320 INFO L225 Difference]: With dead ends: 7888 [2019-11-16 00:19:49,321 INFO L226 Difference]: Without dead ends: 7888 [2019-11-16 00:19:49,321 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:19:49,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7888 states. [2019-11-16 00:19:49,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7888 to 7210. [2019-11-16 00:19:49,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7210 states. [2019-11-16 00:19:49,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7210 states to 7210 states and 21443 transitions. [2019-11-16 00:19:49,443 INFO L78 Accepts]: Start accepts. Automaton has 7210 states and 21443 transitions. Word has length 61 [2019-11-16 00:19:49,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:49,444 INFO L462 AbstractCegarLoop]: Abstraction has 7210 states and 21443 transitions. [2019-11-16 00:19:49,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:19:49,444 INFO L276 IsEmpty]: Start isEmpty. Operand 7210 states and 21443 transitions. [2019-11-16 00:19:49,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-16 00:19:49,452 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:49,452 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] [2019-11-16 00:19:49,452 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:49,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:49,453 INFO L82 PathProgramCache]: Analyzing trace with hash 186803949, now seen corresponding path program 1 times [2019-11-16 00:19:49,453 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:49,453 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501016732] [2019-11-16 00:19:49,453 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:49,454 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:49,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:49,544 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:19:49,544 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501016732] [2019-11-16 00:19:49,544 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:49,544 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:19:49,545 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901365726] [2019-11-16 00:19:49,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:19:49,545 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:49,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:19:49,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:19:49,546 INFO L87 Difference]: Start difference. First operand 7210 states and 21443 transitions. Second operand 6 states. [2019-11-16 00:19:49,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:49,890 INFO L93 Difference]: Finished difference Result 9265 states and 27192 transitions. [2019-11-16 00:19:49,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:19:49,890 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-11-16 00:19:49,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:49,902 INFO L225 Difference]: With dead ends: 9265 [2019-11-16 00:19:49,902 INFO L226 Difference]: Without dead ends: 9217 [2019-11-16 00:19:49,903 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:19:49,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9217 states. [2019-11-16 00:19:50,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9217 to 8049. [2019-11-16 00:19:50,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8049 states. [2019-11-16 00:19:50,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8049 states to 8049 states and 23823 transitions. [2019-11-16 00:19:50,036 INFO L78 Accepts]: Start accepts. Automaton has 8049 states and 23823 transitions. Word has length 61 [2019-11-16 00:19:50,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:50,036 INFO L462 AbstractCegarLoop]: Abstraction has 8049 states and 23823 transitions. [2019-11-16 00:19:50,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:19:50,036 INFO L276 IsEmpty]: Start isEmpty. Operand 8049 states and 23823 transitions. [2019-11-16 00:19:50,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-16 00:19:50,044 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:50,045 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] [2019-11-16 00:19:50,045 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:50,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:50,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1202030726, now seen corresponding path program 1 times [2019-11-16 00:19:50,045 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:50,046 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437881719] [2019-11-16 00:19:50,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:50,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:50,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:50,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:50,105 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:19:50,105 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437881719] [2019-11-16 00:19:50,105 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:50,105 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:19:50,105 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791876348] [2019-11-16 00:19:50,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:19:50,106 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:50,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:19:50,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:19:50,106 INFO L87 Difference]: Start difference. First operand 8049 states and 23823 transitions. Second operand 4 states. [2019-11-16 00:19:50,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:50,299 INFO L93 Difference]: Finished difference Result 10662 states and 31172 transitions. [2019-11-16 00:19:50,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:19:50,300 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-11-16 00:19:50,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:50,312 INFO L225 Difference]: With dead ends: 10662 [2019-11-16 00:19:50,312 INFO L226 Difference]: Without dead ends: 10662 [2019-11-16 00:19:50,313 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:19:50,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10662 states. [2019-11-16 00:19:50,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10662 to 9072. [2019-11-16 00:19:50,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9072 states. [2019-11-16 00:19:50,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9072 states to 9072 states and 26642 transitions. [2019-11-16 00:19:50,428 INFO L78 Accepts]: Start accepts. Automaton has 9072 states and 26642 transitions. Word has length 65 [2019-11-16 00:19:50,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:50,429 INFO L462 AbstractCegarLoop]: Abstraction has 9072 states and 26642 transitions. [2019-11-16 00:19:50,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:19:50,429 INFO L276 IsEmpty]: Start isEmpty. Operand 9072 states and 26642 transitions. [2019-11-16 00:19:50,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-16 00:19:50,436 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:50,436 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] [2019-11-16 00:19:50,436 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:50,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:50,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1848172089, now seen corresponding path program 1 times [2019-11-16 00:19:50,436 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:50,437 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715168373] [2019-11-16 00:19:50,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:50,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:50,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:50,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:50,536 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:19:50,537 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715168373] [2019-11-16 00:19:50,537 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:50,537 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:19:50,537 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586564545] [2019-11-16 00:19:50,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:19:50,538 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:50,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:19:50,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:19:50,538 INFO L87 Difference]: Start difference. First operand 9072 states and 26642 transitions. Second operand 6 states. [2019-11-16 00:19:50,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:50,987 INFO L93 Difference]: Finished difference Result 10382 states and 29893 transitions. [2019-11-16 00:19:50,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:19:50,988 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-11-16 00:19:50,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:51,001 INFO L225 Difference]: With dead ends: 10382 [2019-11-16 00:19:51,001 INFO L226 Difference]: Without dead ends: 10382 [2019-11-16 00:19:51,002 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:19:51,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10382 states. [2019-11-16 00:19:51,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10382 to 10079. [2019-11-16 00:19:51,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10079 states. [2019-11-16 00:19:51,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10079 states to 10079 states and 29116 transitions. [2019-11-16 00:19:51,197 INFO L78 Accepts]: Start accepts. Automaton has 10079 states and 29116 transitions. Word has length 65 [2019-11-16 00:19:51,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:51,197 INFO L462 AbstractCegarLoop]: Abstraction has 10079 states and 29116 transitions. [2019-11-16 00:19:51,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:19:51,197 INFO L276 IsEmpty]: Start isEmpty. Operand 10079 states and 29116 transitions. [2019-11-16 00:19:51,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-16 00:19:51,205 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:51,205 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] [2019-11-16 00:19:51,206 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:51,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:51,206 INFO L82 PathProgramCache]: Analyzing trace with hash 369585864, now seen corresponding path program 1 times [2019-11-16 00:19:51,206 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:51,206 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321389335] [2019-11-16 00:19:51,206 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:51,206 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:51,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:51,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:51,307 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:19:51,307 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321389335] [2019-11-16 00:19:51,307 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:51,307 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:19:51,308 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092203395] [2019-11-16 00:19:51,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:19:51,308 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:51,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:19:51,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:19:51,309 INFO L87 Difference]: Start difference. First operand 10079 states and 29116 transitions. Second operand 6 states. [2019-11-16 00:19:51,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:51,605 INFO L93 Difference]: Finished difference Result 11996 states and 33623 transitions. [2019-11-16 00:19:51,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:19:51,606 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-11-16 00:19:51,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:51,621 INFO L225 Difference]: With dead ends: 11996 [2019-11-16 00:19:51,622 INFO L226 Difference]: Without dead ends: 11996 [2019-11-16 00:19:51,622 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:19:51,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11996 states. [2019-11-16 00:19:51,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11996 to 10298. [2019-11-16 00:19:51,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10298 states. [2019-11-16 00:19:51,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10298 states to 10298 states and 29168 transitions. [2019-11-16 00:19:51,751 INFO L78 Accepts]: Start accepts. Automaton has 10298 states and 29168 transitions. Word has length 65 [2019-11-16 00:19:51,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:51,752 INFO L462 AbstractCegarLoop]: Abstraction has 10298 states and 29168 transitions. [2019-11-16 00:19:51,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:19:51,752 INFO L276 IsEmpty]: Start isEmpty. Operand 10298 states and 29168 transitions. [2019-11-16 00:19:51,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-16 00:19:51,760 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:51,760 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] [2019-11-16 00:19:51,761 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:51,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:51,761 INFO L82 PathProgramCache]: Analyzing trace with hash 580936777, now seen corresponding path program 1 times [2019-11-16 00:19:51,761 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:51,761 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608236444] [2019-11-16 00:19:51,761 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:51,761 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:51,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:51,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:51,824 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:19:51,824 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608236444] [2019-11-16 00:19:51,824 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:51,824 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:19:51,824 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041695619] [2019-11-16 00:19:51,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:19:51,825 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:51,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:19:51,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:19:51,825 INFO L87 Difference]: Start difference. First operand 10298 states and 29168 transitions. Second operand 5 states. [2019-11-16 00:19:52,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:52,101 INFO L93 Difference]: Finished difference Result 12573 states and 35461 transitions. [2019-11-16 00:19:52,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:19:52,101 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-11-16 00:19:52,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:52,117 INFO L225 Difference]: With dead ends: 12573 [2019-11-16 00:19:52,117 INFO L226 Difference]: Without dead ends: 12573 [2019-11-16 00:19:52,117 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:19:52,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12573 states. [2019-11-16 00:19:52,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12573 to 11073. [2019-11-16 00:19:52,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11073 states. [2019-11-16 00:19:52,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11073 states to 11073 states and 31102 transitions. [2019-11-16 00:19:52,255 INFO L78 Accepts]: Start accepts. Automaton has 11073 states and 31102 transitions. Word has length 65 [2019-11-16 00:19:52,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:52,255 INFO L462 AbstractCegarLoop]: Abstraction has 11073 states and 31102 transitions. [2019-11-16 00:19:52,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:19:52,255 INFO L276 IsEmpty]: Start isEmpty. Operand 11073 states and 31102 transitions. [2019-11-16 00:19:52,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-16 00:19:52,262 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:52,262 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] [2019-11-16 00:19:52,262 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:52,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:52,262 INFO L82 PathProgramCache]: Analyzing trace with hash 70402600, now seen corresponding path program 1 times [2019-11-16 00:19:52,263 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:52,263 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354871172] [2019-11-16 00:19:52,263 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:52,263 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:52,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:52,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:52,320 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:19:52,321 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354871172] [2019-11-16 00:19:52,321 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:52,321 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:19:52,321 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658915039] [2019-11-16 00:19:52,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:19:52,322 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:52,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:19:52,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:19:52,322 INFO L87 Difference]: Start difference. First operand 11073 states and 31102 transitions. Second operand 4 states. [2019-11-16 00:19:52,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:52,728 INFO L93 Difference]: Finished difference Result 13629 states and 38377 transitions. [2019-11-16 00:19:52,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:19:52,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-11-16 00:19:52,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:52,744 INFO L225 Difference]: With dead ends: 13629 [2019-11-16 00:19:52,744 INFO L226 Difference]: Without dead ends: 13254 [2019-11-16 00:19:52,745 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:19:52,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13254 states. [2019-11-16 00:19:52,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13254 to 12711. [2019-11-16 00:19:52,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12711 states. [2019-11-16 00:19:52,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12711 states to 12711 states and 35686 transitions. [2019-11-16 00:19:52,899 INFO L78 Accepts]: Start accepts. Automaton has 12711 states and 35686 transitions. Word has length 65 [2019-11-16 00:19:52,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:52,899 INFO L462 AbstractCegarLoop]: Abstraction has 12711 states and 35686 transitions. [2019-11-16 00:19:52,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:19:52,899 INFO L276 IsEmpty]: Start isEmpty. Operand 12711 states and 35686 transitions. [2019-11-16 00:19:52,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-16 00:19:52,906 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:52,907 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] [2019-11-16 00:19:52,907 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:52,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:52,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1726548759, now seen corresponding path program 1 times [2019-11-16 00:19:52,907 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:52,907 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89544635] [2019-11-16 00:19:52,907 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:52,907 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:52,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:52,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:53,048 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:19:53,048 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89544635] [2019-11-16 00:19:53,048 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:53,048 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:19:53,048 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071926212] [2019-11-16 00:19:53,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:19:53,049 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:53,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:19:53,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:19:53,049 INFO L87 Difference]: Start difference. First operand 12711 states and 35686 transitions. Second operand 7 states. [2019-11-16 00:19:53,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:53,552 INFO L93 Difference]: Finished difference Result 15473 states and 42651 transitions. [2019-11-16 00:19:53,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:19:53,552 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-11-16 00:19:53,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:53,577 INFO L225 Difference]: With dead ends: 15473 [2019-11-16 00:19:53,577 INFO L226 Difference]: Without dead ends: 15473 [2019-11-16 00:19:53,577 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:19:53,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15473 states. [2019-11-16 00:19:53,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15473 to 12107. [2019-11-16 00:19:53,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12107 states. [2019-11-16 00:19:53,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12107 states to 12107 states and 33422 transitions. [2019-11-16 00:19:53,742 INFO L78 Accepts]: Start accepts. Automaton has 12107 states and 33422 transitions. Word has length 65 [2019-11-16 00:19:53,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:53,742 INFO L462 AbstractCegarLoop]: Abstraction has 12107 states and 33422 transitions. [2019-11-16 00:19:53,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:19:53,742 INFO L276 IsEmpty]: Start isEmpty. Operand 12107 states and 33422 transitions. [2019-11-16 00:19:53,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-16 00:19:53,748 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:53,748 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] [2019-11-16 00:19:53,748 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:53,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:53,749 INFO L82 PathProgramCache]: Analyzing trace with hash -839045078, now seen corresponding path program 1 times [2019-11-16 00:19:53,749 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:53,749 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623995431] [2019-11-16 00:19:53,749 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:53,749 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:53,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:53,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:53,840 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:19:53,843 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623995431] [2019-11-16 00:19:53,843 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:53,843 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:19:53,844 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073914020] [2019-11-16 00:19:53,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:19:53,845 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:53,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:19:53,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:19:53,846 INFO L87 Difference]: Start difference. First operand 12107 states and 33422 transitions. Second operand 5 states. [2019-11-16 00:19:53,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:53,892 INFO L93 Difference]: Finished difference Result 4022 states and 9369 transitions. [2019-11-16 00:19:53,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:19:53,893 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-11-16 00:19:53,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:53,897 INFO L225 Difference]: With dead ends: 4022 [2019-11-16 00:19:53,897 INFO L226 Difference]: Without dead ends: 3349 [2019-11-16 00:19:53,897 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:19:53,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3349 states. [2019-11-16 00:19:53,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3349 to 3089. [2019-11-16 00:19:53,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3089 states. [2019-11-16 00:19:53,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3089 states to 3089 states and 7075 transitions. [2019-11-16 00:19:53,940 INFO L78 Accepts]: Start accepts. Automaton has 3089 states and 7075 transitions. Word has length 65 [2019-11-16 00:19:53,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:53,940 INFO L462 AbstractCegarLoop]: Abstraction has 3089 states and 7075 transitions. [2019-11-16 00:19:53,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:19:53,940 INFO L276 IsEmpty]: Start isEmpty. Operand 3089 states and 7075 transitions. [2019-11-16 00:19:53,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-16 00:19:53,946 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:53,946 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:19:53,946 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:53,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:53,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1377720652, now seen corresponding path program 1 times [2019-11-16 00:19:53,947 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:53,947 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686528791] [2019-11-16 00:19:53,947 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:53,948 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:53,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:53,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:54,069 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:19:54,069 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686528791] [2019-11-16 00:19:54,070 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:54,070 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:19:54,070 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456930754] [2019-11-16 00:19:54,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:19:54,071 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:54,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:19:54,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:19:54,071 INFO L87 Difference]: Start difference. First operand 3089 states and 7075 transitions. Second operand 7 states. [2019-11-16 00:19:54,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:54,567 INFO L93 Difference]: Finished difference Result 3728 states and 8436 transitions. [2019-11-16 00:19:54,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-16 00:19:54,568 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2019-11-16 00:19:54,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:54,571 INFO L225 Difference]: With dead ends: 3728 [2019-11-16 00:19:54,571 INFO L226 Difference]: Without dead ends: 3697 [2019-11-16 00:19:54,571 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:19:54,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3697 states. [2019-11-16 00:19:54,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3697 to 3243. [2019-11-16 00:19:54,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3243 states. [2019-11-16 00:19:54,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3243 states to 3243 states and 7398 transitions. [2019-11-16 00:19:54,603 INFO L78 Accepts]: Start accepts. Automaton has 3243 states and 7398 transitions. Word has length 82 [2019-11-16 00:19:54,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:54,603 INFO L462 AbstractCegarLoop]: Abstraction has 3243 states and 7398 transitions. [2019-11-16 00:19:54,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:19:54,603 INFO L276 IsEmpty]: Start isEmpty. Operand 3243 states and 7398 transitions. [2019-11-16 00:19:54,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-16 00:19:54,606 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:54,606 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] [2019-11-16 00:19:54,606 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:54,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:54,607 INFO L82 PathProgramCache]: Analyzing trace with hash 733569717, now seen corresponding path program 1 times [2019-11-16 00:19:54,607 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:54,607 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11564640] [2019-11-16 00:19:54,607 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:54,607 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:54,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:54,761 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:19:54,761 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11564640] [2019-11-16 00:19:54,761 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:54,761 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-16 00:19:54,762 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656265275] [2019-11-16 00:19:54,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:19:54,763 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:54,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:19:54,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:19:54,768 INFO L87 Difference]: Start difference. First operand 3243 states and 7398 transitions. Second operand 9 states. [2019-11-16 00:19:55,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:55,198 INFO L93 Difference]: Finished difference Result 11538 states and 26510 transitions. [2019-11-16 00:19:55,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-16 00:19:55,199 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2019-11-16 00:19:55,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:55,205 INFO L225 Difference]: With dead ends: 11538 [2019-11-16 00:19:55,205 INFO L226 Difference]: Without dead ends: 7339 [2019-11-16 00:19:55,205 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2019-11-16 00:19:55,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7339 states. [2019-11-16 00:19:55,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7339 to 3321. [2019-11-16 00:19:55,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3321 states. [2019-11-16 00:19:55,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3321 states to 3321 states and 7546 transitions. [2019-11-16 00:19:55,252 INFO L78 Accepts]: Start accepts. Automaton has 3321 states and 7546 transitions. Word has length 82 [2019-11-16 00:19:55,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:55,252 INFO L462 AbstractCegarLoop]: Abstraction has 3321 states and 7546 transitions. [2019-11-16 00:19:55,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:19:55,252 INFO L276 IsEmpty]: Start isEmpty. Operand 3321 states and 7546 transitions. [2019-11-16 00:19:55,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-16 00:19:55,255 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:55,255 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] [2019-11-16 00:19:55,256 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:55,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:55,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1812519390, now seen corresponding path program 2 times [2019-11-16 00:19:55,256 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:55,256 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878951819] [2019-11-16 00:19:55,256 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:55,257 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:55,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:55,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:55,375 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:19:55,375 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878951819] [2019-11-16 00:19:55,375 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:55,375 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:19:55,376 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631479190] [2019-11-16 00:19:55,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:19:55,376 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:55,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:19:55,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:19:55,377 INFO L87 Difference]: Start difference. First operand 3321 states and 7546 transitions. Second operand 6 states. [2019-11-16 00:19:55,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:55,570 INFO L93 Difference]: Finished difference Result 3701 states and 8348 transitions. [2019-11-16 00:19:55,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:19:55,571 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-11-16 00:19:55,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:55,575 INFO L225 Difference]: With dead ends: 3701 [2019-11-16 00:19:55,576 INFO L226 Difference]: Without dead ends: 3629 [2019-11-16 00:19:55,576 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:19:55,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3629 states. [2019-11-16 00:19:55,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3629 to 3104. [2019-11-16 00:19:55,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3104 states. [2019-11-16 00:19:55,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3104 states to 3104 states and 7014 transitions. [2019-11-16 00:19:55,621 INFO L78 Accepts]: Start accepts. Automaton has 3104 states and 7014 transitions. Word has length 82 [2019-11-16 00:19:55,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:55,621 INFO L462 AbstractCegarLoop]: Abstraction has 3104 states and 7014 transitions. [2019-11-16 00:19:55,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:19:55,622 INFO L276 IsEmpty]: Start isEmpty. Operand 3104 states and 7014 transitions. [2019-11-16 00:19:55,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-16 00:19:55,625 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:55,626 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] [2019-11-16 00:19:55,626 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:55,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:55,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1781499583, now seen corresponding path program 2 times [2019-11-16 00:19:55,627 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:55,627 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505761033] [2019-11-16 00:19:55,627 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:55,627 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:55,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:55,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:55,779 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:19:55,780 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505761033] [2019-11-16 00:19:55,780 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:55,780 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:19:55,781 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919115781] [2019-11-16 00:19:55,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:19:55,783 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:55,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:19:55,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:19:55,783 INFO L87 Difference]: Start difference. First operand 3104 states and 7014 transitions. Second operand 7 states. [2019-11-16 00:19:55,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:55,861 INFO L93 Difference]: Finished difference Result 5310 states and 12039 transitions. [2019-11-16 00:19:55,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:19:55,862 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2019-11-16 00:19:55,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:55,865 INFO L225 Difference]: With dead ends: 5310 [2019-11-16 00:19:55,865 INFO L226 Difference]: Without dead ends: 2294 [2019-11-16 00:19:55,865 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:19:55,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2294 states. [2019-11-16 00:19:55,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2294 to 2294. [2019-11-16 00:19:55,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2294 states. [2019-11-16 00:19:55,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2294 states to 2294 states and 5172 transitions. [2019-11-16 00:19:55,894 INFO L78 Accepts]: Start accepts. Automaton has 2294 states and 5172 transitions. Word has length 82 [2019-11-16 00:19:55,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:55,894 INFO L462 AbstractCegarLoop]: Abstraction has 2294 states and 5172 transitions. [2019-11-16 00:19:55,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:19:55,895 INFO L276 IsEmpty]: Start isEmpty. Operand 2294 states and 5172 transitions. [2019-11-16 00:19:55,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-16 00:19:55,897 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:55,897 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] [2019-11-16 00:19:55,898 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:55,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:55,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1233614151, now seen corresponding path program 3 times [2019-11-16 00:19:55,899 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:55,899 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083397088] [2019-11-16 00:19:55,899 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:55,899 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:55,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:55,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:19:55,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:19:55,999 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:19:55,999 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-16 00:19:56,153 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-16 00:19:56,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:19:56 BasicIcfg [2019-11-16 00:19:56,158 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:19:56,159 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:19:56,159 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:19:56,159 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:19:56,160 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:19:28" (3/4) ... [2019-11-16 00:19:56,165 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-16 00:19:56,350 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_80099ee4-1bce-4e1e-a8ee-52f451665809/bin/uautomizer/witness.graphml [2019-11-16 00:19:56,350 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:19:56,352 INFO L168 Benchmark]: Toolchain (without parser) took 29708.07 ms. Allocated memory was 1.0 GB in the beginning and 3.2 GB in the end (delta: 2.1 GB). Free memory was 939.4 MB in the beginning and 1.2 GB in the end (delta: -229.2 MB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2019-11-16 00:19:56,352 INFO L168 Benchmark]: CDTParser took 0.26 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:19:56,353 INFO L168 Benchmark]: CACSL2BoogieTranslator took 637.21 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -141.7 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:19:56,353 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:19:56,353 INFO L168 Benchmark]: Boogie Preprocessor took 39.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:19:56,354 INFO L168 Benchmark]: RCFGBuilder took 756.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 43.3 MB). Peak memory consumption was 43.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:19:56,354 INFO L168 Benchmark]: TraceAbstraction took 28019.64 ms. Allocated memory was 1.1 GB in the beginning and 3.2 GB in the end (delta: 2.0 GB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -193.3 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2019-11-16 00:19:56,354 INFO L168 Benchmark]: Witness Printer took 191.26 ms. Allocated memory is still 3.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.6 MB). Peak memory consumption was 53.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:19:56,356 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.26 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 637.21 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -141.7 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 756.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 43.3 MB). Peak memory consumption was 43.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 28019.64 ms. Allocated memory was 1.1 GB in the beginning and 3.2 GB in the end (delta: 2.0 GB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -193.3 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. * Witness Printer took 191.26 ms. Allocated memory is still 3.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.6 MB). Peak memory consumption was 53.6 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] [L698] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0] [L699] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L701] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L702] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L703] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L704] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L705] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L706] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L707] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L708] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L709] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L710] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L711] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}] [L712] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L713] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L714] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L715] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L718] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L719] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L789] 0 pthread_t t2565; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L790] FCALL, FORK 0 pthread_create(&t2565, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L791] 0 pthread_t t2566; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L792] FCALL, FORK 0 pthread_create(&t2566, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L753] 2 x$w_buff1 = x$w_buff0 [L754] 2 x$w_buff0 = 1 [L755] 2 x$w_buff1_used = x$w_buff0_used [L756] 2 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L758] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L759] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L760] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L761] 2 x$r_buff0_thd2 = (_Bool)1 [L764] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L723] 1 y = 2 [L728] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L729] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L730] 1 x$flush_delayed = weak$$choice2 [L731] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, 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] [L732] 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, 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] [L732] 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) [L733] 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, 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] [L767] 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, 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] [L733] 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)) [L734] 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, 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] [L734] 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)) [L735] 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, 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] [L735] 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)) [L736] 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, 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] [L736] 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)) [L737] 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, 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] [L737] 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)) [L738] 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, 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] [L738] 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)) [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, 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] [L740] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, 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] [L767] 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) [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, 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=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] [L768] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] 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=0, __unbuffered_p0_EAX=0, 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=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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L769] 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 [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, 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=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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L770] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] 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=0, __unbuffered_p0_EAX=0, 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=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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L771] 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 [L774] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, 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=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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] 1 x = x$flush_delayed ? x$mem_tmp : x [L741] 1 x$flush_delayed = (_Bool)0 [L746] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L794] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 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) [L799] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L799] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L800] 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 [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L801] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L802] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L802] 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 [L805] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, 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=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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 193 locations, 3 error locations. Result: UNSAFE, OverallTime: 27.8s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 11.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6054 SDtfs, 7746 SDslu, 14044 SDs, 0 SdLazy, 5140 SolverSat, 389 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 221 GetRequests, 63 SyntacticMatches, 10 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57887occurred 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.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 64191 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1467 NumberOfCodeBlocks, 1467 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1362 ConstructedInterpolants, 0 QuantifiedInterpolants, 238611 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...