./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/bist_cell.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_bc2962b8-5244-4c79-a7fa-6e19c1b4744d/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_bc2962b8-5244-4c79-a7fa-6e19c1b4744d/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_bc2962b8-5244-4c79-a7fa-6e19c1b4744d/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_bc2962b8-5244-4c79-a7fa-6e19c1b4744d/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/bist_cell.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_bc2962b8-5244-4c79-a7fa-6e19c1b4744d/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_bc2962b8-5244-4c79-a7fa-6e19c1b4744d/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6e1b5c8fd87acd5e9c1ad1566c2fb65080de7370 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-09 10:51:57,355 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 10:51:57,357 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 10:51:57,387 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 10:51:57,388 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 10:51:57,397 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 10:51:57,399 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 10:51:57,401 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 10:51:57,402 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 10:51:57,403 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 10:51:57,404 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 10:51:57,405 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 10:51:57,405 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 10:51:57,406 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 10:51:57,407 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 10:51:57,408 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 10:51:57,408 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 10:51:57,409 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 10:51:57,411 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 10:51:57,412 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 10:51:57,413 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 10:51:57,415 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 10:51:57,416 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 10:51:57,417 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 10:51:57,419 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 10:51:57,419 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 10:51:57,420 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 10:51:57,420 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 10:51:57,421 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 10:51:57,422 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 10:51:57,422 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 10:51:57,422 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 10:51:57,423 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 10:51:57,424 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 10:51:57,424 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 10:51:57,425 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 10:51:57,425 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 10:51:57,425 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 10:51:57,425 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 10:51:57,426 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 10:51:57,426 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 10:51:57,427 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_bc2962b8-5244-4c79-a7fa-6e19c1b4744d/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 10:51:57,444 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 10:51:57,444 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 10:51:57,445 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 10:51:57,445 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 10:51:57,445 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 10:51:57,445 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 10:51:57,445 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 10:51:57,446 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 10:51:57,446 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 10:51:57,446 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 10:51:57,446 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 10:51:57,446 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 10:51:57,446 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 10:51:57,446 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 10:51:57,446 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 10:51:57,447 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 10:51:57,447 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 10:51:57,447 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 10:51:57,447 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 10:51:57,447 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 10:51:57,447 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 10:51:57,447 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 10:51:57,447 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 10:51:57,448 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 10:51:57,448 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 10:51:57,448 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 10:51:57,448 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 10:51:57,448 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 10:51:57,448 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 10:51:57,448 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 10:51:57,448 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 10:51:57,449 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 10:51:57,449 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 10:51:57,449 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 10:51:57,449 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 10:51:57,449 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 10:51:57,449 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 10:51:57,449 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 10:51:57,449 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 10:51:57,449 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_bc2962b8-5244-4c79-a7fa-6e19c1b4744d/bin/utaipan/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_bc2962b8-5244-4c79-a7fa-6e19c1b4744d/bin/utaipan 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(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 6e1b5c8fd87acd5e9c1ad1566c2fb65080de7370 [2020-12-09 10:51:57,615 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 10:51:57,631 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 10:51:57,634 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 10:51:57,635 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 10:51:57,636 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 10:51:57,636 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_bc2962b8-5244-4c79-a7fa-6e19c1b4744d/bin/utaipan/../../sv-benchmarks/c/systemc/bist_cell.cil.c [2020-12-09 10:51:57,680 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bc2962b8-5244-4c79-a7fa-6e19c1b4744d/bin/utaipan/data/3d176be30/d6d5129461e7418e8ed31972a22cd7af/FLAG08ca3b139 [2020-12-09 10:51:58,050 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 10:51:58,050 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_bc2962b8-5244-4c79-a7fa-6e19c1b4744d/sv-benchmarks/c/systemc/bist_cell.cil.c [2020-12-09 10:51:58,057 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bc2962b8-5244-4c79-a7fa-6e19c1b4744d/bin/utaipan/data/3d176be30/d6d5129461e7418e8ed31972a22cd7af/FLAG08ca3b139 [2020-12-09 10:51:58,069 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_bc2962b8-5244-4c79-a7fa-6e19c1b4744d/bin/utaipan/data/3d176be30/d6d5129461e7418e8ed31972a22cd7af [2020-12-09 10:51:58,071 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 10:51:58,072 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 10:51:58,074 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 10:51:58,074 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 10:51:58,077 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 10:51:58,077 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 10:51:58" (1/1) ... [2020-12-09 10:51:58,079 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42f5b3d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:51:58, skipping insertion in model container [2020-12-09 10:51:58,079 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 10:51:58" (1/1) ... [2020-12-09 10:51:58,086 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 10:51:58,112 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 10:51:58,208 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_bc2962b8-5244-4c79-a7fa-6e19c1b4744d/sv-benchmarks/c/systemc/bist_cell.cil.c[334,347] [2020-12-09 10:51:58,261 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 10:51:58,270 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 10:51:58,278 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_bc2962b8-5244-4c79-a7fa-6e19c1b4744d/sv-benchmarks/c/systemc/bist_cell.cil.c[334,347] [2020-12-09 10:51:58,303 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 10:51:58,318 INFO L208 MainTranslator]: Completed translation [2020-12-09 10:51:58,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:51:58 WrapperNode [2020-12-09 10:51:58,319 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 10:51:58,320 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 10:51:58,320 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 10:51:58,320 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 10:51:58,325 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:51:58" (1/1) ... [2020-12-09 10:51:58,332 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:51:58" (1/1) ... [2020-12-09 10:51:58,357 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 10:51:58,357 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 10:51:58,358 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 10:51:58,358 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 10:51:58,364 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:51:58" (1/1) ... [2020-12-09 10:51:58,365 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:51:58" (1/1) ... [2020-12-09 10:51:58,368 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:51:58" (1/1) ... [2020-12-09 10:51:58,368 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:51:58" (1/1) ... [2020-12-09 10:51:58,375 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:51:58" (1/1) ... [2020-12-09 10:51:58,382 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:51:58" (1/1) ... [2020-12-09 10:51:58,385 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:51:58" (1/1) ... [2020-12-09 10:51:58,389 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 10:51:58,390 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 10:51:58,390 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 10:51:58,390 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 10:51:58,391 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:51:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bc2962b8-5244-4c79-a7fa-6e19c1b4744d/bin/utaipan/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 [2020-12-09 10:51:58,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 10:51:58,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 10:51:58,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 10:51:58,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 10:51:59,490 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 10:51:59,490 INFO L299 CfgBuilder]: Removed 64 assume(true) statements. [2020-12-09 10:51:59,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:51:59 BoogieIcfgContainer [2020-12-09 10:51:59,492 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 10:51:59,493 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 10:51:59,493 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 10:51:59,496 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 10:51:59,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 10:51:58" (1/3) ... [2020-12-09 10:51:59,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a462e12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 10:51:59, skipping insertion in model container [2020-12-09 10:51:59,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:51:58" (2/3) ... [2020-12-09 10:51:59,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a462e12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 10:51:59, skipping insertion in model container [2020-12-09 10:51:59,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:51:59" (3/3) ... [2020-12-09 10:51:59,498 INFO L111 eAbstractionObserver]: Analyzing ICFG bist_cell.cil.c [2020-12-09 10:51:59,508 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 10:51:59,510 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-09 10:51:59,518 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-09 10:51:59,534 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 10:51:59,534 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 10:51:59,534 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 10:51:59,534 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 10:51:59,534 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 10:51:59,534 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 10:51:59,534 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 10:51:59,534 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 10:51:59,543 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2020-12-09 10:51:59,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-12-09 10:51:59,546 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:51:59,547 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-12-09 10:51:59,547 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 10:51:59,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:51:59,551 INFO L82 PathProgramCache]: Analyzing trace with hash 20795289, now seen corresponding path program 1 times [2020-12-09 10:51:59,558 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:51:59,558 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164239711] [2020-12-09 10:51:59,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:51:59,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:51:59,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:51:59,668 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164239711] [2020-12-09 10:51:59,669 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:51:59,669 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 10:51:59,669 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186910717] [2020-12-09 10:51:59,673 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-09 10:51:59,673 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:51:59,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-09 10:51:59,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-09 10:51:59,688 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 2 states. [2020-12-09 10:51:59,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:51:59,700 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2020-12-09 10:51:59,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-09 10:51:59,701 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 4 [2020-12-09 10:51:59,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:51:59,706 INFO L225 Difference]: With dead ends: 21 [2020-12-09 10:51:59,706 INFO L226 Difference]: Without dead ends: 9 [2020-12-09 10:51:59,708 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-09 10:51:59,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2020-12-09 10:51:59,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-12-09 10:51:59,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-12-09 10:51:59,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2020-12-09 10:51:59,729 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 4 [2020-12-09 10:51:59,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:51:59,730 INFO L481 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2020-12-09 10:51:59,730 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-09 10:51:59,730 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2020-12-09 10:51:59,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-09 10:51:59,730 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:51:59,730 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 10:51:59,730 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 10:51:59,730 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 10:51:59,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:51:59,731 INFO L82 PathProgramCache]: Analyzing trace with hash -320019114, now seen corresponding path program 1 times [2020-12-09 10:51:59,731 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:51:59,731 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959431418] [2020-12-09 10:51:59,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:51:59,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:51:59,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:51:59,834 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959431418] [2020-12-09 10:51:59,834 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:51:59,835 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 10:51:59,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930663272] [2020-12-09 10:51:59,836 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 10:51:59,836 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:51:59,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 10:51:59,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 10:51:59,837 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 4 states. [2020-12-09 10:51:59,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:51:59,864 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2020-12-09 10:51:59,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 10:51:59,865 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-12-09 10:51:59,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:51:59,865 INFO L225 Difference]: With dead ends: 20 [2020-12-09 10:51:59,865 INFO L226 Difference]: Without dead ends: 17 [2020-12-09 10:51:59,866 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 10:51:59,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-12-09 10:51:59,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2020-12-09 10:51:59,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-12-09 10:51:59,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2020-12-09 10:51:59,870 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 8 [2020-12-09 10:51:59,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:51:59,870 INFO L481 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2020-12-09 10:51:59,870 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 10:51:59,870 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2020-12-09 10:51:59,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-09 10:51:59,871 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:51:59,871 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 10:51:59,871 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 10:51:59,871 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 10:51:59,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:51:59,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1315697747, now seen corresponding path program 1 times [2020-12-09 10:51:59,872 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:51:59,873 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657591420] [2020-12-09 10:51:59,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:51:59,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:52:00,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:52:00,026 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657591420] [2020-12-09 10:52:00,027 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657392466] [2020-12-09 10:52:00,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bc2962b8-5244-4c79-a7fa-6e19c1b4744d/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 10:52:00,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:52:00,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 29 conjunts are in the unsatisfiable core [2020-12-09 10:52:00,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 10:52:00,262 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 2, 1] term [2020-12-09 10:52:00,262 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:52:00,264 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 2, 1] term [2020-12-09 10:52:00,265 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:52:00,268 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 2, 2, 2, 1] term [2020-12-09 10:52:00,268 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:52:00,270 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 2, 2, 2, 1] term [2020-12-09 10:52:00,271 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:52:00,273 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 2, 2, 2, 2, 2, 1] term [2020-12-09 10:52:00,273 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:52:00,275 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 2, 1] term [2020-12-09 10:52:00,276 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:52:00,278 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:52:00,350 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-12-09 10:52:00,350 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:52:00,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:52:00,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 10:52:00,440 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 10:52:00,536 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 1] term [2020-12-09 10:52:00,536 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 10:52:00,537 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 1] term [2020-12-09 10:52:00,538 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 10:52:00,540 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 2, 2, 1] term [2020-12-09 10:52:00,541 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 10:52:00,542 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 2, 2, 1] term [2020-12-09 10:52:00,542 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 10:52:00,543 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 2, 2, 2, 2, 1] term [2020-12-09 10:52:00,544 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 10:52:00,545 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 2, 2, 2, 2, 1] term [2020-12-09 10:52:00,545 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 10:52:00,547 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 2, 2, 2, 2, 1] term [2020-12-09 10:52:00,547 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 10:52:00,548 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 2, 2, 2, 2, 1] term [2020-12-09 10:52:00,548 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 10:52:00,551 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 10:52:00,558 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 10:52:00,559 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 10:52:00,561 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 2, 2, 2, 2, 1] term [2020-12-09 10:52:00,561 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 10:52:00,562 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 1] term [2020-12-09 10:52:00,563 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 10:52:00,563 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 10:52:00,564 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 10:52:00,566 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 2, 2, 1] term [2020-12-09 10:52:00,566 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 10:52:00,567 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 1] term [2020-12-09 10:52:00,567 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 10:52:00,568 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 10:52:00,568 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 10:52:00,572 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 2, 3, 2, 3, 2, 2, 1] term [2020-12-09 10:52:00,573 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 10:52:00,574 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 2, 1] term [2020-12-09 10:52:00,574 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 10:52:00,632 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 10:52:00,632 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 10:52:00,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:52:00,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [559532907] [2020-12-09 10:52:00,698 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2020-12-09 10:52:00,699 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 10:52:00,703 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 10:52:00,708 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 10:52:00,709 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 10:52:00,838 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 10:52:01,577 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 10:52:01,861 WARN L197 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 100 [2020-12-09 10:52:02,294 WARN L197 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 90 [2020-12-09 10:52:02,706 WARN L197 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 94 [2020-12-09 10:52:03,113 WARN L197 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 94 [2020-12-09 10:52:03,445 WARN L197 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 109 [2020-12-09 10:52:03,887 WARN L197 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 100 [2020-12-09 10:52:03,887 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2020-12-09 10:52:03,888 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7, 7] total 23 [2020-12-09 10:52:03,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383488091] [2020-12-09 10:52:03,888 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-09 10:52:03,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:52:03,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-09 10:52:03,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2020-12-09 10:52:03,890 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 8 states. [2020-12-09 10:52:03,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:52:03,970 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2020-12-09 10:52:03,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 10:52:03,970 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2020-12-09 10:52:03,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:52:03,972 INFO L225 Difference]: With dead ends: 28 [2020-12-09 10:52:03,972 INFO L226 Difference]: Without dead ends: 25 [2020-12-09 10:52:03,972 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2020-12-09 10:52:03,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-12-09 10:52:03,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2020-12-09 10:52:03,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-12-09 10:52:03,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-12-09 10:52:03,977 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 10 [2020-12-09 10:52:03,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:52:03,977 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-12-09 10:52:03,977 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-09 10:52:03,977 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-12-09 10:52:03,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-09 10:52:03,978 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:52:03,978 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-12-09 10:52:04,179 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-12-09 10:52:04,180 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 10:52:04,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:52:04,182 INFO L82 PathProgramCache]: Analyzing trace with hash -2145312609, now seen corresponding path program 1 times [2020-12-09 10:52:04,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:52:04,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280297479] [2020-12-09 10:52:04,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:52:04,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:52:04,233 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-09 10:52:04,233 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280297479] [2020-12-09 10:52:04,234 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344814808] [2020-12-09 10:52:04,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bc2962b8-5244-4c79-a7fa-6e19c1b4744d/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 10:52:04,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:52:04,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 22 conjunts are in the unsatisfiable core [2020-12-09 10:52:04,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 10:52:04,314 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 10:52:04,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 10:52:04,329 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-09 10:52:04,329 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2020-12-09 10:52:04,329 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 5 [2020-12-09 10:52:04,329 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579882869] [2020-12-09 10:52:04,330 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 10:52:04,330 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:52:04,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 10:52:04,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-09 10:52:04,330 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 4 states. [2020-12-09 10:52:04,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:52:04,349 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2020-12-09 10:52:04,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 10:52:04,350 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-12-09 10:52:04,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:52:04,350 INFO L225 Difference]: With dead ends: 30 [2020-12-09 10:52:04,351 INFO L226 Difference]: Without dead ends: 17 [2020-12-09 10:52:04,351 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-09 10:52:04,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-12-09 10:52:04,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2020-12-09 10:52:04,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-12-09 10:52:04,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2020-12-09 10:52:04,354 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 15 [2020-12-09 10:52:04,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:52:04,354 INFO L481 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2020-12-09 10:52:04,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 10:52:04,355 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2020-12-09 10:52:04,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-09 10:52:04,355 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:52:04,355 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-12-09 10:52:04,556 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 10:52:04,557 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 10:52:04,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:52:04,558 INFO L82 PathProgramCache]: Analyzing trace with hash 26527441, now seen corresponding path program 2 times [2020-12-09 10:52:04,559 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:52:04,559 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603243902] [2020-12-09 10:52:04,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:52:04,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:52:04,744 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:52:04,744 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603243902] [2020-12-09 10:52:04,744 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206271207] [2020-12-09 10:52:04,744 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bc2962b8-5244-4c79-a7fa-6e19c1b4744d/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 10:52:04,807 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-12-09 10:52:04,807 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 10:52:04,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 25 conjunts are in the unsatisfiable core [2020-12-09 10:52:04,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 10:52:04,864 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 10:52:04,864 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 10:52:04,906 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 10:52:04,906 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2020-12-09 10:52:04,907 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 6] total 15 [2020-12-09 10:52:04,907 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576548127] [2020-12-09 10:52:04,907 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 10:52:04,907 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:52:04,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 10:52:04,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2020-12-09 10:52:04,908 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 5 states. [2020-12-09 10:52:04,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:52:04,965 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2020-12-09 10:52:04,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 10:52:04,965 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-12-09 10:52:04,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:52:04,966 INFO L225 Difference]: With dead ends: 28 [2020-12-09 10:52:04,966 INFO L226 Difference]: Without dead ends: 20 [2020-12-09 10:52:04,966 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2020-12-09 10:52:04,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-12-09 10:52:04,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2020-12-09 10:52:04,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-12-09 10:52:04,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2020-12-09 10:52:04,969 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 15 [2020-12-09 10:52:04,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:52:04,969 INFO L481 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2020-12-09 10:52:04,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 10:52:04,970 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2020-12-09 10:52:04,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-09 10:52:04,970 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:52:04,970 INFO L422 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2020-12-09 10:52:05,171 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 10:52:05,172 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 10:52:05,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:52:05,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1003059816, now seen corresponding path program 3 times [2020-12-09 10:52:05,173 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:52:05,174 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558486834] [2020-12-09 10:52:05,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:52:05,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:52:05,517 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:52:05,517 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558486834] [2020-12-09 10:52:05,517 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577413267] [2020-12-09 10:52:05,517 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bc2962b8-5244-4c79-a7fa-6e19c1b4744d/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 10:52:05,571 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-09 10:52:05,571 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 10:52:05,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 70 conjunts are in the unsatisfiable core [2020-12-09 10:52:05,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 10:52:05,866 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 10:52:05,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 10:52:06,305 WARN L197 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2020-12-09 10:52:06,477 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 10:52:06,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [671489365] [2020-12-09 10:52:06,478 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2020-12-09 10:52:06,479 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 10:52:06,479 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 10:52:06,479 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 10:52:06,479 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 10:52:06,508 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 10:52:07,080 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 10:52:07,081 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 10:52:07,081 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 9] total 26 [2020-12-09 10:52:07,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609307957] [2020-12-09 10:52:07,082 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-12-09 10:52:07,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:52:07,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-12-09 10:52:07,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2020-12-09 10:52:07,083 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 27 states. [2020-12-09 10:52:07,346 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 43 [2020-12-09 10:52:07,505 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 54 [2020-12-09 10:52:07,691 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 55 [2020-12-09 10:52:08,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:52:08,017 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2020-12-09 10:52:08,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-09 10:52:08,018 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 17 [2020-12-09 10:52:08,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:52:08,018 INFO L225 Difference]: With dead ends: 21 [2020-12-09 10:52:08,018 INFO L226 Difference]: Without dead ends: 0 [2020-12-09 10:52:08,019 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=243, Invalid=947, Unknown=0, NotChecked=0, Total=1190 [2020-12-09 10:52:08,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-09 10:52:08,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-09 10:52:08,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-09 10:52:08,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-09 10:52:08,019 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2020-12-09 10:52:08,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:52:08,019 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-09 10:52:08,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-12-09 10:52:08,020 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-09 10:52:08,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-09 10:52:08,220 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 10:52:08,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-09 10:52:09,060 WARN L197 SmtUtils]: Spent 761.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 105 [2020-12-09 10:52:09,322 WARN L197 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 93 [2020-12-09 10:52:09,524 WARN L197 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 100 [2020-12-09 10:52:09,633 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2020-12-09 10:52:09,635 INFO L258 CegarLoopResult]: At program point L303(lines 271 308) the Hoare annotation is: (and (= ~z_req_up~0 1) (<= 1 ULTIMATE.start_activate_threads_~tmp~1) (<= ULTIMATE.start_activate_threads_~tmp~1 1) (<= 1 |ULTIMATE.start_is_method1_triggered_#res|) (<= 0 |#t~string6.base|) (= |#t~string5.offset| 0) (<= |ULTIMATE.start_exists_runnable_thread_#res| 1) (= |#NULL.offset| 0) (<= 1 ~d0_val~0) (<= 0 |#StackHeapBarrier|) (<= |#t~string4.offset| 0) (= ULTIMATE.start_is_method1_triggered_~__retres1~0 1) (= ~z_val~0 0) (<= ~z_ev~0 2) (<= 2 ~z_ev~0) (<= ~d1_req_up~0 0) (<= ULTIMATE.start_exists_runnable_thread_~__retres1~1 1) (<= 2 ~b1_ev~0) (= ~b0_ev~0 2) (= ULTIMATE.start_eval_~tmp___0~0 0) (= ~b1_val_t~0 1) (<= 1 ~d0_val_t~0) (= ~d1_val_t~0 1) (<= 0 |#NULL.base|) (= |#t~string6.offset| 0) (= 2 ~d1_ev~0) (= 1 ULTIMATE.start_start_simulation_~kernel_st~0) (= 2 ~d0_ev~0) (<= 0 |#t~string4.offset|) (= ~d1_val~0 1) (<= 0 |#t~string5.base|) (= ~b1_val~0 1) (<= ~d0_val~0 1) (not (= ~comp_m1_st~0 0)) (<= 0 ~d0_req_up~0) (<= ~d0_req_up~0 0) (<= |#NULL.base| 0) (<= ~b1_ev~0 2) (<= 0 ~d1_req_up~0) (= ~b0_req_up~0 0) (= ~z_val~0 ~z_val_t~0) (= 0 ~b1_req_up~0) (<= 0 |#t~string4.base|) (<= ~d0_val_t~0 1) (= ~b0_val_t~0 1) (<= ~b0_val~0 1) (<= 1 ~b0_val~0) (<= 0 ~comp_m1_st~0) (<= |ULTIMATE.start_is_method1_triggered_#res| 1) (= ~comp_m1_i~0 0)) [2020-12-09 10:52:09,635 INFO L262 CegarLoopResult]: For program point L11(line 11) no Hoare annotation was computed. [2020-12-09 10:52:09,635 INFO L262 CegarLoopResult]: For program point L441(lines 441 445) no Hoare annotation was computed. [2020-12-09 10:52:09,636 INFO L258 CegarLoopResult]: At program point L447(lines 493 499) the Hoare annotation is: (let ((.cse0 (= ~z_val~0 0))) (or (and .cse0 (= ~z_req_up~0 0)) (and (= ULTIMATE.start_stop_simulation_~tmp~2 0) (= ~z_ev~0 2) (<= 1 ~b1_val~0) (= ULTIMATE.start_stop_simulation_~tmp~2 |ULTIMATE.start_exists_runnable_thread_#res|) (<= 0 |#t~string6.base|) (= |#t~string5.offset| 0) (<= ~z_val_t~0 0) (= |#NULL.offset| 0) (<= 1 ~d0_val~0) (= 0 |#t~string4.offset|) (= ~d1_req_up~0 0) (<= 0 |#StackHeapBarrier|) (= 3 ULTIMATE.start_start_simulation_~kernel_st~0) (= |#NULL.base| 0) (= ~d0_val_t~0 1) .cse0 (= ~b1_ev~0 2) (<= ~d1_val~0 1) (not (= ~z_req_up~0 1)) (= ~b0_ev~0 2) (= ULTIMATE.start_eval_~tmp___0~0 0) (= ~b1_val_t~0 1) (<= 0 ~z_req_up~0) (= ~d1_val_t~0 1) (= ULTIMATE.start_exists_runnable_thread_~__retres1~1 |ULTIMATE.start_exists_runnable_thread_#res|) (= |#t~string6.offset| 0) (= 2 ~d1_ev~0) (= ULTIMATE.start_is_method1_triggered_~__retres1~0 |ULTIMATE.start_is_method1_triggered_#res|) (= |ULTIMATE.start_is_method1_triggered_#res| ULTIMATE.start_activate_threads_~tmp~1) (= ULTIMATE.start_stop_simulation_~__retres2~0 1) (= |ULTIMATE.start_stop_simulation_#res| ULTIMATE.start_stop_simulation_~__retres2~0) (= ~d0_req_up~0 0) (= 2 ~d0_ev~0) (= |ULTIMATE.start_stop_simulation_#res| ULTIMATE.start_start_simulation_~tmp~3) (<= 0 |#t~string5.base|) (<= ~d0_val~0 1) (not (= ~comp_m1_st~0 0)) (= ~b0_req_up~0 0) (= 0 ~b1_req_up~0) (= ULTIMATE.start_is_method1_triggered_~__retres1~0 0) (<= 0 |#t~string4.base|) (<= ~b1_val~0 1) (= ~b0_val_t~0 1) (<= ~b0_val~0 1) (<= 0 ~z_val_t~0) (<= 1 ~d1_val~0) (<= 1 ~b0_val~0) (<= 0 ~comp_m1_st~0) (= ~comp_m1_i~0 0)))) [2020-12-09 10:52:09,636 INFO L262 CegarLoopResult]: For program point L282(lines 282 286) no Hoare annotation was computed. [2020-12-09 10:52:09,636 INFO L265 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-12-09 10:52:09,636 INFO L258 CegarLoopResult]: At program point L287(lines 277 302) the Hoare annotation is: (let ((.cse0 (<= 1 ULTIMATE.start_activate_threads_~tmp~1)) (.cse2 (<= ULTIMATE.start_activate_threads_~tmp~1 1)) (.cse5 (<= 1 |ULTIMATE.start_is_method1_triggered_#res|)) (.cse6 (<= 0 |#t~string6.base|)) (.cse7 (= |#t~string5.offset| 0)) (.cse10 (<= ~z_val_t~0 0)) (.cse12 (= |#NULL.offset| 0)) (.cse13 (<= 1 ~d0_val~0)) (.cse14 (<= 0 |#StackHeapBarrier|)) (.cse16 (<= |#t~string4.offset| 0)) (.cse17 (= ULTIMATE.start_is_method1_triggered_~__retres1~0 1)) (.cse23 (= ~z_val~0 0)) (.cse26 (<= ~z_ev~0 2)) (.cse27 (<= 2 ~z_ev~0)) (.cse28 (<= ~d1_req_up~0 0)) (.cse29 (<= 2 ~b1_ev~0)) (.cse31 (= ~b0_ev~0 2)) (.cse32 (= ~b1_val_t~0 1)) (.cse37 (<= 1 ~d0_val_t~0)) (.cse38 (= ~d1_val_t~0 1)) (.cse39 (<= 0 |#NULL.base|)) (.cse41 (= |#t~string6.offset| 0)) (.cse42 (= 2 ~d1_ev~0)) (.cse1 (= 1 ULTIMATE.start_start_simulation_~kernel_st~0)) (.cse24 (= ~comp_m1_st~0 0)) (.cse3 (<= 0 |#t~string4.offset|)) (.cse4 (= ~d1_val~0 1)) (.cse8 (<= 0 |#t~string5.base|)) (.cse9 (= ~b1_val~0 1)) (.cse11 (<= ~d0_val~0 1)) (.cse15 (<= 0 ~d0_req_up~0)) (.cse18 (<= ~d0_req_up~0 0)) (.cse19 (<= |#NULL.base| 0)) (.cse20 (<= ~b1_ev~0 2)) (.cse21 (<= 0 ~d1_req_up~0)) (.cse22 (= ~b0_req_up~0 0)) (.cse25 (= 0 ~b1_req_up~0)) (.cse30 (<= 0 |#t~string4.base|)) (.cse33 (<= ~d0_val_t~0 1)) (.cse34 (= ~b0_val_t~0 1)) (.cse35 (<= ~b0_val~0 1)) (.cse36 (<= 0 ~z_val_t~0)) (.cse40 (<= 1 ~b0_val~0)) (.cse43 (<= |ULTIMATE.start_is_method1_triggered_#res| 1)) (.cse44 (= ~comp_m1_i~0 0))) (or (and .cse0 .cse1 (<= ~d0_ev~0 2) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (= ~z_req_up~0 0) .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 (<= 2 ~d0_ev~0) .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44) (and .cse0 .cse2 (or (not .cse24) (<= 1 ULTIMATE.start_eval_~tmp___0~0)) .cse5 .cse6 .cse7 .cse10 (<= |ULTIMATE.start_exists_runnable_thread_#res| 1) .cse12 .cse13 .cse14 .cse16 .cse17 .cse23 .cse26 .cse27 .cse28 (<= ULTIMATE.start_exists_runnable_thread_~__retres1~1 1) .cse29 .cse31 .cse32 .cse37 (<= 0 ~z_req_up~0) .cse38 .cse39 .cse41 (or (= ULTIMATE.start_eval_~tmp___0~0 0) (= ULTIMATE.start_eval_~tmp___0~0 1)) .cse42 .cse1 (= 2 ~d0_ev~0) (or (= ~z_req_up~0 1) .cse24) .cse3 .cse4 .cse8 .cse9 .cse11 .cse15 .cse18 .cse19 .cse20 .cse21 .cse22 .cse25 .cse30 .cse33 .cse34 .cse35 .cse36 .cse40 (<= 0 ~comp_m1_st~0) .cse43 .cse44))) [2020-12-09 10:52:09,636 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-09 10:52:09,636 INFO L258 CegarLoopResult]: At program point L424-1(lines 342 446) the Hoare annotation is: (let ((.cse0 (select |#memory_int| |#t~string4.base|))) (and (= |ULTIMATE.start_is_method1_triggered_#res| ULTIMATE.start_activate_threads_~tmp~1) (= ~d0_req_up~0 0) (= ~z_ev~0 2) (= 2 ~d0_ev~0) (= (select |#valid| 0) 0) (= 0 ULTIMATE.start_start_simulation_~kernel_st~0) (= ~d1_val~0 1) (= (select |#valid| |#t~string5.base|) 1) (= 16 (select |#length| |#t~string5.base|)) (= (select |#valid| |#t~string4.base|) 1) (= |#t~string5.offset| 0) (= ~b1_val~0 1) (= 12 (select |#length| |#t~string6.base|)) (< |#StackHeapBarrier| |#t~string5.base|) (= |#NULL.offset| 0) (= 0 |#t~string4.offset|) (= ~d1_req_up~0 0) (= ~b0_val~0 1) (= ULTIMATE.start_is_method1_triggered_~__retres1~0 1) (= 2 (select |#length| |#t~string4.base|)) (= |#NULL.base| 0) (= ~b0_req_up~0 0) (= ~d0_val_t~0 1) (= ~z_val~0 0) (= ~b1_ev~0 2) (= ~comp_m1_st~0 0) (= 0 ~b1_req_up~0) (= ~z_req_up~0 0) (= (select |#valid| |#t~string6.base|) 1) (= 48 (select .cse0 |#t~string4.offset|)) (= ~d0_val_t~0 ~d0_val~0) (= ~b0_ev~0 2) (= ~b1_val_t~0 1) (= ~b0_val_t~0 1) (< |#StackHeapBarrier| |#t~string6.base|) (< |#StackHeapBarrier| |#t~string4.base|) (= ~d1_val_t~0 1) (< 0 |#StackHeapBarrier|) (= |#t~string6.offset| 0) (= (select .cse0 (+ |#t~string4.offset| 1)) 0) (= 0 ~z_val_t~0) (= 2 ~d1_ev~0) (= ULTIMATE.start_is_method1_triggered_~__retres1~0 |ULTIMATE.start_is_method1_triggered_#res|) (= ~comp_m1_i~0 0))) [2020-12-09 10:52:09,636 INFO L265 CegarLoopResult]: At program point L493(lines 493 499) the Hoare annotation is: true [2020-12-09 10:52:09,637 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 11) no Hoare annotation was computed. [2020-12-09 10:52:09,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 10:52:09 BoogieIcfgContainer [2020-12-09 10:52:09,660 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 10:52:09,660 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 10:52:09,660 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 10:52:09,660 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 10:52:09,661 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:51:59" (3/4) ... [2020-12-09 10:52:09,663 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-09 10:52:09,674 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 78 nodes and edges [2020-12-09 10:52:09,674 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2020-12-09 10:52:09,675 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2020-12-09 10:52:09,676 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-09 10:52:09,694 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((((((\result == tmp && d0_req_up == 0) && z_ev == 2) && 2 == d0_ev) && \valid[0] == 0) && 0 == kernel_st) && d1_val == 1) && \valid["bist_cell.cil.c"] == 1) && 16 == unknown-#length-unknown["bist_cell.cil.c"]) && \valid["0"] == 1) && "bist_cell.cil.c" == 0) && b1_val == 1) && 12 == unknown-#length-unknown["reach_error"]) && unknown-#StackHeapBarrier-unknown < "bist_cell.cil.c") && #NULL == 0) && 0 == "0") && d1_req_up == 0) && b0_val == 1) && __retres1 == 1) && 2 == unknown-#length-unknown["0"]) && #NULL == 0) && b0_req_up == 0) && d0_val_t == 1) && z_val == 0) && b1_ev == 2) && comp_m1_st == 0) && 0 == b1_req_up) && z_req_up == 0) && \valid["reach_error"] == 1) && 48 == unknown-#memory_int-unknown["0"]["0"]) && d0_val_t == d0_val) && b0_ev == 2) && b1_val_t == 1) && b0_val_t == 1) && unknown-#StackHeapBarrier-unknown < "reach_error") && unknown-#StackHeapBarrier-unknown < "0") && d1_val_t == 1) && 0 < unknown-#StackHeapBarrier-unknown) && "reach_error" == 0) && unknown-#memory_int-unknown["0"]["0" + 1] == 0) && 0 == z_val_t) && 2 == d1_ev) && __retres1 == \result) && comp_m1_i == 0 [2020-12-09 10:52:09,694 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (z_val == 0 && z_req_up == 0) || ((((((((((((((((((((((((((((((((((((((((((((((((tmp == 0 && z_ev == 2) && 1 <= b1_val) && tmp == \result) && 0 <= "reach_error") && "bist_cell.cil.c" == 0) && z_val_t <= 0) && #NULL == 0) && 1 <= d0_val) && 0 == "0") && d1_req_up == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 3 == kernel_st) && #NULL == 0) && d0_val_t == 1) && z_val == 0) && b1_ev == 2) && d1_val <= 1) && !(z_req_up == 1)) && b0_ev == 2) && tmp___0 == 0) && b1_val_t == 1) && 0 <= z_req_up) && d1_val_t == 1) && __retres1 == \result) && "reach_error" == 0) && 2 == d1_ev) && __retres1 == \result) && \result == tmp) && __retres2 == 1) && \result == __retres2) && d0_req_up == 0) && 2 == d0_ev) && \result == tmp) && 0 <= "bist_cell.cil.c") && d0_val <= 1) && !(comp_m1_st == 0)) && b0_req_up == 0) && 0 == b1_req_up) && __retres1 == 0) && 0 <= "0") && b1_val <= 1) && b0_val_t == 1) && b0_val <= 1) && 0 <= z_val_t) && 1 <= d1_val) && 1 <= b0_val) && 0 <= comp_m1_st) && comp_m1_i == 0) [2020-12-09 10:52:09,694 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((((((((((1 <= tmp && 1 == kernel_st) && d0_ev <= 2) && tmp <= 1) && 0 <= "0") && d1_val == 1) && 1 <= \result) && 0 <= "reach_error") && "bist_cell.cil.c" == 0) && 0 <= "bist_cell.cil.c") && b1_val == 1) && z_val_t <= 0) && d0_val <= 1) && #NULL == 0) && 1 <= d0_val) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= d0_req_up) && "0" <= 0) && __retres1 == 1) && d0_req_up <= 0) && #NULL <= 0) && b1_ev <= 2) && 0 <= d1_req_up) && b0_req_up == 0) && z_val == 0) && comp_m1_st == 0) && 0 == b1_req_up) && z_req_up == 0) && z_ev <= 2) && 2 <= z_ev) && d1_req_up <= 0) && 2 <= b1_ev) && 0 <= "0") && b0_ev == 2) && b1_val_t == 1) && d0_val_t <= 1) && b0_val_t == 1) && b0_val <= 1) && 2 <= d0_ev) && 0 <= z_val_t) && 1 <= d0_val_t) && d1_val_t == 1) && 0 <= #NULL) && 1 <= b0_val) && "reach_error" == 0) && 2 == d1_ev) && \result <= 1) && comp_m1_i == 0) || (((((((((((((((((((((((((((((((((((((((((((((((((((1 <= tmp && tmp <= 1) && (!(comp_m1_st == 0) || 1 <= tmp___0)) && 1 <= \result) && 0 <= "reach_error") && "bist_cell.cil.c" == 0) && z_val_t <= 0) && \result <= 1) && #NULL == 0) && 1 <= d0_val) && 0 <= unknown-#StackHeapBarrier-unknown) && "0" <= 0) && __retres1 == 1) && z_val == 0) && z_ev <= 2) && 2 <= z_ev) && d1_req_up <= 0) && __retres1 <= 1) && 2 <= b1_ev) && b0_ev == 2) && b1_val_t == 1) && 1 <= d0_val_t) && 0 <= z_req_up) && d1_val_t == 1) && 0 <= #NULL) && "reach_error" == 0) && (tmp___0 == 0 || tmp___0 == 1)) && 2 == d1_ev) && 1 == kernel_st) && 2 == d0_ev) && (z_req_up == 1 || comp_m1_st == 0)) && 0 <= "0") && d1_val == 1) && 0 <= "bist_cell.cil.c") && b1_val == 1) && d0_val <= 1) && 0 <= d0_req_up) && d0_req_up <= 0) && #NULL <= 0) && b1_ev <= 2) && 0 <= d1_req_up) && b0_req_up == 0) && 0 == b1_req_up) && 0 <= "0") && d0_val_t <= 1) && b0_val_t == 1) && b0_val <= 1) && 0 <= z_val_t) && 1 <= b0_val) && 0 <= comp_m1_st) && \result <= 1) && comp_m1_i == 0) [2020-12-09 10:52:09,694 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((((((((((((z_req_up == 1 && 1 <= tmp) && tmp <= 1) && 1 <= \result) && 0 <= "reach_error") && "bist_cell.cil.c" == 0) && \result <= 1) && #NULL == 0) && 1 <= d0_val) && 0 <= unknown-#StackHeapBarrier-unknown) && "0" <= 0) && __retres1 == 1) && z_val == 0) && z_ev <= 2) && 2 <= z_ev) && d1_req_up <= 0) && __retres1 <= 1) && 2 <= b1_ev) && b0_ev == 2) && tmp___0 == 0) && b1_val_t == 1) && 1 <= d0_val_t) && d1_val_t == 1) && 0 <= #NULL) && "reach_error" == 0) && 2 == d1_ev) && 1 == kernel_st) && 2 == d0_ev) && 0 <= "0") && d1_val == 1) && 0 <= "bist_cell.cil.c") && b1_val == 1) && d0_val <= 1) && !(comp_m1_st == 0)) && 0 <= d0_req_up) && d0_req_up <= 0) && #NULL <= 0) && b1_ev <= 2) && 0 <= d1_req_up) && b0_req_up == 0) && z_val == z_val_t) && 0 == b1_req_up) && 0 <= "0") && d0_val_t <= 1) && b0_val_t == 1) && b0_val <= 1) && 1 <= b0_val) && 0 <= comp_m1_st) && \result <= 1) && comp_m1_i == 0 [2020-12-09 10:52:09,730 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_bc2962b8-5244-4c79-a7fa-6e19c1b4744d/bin/utaipan/witness.graphml [2020-12-09 10:52:09,730 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 10:52:09,731 INFO L168 Benchmark]: Toolchain (without parser) took 11658.66 ms. Allocated memory was 107.0 MB in the beginning and 272.6 MB in the end (delta: 165.7 MB). Free memory was 70.6 MB in the beginning and 154.3 MB in the end (delta: -83.7 MB). Peak memory consumption was 81.8 MB. Max. memory is 16.1 GB. [2020-12-09 10:52:09,731 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 107.0 MB. Free memory is still 86.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 10:52:09,731 INFO L168 Benchmark]: CACSL2BoogieTranslator took 245.50 ms. Allocated memory is still 107.0 MB. Free memory was 70.4 MB in the beginning and 81.4 MB in the end (delta: -11.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-12-09 10:52:09,732 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.98 ms. Allocated memory is still 107.0 MB. Free memory was 81.4 MB in the beginning and 79.0 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 10:52:09,732 INFO L168 Benchmark]: Boogie Preprocessor took 32.00 ms. Allocated memory is still 107.0 MB. Free memory was 79.0 MB in the beginning and 77.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 10:52:09,732 INFO L168 Benchmark]: RCFGBuilder took 1102.20 ms. Allocated memory was 107.0 MB in the beginning and 130.0 MB in the end (delta: 23.1 MB). Free memory was 76.9 MB in the beginning and 68.4 MB in the end (delta: 8.5 MB). Peak memory consumption was 60.6 MB. Max. memory is 16.1 GB. [2020-12-09 10:52:09,732 INFO L168 Benchmark]: TraceAbstraction took 10166.50 ms. Allocated memory was 130.0 MB in the beginning and 272.6 MB in the end (delta: 142.6 MB). Free memory was 68.4 MB in the beginning and 161.6 MB in the end (delta: -93.2 MB). Peak memory consumption was 131.2 MB. Max. memory is 16.1 GB. [2020-12-09 10:52:09,733 INFO L168 Benchmark]: Witness Printer took 70.32 ms. Allocated memory is still 272.6 MB. Free memory was 161.6 MB in the beginning and 154.3 MB in the end (delta: 7.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-12-09 10:52:09,734 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 107.0 MB. Free memory is still 86.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 245.50 ms. Allocated memory is still 107.0 MB. Free memory was 70.4 MB in the beginning and 81.4 MB in the end (delta: -11.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 36.98 ms. Allocated memory is still 107.0 MB. Free memory was 81.4 MB in the beginning and 79.0 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 32.00 ms. Allocated memory is still 107.0 MB. Free memory was 79.0 MB in the beginning and 77.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1102.20 ms. Allocated memory was 107.0 MB in the beginning and 130.0 MB in the end (delta: 23.1 MB). Free memory was 76.9 MB in the beginning and 68.4 MB in the end (delta: 8.5 MB). Peak memory consumption was 60.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 10166.50 ms. Allocated memory was 130.0 MB in the beginning and 272.6 MB in the end (delta: 142.6 MB). Free memory was 68.4 MB in the beginning and 161.6 MB in the end (delta: -93.2 MB). Peak memory consumption was 131.2 MB. Max. memory is 16.1 GB. * Witness Printer took 70.32 ms. Allocated memory is still 272.6 MB. Free memory was 161.6 MB in the beginning and 154.3 MB in the end (delta: 7.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 11]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((z_req_up == 1 && 1 <= tmp) && tmp <= 1) && 1 <= \result) && 0 <= "reach_error") && "bist_cell.cil.c" == 0) && \result <= 1) && #NULL == 0) && 1 <= d0_val) && 0 <= unknown-#StackHeapBarrier-unknown) && "0" <= 0) && __retres1 == 1) && z_val == 0) && z_ev <= 2) && 2 <= z_ev) && d1_req_up <= 0) && __retres1 <= 1) && 2 <= b1_ev) && b0_ev == 2) && tmp___0 == 0) && b1_val_t == 1) && 1 <= d0_val_t) && d1_val_t == 1) && 0 <= #NULL) && "reach_error" == 0) && 2 == d1_ev) && 1 == kernel_st) && 2 == d0_ev) && 0 <= "0") && d1_val == 1) && 0 <= "bist_cell.cil.c") && b1_val == 1) && d0_val <= 1) && !(comp_m1_st == 0)) && 0 <= d0_req_up) && d0_req_up <= 0) && #NULL <= 0) && b1_ev <= 2) && 0 <= d1_req_up) && b0_req_up == 0) && z_val == z_val_t) && 0 == b1_req_up) && 0 <= "0") && d0_val_t <= 1) && b0_val_t == 1) && b0_val <= 1) && 1 <= b0_val) && 0 <= comp_m1_st) && \result <= 1) && comp_m1_i == 0 - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((1 <= tmp && 1 == kernel_st) && d0_ev <= 2) && tmp <= 1) && 0 <= "0") && d1_val == 1) && 1 <= \result) && 0 <= "reach_error") && "bist_cell.cil.c" == 0) && 0 <= "bist_cell.cil.c") && b1_val == 1) && z_val_t <= 0) && d0_val <= 1) && #NULL == 0) && 1 <= d0_val) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= d0_req_up) && "0" <= 0) && __retres1 == 1) && d0_req_up <= 0) && #NULL <= 0) && b1_ev <= 2) && 0 <= d1_req_up) && b0_req_up == 0) && z_val == 0) && comp_m1_st == 0) && 0 == b1_req_up) && z_req_up == 0) && z_ev <= 2) && 2 <= z_ev) && d1_req_up <= 0) && 2 <= b1_ev) && 0 <= "0") && b0_ev == 2) && b1_val_t == 1) && d0_val_t <= 1) && b0_val_t == 1) && b0_val <= 1) && 2 <= d0_ev) && 0 <= z_val_t) && 1 <= d0_val_t) && d1_val_t == 1) && 0 <= #NULL) && 1 <= b0_val) && "reach_error" == 0) && 2 == d1_ev) && \result <= 1) && comp_m1_i == 0) || (((((((((((((((((((((((((((((((((((((((((((((((((((1 <= tmp && tmp <= 1) && (!(comp_m1_st == 0) || 1 <= tmp___0)) && 1 <= \result) && 0 <= "reach_error") && "bist_cell.cil.c" == 0) && z_val_t <= 0) && \result <= 1) && #NULL == 0) && 1 <= d0_val) && 0 <= unknown-#StackHeapBarrier-unknown) && "0" <= 0) && __retres1 == 1) && z_val == 0) && z_ev <= 2) && 2 <= z_ev) && d1_req_up <= 0) && __retres1 <= 1) && 2 <= b1_ev) && b0_ev == 2) && b1_val_t == 1) && 1 <= d0_val_t) && 0 <= z_req_up) && d1_val_t == 1) && 0 <= #NULL) && "reach_error" == 0) && (tmp___0 == 0 || tmp___0 == 1)) && 2 == d1_ev) && 1 == kernel_st) && 2 == d0_ev) && (z_req_up == 1 || comp_m1_st == 0)) && 0 <= "0") && d1_val == 1) && 0 <= "bist_cell.cil.c") && b1_val == 1) && d0_val <= 1) && 0 <= d0_req_up) && d0_req_up <= 0) && #NULL <= 0) && b1_ev <= 2) && 0 <= d1_req_up) && b0_req_up == 0) && 0 == b1_req_up) && 0 <= "0") && d0_val_t <= 1) && b0_val_t == 1) && b0_val <= 1) && 0 <= z_val_t) && 1 <= b0_val) && 0 <= comp_m1_st) && \result <= 1) && comp_m1_i == 0) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 493]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((\result == tmp && d0_req_up == 0) && z_ev == 2) && 2 == d0_ev) && \valid[0] == 0) && 0 == kernel_st) && d1_val == 1) && \valid["bist_cell.cil.c"] == 1) && 16 == unknown-#length-unknown["bist_cell.cil.c"]) && \valid["0"] == 1) && "bist_cell.cil.c" == 0) && b1_val == 1) && 12 == unknown-#length-unknown["reach_error"]) && unknown-#StackHeapBarrier-unknown < "bist_cell.cil.c") && #NULL == 0) && 0 == "0") && d1_req_up == 0) && b0_val == 1) && __retres1 == 1) && 2 == unknown-#length-unknown["0"]) && #NULL == 0) && b0_req_up == 0) && d0_val_t == 1) && z_val == 0) && b1_ev == 2) && comp_m1_st == 0) && 0 == b1_req_up) && z_req_up == 0) && \valid["reach_error"] == 1) && 48 == unknown-#memory_int-unknown["0"]["0"]) && d0_val_t == d0_val) && b0_ev == 2) && b1_val_t == 1) && b0_val_t == 1) && unknown-#StackHeapBarrier-unknown < "reach_error") && unknown-#StackHeapBarrier-unknown < "0") && d1_val_t == 1) && 0 < unknown-#StackHeapBarrier-unknown) && "reach_error" == 0) && unknown-#memory_int-unknown["0"]["0" + 1] == 0) && 0 == z_val_t) && 2 == d1_ev) && __retres1 == \result) && comp_m1_i == 0 - InvariantResult [Line: 493]: Loop Invariant Derived loop invariant: (z_val == 0 && z_req_up == 0) || ((((((((((((((((((((((((((((((((((((((((((((((((tmp == 0 && z_ev == 2) && 1 <= b1_val) && tmp == \result) && 0 <= "reach_error") && "bist_cell.cil.c" == 0) && z_val_t <= 0) && #NULL == 0) && 1 <= d0_val) && 0 == "0") && d1_req_up == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 3 == kernel_st) && #NULL == 0) && d0_val_t == 1) && z_val == 0) && b1_ev == 2) && d1_val <= 1) && !(z_req_up == 1)) && b0_ev == 2) && tmp___0 == 0) && b1_val_t == 1) && 0 <= z_req_up) && d1_val_t == 1) && __retres1 == \result) && "reach_error" == 0) && 2 == d1_ev) && __retres1 == \result) && \result == tmp) && __retres2 == 1) && \result == __retres2) && d0_req_up == 0) && 2 == d0_ev) && \result == tmp) && 0 <= "bist_cell.cil.c") && d0_val <= 1) && !(comp_m1_st == 0)) && b0_req_up == 0) && 0 == b1_req_up) && __retres1 == 0) && 0 <= "0") && b1_val <= 1) && b0_val_t == 1) && b0_val <= 1) && 0 <= z_val_t) && 1 <= d1_val) && 1 <= b0_val) && 0 <= comp_m1_st) && comp_m1_i == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 8.6s, OverallIterations: 6, TraceHistogramMax: 4, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 46 SDtfs, 48 SDslu, 48 SDs, 0 SdLazy, 142 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 166 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 10 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 13 NumberOfFragments, 785 HoareAnnotationTreeSize, 6 FomulaSimplifications, 499 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 180 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 126 NumberOfCodeBlocks, 124 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 169 ConstructedInterpolants, 0 QuantifiedInterpolants, 29778 SizeOfPredicates, 83 NumberOfNonLiveVariables, 732 ConjunctsInSsa, 146 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 52/105 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: OVERALL_TIME[ms]: 878, ICFG_INTERPRETER_ENTERED_PROCEDURES: 1, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 8, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 12, TOOLS_POST_TIME[ms]: 349, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME[ms]: 0, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME[ms]: 0, TOOLS_QUANTIFIERELIM_APPLICATIONS: 12, TOOLS_QUANTIFIERELIM_TIME[ms]: 342, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 173, FLUID_QUERY_TIME[ms]: 3, FLUID_QUERIES: 25, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 1, DOMAIN_JOIN_TIME[ms]: 103, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME[ms]: 0, DOMAIN_WIDEN_APPLICATIONS: 1, DOMAIN_WIDEN_TIME[ms]: 365, DOMAIN_ISSUBSETEQ_APPLICATIONS: 2, DOMAIN_ISSUBSETEQ_TIME[ms]: 7, DOMAIN_ISBOTTOM_APPLICATIONS: 8, DOMAIN_ISBOTTOM_TIME[ms]: 15, LOOP_SUMMARIZER_APPLICATIONS: 1, LOOP_SUMMARIZER_CACHE_MISSES: 1, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 462, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 462, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 2, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME[ms]: 0, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 0, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 2, PATH_EXPR_TIME[ms]: 2, REGEX_TO_DAG_TIME[ms]: 3, DAG_COMPRESSION_TIME[ms]: 8, DAG_COMPRESSION_PROCESSED_NODES: 66, DAG_COMPRESSION_RETAINED_NODES: 26, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...